/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread/queue_ok_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 20:36:32,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 20:36:32,652 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 20:36:32,658 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 20:36:32,659 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 20:36:32,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 20:36:32,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 20:36:32,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 20:36:32,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 20:36:32,698 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 20:36:32,698 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 20:36:32,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 20:36:32,698 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 20:36:32,700 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 20:36:32,700 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 20:36:32,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 20:36:32,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 20:36:32,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 20:36:32,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 20:36:32,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 20:36:32,701 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 20:36:32,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 20:36:32,702 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 20:36:32,702 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 20:36:32,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 20:36:32,703 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 20:36:32,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 20:36:32,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 20:36:32,704 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 20:36:32,704 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 20:36:32,705 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 20:36:32,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 20:36:32,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 20:36:32,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 20:36:32,705 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 20:36:32,706 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-26 20:36:32,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 20:36:33,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 20:36:33,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 20:36:33,016 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 20:36:33,016 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 20:36:33,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-08-26 20:36:34,198 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 20:36:34,434 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 20:36:34,435 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-08-26 20:36:34,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05c4bdcda/8d40fbfc477c4d43a3fae84680355f46/FLAG0d71eb747 [2023-08-26 20:36:34,470 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05c4bdcda/8d40fbfc477c4d43a3fae84680355f46 [2023-08-26 20:36:34,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 20:36:34,476 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 20:36:34,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 20:36:34,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 20:36:34,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 20:36:34,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:36:34" (1/1) ... [2023-08-26 20:36:34,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cb96818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:36:34, skipping insertion in model container [2023-08-26 20:36:34,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:36:34" (1/1) ... [2023-08-26 20:36:34,536 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 20:36:34,899 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 20:36:34,911 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 20:36:34,937 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-26 20:36:34,939 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-26 20:36:34,961 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [750] [2023-08-26 20:36:34,986 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 20:36:35,042 INFO L206 MainTranslator]: Completed translation [2023-08-26 20:36:35,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:36:35 WrapperNode [2023-08-26 20:36:35,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 20:36:35,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 20:36:35,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 20:36:35,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 20:36:35,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:36:35" (1/1) ... [2023-08-26 20:36:35,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:36:35" (1/1) ... [2023-08-26 20:36:35,088 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 221 [2023-08-26 20:36:35,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 20:36:35,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 20:36:35,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 20:36:35,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 20:36:35,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:36:35" (1/1) ... [2023-08-26 20:36:35,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:36:35" (1/1) ... [2023-08-26 20:36:35,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:36:35" (1/1) ... [2023-08-26 20:36:35,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:36:35" (1/1) ... [2023-08-26 20:36:35,109 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:36:35" (1/1) ... [2023-08-26 20:36:35,112 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:36:35" (1/1) ... [2023-08-26 20:36:35,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:36:35" (1/1) ... [2023-08-26 20:36:35,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:36:35" (1/1) ... [2023-08-26 20:36:35,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 20:36:35,119 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 20:36:35,119 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 20:36:35,119 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 20:36:35,120 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:36:35" (1/1) ... [2023-08-26 20:36:35,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 20:36:35,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:36:35,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 20:36:35,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 20:36:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-26 20:36:35,199 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-26 20:36:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-26 20:36:35,199 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-26 20:36:35,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 20:36:35,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 20:36:35,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 20:36:35,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 20:36:35,200 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 20:36:35,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 20:36:35,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 20:36:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 20:36:35,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 20:36:35,202 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 20:36:35,320 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 20:36:35,323 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 20:36:35,655 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 20:36:35,663 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 20:36:35,663 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-26 20:36:35,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:36:35 BoogieIcfgContainer [2023-08-26 20:36:35,665 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 20:36:35,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 20:36:35,667 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 20:36:35,669 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 20:36:35,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 08:36:34" (1/3) ... [2023-08-26 20:36:35,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c94c818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:36:35, skipping insertion in model container [2023-08-26 20:36:35,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:36:35" (2/3) ... [2023-08-26 20:36:35,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c94c818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:36:35, skipping insertion in model container [2023-08-26 20:36:35,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:36:35" (3/3) ... [2023-08-26 20:36:35,671 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2023-08-26 20:36:35,685 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 20:36:35,685 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-08-26 20:36:35,685 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 20:36:35,765 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 20:36:35,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 240 places, 248 transitions, 512 flow [2023-08-26 20:36:35,868 INFO L124 PetriNetUnfolderBase]: 15/246 cut-off events. [2023-08-26 20:36:35,868 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 20:36:35,877 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-26 20:36:35,877 INFO L82 GeneralOperation]: Start removeDead. Operand has 240 places, 248 transitions, 512 flow [2023-08-26 20:36:35,882 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 237 transitions, 483 flow [2023-08-26 20:36:35,885 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 20:36:35,893 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 229 places, 237 transitions, 483 flow [2023-08-26 20:36:35,895 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 229 places, 237 transitions, 483 flow [2023-08-26 20:36:35,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 237 transitions, 483 flow [2023-08-26 20:36:35,936 INFO L124 PetriNetUnfolderBase]: 15/237 cut-off events. [2023-08-26 20:36:35,937 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 20:36:35,939 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-26 20:36:35,945 INFO L119 LiptonReduction]: Number of co-enabled transitions 14312 [2023-08-26 20:36:42,964 INFO L134 LiptonReduction]: Checked pairs total: 33711 [2023-08-26 20:36:42,965 INFO L136 LiptonReduction]: Total number of compositions: 237 [2023-08-26 20:36:42,976 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 20:36:42,981 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;@79214b2b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 20:36:42,981 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2023-08-26 20:36:42,983 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 20:36:42,983 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 20:36:42,983 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 20:36:42,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:36:42,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 20:36:42,984 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-26 20:36:42,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:36:42,988 INFO L85 PathProgramCache]: Analyzing trace with hash 991, now seen corresponding path program 1 times [2023-08-26 20:36:42,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:36:42,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533304174] [2023-08-26 20:36:42,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:36:42,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:36:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:36:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:36:43,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:36:43,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533304174] [2023-08-26 20:36:43,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533304174] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:36:43,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:36:43,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 20:36:43,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589649782] [2023-08-26 20:36:43,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:36:43,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 20:36:43,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:36:43,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 20:36:43,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 20:36:43,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 485 [2023-08-26 20:36:43,112 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-26 20:36:43,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:36:43,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 485 [2023-08-26 20:36:43,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:36:43,405 INFO L124 PetriNetUnfolderBase]: 1466/2404 cut-off events. [2023-08-26 20:36:43,405 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2023-08-26 20:36:43,409 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-26 20:36:43,421 INFO L140 encePairwiseOnDemand]: 484/485 looper letters, 50 selfloop transitions, 0 changer transitions 0/58 dead transitions. [2023-08-26 20:36:43,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 225 flow [2023-08-26 20:36:43,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 20:36:43,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 20:36:43,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 521 transitions. [2023-08-26 20:36:43,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5371134020618556 [2023-08-26 20:36:43,443 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 521 transitions. [2023-08-26 20:36:43,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 521 transitions. [2023-08-26 20:36:43,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:36:43,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 521 transitions. [2023-08-26 20:36:43,451 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-26 20:36:43,455 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-26 20:36:43,456 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-26 20:36:43,457 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 127 flow. Second operand 2 states and 521 transitions. [2023-08-26 20:36:43,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 225 flow [2023-08-26 20:36:43,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 58 transitions, 220 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 20:36:43,462 INFO L231 Difference]: Finished difference. Result has 56 places, 58 transitions, 120 flow [2023-08-26 20:36:43,464 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-26 20:36:43,466 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2023-08-26 20:36:43,466 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 120 flow [2023-08-26 20:36:43,467 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-26 20:36:43,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:36:43,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:36:43,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 20:36:43,468 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-26 20:36:43,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:36:43,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1865824386, now seen corresponding path program 1 times [2023-08-26 20:36:43,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:36:43,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468860406] [2023-08-26 20:36:43,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:36:43,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:36:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:36:44,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:36:44,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:36:44,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468860406] [2023-08-26 20:36:44,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468860406] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:36:44,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:36:44,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 20:36:44,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069126973] [2023-08-26 20:36:44,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:36:44,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:36:44,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:36:44,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:36:44,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:36:44,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 485 [2023-08-26 20:36:44,482 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-26 20:36:44,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:36:44,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 485 [2023-08-26 20:36:44,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:36:44,922 INFO L124 PetriNetUnfolderBase]: 1511/2489 cut-off events. [2023-08-26 20:36:44,923 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-08-26 20:36:44,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4962 conditions, 2489 events. 1511/2489 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 12463 event pairs, 1057 based on Foata normal form. 0/1742 useless extension candidates. Maximal degree in co-relation 4959. Up to 2422 conditions per place. [2023-08-26 20:36:44,934 INFO L140 encePairwiseOnDemand]: 477/485 looper letters, 54 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2023-08-26 20:36:44,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 274 flow [2023-08-26 20:36:44,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 20:36:44,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 20:36:44,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1193 transitions. [2023-08-26 20:36:44,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4099656357388316 [2023-08-26 20:36:44,939 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1193 transitions. [2023-08-26 20:36:44,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1193 transitions. [2023-08-26 20:36:44,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:36:44,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1193 transitions. [2023-08-26 20:36:44,944 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-26 20:36:44,950 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-26 20:36:44,952 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-26 20:36:44,952 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 120 flow. Second operand 6 states and 1193 transitions. [2023-08-26 20:36:44,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 274 flow [2023-08-26 20:36:44,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 71 transitions, 274 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 20:36:44,955 INFO L231 Difference]: Finished difference. Result has 65 places, 67 transitions, 186 flow [2023-08-26 20:36:44,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=65, PETRI_TRANSITIONS=67} [2023-08-26 20:36:44,956 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 6 predicate places. [2023-08-26 20:36:44,956 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 67 transitions, 186 flow [2023-08-26 20:36:44,957 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-26 20:36:44,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:36:44,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:36:44,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 20:36:44,961 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-26 20:36:44,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:36:44,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1865824368, now seen corresponding path program 1 times [2023-08-26 20:36:44,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:36:44,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425220044] [2023-08-26 20:36:44,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:36:44,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:36:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:36:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:36:45,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:36:45,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425220044] [2023-08-26 20:36:45,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425220044] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:36:45,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:36:45,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 20:36:45,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636978821] [2023-08-26 20:36:45,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:36:45,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:36:45,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:36:45,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:36:45,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:36:45,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 485 [2023-08-26 20:36:45,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 67 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 189.4) internal successors, (947), 5 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:36:45,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:36:45,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 485 [2023-08-26 20:36:45,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:36:45,652 INFO L124 PetriNetUnfolderBase]: 1510/2487 cut-off events. [2023-08-26 20:36:45,652 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2023-08-26 20:36:45,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5281 conditions, 2487 events. 1510/2487 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 12431 event pairs, 1057 based on Foata normal form. 0/1788 useless extension candidates. Maximal degree in co-relation 5273. Up to 2421 conditions per place. [2023-08-26 20:36:45,666 INFO L140 encePairwiseOnDemand]: 479/485 looper letters, 55 selfloop transitions, 8 changer transitions 0/70 dead transitions. [2023-08-26 20:36:45,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 70 transitions, 314 flow [2023-08-26 20:36:45,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:36:45,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:36:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1003 transitions. [2023-08-26 20:36:45,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41360824742268043 [2023-08-26 20:36:45,669 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1003 transitions. [2023-08-26 20:36:45,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1003 transitions. [2023-08-26 20:36:45,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:36:45,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1003 transitions. [2023-08-26 20:36:45,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 200.6) internal successors, (1003), 5 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:36:45,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 485.0) internal successors, (2910), 6 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:36:45,678 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 485.0) internal successors, (2910), 6 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:36:45,678 INFO L175 Difference]: Start difference. First operand has 65 places, 67 transitions, 186 flow. Second operand 5 states and 1003 transitions. [2023-08-26 20:36:45,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 70 transitions, 314 flow [2023-08-26 20:36:45,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 70 transitions, 314 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 20:36:45,681 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 196 flow [2023-08-26 20:36:45,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2023-08-26 20:36:45,682 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places. [2023-08-26 20:36:45,682 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 196 flow [2023-08-26 20:36:45,683 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-26 20:36:45,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:36:45,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:36:45,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 20:36:45,683 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-26 20:36:45,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:36:45,683 INFO L85 PathProgramCache]: Analyzing trace with hash -2006802610, now seen corresponding path program 1 times [2023-08-26 20:36:45,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:36:45,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500438199] [2023-08-26 20:36:45,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:36:45,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:36:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:36:46,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:36:46,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:36:46,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500438199] [2023-08-26 20:36:46,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500438199] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:36:46,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:36:46,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 20:36:46,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133913918] [2023-08-26 20:36:46,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:36:46,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 20:36:46,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:36:46,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 20:36:46,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 20:36:46,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-26 20:36:46,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 185.33333333333334) internal successors, (1112), 6 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:36:46,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:36:46,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-26 20:36:46,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:36:46,573 INFO L124 PetriNetUnfolderBase]: 2181/3625 cut-off events. [2023-08-26 20:36:46,573 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2023-08-26 20:36:46,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7779 conditions, 3625 events. 2181/3625 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 20327 event pairs, 512 based on Foata normal form. 0/2716 useless extension candidates. Maximal degree in co-relation 7770. Up to 2528 conditions per place. [2023-08-26 20:36:46,593 INFO L140 encePairwiseOnDemand]: 476/485 looper letters, 110 selfloop transitions, 15 changer transitions 0/132 dead transitions. [2023-08-26 20:36:46,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 132 transitions, 603 flow [2023-08-26 20:36:46,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:36:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:36:46,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1042 transitions. [2023-08-26 20:36:46,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4296907216494845 [2023-08-26 20:36:46,597 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1042 transitions. [2023-08-26 20:36:46,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1042 transitions. [2023-08-26 20:36:46,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:36:46,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1042 transitions. [2023-08-26 20:36:46,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 208.4) internal successors, (1042), 5 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:36:46,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 485.0) internal successors, (2910), 6 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:36:46,604 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 485.0) internal successors, (2910), 6 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:36:46,604 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 196 flow. Second operand 5 states and 1042 transitions. [2023-08-26 20:36:46,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 132 transitions, 603 flow [2023-08-26 20:36:46,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 132 transitions, 587 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 20:36:46,615 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 266 flow [2023-08-26 20:36:46,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=266, PETRI_PLACES=71, PETRI_TRANSITIONS=74} [2023-08-26 20:36:46,617 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 12 predicate places. [2023-08-26 20:36:46,617 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 266 flow [2023-08-26 20:36:46,617 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-26 20:36:46,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:36:46,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:36:46,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 20:36:46,618 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-26 20:36:46,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:36:46,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2005979560, now seen corresponding path program 2 times [2023-08-26 20:36:46,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:36:46,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796338666] [2023-08-26 20:36:46,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:36:46,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:36:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:36:47,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:36:47,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:36:47,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796338666] [2023-08-26 20:36:47,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796338666] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:36:47,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:36:47,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 20:36:47,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837021238] [2023-08-26 20:36:47,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:36:47,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 20:36:47,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:36:47,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 20:36:47,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 20:36:47,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-26 20:36:47,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 185.33333333333334) internal successors, (1112), 6 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:36:47,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:36:47,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-26 20:36:47,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:36:47,895 INFO L124 PetriNetUnfolderBase]: 2181/3621 cut-off events. [2023-08-26 20:36:47,898 INFO L125 PetriNetUnfolderBase]: For 825/825 co-relation queries the response was YES. [2023-08-26 20:36:47,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8519 conditions, 3621 events. 2181/3621 cut-off events. For 825/825 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 20236 event pairs, 389 based on Foata normal form. 0/2785 useless extension candidates. Maximal degree in co-relation 8508. Up to 2528 conditions per place. [2023-08-26 20:36:47,918 INFO L140 encePairwiseOnDemand]: 477/485 looper letters, 124 selfloop transitions, 22 changer transitions 0/153 dead transitions. [2023-08-26 20:36:47,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 153 transitions, 753 flow [2023-08-26 20:36:47,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 20:36:47,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 20:36:47,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1239 transitions. [2023-08-26 20:36:47,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42577319587628865 [2023-08-26 20:36:47,922 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1239 transitions. [2023-08-26 20:36:47,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1239 transitions. [2023-08-26 20:36:47,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:36:47,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1239 transitions. [2023-08-26 20:36:47,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 206.5) internal successors, (1239), 6 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:36:47,930 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-26 20:36:47,931 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-26 20:36:47,931 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 266 flow. Second operand 6 states and 1239 transitions. [2023-08-26 20:36:47,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 153 transitions, 753 flow [2023-08-26 20:36:47,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 153 transitions, 735 flow, removed 9 selfloop flow, removed 0 redundant places. [2023-08-26 20:36:47,944 INFO L231 Difference]: Finished difference. Result has 79 places, 83 transitions, 376 flow [2023-08-26 20:36:47,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=79, PETRI_TRANSITIONS=83} [2023-08-26 20:36:47,947 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places. [2023-08-26 20:36:47,947 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 83 transitions, 376 flow [2023-08-26 20:36:47,947 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-26 20:36:47,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:36:47,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:36:47,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 20:36:47,948 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-26 20:36:47,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:36:47,948 INFO L85 PathProgramCache]: Analyzing trace with hash 752218327, now seen corresponding path program 1 times [2023-08-26 20:36:47,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:36:47,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159033217] [2023-08-26 20:36:47,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:36:47,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:36:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:36:47,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:36:47,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:36:47,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159033217] [2023-08-26 20:36:47,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159033217] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:36:47,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:36:47,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 20:36:47,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359564798] [2023-08-26 20:36:47,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:36:47,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 20:36:47,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:36:47,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 20:36:47,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 20:36:47,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 485 [2023-08-26 20:36:47,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 83 transitions, 376 flow. Second operand has 4 states, 4 states have (on average 225.25) internal successors, (901), 4 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:36:47,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:36:47,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 485 [2023-08-26 20:36:47,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:36:48,562 INFO L124 PetriNetUnfolderBase]: 3557/5851 cut-off events. [2023-08-26 20:36:48,562 INFO L125 PetriNetUnfolderBase]: For 3122/3173 co-relation queries the response was YES. [2023-08-26 20:36:48,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14120 conditions, 5851 events. 3557/5851 cut-off events. For 3122/3173 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 35750 event pairs, 1602 based on Foata normal form. 51/4420 useless extension candidates. Maximal degree in co-relation 14105. Up to 3438 conditions per place. [2023-08-26 20:36:48,598 INFO L140 encePairwiseOnDemand]: 478/485 looper letters, 153 selfloop transitions, 4 changer transitions 0/167 dead transitions. [2023-08-26 20:36:48,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 167 transitions, 1034 flow [2023-08-26 20:36:48,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 20:36:48,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 20:36:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1009 transitions. [2023-08-26 20:36:48,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5201030927835052 [2023-08-26 20:36:48,601 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1009 transitions. [2023-08-26 20:36:48,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1009 transitions. [2023-08-26 20:36:48,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:36:48,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1009 transitions. [2023-08-26 20:36:48,604 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-26 20:36:48,607 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-26 20:36:48,607 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-26 20:36:48,607 INFO L175 Difference]: Start difference. First operand has 79 places, 83 transitions, 376 flow. Second operand 4 states and 1009 transitions. [2023-08-26 20:36:48,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 167 transitions, 1034 flow [2023-08-26 20:36:48,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 167 transitions, 1032 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-26 20:36:48,617 INFO L231 Difference]: Finished difference. Result has 84 places, 86 transitions, 406 flow [2023-08-26 20:36:48,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=406, PETRI_PLACES=84, PETRI_TRANSITIONS=86} [2023-08-26 20:36:48,619 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 25 predicate places. [2023-08-26 20:36:48,619 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 86 transitions, 406 flow [2023-08-26 20:36:48,621 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-26 20:36:48,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:36:48,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:36:48,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 20:36:48,622 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-26 20:36:48,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:36:48,622 INFO L85 PathProgramCache]: Analyzing trace with hash 693783489, now seen corresponding path program 1 times [2023-08-26 20:36:48,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:36:48,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376390925] [2023-08-26 20:36:48,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:36:48,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:36:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:36:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:36:48,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:36:48,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376390925] [2023-08-26 20:36:48,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376390925] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:36:48,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:36:48,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 20:36:48,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962721134] [2023-08-26 20:36:48,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:36:48,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:36:48,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:36:48,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:36:48,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:36:48,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 485 [2023-08-26 20:36:48,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 86 transitions, 406 flow. Second operand has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:36:48,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:36:48,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 485 [2023-08-26 20:36:48,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:36:49,534 INFO L124 PetriNetUnfolderBase]: 3602/6015 cut-off events. [2023-08-26 20:36:49,534 INFO L125 PetriNetUnfolderBase]: For 3921/3929 co-relation queries the response was YES. [2023-08-26 20:36:49,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15567 conditions, 6015 events. 3602/6015 cut-off events. For 3921/3929 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 36577 event pairs, 2530 based on Foata normal form. 0/4858 useless extension candidates. Maximal degree in co-relation 15549. Up to 5806 conditions per place. [2023-08-26 20:36:49,574 INFO L140 encePairwiseOnDemand]: 476/485 looper letters, 77 selfloop transitions, 10 changer transitions 0/94 dead transitions. [2023-08-26 20:36:49,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 94 transitions, 598 flow [2023-08-26 20:36:49,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 20:36:49,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 20:36:49,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1197 transitions. [2023-08-26 20:36:49,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.411340206185567 [2023-08-26 20:36:49,578 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1197 transitions. [2023-08-26 20:36:49,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1197 transitions. [2023-08-26 20:36:49,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:36:49,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1197 transitions. [2023-08-26 20:36:49,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 199.5) internal successors, (1197), 6 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:36:49,585 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-26 20:36:49,586 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-26 20:36:49,586 INFO L175 Difference]: Start difference. First operand has 84 places, 86 transitions, 406 flow. Second operand 6 states and 1197 transitions. [2023-08-26 20:36:49,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 94 transitions, 598 flow [2023-08-26 20:36:49,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 94 transitions, 596 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:36:49,600 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 444 flow [2023-08-26 20:36:49,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=444, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2023-08-26 20:36:49,600 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places. [2023-08-26 20:36:49,600 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 444 flow [2023-08-26 20:36:49,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:36:49,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:36:49,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:36:49,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 20:36:49,601 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-26 20:36:49,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:36:49,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1288991555, now seen corresponding path program 1 times [2023-08-26 20:36:49,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:36:49,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337889502] [2023-08-26 20:36:49,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:36:49,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:36:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:36:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:36:50,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:36:50,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337889502] [2023-08-26 20:36:50,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337889502] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:36:50,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:36:50,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 20:36:50,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445609009] [2023-08-26 20:36:50,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:36:50,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 20:36:50,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:36:50,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 20:36:50,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 20:36:50,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-26 20:36:50,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 444 flow. Second operand has 6 states, 6 states have (on average 185.83333333333334) internal successors, (1115), 6 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:36:50,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:36:50,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-26 20:36:50,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:36:51,197 INFO L124 PetriNetUnfolderBase]: 3916/6452 cut-off events. [2023-08-26 20:36:51,197 INFO L125 PetriNetUnfolderBase]: For 3113/3143 co-relation queries the response was YES. [2023-08-26 20:36:51,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16860 conditions, 6452 events. 3916/6452 cut-off events. For 3113/3143 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 39632 event pairs, 726 based on Foata normal form. 94/5527 useless extension candidates. Maximal degree in co-relation 16841. Up to 4791 conditions per place. [2023-08-26 20:36:51,240 INFO L140 encePairwiseOnDemand]: 475/485 looper letters, 143 selfloop transitions, 20 changer transitions 0/170 dead transitions. [2023-08-26 20:36:51,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 170 transitions, 1013 flow [2023-08-26 20:36:51,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 20:36:51,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 20:36:51,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1244 transitions. [2023-08-26 20:36:51,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4274914089347079 [2023-08-26 20:36:51,245 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1244 transitions. [2023-08-26 20:36:51,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1244 transitions. [2023-08-26 20:36:51,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:36:51,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1244 transitions. [2023-08-26 20:36:51,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 207.33333333333334) internal successors, (1244), 6 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:36:51,253 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-26 20:36:51,254 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-26 20:36:51,254 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 444 flow. Second operand 6 states and 1244 transitions. [2023-08-26 20:36:51,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 170 transitions, 1013 flow [2023-08-26 20:36:51,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 170 transitions, 997 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 20:36:51,276 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 496 flow [2023-08-26 20:36:51,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=496, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2023-08-26 20:36:51,278 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 32 predicate places. [2023-08-26 20:36:51,278 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 496 flow [2023-08-26 20:36:51,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.83333333333334) internal successors, (1115), 6 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:36:51,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:36:51,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:36:51,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 20:36:51,279 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-26 20:36:51,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:36:51,279 INFO L85 PathProgramCache]: Analyzing trace with hash 38670329, now seen corresponding path program 2 times [2023-08-26 20:36:51,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:36:51,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752410647] [2023-08-26 20:36:51,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:36:51,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:36:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:36:51,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-26 20:36:51,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:36:51,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752410647] [2023-08-26 20:36:51,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752410647] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:36:51,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:36:51,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 20:36:51,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648155599] [2023-08-26 20:36:51,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:36:51,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 20:36:51,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:36:51,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 20:36:51,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 20:36:51,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-26 20:36:51,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 496 flow. Second operand has 6 states, 6 states have (on average 185.83333333333334) internal successors, (1115), 6 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:36:51,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:36:51,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-26 20:36:51,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:36:52,614 INFO L124 PetriNetUnfolderBase]: 4146/6845 cut-off events. [2023-08-26 20:36:52,614 INFO L125 PetriNetUnfolderBase]: For 4591/4615 co-relation queries the response was YES. [2023-08-26 20:36:52,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18567 conditions, 6845 events. 4146/6845 cut-off events. For 4591/4615 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 41941 event pairs, 730 based on Foata normal form. 94/5889 useless extension candidates. Maximal degree in co-relation 18547. Up to 4332 conditions per place. [2023-08-26 20:36:52,658 INFO L140 encePairwiseOnDemand]: 476/485 looper letters, 142 selfloop transitions, 23 changer transitions 0/172 dead transitions. [2023-08-26 20:36:52,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 172 transitions, 1073 flow [2023-08-26 20:36:52,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 20:36:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 20:36:52,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1243 transitions. [2023-08-26 20:36:52,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42714776632302404 [2023-08-26 20:36:52,662 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1243 transitions. [2023-08-26 20:36:52,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1243 transitions. [2023-08-26 20:36:52,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:36:52,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1243 transitions. [2023-08-26 20:36:52,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 207.16666666666666) internal successors, (1243), 6 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:36:52,717 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-26 20:36:52,717 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-26 20:36:52,718 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 496 flow. Second operand 6 states and 1243 transitions. [2023-08-26 20:36:52,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 172 transitions, 1073 flow [2023-08-26 20:36:52,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 172 transitions, 1050 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 20:36:52,740 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 554 flow [2023-08-26 20:36:52,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=554, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2023-08-26 20:36:52,742 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 36 predicate places. [2023-08-26 20:36:52,742 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 554 flow [2023-08-26 20:36:52,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.83333333333334) internal successors, (1115), 6 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:36:52,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:36:52,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:36:52,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 20:36:52,744 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-26 20:36:52,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:36:52,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1327212761, now seen corresponding path program 1 times [2023-08-26 20:36:52,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:36:52,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968122558] [2023-08-26 20:36:52,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:36:52,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:36:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:36:52,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:36:52,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:36:52,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968122558] [2023-08-26 20:36:52,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968122558] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:36:52,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:36:52,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 20:36:52,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81303791] [2023-08-26 20:36:52,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:36:52,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:36:52,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:36:52,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:36:52,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:36:52,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 485 [2023-08-26 20:36:52,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:36:52,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:36:52,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 485 [2023-08-26 20:36:52,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:36:52,992 INFO L124 PetriNetUnfolderBase]: 852/1653 cut-off events. [2023-08-26 20:36:52,993 INFO L125 PetriNetUnfolderBase]: For 1280/1287 co-relation queries the response was YES. [2023-08-26 20:36:52,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4260 conditions, 1653 events. 852/1653 cut-off events. For 1280/1287 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 9260 event pairs, 565 based on Foata normal form. 73/1571 useless extension candidates. Maximal degree in co-relation 4239. Up to 813 conditions per place. [2023-08-26 20:36:53,001 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 75 selfloop transitions, 2 changer transitions 7/92 dead transitions. [2023-08-26 20:36:53,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 92 transitions, 645 flow [2023-08-26 20:36:53,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:36:53,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:36:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2023-08-26 20:36:53,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147766323024054 [2023-08-26 20:36:53,005 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 749 transitions. [2023-08-26 20:36:53,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 749 transitions. [2023-08-26 20:36:53,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:36:53,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 749 transitions. [2023-08-26 20:36:53,007 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-26 20:36:53,010 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-26 20:36:53,010 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-26 20:36:53,010 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 554 flow. Second operand 3 states and 749 transitions. [2023-08-26 20:36:53,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 92 transitions, 645 flow [2023-08-26 20:36:53,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 92 transitions, 613 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-26 20:36:53,016 INFO L231 Difference]: Finished difference. Result has 94 places, 80 transitions, 419 flow [2023-08-26 20:36:53,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=419, PETRI_PLACES=94, PETRI_TRANSITIONS=80} [2023-08-26 20:36:53,017 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 35 predicate places. [2023-08-26 20:36:53,017 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 80 transitions, 419 flow [2023-08-26 20:36:53,017 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-26 20:36:53,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:36:53,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:36:53,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 20:36:53,018 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-26 20:36:53,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:36:53,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1005879036, now seen corresponding path program 1 times [2023-08-26 20:36:53,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:36:53,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791982902] [2023-08-26 20:36:53,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:36:53,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:36:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:36:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:36:53,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:36:53,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791982902] [2023-08-26 20:36:53,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791982902] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:36:53,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:36:53,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 20:36:53,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56198403] [2023-08-26 20:36:53,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:36:53,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:36:53,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:36:53,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:36:53,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:36:53,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-26 20:36:53,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 80 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:36:53,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:36:53,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-26 20:36:53,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:36:53,221 INFO L124 PetriNetUnfolderBase]: 548/1083 cut-off events. [2023-08-26 20:36:53,221 INFO L125 PetriNetUnfolderBase]: For 622/627 co-relation queries the response was YES. [2023-08-26 20:36:53,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 1083 events. 548/1083 cut-off events. For 622/627 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5347 event pairs, 410 based on Foata normal form. 13/971 useless extension candidates. Maximal degree in co-relation 2823. Up to 804 conditions per place. [2023-08-26 20:36:53,227 INFO L140 encePairwiseOnDemand]: 480/485 looper letters, 76 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2023-08-26 20:36:53,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 88 transitions, 594 flow [2023-08-26 20:36:53,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:36:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:36:53,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2023-08-26 20:36:53,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5140893470790378 [2023-08-26 20:36:53,230 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 748 transitions. [2023-08-26 20:36:53,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 748 transitions. [2023-08-26 20:36:53,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:36:53,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 748 transitions. [2023-08-26 20:36:53,232 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-26 20:36:53,234 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-26 20:36:53,234 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-26 20:36:53,234 INFO L175 Difference]: Start difference. First operand has 94 places, 80 transitions, 419 flow. Second operand 3 states and 748 transitions. [2023-08-26 20:36:53,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 88 transitions, 594 flow [2023-08-26 20:36:53,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 88 transitions, 581 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-26 20:36:53,238 INFO L231 Difference]: Finished difference. Result has 93 places, 80 transitions, 414 flow [2023-08-26 20:36:53,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=93, PETRI_TRANSITIONS=80} [2023-08-26 20:36:53,239 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 34 predicate places. [2023-08-26 20:36:53,239 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 80 transitions, 414 flow [2023-08-26 20:36:53,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:36:53,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:36:53,240 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:36:53,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 20:36:53,240 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-26 20:36:53,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:36:53,240 INFO L85 PathProgramCache]: Analyzing trace with hash 156498137, now seen corresponding path program 1 times [2023-08-26 20:36:53,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:36:53,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746516123] [2023-08-26 20:36:53,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:36:53,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:36:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:36:54,398 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-26 20:36:54,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:36:54,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746516123] [2023-08-26 20:36:54,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746516123] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:36:54,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546684788] [2023-08-26 20:36:54,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:36:54,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:36:54,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:36:54,401 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:36:54,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 20:36:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:36:54,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 68 conjunts are in the unsatisfiable core [2023-08-26 20:36:54,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:36:54,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:36:54,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:36:54,598 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 20:36:54,599 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-26 20:36:54,609 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 20:36:54,610 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 20:36:54,722 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-26 20:36:54,848 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-08-26 20:36:55,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 44 treesize of output 37 [2023-08-26 20:36:55,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:36:55,102 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-26 20:36:55,228 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-26 20:36:55,545 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-26 20:36:55,545 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:36:55,650 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_405 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_404) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_405) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)))) is different from false [2023-08-26 20:36:55,741 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_402)) |c_~#stored_elements~0.base| v_ArrVal_404) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_405) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_402) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|))))) is different from false [2023-08-26 20:36:55,776 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_400 Int) (v_ArrVal_404 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_400) .cse1 v_ArrVal_402)) |c_~#stored_elements~0.base| v_ArrVal_404) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_400) (< (+ (select .cse0 .cse1) 1) v_ArrVal_402) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_405) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|))))) is different from false [2023-08-26 20:36:55,903 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_400 Int) (v_ArrVal_398 Int) (v_ArrVal_404 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_398)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_400) .cse3 v_ArrVal_402)) |c_~#stored_elements~0.base| v_ArrVal_404) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_400) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|) (< (+ (select .cse0 .cse3) 1) v_ArrVal_402) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_405) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-08-26 20:37:02,071 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-26 20:37:02,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546684788] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:37:02,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:37:02,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-08-26 20:37:02,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420308280] [2023-08-26 20:37:02,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:37:02,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-26 20:37:02,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:37:02,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-26 20:37:02,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=572, Unknown=13, NotChecked=220, Total=992 [2023-08-26 20:37:02,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 485 [2023-08-26 20:37:02,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 80 transitions, 414 flow. Second operand has 32 states, 32 states have (on average 180.40625) internal successors, (5773), 32 states have internal predecessors, (5773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:37:02,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:37:02,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 485 [2023-08-26 20:37:02,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:37:07,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:37:09,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:37:12,053 INFO L124 PetriNetUnfolderBase]: 612/1198 cut-off events. [2023-08-26 20:37:12,053 INFO L125 PetriNetUnfolderBase]: For 702/702 co-relation queries the response was YES. [2023-08-26 20:37:12,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3221 conditions, 1198 events. 612/1198 cut-off events. For 702/702 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 6016 event pairs, 436 based on Foata normal form. 0/1070 useless extension candidates. Maximal degree in co-relation 3199. Up to 1046 conditions per place. [2023-08-26 20:37:12,060 INFO L140 encePairwiseOnDemand]: 468/485 looper letters, 69 selfloop transitions, 52 changer transitions 1/128 dead transitions. [2023-08-26 20:37:12,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 128 transitions, 889 flow [2023-08-26 20:37:12,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-26 20:37:12,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-26 20:37:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3868 transitions. [2023-08-26 20:37:12,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.379774177712322 [2023-08-26 20:37:12,071 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3868 transitions. [2023-08-26 20:37:12,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3868 transitions. [2023-08-26 20:37:12,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:37:12,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3868 transitions. [2023-08-26 20:37:12,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 184.1904761904762) internal successors, (3868), 21 states have internal predecessors, (3868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:37:12,090 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-26 20:37:12,092 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-26 20:37:12,092 INFO L175 Difference]: Start difference. First operand has 93 places, 80 transitions, 414 flow. Second operand 21 states and 3868 transitions. [2023-08-26 20:37:12,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 128 transitions, 889 flow [2023-08-26 20:37:12,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 128 transitions, 885 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:37:12,098 INFO L231 Difference]: Finished difference. Result has 119 places, 115 transitions, 777 flow [2023-08-26 20:37:12,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=777, PETRI_PLACES=119, PETRI_TRANSITIONS=115} [2023-08-26 20:37:12,099 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 60 predicate places. [2023-08-26 20:37:12,099 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 115 transitions, 777 flow [2023-08-26 20:37:12,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 180.40625) internal successors, (5773), 32 states have internal predecessors, (5773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:37:12,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:37:12,100 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:37:12,112 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-26 20:37:12,305 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-26 20:37:12,306 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-26 20:37:12,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:37:12,306 INFO L85 PathProgramCache]: Analyzing trace with hash 156498119, now seen corresponding path program 1 times [2023-08-26 20:37:12,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:37:12,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937592425] [2023-08-26 20:37:12,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:37:12,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:37:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:37:12,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-26 20:37:12,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:37:12,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937592425] [2023-08-26 20:37:12,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937592425] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:37:12,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319645750] [2023-08-26 20:37:12,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:37:12,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:37:12,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:37:12,759 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:37:12,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 20:37:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:37:12,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-26 20:37:12,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:37:13,020 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-26 20:37:13,089 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-26 20:37:13,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:37:13,118 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 20:37:13,187 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-26 20:37:13,188 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-26 20:37:13,218 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-26 20:37:13,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:37:13,418 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 20:37:13,419 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2023-08-26 20:37:13,431 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 20:37:13,431 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-26 20:37:13,438 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-26 20:37:13,454 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-26 20:37:13,465 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 20:37:13,466 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-26 20:37:13,588 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-26 20:37:13,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319645750] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:37:13,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:37:13,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-08-26 20:37:13,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991050483] [2023-08-26 20:37:13,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:37:13,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-26 20:37:13,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:37:13,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-26 20:37:13,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=513, Unknown=5, NotChecked=0, Total=650 [2023-08-26 20:37:13,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 485 [2023-08-26 20:37:13,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 115 transitions, 777 flow. Second operand has 26 states, 26 states have (on average 181.73076923076923) internal successors, (4725), 26 states have internal predecessors, (4725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:37:13,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:37:13,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 485 [2023-08-26 20:37:13,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:37:14,516 INFO L124 PetriNetUnfolderBase]: 1367/2659 cut-off events. [2023-08-26 20:37:14,516 INFO L125 PetriNetUnfolderBase]: For 1601/1601 co-relation queries the response was YES. [2023-08-26 20:37:14,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7089 conditions, 2659 events. 1367/2659 cut-off events. For 1601/1601 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 15876 event pairs, 652 based on Foata normal form. 0/2361 useless extension candidates. Maximal degree in co-relation 7060. Up to 845 conditions per place. [2023-08-26 20:37:14,533 INFO L140 encePairwiseOnDemand]: 475/485 looper letters, 173 selfloop transitions, 50 changer transitions 4/233 dead transitions. [2023-08-26 20:37:14,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 233 transitions, 1652 flow [2023-08-26 20:37:14,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 20:37:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 20:37:14,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2146 transitions. [2023-08-26 20:37:14,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022492970946579 [2023-08-26 20:37:14,539 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2146 transitions. [2023-08-26 20:37:14,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2146 transitions. [2023-08-26 20:37:14,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:37:14,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2146 transitions. [2023-08-26 20:37:14,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 195.0909090909091) internal successors, (2146), 11 states have internal predecessors, (2146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:37:14,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 485.0) internal successors, (5820), 12 states have internal predecessors, (5820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:37:14,550 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 485.0) internal successors, (5820), 12 states have internal predecessors, (5820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:37:14,550 INFO L175 Difference]: Start difference. First operand has 119 places, 115 transitions, 777 flow. Second operand 11 states and 2146 transitions. [2023-08-26 20:37:14,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 233 transitions, 1652 flow [2023-08-26 20:37:14,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 233 transitions, 1514 flow, removed 54 selfloop flow, removed 8 redundant places. [2023-08-26 20:37:14,563 INFO L231 Difference]: Finished difference. Result has 123 places, 124 transitions, 836 flow [2023-08-26 20:37:14,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=836, PETRI_PLACES=123, PETRI_TRANSITIONS=124} [2023-08-26 20:37:14,564 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 64 predicate places. [2023-08-26 20:37:14,564 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 124 transitions, 836 flow [2023-08-26 20:37:14,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 181.73076923076923) internal successors, (4725), 26 states have internal predecessors, (4725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:37:14,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:37:14,565 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:37:14,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 20:37:14,770 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-26 20:37:14,770 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-26 20:37:14,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:37:14,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1827680919, now seen corresponding path program 1 times [2023-08-26 20:37:14,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:37:14,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203558113] [2023-08-26 20:37:14,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:37:14,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:37:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:37:15,601 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-26 20:37:15,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:37:15,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203558113] [2023-08-26 20:37:15,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203558113] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:37:15,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955686011] [2023-08-26 20:37:15,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:37:15,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:37:15,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:37:15,605 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:37:15,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 20:37:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:37:15,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 72 conjunts are in the unsatisfiable core [2023-08-26 20:37:15,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:37:15,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:37:15,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:37:15,799 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 20:37:15,799 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-26 20:37:15,818 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 20:37:15,819 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 20:37:15,898 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-08-26 20:37:15,983 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-26 20:37:16,088 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-08-26 20:37:16,266 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-08-26 20:37:16,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:37:16,335 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-26 20:37:16,472 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-08-26 20:37:16,555 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-26 20:37:16,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:37:16,677 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (v_ArrVal_585 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (v_ArrVal_587 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_585)) |c_~#stored_elements~0.base| v_ArrVal_587) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_~#queue~0.offset|) v_ArrVal_588) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_585) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|)))) is different from false [2023-08-26 20:37:16,782 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (v_ArrVal_585 Int) (v_ArrVal_584 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (v_ArrVal_587 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_584) .cse2 v_ArrVal_585)) |c_~#stored_elements~0.base| v_ArrVal_587) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_584) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_~#queue~0.offset|) v_ArrVal_588) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_585) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|))))) is different from false [2023-08-26 20:37:19,577 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (v_ArrVal_585 Int) (v_ArrVal_584 Int) (v_ArrVal_582 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (v_ArrVal_587 (Array Int 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_582)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_584) .cse2 v_ArrVal_585)) |c_~#stored_elements~0.base| v_ArrVal_587) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_584) (< (+ (select .cse0 .cse2) 1) v_ArrVal_585) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_~#queue~0.offset|) v_ArrVal_588) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse3 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|))))) is different from false [2023-08-26 20:37:27,714 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (v_ArrVal_585 Int) (v_ArrVal_584 Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_587 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_580))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_582)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_584) .cse1 v_ArrVal_585)) |c_~#stored_elements~0.base| v_ArrVal_587) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_585) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_~#queue~0.offset|) v_ArrVal_588) .cse3) 2147483647) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (< (+ 1 (select .cse0 .cse3)) v_ArrVal_584))))))) is different from false [2023-08-26 20:37:27,768 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-26 20:37:27,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955686011] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:37:27,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:37:27,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-26 20:37:27,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720303895] [2023-08-26 20:37:27,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:37:27,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-26 20:37:27,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:37:27,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-26 20:37:27,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=683, Unknown=21, NotChecked=244, Total=1190 [2023-08-26 20:37:27,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-26 20:37:27,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 124 transitions, 836 flow. Second operand has 35 states, 35 states have (on average 176.37142857142857) internal successors, (6173), 35 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:37:27,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:37:27,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-26 20:37:27,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:37:31,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:37:33,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:37:34,039 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_588 Int) (v_ArrVal_585 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (v_ArrVal_587 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_585)) |c_~#stored_elements~0.base| v_ArrVal_587) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_~#queue~0.offset|) v_ArrVal_588) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_585)))) (forall ((v_ArrVal_588 Int) (v_ArrVal_585 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (v_ArrVal_587 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_585)) |c_~#stored_elements~0.base| v_ArrVal_587) |c_~#queue~0.base|))) (or (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_~#queue~0.offset|) v_ArrVal_588) .cse1) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_585) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|)))))) is different from false [2023-08-26 20:37:35,817 INFO L124 PetriNetUnfolderBase]: 1812/3515 cut-off events. [2023-08-26 20:37:35,818 INFO L125 PetriNetUnfolderBase]: For 2893/2893 co-relation queries the response was YES. [2023-08-26 20:37:35,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9614 conditions, 3515 events. 1812/3515 cut-off events. For 2893/2893 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 22575 event pairs, 907 based on Foata normal form. 14/3154 useless extension candidates. Maximal degree in co-relation 9584. Up to 2231 conditions per place. [2023-08-26 20:37:35,837 INFO L140 encePairwiseOnDemand]: 465/485 looper letters, 174 selfloop transitions, 78 changer transitions 3/261 dead transitions. [2023-08-26 20:37:35,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 261 transitions, 1827 flow [2023-08-26 20:37:35,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-26 20:37:35,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-26 20:37:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3882 transitions. [2023-08-26 20:37:35,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3811487481590574 [2023-08-26 20:37:35,849 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3882 transitions. [2023-08-26 20:37:35,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3882 transitions. [2023-08-26 20:37:35,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:37:35,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3882 transitions. [2023-08-26 20:37:35,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 184.85714285714286) internal successors, (3882), 21 states have internal predecessors, (3882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:37:35,870 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-26 20:37:35,872 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-26 20:37:35,872 INFO L175 Difference]: Start difference. First operand has 123 places, 124 transitions, 836 flow. Second operand 21 states and 3882 transitions. [2023-08-26 20:37:35,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 261 transitions, 1827 flow [2023-08-26 20:37:35,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 261 transitions, 1773 flow, removed 14 selfloop flow, removed 5 redundant places. [2023-08-26 20:37:35,888 INFO L231 Difference]: Finished difference. Result has 148 places, 152 transitions, 1220 flow [2023-08-26 20:37:35,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1220, PETRI_PLACES=148, PETRI_TRANSITIONS=152} [2023-08-26 20:37:35,889 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 89 predicate places. [2023-08-26 20:37:35,889 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 152 transitions, 1220 flow [2023-08-26 20:37:35,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 176.37142857142857) internal successors, (6173), 35 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:37:35,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:37:35,891 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:37:35,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-26 20:37:36,096 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-26 20:37:36,097 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-26 20:37:36,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:37:36,097 INFO L85 PathProgramCache]: Analyzing trace with hash 555652901, now seen corresponding path program 2 times [2023-08-26 20:37:36,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:37:36,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930012902] [2023-08-26 20:37:36,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:37:36,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:37:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:37:36,924 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-26 20:37:36,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:37:36,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930012902] [2023-08-26 20:37:36,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930012902] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:37:36,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465287916] [2023-08-26 20:37:36,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 20:37:36,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:37:36,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:37:36,926 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:37:36,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 20:37:37,083 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 20:37:37,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 20:37:37,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 77 conjunts are in the unsatisfiable core [2023-08-26 20:37:37,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:37:37,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:37:37,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:37:37,123 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 20:37:37,123 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-26 20:37:37,140 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 20:37:37,140 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 20:37:37,255 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-26 20:37:37,360 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-08-26 20:37:37,522 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-26 20:37:37,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:37:37,584 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-26 20:37:37,638 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-26 20:37:37,745 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-26 20:37:37,892 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-26 20:37:37,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:37:38,028 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_52| Int) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_692 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_689) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_690) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_52|)) v_ArrVal_692) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_52|)))) is different from false [2023-08-26 20:37:38,052 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_687 Int) (v_ArrVal_689 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_52| Int) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_692 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_687)) |c_~#stored_elements~0.base| v_ArrVal_689) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_690) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_52|)) v_ArrVal_692) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_52|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_687)))) is different from false [2023-08-26 20:37:59,062 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-26 20:37:59,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465287916] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:37:59,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:37:59,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-26 20:37:59,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355298454] [2023-08-26 20:37:59,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:37:59,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-26 20:37:59,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:37:59,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-26 20:37:59,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=774, Unknown=30, NotChecked=126, Total=1190 [2023-08-26 20:37:59,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-26 20:37:59,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 152 transitions, 1220 flow. Second operand has 35 states, 35 states have (on average 176.37142857142857) internal successors, (6173), 35 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:37:59,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:37:59,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-26 20:37:59,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:38:07,891 WARN L234 SmtUtils]: Spent 5.57s on a formula simplification. DAG size of input: 92 DAG size of output: 90 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 20:38:12,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:38:14,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:38:16,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:38:16,308 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse2 (+ (select .cse4 .cse5) 1))) (and (forall ((v_ArrVal_687 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_686 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_52| Int) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_692 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_686) .cse5 v_ArrVal_687)) |c_~#stored_elements~0.base| v_ArrVal_689) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_690) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_52|)) v_ArrVal_692) .cse1) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_686) (< .cse2 v_ArrVal_687) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_52|)))) (forall ((v_ArrVal_687 Int) (v_ArrVal_689 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_52| Int) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_692 Int)) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_687)) |c_~#stored_elements~0.base| v_ArrVal_689) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_690) |c_~#queue~0.base|))) (or (< (select (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_52|)) v_ArrVal_692) .cse1) 2147483647) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_52|) (< .cse2 v_ArrVal_687))))))) is different from false [2023-08-26 20:38:18,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:38:20,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 20:38:22,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 20:38:24,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 20:38:26,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 20:38:28,770 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-26 20:38:31,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 20:38:34,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 20:38:36,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 20:38:38,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 20:38:48,347 INFO L124 PetriNetUnfolderBase]: 3185/6241 cut-off events. [2023-08-26 20:38:48,348 INFO L125 PetriNetUnfolderBase]: For 9941/9941 co-relation queries the response was YES. [2023-08-26 20:38:48,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21001 conditions, 6241 events. 3185/6241 cut-off events. For 9941/9941 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 45992 event pairs, 1061 based on Foata normal form. 20/5666 useless extension candidates. Maximal degree in co-relation 20963. Up to 2769 conditions per place. [2023-08-26 20:38:48,389 INFO L140 encePairwiseOnDemand]: 464/485 looper letters, 238 selfloop transitions, 127 changer transitions 3/374 dead transitions. [2023-08-26 20:38:48,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 374 transitions, 3365 flow [2023-08-26 20:38:48,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-26 20:38:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-08-26 20:38:48,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 5346 transitions. [2023-08-26 20:38:48,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38009242801279775 [2023-08-26 20:38:48,396 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 5346 transitions. [2023-08-26 20:38:48,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 5346 transitions. [2023-08-26 20:38:48,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:38:48,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 5346 transitions. [2023-08-26 20:38:48,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 184.3448275862069) internal successors, (5346), 29 states have internal predecessors, (5346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:38:48,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 485.0) internal successors, (14550), 30 states have internal predecessors, (14550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:38:48,418 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 485.0) internal successors, (14550), 30 states have internal predecessors, (14550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:38:48,418 INFO L175 Difference]: Start difference. First operand has 148 places, 152 transitions, 1220 flow. Second operand 29 states and 5346 transitions. [2023-08-26 20:38:48,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 374 transitions, 3365 flow [2023-08-26 20:38:48,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 374 transitions, 3206 flow, removed 63 selfloop flow, removed 7 redundant places. [2023-08-26 20:38:48,538 INFO L231 Difference]: Finished difference. Result has 180 places, 225 transitions, 2164 flow [2023-08-26 20:38:48,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=2164, PETRI_PLACES=180, PETRI_TRANSITIONS=225} [2023-08-26 20:38:48,539 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 121 predicate places. [2023-08-26 20:38:48,539 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 225 transitions, 2164 flow [2023-08-26 20:38:48,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 176.37142857142857) internal successors, (6173), 35 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:38:48,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:38:48,541 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:38:48,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-26 20:38:48,746 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-26 20:38:48,746 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-26 20:38:48,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:38:48,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1968124125, now seen corresponding path program 1 times [2023-08-26 20:38:48,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:38:48,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346517457] [2023-08-26 20:38:48,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:38:48,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:38:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:38:49,216 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-26 20:38:49,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:38:49,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346517457] [2023-08-26 20:38:49,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346517457] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:38:49,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105626204] [2023-08-26 20:38:49,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:38:49,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:38:49,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:38:49,218 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:38:49,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 20:38:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:38:49,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 56 conjunts are in the unsatisfiable core [2023-08-26 20:38:49,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:38:49,377 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 20:38:49,377 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 20:38:49,508 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-26 20:38:49,548 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 20:38:49,609 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-26 20:38:49,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:38:49,636 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 20:38:49,699 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-26 20:38:49,699 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2023-08-26 20:38:49,740 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-26 20:38:49,740 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:38:49,815 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_779 Int)) (or (< 0 (+ (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_778) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_779) (+ 3208 |c_~#queue~0.offset|)) 2147483650)) (< (+ v_ArrVal_779 2147483648) 0))) is different from false [2023-08-26 20:38:49,951 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 20:38:49,952 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-26 20:38:49,965 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 20:38:49,966 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 2233 treesize of output 2187 [2023-08-26 20:38:50,012 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 516 treesize of output 500 [2023-08-26 20:38:50,037 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 498 treesize of output 466 [2023-08-26 20:38:50,903 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 20:38:50,906 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-26 20:38:50,912 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 20:38:50,914 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-26 20:38:50,923 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 20:38:50,925 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-26 20:38:50,942 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 20:38:50,944 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-26 20:38:50,969 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-26 20:38:51,106 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 20:38:51,106 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 466 treesize of output 434 [2023-08-26 20:38:51,230 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-26 20:38:51,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105626204] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:38:51,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:38:51,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2023-08-26 20:38:51,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145223368] [2023-08-26 20:38:51,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:38:51,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-26 20:38:51,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:38:51,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-26 20:38:51,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=609, Unknown=7, NotChecked=52, Total=812 [2023-08-26 20:38:51,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 485 [2023-08-26 20:38:51,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 225 transitions, 2164 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-26 20:38:51,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:38:51,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 485 [2023-08-26 20:38:51,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:38:52,354 INFO L124 PetriNetUnfolderBase]: 3292/6413 cut-off events. [2023-08-26 20:38:52,354 INFO L125 PetriNetUnfolderBase]: For 36954/37426 co-relation queries the response was YES. [2023-08-26 20:38:52,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29239 conditions, 6413 events. 3292/6413 cut-off events. For 36954/37426 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 47223 event pairs, 1717 based on Foata normal form. 28/5800 useless extension candidates. Maximal degree in co-relation 29192. Up to 5325 conditions per place. [2023-08-26 20:38:52,408 INFO L140 encePairwiseOnDemand]: 477/485 looper letters, 212 selfloop transitions, 37 changer transitions 3/258 dead transitions. [2023-08-26 20:38:52,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 258 transitions, 2821 flow [2023-08-26 20:38:52,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 20:38:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 20:38:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1144 transitions. [2023-08-26 20:38:52,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.393127147766323 [2023-08-26 20:38:52,411 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1144 transitions. [2023-08-26 20:38:52,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1144 transitions. [2023-08-26 20:38:52,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:38:52,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1144 transitions. [2023-08-26 20:38:52,413 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-26 20:38:52,415 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-26 20:38:52,415 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-26 20:38:52,415 INFO L175 Difference]: Start difference. First operand has 180 places, 225 transitions, 2164 flow. Second operand 6 states and 1144 transitions. [2023-08-26 20:38:52,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 258 transitions, 2821 flow [2023-08-26 20:38:52,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 258 transitions, 2593 flow, removed 76 selfloop flow, removed 7 redundant places. [2023-08-26 20:38:52,463 INFO L231 Difference]: Finished difference. Result has 178 places, 222 transitions, 1993 flow [2023-08-26 20:38:52,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=1877, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1993, PETRI_PLACES=178, PETRI_TRANSITIONS=222} [2023-08-26 20:38:52,464 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 119 predicate places. [2023-08-26 20:38:52,464 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 222 transitions, 1993 flow [2023-08-26 20:38:52,465 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-26 20:38:52,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:38:52,465 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:38:52,473 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-26 20:38:52,674 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-26 20:38:52,674 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-26 20:38:52,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:38:52,674 INFO L85 PathProgramCache]: Analyzing trace with hash 556475951, now seen corresponding path program 3 times [2023-08-26 20:38:52,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:38:52,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864044736] [2023-08-26 20:38:52,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:38:52,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:38:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:38:53,402 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-26 20:38:53,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:38:53,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864044736] [2023-08-26 20:38:53,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864044736] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:38:53,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760489165] [2023-08-26 20:38:53,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 20:38:53,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:38:53,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:38:53,404 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:38:53,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 20:38:53,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-26 20:38:53,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 20:38:53,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 78 conjunts are in the unsatisfiable core [2023-08-26 20:38:53,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:38:53,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:38:53,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:38:53,572 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 20:38:53,572 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-26 20:38:53,587 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 20:38:53,587 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 20:38:53,674 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-26 20:38:53,755 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-26 20:38:53,871 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2023-08-26 20:38:53,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:38:53,917 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2023-08-26 20:38:54,008 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2023-08-26 20:38:54,071 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 36 treesize of output 38 [2023-08-26 20:38:54,126 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-26 20:38:54,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:38:56,302 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int) (v_ArrVal_882 Int) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_878 Int) (v_ArrVal_883 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_878)) |c_~#stored_elements~0.base| v_ArrVal_880))) (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_882)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_883) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_878) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|))))) is different from false [2023-08-26 20:38:56,318 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int) (v_ArrVal_882 Int) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_878 Int) (v_ArrVal_883 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_878)) |c_~#stored_elements~0.base| v_ArrVal_880))) (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_882)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_883) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_878) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|)))))) is different from false [2023-08-26 20:38:56,353 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int) (v_ArrVal_882 Int) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_878 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_876 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_876) .cse1 v_ArrVal_878)) |c_~#stored_elements~0.base| v_ArrVal_880))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_878) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_876) (< (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_882)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_883) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse3 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|)))))) is different from false [2023-08-26 20:38:58,497 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int) (v_ArrVal_882 Int) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_878 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_876 Int) (v_ArrVal_875 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_875)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_876) .cse2 v_ArrVal_878)) |c_~#stored_elements~0.base| v_ArrVal_880))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_876) (< (+ (select .cse0 .cse2) 1) v_ArrVal_878) (< (select .cse3 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) |c_~#queue~0.offset|) v_ArrVal_882)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_883) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2023-08-26 20:39:04,655 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-26 20:39:04,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760489165] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:39:04,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:39:04,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-26 20:39:04,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629665886] [2023-08-26 20:39:04,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:39:04,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-26 20:39:04,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:39:04,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-26 20:39:04,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=670, Unknown=18, NotChecked=244, Total=1190 [2023-08-26 20:39:04,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-26 20:39:04,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 222 transitions, 1993 flow. Second operand has 35 states, 35 states have (on average 176.37142857142857) internal successors, (6173), 35 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:39:04,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:39:04,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-26 20:39:04,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:39:19,715 WARN L234 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 80 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 20:39:21,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:39:23,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:39:25,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:39:27,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:39:28,445 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_883 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_883) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0) 2147483647)) (forall ((v_ArrVal_882 Int) (v_ArrVal_883 (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_882)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_883) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int) (v_ArrVal_882 Int) (v_ArrVal_883 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) |c_~#queue~0.offset|) v_ArrVal_882)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_883) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|)))))) is different from false [2023-08-26 20:39:30,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 20:39:31,943 INFO L124 PetriNetUnfolderBase]: 4223/8206 cut-off events. [2023-08-26 20:39:31,943 INFO L125 PetriNetUnfolderBase]: For 46427/46945 co-relation queries the response was YES. [2023-08-26 20:39:31,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37037 conditions, 8206 events. 4223/8206 cut-off events. For 46427/46945 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 63194 event pairs, 1428 based on Foata normal form. 27/7424 useless extension candidates. Maximal degree in co-relation 36990. Up to 4393 conditions per place. [2023-08-26 20:39:32,088 INFO L140 encePairwiseOnDemand]: 464/485 looper letters, 240 selfloop transitions, 156 changer transitions 3/405 dead transitions. [2023-08-26 20:39:32,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 405 transitions, 4744 flow [2023-08-26 20:39:32,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-26 20:39:32,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-26 20:39:32,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4243 transitions. [2023-08-26 20:39:32,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38036754818467056 [2023-08-26 20:39:32,092 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4243 transitions. [2023-08-26 20:39:32,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4243 transitions. [2023-08-26 20:39:32,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:39:32,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4243 transitions. [2023-08-26 20:39:32,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 184.47826086956522) internal successors, (4243), 23 states have internal predecessors, (4243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:39:32,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 485.0) internal successors, (11640), 24 states have internal predecessors, (11640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:39:32,103 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 485.0) internal successors, (11640), 24 states have internal predecessors, (11640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:39:32,103 INFO L175 Difference]: Start difference. First operand has 178 places, 222 transitions, 1993 flow. Second operand 23 states and 4243 transitions. [2023-08-26 20:39:32,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 405 transitions, 4744 flow [2023-08-26 20:39:32,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 405 transitions, 4700 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 20:39:32,151 INFO L231 Difference]: Finished difference. Result has 207 places, 302 transitions, 3530 flow [2023-08-26 20:39:32,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=1949, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3530, PETRI_PLACES=207, PETRI_TRANSITIONS=302} [2023-08-26 20:39:32,152 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 148 predicate places. [2023-08-26 20:39:32,152 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 302 transitions, 3530 flow [2023-08-26 20:39:32,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 176.37142857142857) internal successors, (6173), 35 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:39:32,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:39:32,153 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:39:32,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-26 20:39:32,353 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-26 20:39:32,354 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-26 20:39:32,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:39:32,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2097698327, now seen corresponding path program 1 times [2023-08-26 20:39:32,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:39:32,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084737576] [2023-08-26 20:39:32,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:39:32,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:39:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:39:32,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:39:32,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:39:32,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084737576] [2023-08-26 20:39:32,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084737576] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:39:32,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855604267] [2023-08-26 20:39:32,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:39:32,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:39:32,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:39:32,905 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:39:32,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 20:39:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:39:33,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 67 conjunts are in the unsatisfiable core [2023-08-26 20:39:33,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:39:33,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:39:33,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:39:33,063 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 20:39:33,064 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-26 20:39:33,074 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 20:39:33,074 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 20:39:33,159 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-26 20:39:33,214 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-08-26 20:39:33,344 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-26 20:39:33,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:39:33,394 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-26 20:39:33,471 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-26 20:39:33,572 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2023-08-26 20:39:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:39:33,729 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:39:33,802 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_983 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_983) .cse1) 2147483647)))) is different from false [2023-08-26 20:39:35,924 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_983 Int) (v_ArrVal_980 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_978 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_978) .cse3 v_ArrVal_980)) |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_983) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_980) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|))))) is different from false [2023-08-26 20:39:40,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-26 20:39:40,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855604267] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:39:40,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:39:40,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2023-08-26 20:39:40,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75914613] [2023-08-26 20:39:40,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:39:40,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-26 20:39:40,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:39:40,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-26 20:39:40,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=469, Unknown=17, NotChecked=98, Total=756 [2023-08-26 20:39:40,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 485 [2023-08-26 20:39:40,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 302 transitions, 3530 flow. Second operand has 28 states, 28 states have (on average 186.92857142857142) internal successors, (5234), 28 states have internal predecessors, (5234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:39:40,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:39:40,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 485 [2023-08-26 20:39:40,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:39:47,532 INFO L124 PetriNetUnfolderBase]: 5321/10270 cut-off events. [2023-08-26 20:39:47,532 INFO L125 PetriNetUnfolderBase]: For 163173/164320 co-relation queries the response was YES. [2023-08-26 20:39:47,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61905 conditions, 10270 events. 5321/10270 cut-off events. For 163173/164320 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 82336 event pairs, 2996 based on Foata normal form. 28/9311 useless extension candidates. Maximal degree in co-relation 61848. Up to 7729 conditions per place. [2023-08-26 20:39:47,606 INFO L140 encePairwiseOnDemand]: 464/485 looper letters, 356 selfloop transitions, 116 changer transitions 1/479 dead transitions. [2023-08-26 20:39:47,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 479 transitions, 6667 flow [2023-08-26 20:39:47,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-26 20:39:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-26 20:39:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4638 transitions. [2023-08-26 20:39:47,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3984536082474227 [2023-08-26 20:39:47,611 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4638 transitions. [2023-08-26 20:39:47,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4638 transitions. [2023-08-26 20:39:47,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:39:47,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4638 transitions. [2023-08-26 20:39:47,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 193.25) internal successors, (4638), 24 states have internal predecessors, (4638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:39:47,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 485.0) internal successors, (12125), 25 states have internal predecessors, (12125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:39:47,626 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 485.0) internal successors, (12125), 25 states have internal predecessors, (12125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:39:47,626 INFO L175 Difference]: Start difference. First operand has 207 places, 302 transitions, 3530 flow. Second operand 24 states and 4638 transitions. [2023-08-26 20:39:47,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 479 transitions, 6667 flow [2023-08-26 20:39:47,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 479 transitions, 6177 flow, removed 205 selfloop flow, removed 9 redundant places. [2023-08-26 20:39:47,749 INFO L231 Difference]: Finished difference. Result has 233 places, 367 transitions, 4428 flow [2023-08-26 20:39:47,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=3146, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=4428, PETRI_PLACES=233, PETRI_TRANSITIONS=367} [2023-08-26 20:39:47,749 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 174 predicate places. [2023-08-26 20:39:47,749 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 367 transitions, 4428 flow [2023-08-26 20:39:47,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 186.92857142857142) internal successors, (5234), 28 states have internal predecessors, (5234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:39:47,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:39:47,750 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:39:47,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-26 20:39:47,950 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-26 20:39:47,951 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-26 20:39:47,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:39:47,951 INFO L85 PathProgramCache]: Analyzing trace with hash -2097698344, now seen corresponding path program 1 times [2023-08-26 20:39:47,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:39:47,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185895149] [2023-08-26 20:39:47,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:39:47,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:39:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:39:48,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:39:48,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:39:48,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185895149] [2023-08-26 20:39:48,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185895149] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:39:48,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186453331] [2023-08-26 20:39:48,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:39:48,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:39:48,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:39:48,389 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:39:48,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-26 20:39:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:39:48,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-26 20:39:48,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:39:48,676 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-08-26 20:39:48,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:39:48,707 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 24 treesize of output 24 [2023-08-26 20:39:48,770 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-26 20:39:48,770 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2023-08-26 20:39:48,803 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 29 treesize of output 24 [2023-08-26 20:39:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:39:48,817 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:39:48,893 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1067 Int) (v_ArrVal_1066 (Array Int Int))) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1066) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1067)) .cse1))))) is different from false [2023-08-26 20:39:48,978 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 20:39:48,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 51 [2023-08-26 20:39:48,987 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 20:39:48,988 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 74 treesize of output 74 [2023-08-26 20:39:48,993 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-08-26 20:39:49,005 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 17 treesize of output 9 [2023-08-26 20:39:49,026 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 20:39:49,026 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 59 treesize of output 47 [2023-08-26 20:39:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:39:49,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186453331] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:39:49,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:39:49,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 22 [2023-08-26 20:39:49,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926575225] [2023-08-26 20:39:49,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:39:49,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-26 20:39:49,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:39:49,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-26 20:39:49,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=415, Unknown=1, NotChecked=42, Total=552 [2023-08-26 20:39:49,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-26 20:39:49,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 367 transitions, 4428 flow. Second operand has 24 states, 24 states have (on average 186.25) internal successors, (4470), 24 states have internal predecessors, (4470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:39:49,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:39:49,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-26 20:39:49,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:39:52,782 INFO L124 PetriNetUnfolderBase]: 7202/14111 cut-off events. [2023-08-26 20:39:52,783 INFO L125 PetriNetUnfolderBase]: For 265403/265605 co-relation queries the response was YES. [2023-08-26 20:39:52,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87446 conditions, 14111 events. 7202/14111 cut-off events. For 265403/265605 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 120024 event pairs, 2598 based on Foata normal form. 168/13080 useless extension candidates. Maximal degree in co-relation 87377. Up to 6127 conditions per place. [2023-08-26 20:39:52,908 INFO L140 encePairwiseOnDemand]: 470/485 looper letters, 427 selfloop transitions, 190 changer transitions 4/627 dead transitions. [2023-08-26 20:39:52,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 627 transitions, 8873 flow [2023-08-26 20:39:52,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-26 20:39:52,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-26 20:39:52,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3527 transitions. [2023-08-26 20:39:52,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40400916380297824 [2023-08-26 20:39:52,912 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3527 transitions. [2023-08-26 20:39:52,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3527 transitions. [2023-08-26 20:39:52,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:39:52,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3527 transitions. [2023-08-26 20:39:52,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 195.94444444444446) internal successors, (3527), 18 states have internal predecessors, (3527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:39:52,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 485.0) internal successors, (9215), 19 states have internal predecessors, (9215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:39:52,923 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 485.0) internal successors, (9215), 19 states have internal predecessors, (9215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:39:52,924 INFO L175 Difference]: Start difference. First operand has 233 places, 367 transitions, 4428 flow. Second operand 18 states and 3527 transitions. [2023-08-26 20:39:52,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 627 transitions, 8873 flow [2023-08-26 20:39:53,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 627 transitions, 8700 flow, removed 68 selfloop flow, removed 11 redundant places. [2023-08-26 20:39:53,139 INFO L231 Difference]: Finished difference. Result has 243 places, 429 transitions, 5697 flow [2023-08-26 20:39:53,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=4189, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=5697, PETRI_PLACES=243, PETRI_TRANSITIONS=429} [2023-08-26 20:39:53,139 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 184 predicate places. [2023-08-26 20:39:53,139 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 429 transitions, 5697 flow [2023-08-26 20:39:53,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 186.25) internal successors, (4470), 24 states have internal predecessors, (4470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:39:53,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:39:53,140 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:39:53,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-26 20:39:53,341 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-26 20:39:53,341 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-26 20:39:53,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:39:53,342 INFO L85 PathProgramCache]: Analyzing trace with hash 652400669, now seen corresponding path program 1 times [2023-08-26 20:39:53,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:39:53,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471812632] [2023-08-26 20:39:53,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:39:53,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:39:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:39:54,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:39:54,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:39:54,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471812632] [2023-08-26 20:39:54,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471812632] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:39:54,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458024335] [2023-08-26 20:39:54,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:39:54,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:39:54,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:39:54,060 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:39:54,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-26 20:39:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:39:54,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 74 conjunts are in the unsatisfiable core [2023-08-26 20:39:54,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:39:54,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:39:54,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:39:54,215 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 20:39:54,215 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-26 20:39:54,230 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 20:39:54,230 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 20:39:54,332 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-26 20:39:54,394 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-08-26 20:39:54,505 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-26 20:39:54,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:39:54,555 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-08-26 20:39:54,608 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-26 20:39:54,694 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-26 20:39:54,795 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-26 20:39:54,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:39:54,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:39:55,030 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1175 (Array Int Int)) (v_ArrVal_1174 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1175) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_1176) .cse1) 2147483647)))) is different from false [2023-08-26 20:39:57,519 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1172 Int) (v_ArrVal_1176 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1175 (Array Int Int)) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1170 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1170) .cse1 v_ArrVal_1172)) |c_~#stored_elements~0.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1175) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1172) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_1176) .cse3) 2147483647))))) is different from false [2023-08-26 20:39:57,556 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1172 Int) (v_ArrVal_1176 Int) (v_ArrVal_1168 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1175 (Array Int Int)) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1170 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_1168)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1170) .cse3 v_ArrVal_1172)) |c_~#stored_elements~0.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1175) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_1176) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1172))))) is different from false [2023-08-26 20:40:01,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-26 20:40:01,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458024335] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:40:01,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:40:01,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2023-08-26 20:40:01,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295366576] [2023-08-26 20:40:01,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:40:01,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-26 20:40:01,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:40:01,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-26 20:40:01,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=544, Unknown=17, NotChecked=162, Total=930 [2023-08-26 20:40:01,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 485 [2023-08-26 20:40:01,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 429 transitions, 5697 flow. Second operand has 31 states, 31 states have (on average 182.83870967741936) internal successors, (5668), 31 states have internal predecessors, (5668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:40:01,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:40:01,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 485 [2023-08-26 20:40:01,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:40:09,746 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1176 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1175 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1175) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_1176) .cse1) 2147483647) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)))) (forall ((v_ArrVal_1176 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_1176) .cse1) 2147483647)))) (forall ((v_ArrVal_1176 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1175 (Array Int Int)) (v_ArrVal_1174 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1175) |c_~#queue~0.base|))) (or (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_1176) .cse1) 2147483647)))))) is different from false [2023-08-26 20:40:10,304 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1176 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1175 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1175) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_1176) .cse1) 2147483647) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)))) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) is different from false [2023-08-26 20:40:16,346 INFO L124 PetriNetUnfolderBase]: 8986/17647 cut-off events. [2023-08-26 20:40:16,347 INFO L125 PetriNetUnfolderBase]: For 341800/342166 co-relation queries the response was YES. [2023-08-26 20:40:16,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111417 conditions, 17647 events. 8986/17647 cut-off events. For 341800/342166 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 155696 event pairs, 3144 based on Foata normal form. 252/16342 useless extension candidates. Maximal degree in co-relation 111343. Up to 7976 conditions per place. [2023-08-26 20:40:16,519 INFO L140 encePairwiseOnDemand]: 464/485 looper letters, 447 selfloop transitions, 256 changer transitions 3/712 dead transitions. [2023-08-26 20:40:16,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 712 transitions, 11307 flow [2023-08-26 20:40:16,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-26 20:40:16,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-26 20:40:16,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 5368 transitions. [2023-08-26 20:40:16,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39528718703976434 [2023-08-26 20:40:16,523 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 5368 transitions. [2023-08-26 20:40:16,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 5368 transitions. [2023-08-26 20:40:16,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:40:16,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 5368 transitions. [2023-08-26 20:40:16,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 191.71428571428572) internal successors, (5368), 28 states have internal predecessors, (5368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:40:16,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 485.0) internal successors, (14065), 29 states have internal predecessors, (14065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:40:16,538 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 485.0) internal successors, (14065), 29 states have internal predecessors, (14065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:40:16,538 INFO L175 Difference]: Start difference. First operand has 243 places, 429 transitions, 5697 flow. Second operand 28 states and 5368 transitions. [2023-08-26 20:40:16,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 712 transitions, 11307 flow [2023-08-26 20:40:16,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 712 transitions, 10965 flow, removed 166 selfloop flow, removed 5 redundant places. [2023-08-26 20:40:16,903 INFO L231 Difference]: Finished difference. Result has 278 places, 514 transitions, 7678 flow [2023-08-26 20:40:16,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=5319, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=7678, PETRI_PLACES=278, PETRI_TRANSITIONS=514} [2023-08-26 20:40:16,903 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 219 predicate places. [2023-08-26 20:40:16,903 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 514 transitions, 7678 flow [2023-08-26 20:40:16,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 182.83870967741936) internal successors, (5668), 31 states have internal predecessors, (5668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:40:16,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:40:16,904 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:40:16,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-26 20:40:17,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:40:17,105 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-26 20:40:17,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:40:17,105 INFO L85 PathProgramCache]: Analyzing trace with hash -604090194, now seen corresponding path program 1 times [2023-08-26 20:40:17,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:40:17,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103893833] [2023-08-26 20:40:17,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:40:17,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:40:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:40:17,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:40:17,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:40:17,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103893833] [2023-08-26 20:40:17,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103893833] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:40:17,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997685505] [2023-08-26 20:40:17,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:40:17,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:40:17,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:40:17,959 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:40:17,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-26 20:40:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:40:18,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 54 conjunts are in the unsatisfiable core [2023-08-26 20:40:18,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:40:18,131 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 20:40:18,131 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-26 20:40:18,284 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-08-26 20:40:18,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:40:18,320 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 24 treesize of output 24 [2023-08-26 20:40:18,387 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-26 20:40:18,387 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2023-08-26 20:40:18,426 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 29 treesize of output 24 [2023-08-26 20:40:18,436 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 24 treesize of output 24 [2023-08-26 20:40:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:40:18,467 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:40:18,524 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 Int) (v_ArrVal_1271 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1270)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1271) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483650))) is different from false [2023-08-26 20:40:18,627 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1268 Int) (v_ArrVal_1271 (Array Int Int))) (< 0 (+ 2147483650 (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1266))) (store .cse0 |c_~#queue~0.base| (store (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1268)) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1270))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1271) |c_~#queue~0.base|) .cse2))))) is different from false [2023-08-26 20:40:18,748 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 20:40:18,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 67 [2023-08-26 20:40:18,759 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 20:40:18,759 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 112 treesize of output 112 [2023-08-26 20:40:18,767 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 55 treesize of output 43 [2023-08-26 20:40:18,773 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 88 treesize of output 80 [2023-08-26 20:40:18,799 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-08-26 20:40:18,823 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 20:40:18,824 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 74 treesize of output 62 [2023-08-26 20:40:18,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-26 20:40:18,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997685505] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:40:18,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:40:18,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 28 [2023-08-26 20:40:18,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254492994] [2023-08-26 20:40:18,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:40:18,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-26 20:40:18,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:40:18,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-26 20:40:18,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=620, Unknown=8, NotChecked=106, Total=870 [2023-08-26 20:40:18,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 485 [2023-08-26 20:40:18,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 514 transitions, 7678 flow. Second operand has 30 states, 30 states have (on average 182.9) internal successors, (5487), 30 states have internal predecessors, (5487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:40:18,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:40:18,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 485 [2023-08-26 20:40:18,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:40:25,118 INFO L124 PetriNetUnfolderBase]: 10650/20840 cut-off events. [2023-08-26 20:40:25,119 INFO L125 PetriNetUnfolderBase]: For 599260/602338 co-relation queries the response was YES. [2023-08-26 20:40:25,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148931 conditions, 20840 events. 10650/20840 cut-off events. For 599260/602338 co-relation queries the response was YES. Maximal size of possible extension queue 778. Compared 181295 event pairs, 3925 based on Foata normal form. 300/19155 useless extension candidates. Maximal degree in co-relation 148846. Up to 8390 conditions per place. [2023-08-26 20:40:25,331 INFO L140 encePairwiseOnDemand]: 466/485 looper letters, 444 selfloop transitions, 217 changer transitions 3/670 dead transitions. [2023-08-26 20:40:25,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 670 transitions, 11218 flow [2023-08-26 20:40:25,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-26 20:40:25,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-26 20:40:25,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3292 transitions. [2023-08-26 20:40:25,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3992722862340813 [2023-08-26 20:40:25,334 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3292 transitions. [2023-08-26 20:40:25,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3292 transitions. [2023-08-26 20:40:25,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:40:25,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3292 transitions. [2023-08-26 20:40:25,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 193.64705882352942) internal successors, (3292), 17 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:40:25,342 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-26 20:40:25,342 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-26 20:40:25,342 INFO L175 Difference]: Start difference. First operand has 278 places, 514 transitions, 7678 flow. Second operand 17 states and 3292 transitions. [2023-08-26 20:40:25,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 670 transitions, 11218 flow [2023-08-26 20:40:25,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 670 transitions, 10611 flow, removed 198 selfloop flow, removed 13 redundant places. [2023-08-26 20:40:25,895 INFO L231 Difference]: Finished difference. Result has 280 places, 525 transitions, 7932 flow [2023-08-26 20:40:25,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=6674, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=7932, PETRI_PLACES=280, PETRI_TRANSITIONS=525} [2023-08-26 20:40:25,896 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 221 predicate places. [2023-08-26 20:40:25,896 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 525 transitions, 7932 flow [2023-08-26 20:40:25,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 182.9) internal successors, (5487), 30 states have internal predecessors, (5487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:40:25,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:40:25,897 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:40:25,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-26 20:40:26,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-08-26 20:40:26,097 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-26 20:40:26,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:40:26,098 INFO L85 PathProgramCache]: Analyzing trace with hash 923823037, now seen corresponding path program 1 times [2023-08-26 20:40:26,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:40:26,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936672663] [2023-08-26 20:40:26,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:40:26,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:40:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:40:26,158 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-26 20:40:26,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:40:26,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936672663] [2023-08-26 20:40:26,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936672663] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:40:26,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:40:26,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 20:40:26,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060472403] [2023-08-26 20:40:26,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:40:26,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:40:26,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:40:26,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:40:26,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:40:26,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-26 20:40:26,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 525 transitions, 7932 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-26 20:40:26,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:40:26,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-26 20:40:26,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:40:30,807 INFO L124 PetriNetUnfolderBase]: 10342/20409 cut-off events. [2023-08-26 20:40:30,807 INFO L125 PetriNetUnfolderBase]: For 598314/600624 co-relation queries the response was YES. [2023-08-26 20:40:30,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145018 conditions, 20409 events. 10342/20409 cut-off events. For 598314/600624 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 178719 event pairs, 6356 based on Foata normal form. 86/18699 useless extension candidates. Maximal degree in co-relation 144930. Up to 19027 conditions per place. [2023-08-26 20:40:31,034 INFO L140 encePairwiseOnDemand]: 483/485 looper letters, 463 selfloop transitions, 1 changer transitions 3/513 dead transitions. [2023-08-26 20:40:31,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 513 transitions, 8735 flow [2023-08-26 20:40:31,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:40:31,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:40:31,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2023-08-26 20:40:31,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079037800687285 [2023-08-26 20:40:31,036 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 739 transitions. [2023-08-26 20:40:31,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 739 transitions. [2023-08-26 20:40:31,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:40:31,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 739 transitions. [2023-08-26 20:40:31,037 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-26 20:40:31,038 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-26 20:40:31,038 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-26 20:40:31,038 INFO L175 Difference]: Start difference. First operand has 280 places, 525 transitions, 7932 flow. Second operand 3 states and 739 transitions. [2023-08-26 20:40:31,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 513 transitions, 8735 flow [2023-08-26 20:40:31,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 513 transitions, 8387 flow, removed 139 selfloop flow, removed 9 redundant places. [2023-08-26 20:40:31,707 INFO L231 Difference]: Finished difference. Result has 272 places, 505 transitions, 7317 flow [2023-08-26 20:40:31,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=7315, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=7317, PETRI_PLACES=272, PETRI_TRANSITIONS=505} [2023-08-26 20:40:31,707 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 213 predicate places. [2023-08-26 20:40:31,707 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 505 transitions, 7317 flow [2023-08-26 20:40:31,707 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-26 20:40:31,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:40:31,708 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:40:31,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 20:40:31,708 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-26 20:40:31,708 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:40:31,708 INFO L85 PathProgramCache]: Analyzing trace with hash 923823039, now seen corresponding path program 1 times [2023-08-26 20:40:31,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:40:31,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879201698] [2023-08-26 20:40:31,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:40:31,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:40:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:40:31,743 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-26 20:40:31,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:40:31,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879201698] [2023-08-26 20:40:31,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879201698] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:40:31,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:40:31,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 20:40:31,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477863985] [2023-08-26 20:40:31,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:40:31,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:40:31,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:40:31,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:40:31,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:40:31,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-26 20:40:31,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 505 transitions, 7317 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-26 20:40:31,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:40:31,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-26 20:40:31,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:40:35,738 INFO L124 PetriNetUnfolderBase]: 10096/20053 cut-off events. [2023-08-26 20:40:35,739 INFO L125 PetriNetUnfolderBase]: For 509362/512821 co-relation queries the response was YES. [2023-08-26 20:40:35,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134386 conditions, 20053 events. 10096/20053 cut-off events. For 509362/512821 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 176330 event pairs, 6211 based on Foata normal form. 157/18481 useless extension candidates. Maximal degree in co-relation 134301. Up to 14368 conditions per place. [2023-08-26 20:40:35,970 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 383 selfloop transitions, 62 changer transitions 0/491 dead transitions. [2023-08-26 20:40:35,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 491 transitions, 8084 flow [2023-08-26 20:40:35,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:40:35,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:40:35,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2023-08-26 20:40:35,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5058419243986254 [2023-08-26 20:40:35,972 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 736 transitions. [2023-08-26 20:40:35,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 736 transitions. [2023-08-26 20:40:35,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:40:35,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 736 transitions. [2023-08-26 20:40:35,974 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-26 20:40:35,975 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-26 20:40:35,975 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-26 20:40:35,975 INFO L175 Difference]: Start difference. First operand has 272 places, 505 transitions, 7317 flow. Second operand 3 states and 736 transitions. [2023-08-26 20:40:35,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 491 transitions, 8084 flow [2023-08-26 20:40:36,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 491 transitions, 8054 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-26 20:40:36,512 INFO L231 Difference]: Finished difference. Result has 270 places, 484 transitions, 7127 flow [2023-08-26 20:40:36,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=7003, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=7127, PETRI_PLACES=270, PETRI_TRANSITIONS=484} [2023-08-26 20:40:36,512 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 211 predicate places. [2023-08-26 20:40:36,513 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 484 transitions, 7127 flow [2023-08-26 20:40:36,513 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-26 20:40:36,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:40:36,513 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-26 20:40:36,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 20:40:36,513 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-26 20:40:36,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:40:36,514 INFO L85 PathProgramCache]: Analyzing trace with hash -286124216, now seen corresponding path program 1 times [2023-08-26 20:40:36,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:40:36,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791634443] [2023-08-26 20:40:36,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:40:36,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:40:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:40:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:40:36,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:40:36,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791634443] [2023-08-26 20:40:36,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791634443] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:40:36,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720371660] [2023-08-26 20:40:36,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:40:36,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:40:36,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:40:36,561 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:40:36,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-26 20:40:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:40:36,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 20:40:36,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:40:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:40:36,752 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:40:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:40:36,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720371660] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:40:36,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:40:36,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-26 20:40:36,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743330610] [2023-08-26 20:40:36,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:40:36,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 20:40:36,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:40:36,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 20:40:36,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 20:40:36,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-26 20:40:36,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 484 transitions, 7127 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-26 20:40:36,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:40:36,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-26 20:40:36,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:40:39,776 INFO L124 PetriNetUnfolderBase]: 6779/13357 cut-off events. [2023-08-26 20:40:39,777 INFO L125 PetriNetUnfolderBase]: For 401942/404875 co-relation queries the response was YES. [2023-08-26 20:40:39,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106570 conditions, 13357 events. 6779/13357 cut-off events. For 401942/404875 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 100680 event pairs, 3588 based on Foata normal form. 287/12694 useless extension candidates. Maximal degree in co-relation 106487. Up to 6832 conditions per place. [2023-08-26 20:40:39,902 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 441 selfloop transitions, 39 changer transitions 0/526 dead transitions. [2023-08-26 20:40:39,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 526 transitions, 8877 flow [2023-08-26 20:40:39,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 20:40:39,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 20:40:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1460 transitions. [2023-08-26 20:40:39,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5017182130584192 [2023-08-26 20:40:39,904 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1460 transitions. [2023-08-26 20:40:39,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1460 transitions. [2023-08-26 20:40:39,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:40:39,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1460 transitions. [2023-08-26 20:40:39,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 243.33333333333334) internal successors, (1460), 6 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:40:39,908 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-26 20:40:39,908 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-26 20:40:39,908 INFO L175 Difference]: Start difference. First operand has 270 places, 484 transitions, 7127 flow. Second operand 6 states and 1460 transitions. [2023-08-26 20:40:39,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 526 transitions, 8877 flow [2023-08-26 20:40:40,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 526 transitions, 8749 flow, removed 28 selfloop flow, removed 1 redundant places. [2023-08-26 20:40:40,253 INFO L231 Difference]: Finished difference. Result has 278 places, 471 transitions, 6891 flow [2023-08-26 20:40:40,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=6563, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6891, PETRI_PLACES=278, PETRI_TRANSITIONS=471} [2023-08-26 20:40:40,253 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 219 predicate places. [2023-08-26 20:40:40,253 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 471 transitions, 6891 flow [2023-08-26 20:40:40,254 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-26 20:40:40,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:40:40,254 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:40:40,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-26 20:40:40,454 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-26 20:40:40,454 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-26 20:40:40,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:40:40,455 INFO L85 PathProgramCache]: Analyzing trace with hash 339738295, now seen corresponding path program 1 times [2023-08-26 20:40:40,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:40:40,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631149363] [2023-08-26 20:40:40,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:40:40,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:40:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:40:41,844 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-26 20:40:41,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:40:41,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631149363] [2023-08-26 20:40:41,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631149363] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:40:41,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805822601] [2023-08-26 20:40:41,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:40:41,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:40:41,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:40:41,845 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:40:41,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-26 20:40:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:40:41,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 96 conjunts are in the unsatisfiable core [2023-08-26 20:40:42,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:40:42,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:40:42,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:40:42,021 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 20:40:42,022 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-26 20:40:42,036 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 20:40:42,036 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 20:40:42,130 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-26 20:40:42,230 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-08-26 20:40:42,363 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-08-26 20:40:42,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:40:42,442 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-26 20:40:42,572 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-08-26 20:40:42,884 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-26 20:40:43,200 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2023-08-26 20:40:43,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:40:43,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-26 20:40:45,050 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 51 treesize of output 51 [2023-08-26 20:40:45,174 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 51 treesize of output 46 [2023-08-26 20:40:52,398 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-26 20:40:52,398 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:40:52,446 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1565 Int)) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1563) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1565) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) is different from false [2023-08-26 20:40:52,453 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1565 Int)) (or (< (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1563) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1565) (+ 3208 |c_~#queue~0.offset|)) 2147483647))) is different from false [2023-08-26 20:40:52,461 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1562))) (or (< (select (select .cse0 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1563) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1565) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-26 20:40:52,578 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1561 Int) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1561)) |c_~#stored_elements~0.base| v_ArrVal_1562))) (or (< (select (select .cse0 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1561) (< (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1563) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1565) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-08-26 20:40:52,694 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1561 Int) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1559 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_1559) .cse1 v_ArrVal_1561)) |c_~#stored_elements~0.base| v_ArrVal_1562))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1561) (< (select (store (select (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1563) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1565) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select (select .cse2 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1559))))) is different from false [2023-08-26 20:40:54,838 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1561 Int) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1557 Int) (v_ArrVal_1559 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1557)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1559) .cse2 v_ArrVal_1561)) |c_~#stored_elements~0.base| v_ArrVal_1562))) (or (< (+ 1 (select .cse0 .cse1)) v_ArrVal_1559) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1561) (< (select (select .cse3 |c_~#queue~0.base|) .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (select (store (select (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1563) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1565) .cse1) 2147483647) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|)))))) is different from false [2023-08-26 20:40:54,973 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1561 Int) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1553 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1557 Int) (v_ArrVal_1559 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1553)) |c_~#stored_elements~0.base| v_ArrVal_1555))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1557)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1559) .cse1 v_ArrVal_1561)) |c_~#stored_elements~0.base| v_ArrVal_1562))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select (select .cse2 |c_~#queue~0.base|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1561) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1553) (< (select (store (select (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1563) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1565) .cse4) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1559))))))) is different from false [2023-08-26 20:40:55,257 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1561 Int) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1551 Int) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1553 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1557 Int) (v_ArrVal_1559 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1551) .cse3 v_ArrVal_1553)) |c_~#stored_elements~0.base| v_ArrVal_1555))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1557)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_1559) .cse1 v_ArrVal_1561)) |c_~#stored_elements~0.base| v_ArrVal_1562))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1553) (< (select (store (select (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1563) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1565) .cse5) 2147483647) (< (select (select .cse4 |c_~#queue~0.base|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1551) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1561) (< (+ (select .cse6 .cse5) 1) v_ArrVal_1559)))))))) is different from false [2023-08-26 20:40:55,543 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1550 Int) (v_ArrVal_1561 Int) (v_ArrVal_1551 Int) (v_ArrVal_1565 Int) (v_ArrVal_1553 Int) (v_ArrVal_1557 Int) (v_ArrVal_1559 Int)) (let ((.cse4 (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_1550)) (.cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 .cse7 v_ArrVal_1551) .cse5 v_ArrVal_1553)) |c_~#stored_elements~0.base| v_ArrVal_1555))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1557)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1559) .cse1 v_ArrVal_1561)) |c_~#stored_elements~0.base| v_ArrVal_1562))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1559) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1561) (< (+ 1 (select .cse4 .cse5)) v_ArrVal_1553) (< (select (store (select (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1563) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1565) .cse3) 2147483647) (< (+ (select .cse4 .cse7) 1) v_ArrVal_1551) (< (select (select .cse6 |c_~#queue~0.base|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|)))))))) is different from false [2023-08-26 20:41:01,893 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2023-08-26 20:41:01,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805822601] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:41:01,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:41:01,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 52 [2023-08-26 20:41:01,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090042092] [2023-08-26 20:41:01,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:41:01,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-08-26 20:41:01,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:41:01,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-08-26 20:41:01,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=1484, Unknown=72, NotChecked=846, Total=2862 [2023-08-26 20:41:01,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-26 20:41:01,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 471 transitions, 6891 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-26 20:41:01,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:41:01,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-26 20:41:01,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:41:25,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:41:28,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:41:32,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:41:34,533 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-26 20:41:36,540 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-26 20:41:38,548 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-26 20:41:40,554 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-26 20:41:42,562 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-26 20:41:44,569 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-26 20:41:46,577 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-26 20:41:48,583 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-26 20:41:50,592 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-26 20:41:52,601 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-26 20:41:54,608 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-26 20:41:56,615 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-26 20:41:58,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:42:06,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:42:08,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 [0] [2023-08-26 20:42:15,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] [2023-08-26 20:42:29,170 WARN L234 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 116 DAG size of output: 70 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 20:42:49,338 WARN L234 SmtUtils]: Spent 14.23s on a formula simplification. DAG size of input: 130 DAG size of output: 99 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 20:42:51,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:42:55,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:43:05,177 WARN L234 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 136 DAG size of output: 131 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 20:43:07,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:43:21,745 WARN L234 SmtUtils]: Spent 10.23s on a formula simplification. DAG size of input: 109 DAG size of output: 102 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 20:43:23,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] [2023-08-26 20:43:25,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:43:36,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:43:38,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 [0, 1] [2023-08-26 20:43:38,351 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse0 (+ (select .cse7 .cse8) 1)) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1561 Int) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1553 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1557 Int) (v_ArrVal_1559 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1553)) |c_~#stored_elements~0.base| v_ArrVal_1555))) (let ((.cse1 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1557))) (let ((.cse3 (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1559) .cse2 v_ArrVal_1561)) |c_~#stored_elements~0.base| v_ArrVal_1562))) (or (< .cse0 v_ArrVal_1553) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select (select .cse3 |c_~#queue~0.base|) .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (+ (select .cse4 .cse2) 1) v_ArrVal_1561) (< (select (store (select (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1563) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1565) .cse5) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1559))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1561 Int) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1559 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1559) .cse8 v_ArrVal_1561)) |c_~#stored_elements~0.base| v_ArrVal_1562))) (or (< .cse0 v_ArrVal_1561) (< (select (store (select (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1563) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1565) .cse5) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1559) (< (select (select .cse9 |c_~#queue~0.base|) .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1561 Int) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1561)) |c_~#stored_elements~0.base| v_ArrVal_1562))) (or (< (select (select .cse10 |c_~#queue~0.base|) .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< .cse0 v_ArrVal_1561) (< (select (store (select (store .cse10 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1563) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1565) .cse5) 2147483647))))))) is different from false [2023-08-26 20:43:47,037 WARN L234 SmtUtils]: Spent 6.52s on a formula simplification. DAG size of input: 102 DAG size of output: 97 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 20:43:49,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:43:52,058 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)) (.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1561 Int) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1553 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1557 Int) (v_ArrVal_1559 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1553)) |c_~#stored_elements~0.base| v_ArrVal_1555))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1557))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1559) .cse3 v_ArrVal_1561)) |c_~#stored_elements~0.base| v_ArrVal_1562))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1553) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select (select .cse4 |c_~#queue~0.base|) .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1561) (< (select (store (select (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1563) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1565) .cse6) 2147483647) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1559))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1561 Int) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1561)) |c_~#stored_elements~0.base| v_ArrVal_1562))) (or (< (select (select .cse8 |c_~#queue~0.base|) .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< .cse9 v_ArrVal_1561) (< (select (store (select (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1563) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1565) .cse6) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1561 Int) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1553 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1557 Int) (v_ArrVal_1559 Int)) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1553)) |c_~#stored_elements~0.base| v_ArrVal_1555))) (let ((.cse10 (select .cse13 |c_~#queue~0.base|))) (let ((.cse12 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1557))) (let ((.cse11 (store (store .cse13 |c_~#queue~0.base| (store (store .cse12 .cse6 v_ArrVal_1559) .cse3 v_ArrVal_1561)) |c_~#stored_elements~0.base| v_ArrVal_1562))) (or (< (select .cse10 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select (select .cse11 |c_~#queue~0.base|) .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (+ (select .cse12 .cse3) 1) v_ArrVal_1561) (< .cse9 v_ArrVal_1553) (< (select (store (select (store .cse11 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1563) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1565) .cse6) 2147483647) (< (+ (select .cse12 .cse6) 1) v_ArrVal_1559))))))))) is different from false [2023-08-26 20:43:52,149 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1561 Int) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1559 Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_1559) .cse1 v_ArrVal_1561)) |c_~#stored_elements~0.base| v_ArrVal_1562))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1561) (< (select (store (select (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1563) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1565) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1559) (< (select (select .cse2 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|))))) (< (select .cse0 .cse3) 2147483647))) is different from false [2023-08-26 20:43:53,410 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1561 Int) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1553 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1557 Int) (v_ArrVal_1559 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1553)) |c_~#stored_elements~0.base| v_ArrVal_1555))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1557))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1559) .cse3 v_ArrVal_1561)) |c_~#stored_elements~0.base| v_ArrVal_1562))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1553) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select (select .cse4 |c_~#queue~0.base|) .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1561) (< (select (store (select (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1563) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1565) .cse6) 2147483647) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1559))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1561 Int) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1553 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1557 Int) (v_ArrVal_1559 Int)) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1553)) |c_~#stored_elements~0.base| v_ArrVal_1555))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse10 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1557))) (let ((.cse9 (store (store .cse11 |c_~#queue~0.base| (store (store .cse10 .cse6 v_ArrVal_1559) .cse3 v_ArrVal_1561)) |c_~#stored_elements~0.base| v_ArrVal_1562))) (or (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select (select .cse9 |c_~#queue~0.base|) .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (+ (select .cse10 .cse3) 1) v_ArrVal_1561) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1553) (< (select (store (select (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1563) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1565) .cse6) 2147483647) (< (+ (select .cse10 .cse6) 1) v_ArrVal_1559))))))))) is different from false [2023-08-26 20:43:53,603 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select .cse5 .cse2)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1561 Int) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1557 Int) (v_ArrVal_1559 Int)) (let ((.cse0 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1557))) (let ((.cse3 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1559) .cse2 v_ArrVal_1561)) |c_~#stored_elements~0.base| v_ArrVal_1562))) (or (< (+ 1 (select .cse0 .cse1)) v_ArrVal_1559) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1561) (< (select (select .cse3 |c_~#queue~0.base|) .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (select (store (select (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1563) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1565) .cse1) 2147483647) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1565 Int)) (or (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1563) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1565) .cse1) 2147483647)))))) is different from false [2023-08-26 20:43:54,134 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1561 Int) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1557 Int) (v_ArrVal_1559 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse4 v_ArrVal_1557)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_1559) .cse1 v_ArrVal_1561)) |c_~#stored_elements~0.base| v_ArrVal_1562))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1561) (< (select (select .cse2 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1559) (< (select (store (select (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1563) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1565) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) (forall ((v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1565 Int)) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1563) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse4 v_ArrVal_1565) .cse3) 2147483647)))) is different from false [2023-08-26 20:43:57,559 INFO L124 PetriNetUnfolderBase]: 7895/15585 cut-off events. [2023-08-26 20:43:57,559 INFO L125 PetriNetUnfolderBase]: For 479076/481687 co-relation queries the response was YES. [2023-08-26 20:43:57,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133232 conditions, 15585 events. 7895/15585 cut-off events. For 479076/481687 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 119332 event pairs, 3675 based on Foata normal form. 131/14800 useless extension candidates. Maximal degree in co-relation 133145. Up to 9368 conditions per place. [2023-08-26 20:43:57,929 INFO L140 encePairwiseOnDemand]: 467/485 looper letters, 318 selfloop transitions, 499 changer transitions 3/826 dead transitions. [2023-08-26 20:43:57,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 826 transitions, 17167 flow [2023-08-26 20:43:57,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-08-26 20:43:57,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2023-08-26 20:43:57,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 10167 transitions. [2023-08-26 20:43:57,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37433726067746687 [2023-08-26 20:43:57,939 INFO L72 ComplementDD]: Start complementDD. Operand 56 states and 10167 transitions. [2023-08-26 20:43:57,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 10167 transitions. [2023-08-26 20:43:57,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:43:57,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 10167 transitions. [2023-08-26 20:43:57,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 57 states, 56 states have (on average 181.55357142857142) internal successors, (10167), 56 states have internal predecessors, (10167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:43:57,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 57 states, 57 states have (on average 485.0) internal successors, (27645), 57 states have internal predecessors, (27645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:43:57,971 INFO L81 ComplementDD]: Finished complementDD. Result has 57 states, 57 states have (on average 485.0) internal successors, (27645), 57 states have internal predecessors, (27645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:43:57,971 INFO L175 Difference]: Start difference. First operand has 278 places, 471 transitions, 6891 flow. Second operand 56 states and 10167 transitions. [2023-08-26 20:43:57,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 826 transitions, 17167 flow [2023-08-26 20:43:58,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 826 transitions, 17101 flow, removed 30 selfloop flow, removed 1 redundant places. [2023-08-26 20:43:58,364 INFO L231 Difference]: Finished difference. Result has 361 places, 705 transitions, 13944 flow [2023-08-26 20:43:58,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=6835, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=289, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=13944, PETRI_PLACES=361, PETRI_TRANSITIONS=705} [2023-08-26 20:43:58,364 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 302 predicate places. [2023-08-26 20:43:58,365 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 705 transitions, 13944 flow [2023-08-26 20:43:58,366 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-26 20:43:58,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:43:58,366 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 20:43:58,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-26 20:43:58,566 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-26 20:43:58,566 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-26 20:43:58,567 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:43:58,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1660887662, now seen corresponding path program 4 times [2023-08-26 20:43:58,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:43:58,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311079207] [2023-08-26 20:43:58,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:43:58,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:43:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:43:59,853 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-26 20:43:59,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:43:59,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311079207] [2023-08-26 20:43:59,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311079207] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:43:59,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497947504] [2023-08-26 20:43:59,854 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 20:43:59,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:43:59,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:43:59,855 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:43:59,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-26 20:44:00,006 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 20:44:00,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 20:44:00,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 96 conjunts are in the unsatisfiable core [2023-08-26 20:44:00,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:44:00,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:44:00,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:44:00,039 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 20:44:00,039 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-26 20:44:00,054 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 20:44:00,054 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 20:44:00,160 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-26 20:44:00,253 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-08-26 20:44:00,372 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-26 20:44:00,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:44:00,433 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-26 20:44:00,524 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-08-26 20:44:01,496 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-26 20:44:01,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 41 treesize of output 43 [2023-08-26 20:44:01,941 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-26 20:44:02,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:44:02,398 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-26 20:44:02,790 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-26 20:44:12,906 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-26 20:44:12,907 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:44:12,990 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1691 Int) (v_ArrVal_1689 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1689) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1691) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|)))) is different from false [2023-08-26 20:44:13,006 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1691 Int) (v_ArrVal_1689 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1688 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1688)) |c_~#stored_elements~0.base| v_ArrVal_1689) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1691) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1688)))) is different from false [2023-08-26 20:44:13,252 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1691 Int) (v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1686 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1688 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1686))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1688)) |c_~#stored_elements~0.base| v_ArrVal_1689) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1691) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1688)))))) is different from false [2023-08-26 20:44:13,294 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1691 Int) (v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1684 Int) (v_ArrVal_1686 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1688 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1684)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1686))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1688)) |c_~#stored_elements~0.base| v_ArrVal_1689) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1684) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1688) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1691) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2023-08-26 20:44:13,316 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1691 Int) (v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1684 Int) (v_ArrVal_1686 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1688 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1684)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1686))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1688)) |c_~#stored_elements~0.base| v_ArrVal_1689) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1684) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1688) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1691) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2023-08-26 20:44:13,338 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1691 Int) (v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1682 Int) (v_ArrVal_1684 Int) (v_ArrVal_1686 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1688 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_1682)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1684)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1686))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1688)) |c_~#stored_elements~0.base| v_ArrVal_1689) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1688) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1684) (< (select .cse4 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1691) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2023-08-26 20:44:13,360 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1691 Int) (v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1682 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1684 Int) (v_ArrVal_1686 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1688 Int)) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1682)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1684)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1686))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1688)) |c_~#stored_elements~0.base| v_ArrVal_1689) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1684) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1688) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1691) .cse1) 2147483647)))))))) is different from false [2023-08-26 20:44:13,388 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1691 Int) (v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1682 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1684 Int) (v_ArrVal_1686 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1688 Int) (v_ArrVal_1681 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1681))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1682)) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse3 .cse4 v_ArrVal_1684)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1686))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1688)) |c_~#stored_elements~0.base| v_ArrVal_1689) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1688) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1684) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1691) .cse4) 2147483647))))))))) is different from false [2023-08-26 20:44:13,419 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1680 Int) (v_ArrVal_1691 Int) (v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1682 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1684 Int) (v_ArrVal_1686 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1688 Int) (v_ArrVal_1681 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1680)) |c_~#stored_elements~0.base| v_ArrVal_1681))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1682)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse5 .cse1 v_ArrVal_1684)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1686))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store .cse3 .cse2 v_ArrVal_1688)) |c_~#stored_elements~0.base| v_ArrVal_1689) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1691) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1688) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1680) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1684))))))))) is different from false [2023-08-26 20:44:13,459 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1680 Int) (v_ArrVal_1691 Int) (v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1682 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1684 Int) (v_ArrVal_1686 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1688 Int) (v_ArrVal_1681 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1680)) |c_~#stored_elements~0.base| v_ArrVal_1681))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1682)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse7 .cse3 v_ArrVal_1684)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1686))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store .cse5 .cse4 v_ArrVal_1688)) |c_~#stored_elements~0.base| v_ArrVal_1689) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1680) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1691) .cse3) 2147483647) (< (select .cse2 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1688) (< (select .cse6 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|) (< (+ (select .cse7 .cse3) 1) v_ArrVal_1684)))))))))) is different from false [2023-08-26 20:44:13,534 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1680 Int) (v_ArrVal_1691 Int) (v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1682 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1684 Int) (v_ArrVal_1686 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1688 Int) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1678 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1678) .cse5 v_ArrVal_1680)) |c_~#stored_elements~0.base| v_ArrVal_1681))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1682)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1684)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1686))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store .cse6 .cse1 v_ArrVal_1688)) |c_~#stored_elements~0.base| v_ArrVal_1689) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1684) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1678) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1680) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1688) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1691) .cse3) 2147483647)))))))))) is different from false [2023-08-26 20:44:13,586 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1680 Int) (v_ArrVal_1691 Int) (v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1682 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1684 Int) (v_ArrVal_1686 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1688 Int) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1678 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 .cse7 v_ArrVal_1678) .cse5 v_ArrVal_1680)) |c_~#stored_elements~0.base| v_ArrVal_1681))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1682)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1684)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1686))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store .cse6 .cse1 v_ArrVal_1688)) |c_~#stored_elements~0.base| v_ArrVal_1689) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1684) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1680) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1688) (< (+ (select .cse4 .cse7) 1) v_ArrVal_1678) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1691) .cse3) 2147483647)))))))))) is different from false [2023-08-26 20:44:13,633 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1686 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1680 Int) (v_ArrVal_1691 Int) (v_ArrVal_1682 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1684 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1675 Int) (v_ArrVal_1688 Int) (v_ArrVal_1678 Int)) (let ((.cse4 (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_1675)) (.cse8 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 .cse8 v_ArrVal_1678) .cse5 v_ArrVal_1680)) |c_~#stored_elements~0.base| v_ArrVal_1681))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1682)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1684)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1686))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (select (store (store .cse9 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1688)) |c_~#stored_elements~0.base| v_ArrVal_1689) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1688) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1684) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1680) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1691) .cse3) 2147483647) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|) (< (+ (select .cse4 .cse8) 1) v_ArrVal_1678) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|)))))))))) is different from false [2023-08-26 20:44:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2023-08-26 20:44:18,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497947504] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:44:18,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:44:18,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 52 [2023-08-26 20:44:18,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530914951] [2023-08-26 20:44:18,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:44:18,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-08-26 20:44:18,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:44:18,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-08-26 20:44:18,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=1212, Unknown=20, NotChecked=1170, Total=2862 [2023-08-26 20:44:18,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-26 20:44:18,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 705 transitions, 13944 flow. Second operand has 54 states, 54 states have (on average 176.33333333333334) internal successors, (9522), 54 states have internal predecessors, (9522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:44:18,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:44:18,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-26 20:44:18,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:44:26,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:44:28,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:44:30,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:44:47,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:45:08,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:45:10,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:45:29,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:45:48,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:45:50,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:45:57,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-26 20:45:59,907 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-26 20:46:01,916 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-26 20:46:03,928 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-26 20:46:05,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 [0, 1] [2023-08-26 20:46:07,956 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-26 20:46:09,964 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-26 20:46:19,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:46:25,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:46:27,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:46:41,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:46:43,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:46:45,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:46:47,362 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-26 20:46:49,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:46:51,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:46:53,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:47:08,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:47:18,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:47:20,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:47:22,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:47:24,989 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-26 20:47:26,998 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-26 20:47:29,006 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-26 20:47:31,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:47:33,036 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-26 20:47:52,022 WARN L234 SmtUtils]: Spent 6.34s on a formula simplification. DAG size of input: 170 DAG size of output: 116 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 20:47:54,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:48:10,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:48:28,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:48:43,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:48:45,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:48:47,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:48:49,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:48:51,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:49:12,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:49:14,653 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-26 20:49:16,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:49:18,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:49:20,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:49:40,365 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1691 Int) (v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1686 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1688 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1686))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1688)) |c_~#stored_elements~0.base| v_ArrVal_1689) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1691) .cse2) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1688)))))) (forall ((v_ArrVal_1680 Int) (v_ArrVal_1691 Int) (v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1682 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1684 Int) (v_ArrVal_1686 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1688 Int) (v_ArrVal_1681 (Array Int Int))) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse4 v_ArrVal_1680)) |c_~#stored_elements~0.base| v_ArrVal_1681))) (let ((.cse9 (select .cse12 |c_~#queue~0.base|))) (let ((.cse10 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_1682))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store .cse10 .cse2 v_ArrVal_1684)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1686))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse7 (select (store (store .cse11 |c_~#queue~0.base| (store .cse8 .cse1 v_ArrVal_1688)) |c_~#stored_elements~0.base| v_ArrVal_1689) |c_~#queue~0.base|))) (or (< (+ (select .cse6 .cse4) 1) v_ArrVal_1680) (< (select (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1691) .cse2) 2147483647) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (+ (select .cse8 .cse1) 1) v_ArrVal_1688) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104|) (< (+ (select .cse10 .cse2) 1) v_ArrVal_1684)))))))))))) is different from false [2023-08-26 20:49:42,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:49:44,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:49:52,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:49:54,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:49:56,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:49:58,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:50:22,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 20:50:24,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:50:26,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:50:28,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:50:30,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:50:32,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 20:50:35,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] Received shutdown request... [2023-08-26 20:50:35,672 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 20:50:35,672 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 20:50:36,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-26 20:50:36,873 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-26 20:50:36,903 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 29 remaining) [2023-08-26 20:50:36,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-26 20:50:36,903 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-26 20:50:36,904 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (27 of 29 remaining) [2023-08-26 20:50:36,904 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 29 remaining) [2023-08-26 20:50:36,904 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 29 remaining) [2023-08-26 20:50:36,904 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 29 remaining) [2023-08-26 20:50:36,907 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 29 remaining) [2023-08-26 20:50:36,907 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 29 remaining) [2023-08-26 20:50:36,907 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 29 remaining) [2023-08-26 20:50:36,907 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 29 remaining) [2023-08-26 20:50:36,907 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 29 remaining) [2023-08-26 20:50:36,907 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 29 remaining) [2023-08-26 20:50:36,907 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 29 remaining) [2023-08-26 20:50:36,907 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 29 remaining) [2023-08-26 20:50:36,907 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 29 remaining) [2023-08-26 20:50:36,907 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 29 remaining) [2023-08-26 20:50:36,908 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 29 remaining) [2023-08-26 20:50:36,908 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4ASSERT_VIOLATIONASSERT (12 of 29 remaining) [2023-08-26 20:50:36,908 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 29 remaining) [2023-08-26 20:50:36,908 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 29 remaining) [2023-08-26 20:50:36,908 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 29 remaining) [2023-08-26 20:50:36,908 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 29 remaining) [2023-08-26 20:50:36,908 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 29 remaining) [2023-08-26 20:50:36,908 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 29 remaining) [2023-08-26 20:50:36,908 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 29 remaining) [2023-08-26 20:50:36,908 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 29 remaining) [2023-08-26 20:50:36,908 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 29 remaining) [2023-08-26 20:50:36,909 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 29 remaining) [2023-08-26 20:50:36,909 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 29 remaining) [2023-08-26 20:50:36,909 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4ASSERT_VIOLATIONASSERT (0 of 29 remaining) [2023-08-26 20:50:36,909 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:50:36,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-26 20:50:36,917 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 20:50:36,917 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 20:50:36,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 08:50:36 BasicIcfg [2023-08-26 20:50:36,919 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 20:50:36,919 INFO L158 Benchmark]: Toolchain (without parser) took 842443.62ms. Allocated memory was 358.6MB in the beginning and 10.9GB in the end (delta: 10.5GB). Free memory was 333.4MB in the beginning and 8.4GB in the end (delta: -8.1GB). Peak memory consumption was 2.4GB. Max. memory is 16.0GB. [2023-08-26 20:50:36,919 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 358.6MB. Free memory is still 335.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 20:50:36,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.42ms. Allocated memory is still 358.6MB. Free memory was 333.4MB in the beginning and 303.6MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-26 20:50:36,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.22ms. Allocated memory is still 358.6MB. Free memory was 303.6MB in the beginning and 300.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 20:50:36,920 INFO L158 Benchmark]: Boogie Preprocessor took 29.76ms. Allocated memory is still 358.6MB. Free memory was 300.4MB in the beginning and 298.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 20:50:36,920 INFO L158 Benchmark]: RCFGBuilder took 546.05ms. Allocated memory is still 358.6MB. Free memory was 298.4MB in the beginning and 325.9MB in the end (delta: -27.5MB). Peak memory consumption was 20.7MB. Max. memory is 16.0GB. [2023-08-26 20:50:36,920 INFO L158 Benchmark]: TraceAbstraction took 841252.00ms. Allocated memory was 358.6MB in the beginning and 10.9GB in the end (delta: 10.5GB). Free memory was 324.9MB in the beginning and 8.4GB in the end (delta: -8.1GB). Peak memory consumption was 2.4GB. Max. memory is 16.0GB. [2023-08-26 20:50:36,921 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.13ms. Allocated memory is still 358.6MB. Free memory is still 335.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 565.42ms. Allocated memory is still 358.6MB. Free memory was 333.4MB in the beginning and 303.6MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 44.22ms. Allocated memory is still 358.6MB. Free memory was 303.6MB in the beginning and 300.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.76ms. Allocated memory is still 358.6MB. Free memory was 300.4MB in the beginning and 298.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 546.05ms. Allocated memory is still 358.6MB. Free memory was 298.4MB in the beginning and 325.9MB in the end (delta: -27.5MB). Peak memory consumption was 20.7MB. Max. memory is 16.0GB. * TraceAbstraction took 841252.00ms. Allocated memory was 358.6MB in the beginning and 10.9GB in the end (delta: 10.5GB). Free memory was 324.9MB in the beginning and 8.4GB in the end (delta: -8.1GB). Peak memory consumption was 2.4GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 750]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [750] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 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 executing Executor. - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - 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 executing Executor. - 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 executing Executor. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - 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: 841.1s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 705.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 1129 mSolverCounterUnknown, 5384 SdHoareTripleChecker+Valid, 250.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5384 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 248.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 15878 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 980 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14269 IncrementalHoareTripleChecker+Invalid, 32257 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 980 mSolverCounterUnsat, 2 mSDtfsCounter, 14269 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1129 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 908 GetRequests, 228 SyntacticMatches, 61 SemanticMatches, 619 ConstructedPredicates, 57 IntricatePredicates, 14 DeprecatedPredicates, 9929 ImplicationChecksByTransitivity, 516.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13944occurred in iteration=25, InterpolantAutomatonStates: 318, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 123.2s InterpolantComputationTime, 617 NumberOfCodeBlocks, 617 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 805 ConstructedInterpolants, 258 QuantifiedInterpolants, 38558 SizeOfPredicates, 230 NumberOfNonLiveVariables, 3372 ConjunctsInSsa, 823 ConjunctsInUnsatCore, 52 InterpolantComputations, 13 PerfectInterpolantSequences, 16/229 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