/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread/triangular-longer-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 06:22:10,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 06:22:10,748 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-NoLbe.epf [2023-11-30 06:22:10,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 06:22:10,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 06:22:10,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 06:22:10,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 06:22:10,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 06:22:10,780 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 06:22:10,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 06:22:10,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 06:22:10,784 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 06:22:10,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 06:22:10,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 06:22:10,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 06:22:10,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 06:22:10,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 06:22:10,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 06:22:10,787 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 06:22:10,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 06:22:10,787 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 06:22:10,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 06:22:10,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 06:22:10,788 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 06:22:10,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 06:22:10,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 06:22:10,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 06:22:10,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 06:22:10,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 06:22:10,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 06:22:10,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 06:22:10,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 06:22:10,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 06:22:10,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true 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-11-30 06:22:10,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 06:22:11,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 06:22:11,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 06:22:11,006 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 06:22:11,006 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 06:22:11,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longer-1.i [2023-11-30 06:22:12,103 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 06:22:12,334 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 06:22:12,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-1.i [2023-11-30 06:22:12,357 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cbce8310/3d35b186743849fa814d529ba7127135/FLAG6ecaee130 [2023-11-30 06:22:12,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cbce8310/3d35b186743849fa814d529ba7127135 [2023-11-30 06:22:12,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 06:22:12,369 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 06:22:12,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 06:22:12,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 06:22:12,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 06:22:12,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 06:22:12" (1/1) ... [2023-11-30 06:22:12,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d5a65aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:12, skipping insertion in model container [2023-11-30 06:22:12,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 06:22:12" (1/1) ... [2023-11-30 06:22:12,425 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 06:22:12,715 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 06:22:12,723 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 06:22:12,767 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 06:22:12,796 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 06:22:12,797 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 06:22:12,803 INFO L206 MainTranslator]: Completed translation [2023-11-30 06:22:12,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:12 WrapperNode [2023-11-30 06:22:12,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 06:22:12,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 06:22:12,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 06:22:12,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 06:22:12,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:12" (1/1) ... [2023-11-30 06:22:12,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:12" (1/1) ... [2023-11-30 06:22:12,855 INFO L138 Inliner]: procedures = 169, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2023-11-30 06:22:12,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 06:22:12,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 06:22:12,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 06:22:12,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 06:22:12,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:12" (1/1) ... [2023-11-30 06:22:12,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:12" (1/1) ... [2023-11-30 06:22:12,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:12" (1/1) ... [2023-11-30 06:22:12,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:12" (1/1) ... [2023-11-30 06:22:12,882 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:12" (1/1) ... [2023-11-30 06:22:12,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:12" (1/1) ... [2023-11-30 06:22:12,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:12" (1/1) ... [2023-11-30 06:22:12,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:12" (1/1) ... [2023-11-30 06:22:12,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 06:22:12,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 06:22:12,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 06:22:12,898 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 06:22:12,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:12" (1/1) ... [2023-11-30 06:22:12,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 06:22:12,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:12,923 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-11-30 06:22:12,948 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-11-30 06:22:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-30 06:22:12,957 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-30 06:22:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-30 06:22:12,957 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-30 06:22:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 06:22:12,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 06:22:12,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 06:22:12,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 06:22:12,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 06:22:12,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 06:22:12,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 06:22:12,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 06:22:12,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 06:22:12,960 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 06:22:13,100 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 06:22:13,101 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 06:22:13,226 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 06:22:13,252 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 06:22:13,253 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-30 06:22:13,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 06:22:13 BoogieIcfgContainer [2023-11-30 06:22:13,254 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 06:22:13,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 06:22:13,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 06:22:13,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 06:22:13,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 06:22:12" (1/3) ... [2023-11-30 06:22:13,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e2d5967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 06:22:13, skipping insertion in model container [2023-11-30 06:22:13,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:12" (2/3) ... [2023-11-30 06:22:13,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e2d5967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 06:22:13, skipping insertion in model container [2023-11-30 06:22:13,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 06:22:13" (3/3) ... [2023-11-30 06:22:13,261 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longer-1.i [2023-11-30 06:22:13,277 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 06:22:13,278 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-30 06:22:13,278 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 06:22:13,327 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 06:22:13,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 84 transitions, 176 flow [2023-11-30 06:22:13,398 INFO L124 PetriNetUnfolderBase]: 6/82 cut-off events. [2023-11-30 06:22:13,398 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 06:22:13,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 82 events. 6/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 157 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-11-30 06:22:13,407 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 84 transitions, 176 flow [2023-11-30 06:22:13,411 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 82 transitions, 170 flow [2023-11-30 06:22:13,419 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 06:22:13,424 INFO L362 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@475a4b6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 06:22:13,424 INFO L363 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-11-30 06:22:13,432 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 06:22:13,432 INFO L124 PetriNetUnfolderBase]: 1/28 cut-off events. [2023-11-30 06:22:13,432 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 06:22:13,432 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:13,433 INFO L232 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] [2023-11-30 06:22:13,433 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:13,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:13,441 INFO L85 PathProgramCache]: Analyzing trace with hash -184951082, now seen corresponding path program 1 times [2023-11-30 06:22:13,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:13,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299693143] [2023-11-30 06:22:13,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:13,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:13,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:13,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:13,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299693143] [2023-11-30 06:22:13,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299693143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:13,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:13,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 06:22:13,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567548093] [2023-11-30 06:22:13,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:13,752 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 06:22:13,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:13,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 06:22:13,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 06:22:13,781 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 84 [2023-11-30 06:22:13,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:13,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:13,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 84 [2023-11-30 06:22:13,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:13,872 INFO L124 PetriNetUnfolderBase]: 90/315 cut-off events. [2023-11-30 06:22:13,872 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-30 06:22:13,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 315 events. 90/315 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1565 event pairs, 23 based on Foata normal form. 81/286 useless extension candidates. Maximal degree in co-relation 438. Up to 69 conditions per place. [2023-11-30 06:22:13,878 INFO L140 encePairwiseOnDemand]: 76/84 looper letters, 13 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2023-11-30 06:22:13,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 200 flow [2023-11-30 06:22:13,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 06:22:13,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 06:22:13,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2023-11-30 06:22:13,891 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2023-11-30 06:22:13,891 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 232 transitions. [2023-11-30 06:22:13,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 232 transitions. [2023-11-30 06:22:13,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:13,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 232 transitions. [2023-11-30 06:22:13,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:13,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:13,902 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:13,907 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, -1 predicate places. [2023-11-30 06:22:13,908 INFO L500 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 200 flow [2023-11-30 06:22:13,908 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:13,908 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:13,908 INFO L232 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] [2023-11-30 06:22:13,908 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 06:22:13,909 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:13,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:13,909 INFO L85 PathProgramCache]: Analyzing trace with hash -184951081, now seen corresponding path program 1 times [2023-11-30 06:22:13,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:13,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168940552] [2023-11-30 06:22:13,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:13,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:13,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:13,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:13,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168940552] [2023-11-30 06:22:13,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168940552] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:13,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:13,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 06:22:13,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933873857] [2023-11-30 06:22:13,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:13,990 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 06:22:13,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:13,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 06:22:13,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 06:22:13,991 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 84 [2023-11-30 06:22:13,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:13,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:13,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 84 [2023-11-30 06:22:13,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:14,081 INFO L124 PetriNetUnfolderBase]: 75/327 cut-off events. [2023-11-30 06:22:14,081 INFO L125 PetriNetUnfolderBase]: For 33/61 co-relation queries the response was YES. [2023-11-30 06:22:14,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 327 events. 75/327 cut-off events. For 33/61 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1581 event pairs, 10 based on Foata normal form. 6/233 useless extension candidates. Maximal degree in co-relation 559. Up to 76 conditions per place. [2023-11-30 06:22:14,088 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 19 selfloop transitions, 4 changer transitions 0/88 dead transitions. [2023-11-30 06:22:14,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 88 transitions, 274 flow [2023-11-30 06:22:14,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 06:22:14,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 06:22:14,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2023-11-30 06:22:14,093 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8849206349206349 [2023-11-30 06:22:14,093 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 223 transitions. [2023-11-30 06:22:14,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 223 transitions. [2023-11-30 06:22:14,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:14,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 223 transitions. [2023-11-30 06:22:14,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:14,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:14,096 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:14,097 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 1 predicate places. [2023-11-30 06:22:14,097 INFO L500 AbstractCegarLoop]: Abstraction has has 84 places, 88 transitions, 274 flow [2023-11-30 06:22:14,097 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:14,097 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:14,097 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:22:14,097 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 06:22:14,098 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:14,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:14,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1644321734, now seen corresponding path program 1 times [2023-11-30 06:22:14,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:14,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222281968] [2023-11-30 06:22:14,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:14,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:14,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:14,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:14,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222281968] [2023-11-30 06:22:14,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222281968] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:14,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:14,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:14,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879159392] [2023-11-30 06:22:14,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:14,214 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:14,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:14,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:14,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:14,215 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:22:14,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 88 transitions, 274 flow. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:14,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:14,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:22:14,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:14,432 INFO L124 PetriNetUnfolderBase]: 317/874 cut-off events. [2023-11-30 06:22:14,436 INFO L125 PetriNetUnfolderBase]: For 423/565 co-relation queries the response was YES. [2023-11-30 06:22:14,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2269 conditions, 874 events. 317/874 cut-off events. For 423/565 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6203 event pairs, 117 based on Foata normal form. 11/560 useless extension candidates. Maximal degree in co-relation 2238. Up to 350 conditions per place. [2023-11-30 06:22:14,448 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 62 selfloop transitions, 4 changer transitions 0/125 dead transitions. [2023-11-30 06:22:14,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 125 transitions, 613 flow [2023-11-30 06:22:14,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:14,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 343 transitions. [2023-11-30 06:22:14,450 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2023-11-30 06:22:14,450 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 343 transitions. [2023-11-30 06:22:14,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 343 transitions. [2023-11-30 06:22:14,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:14,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 343 transitions. [2023-11-30 06:22:14,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:14,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:14,454 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:14,455 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 5 predicate places. [2023-11-30 06:22:14,455 INFO L500 AbstractCegarLoop]: Abstraction has has 88 places, 125 transitions, 613 flow [2023-11-30 06:22:14,456 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:14,456 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:14,456 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:22:14,457 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 06:22:14,457 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:14,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:14,458 INFO L85 PathProgramCache]: Analyzing trace with hash -2014346421, now seen corresponding path program 1 times [2023-11-30 06:22:14,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:14,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416145435] [2023-11-30 06:22:14,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:14,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:14,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:14,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:14,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416145435] [2023-11-30 06:22:14,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416145435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:14,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:14,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 06:22:14,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842672838] [2023-11-30 06:22:14,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:14,577 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 06:22:14,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:14,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 06:22:14,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 06:22:14,583 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 84 [2023-11-30 06:22:14,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 125 transitions, 613 flow. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:14,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:14,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 84 [2023-11-30 06:22:14,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:14,745 INFO L124 PetriNetUnfolderBase]: 479/1478 cut-off events. [2023-11-30 06:22:14,745 INFO L125 PetriNetUnfolderBase]: For 1228/1455 co-relation queries the response was YES. [2023-11-30 06:22:14,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4031 conditions, 1478 events. 479/1478 cut-off events. For 1228/1455 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 12582 event pairs, 128 based on Foata normal form. 5/1014 useless extension candidates. Maximal degree in co-relation 3997. Up to 545 conditions per place. [2023-11-30 06:22:14,757 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 49 selfloop transitions, 15 changer transitions 0/138 dead transitions. [2023-11-30 06:22:14,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 138 transitions, 845 flow [2023-11-30 06:22:14,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 06:22:14,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 06:22:14,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2023-11-30 06:22:14,759 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8928571428571429 [2023-11-30 06:22:14,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 225 transitions. [2023-11-30 06:22:14,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 225 transitions. [2023-11-30 06:22:14,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:14,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 225 transitions. [2023-11-30 06:22:14,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:14,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:14,761 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:14,763 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 7 predicate places. [2023-11-30 06:22:14,763 INFO L500 AbstractCegarLoop]: Abstraction has has 90 places, 138 transitions, 845 flow [2023-11-30 06:22:14,763 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:14,763 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:14,763 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:22:14,763 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 06:22:14,763 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:14,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:14,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2014346422, now seen corresponding path program 1 times [2023-11-30 06:22:14,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:14,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217138046] [2023-11-30 06:22:14,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:14,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:14,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:14,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217138046] [2023-11-30 06:22:14,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217138046] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:14,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:14,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 06:22:14,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744935491] [2023-11-30 06:22:14,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:14,826 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 06:22:14,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:14,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 06:22:14,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 06:22:14,827 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 84 [2023-11-30 06:22:14,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 138 transitions, 845 flow. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:14,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:14,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 84 [2023-11-30 06:22:14,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:14,978 INFO L124 PetriNetUnfolderBase]: 482/1304 cut-off events. [2023-11-30 06:22:14,978 INFO L125 PetriNetUnfolderBase]: For 1939/2254 co-relation queries the response was YES. [2023-11-30 06:22:14,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4278 conditions, 1304 events. 482/1304 cut-off events. For 1939/2254 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 9908 event pairs, 110 based on Foata normal form. 12/880 useless extension candidates. Maximal degree in co-relation 4241. Up to 633 conditions per place. [2023-11-30 06:22:14,991 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 49 selfloop transitions, 15 changer transitions 0/138 dead transitions. [2023-11-30 06:22:14,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 138 transitions, 961 flow [2023-11-30 06:22:14,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 06:22:14,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 06:22:14,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2023-11-30 06:22:14,993 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2023-11-30 06:22:14,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2023-11-30 06:22:14,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2023-11-30 06:22:14,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:14,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2023-11-30 06:22:14,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:14,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:14,995 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:14,997 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 9 predicate places. [2023-11-30 06:22:14,997 INFO L500 AbstractCegarLoop]: Abstraction has has 92 places, 138 transitions, 961 flow [2023-11-30 06:22:14,997 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:14,998 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:14,998 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:22:14,998 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 06:22:14,998 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:15,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:15,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1243348462, now seen corresponding path program 1 times [2023-11-30 06:22:15,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:15,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60072029] [2023-11-30 06:22:15,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:15,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:15,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:15,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:15,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60072029] [2023-11-30 06:22:15,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60072029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:15,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:15,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:15,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997052177] [2023-11-30 06:22:15,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:15,069 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:15,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:15,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:15,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:15,071 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:22:15,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 138 transitions, 961 flow. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:15,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:15,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:22:15,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:15,367 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][133], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 96#true, 70#L699true, 107#true, 103#true, 48#L704-7true, 92#true]) [2023-11-30 06:22:15,367 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:15,367 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:15,368 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:15,368 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:15,368 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([215] L697-->t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~j~0_19) 0) InVars {~j~0=v_~j~0_19} OutVars{~j~0=v_~j~0_19} AuxVars[] AssignedVars[][134], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 107#true, 96#true, 103#true, 64#t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 48#L704-7true, 94#(<= ~j~0 6)]) [2023-11-30 06:22:15,368 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:15,369 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:15,369 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:15,369 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:15,369 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][135], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 90#(<= 6 ~j~0), t1Thread1of1ForFork0InUse, 107#true, 96#true, 103#true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 48#L704-7true, 92#true]) [2023-11-30 06:22:15,369 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:15,369 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:15,369 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:15,369 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:15,375 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([233] L705-->t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~i~0_13) 0) InVars {~i~0=v_~i~0_13} OutVars{~i~0=v_~i~0_13} AuxVars[] AssignedVars[][142], [111#true, 24#L717true, 18#t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 96#true, 107#true, 105#(<= ~i~0 3), 52#L697true, 92#true]) [2023-11-30 06:22:15,375 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,375 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,376 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,376 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,376 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L705-->t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~i~0_17)) (< 2147483646 v_~i~0_17)) InVars {~i~0=v_~i~0_17} OutVars{~i~0=v_~i~0_17} AuxVars[] AssignedVars[][143], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 35#t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 96#true, 103#true, 109#(<= 3 ~i~0), 52#L697true, 92#true]) [2023-11-30 06:22:15,376 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,376 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,376 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,376 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,376 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L705-->L707: Formula: (and (<= v_~i~0_19 2147483646) (<= 0 (+ 2147483649 v_~i~0_19)) (= v_~j~0_13 (+ v_~i~0_19 1))) InVars {~i~0=v_~i~0_19} OutVars{~i~0=v_~i~0_19, ~j~0=v_~j~0_13} AuxVars[] AssignedVars[~j~0][144], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 80#L707true, 96#true, 107#true, 103#true, 52#L697true, 92#true]) [2023-11-30 06:22:15,376 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,376 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,377 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,377 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,377 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][133], [111#true, 42#L705true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 96#true, 107#true, 70#L699true, 103#true, 92#true]) [2023-11-30 06:22:15,377 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,377 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,377 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,377 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,377 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([215] L697-->t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~j~0_19) 0) InVars {~j~0=v_~j~0_19} OutVars{~j~0=v_~j~0_19} AuxVars[] AssignedVars[][134], [111#true, 42#L705true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 107#true, 96#true, 64#t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 103#true, 94#(<= ~j~0 6)]) [2023-11-30 06:22:15,377 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,377 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,378 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,378 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,378 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][135], [111#true, 42#L705true, 24#L717true, t2Thread1of1ForFork1InUse, 90#(<= 6 ~j~0), t1Thread1of1ForFork0InUse, 107#true, 96#true, 103#true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 92#true]) [2023-11-30 06:22:15,378 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,378 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,378 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,378 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,378 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][133], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 20#L704-8true, t1Thread1of1ForFork0InUse, 88#true, 70#L699true, 96#true, 107#true, 103#true, 92#true]) [2023-11-30 06:22:15,379 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,379 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,379 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,379 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,379 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([215] L697-->t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~j~0_19) 0) InVars {~j~0=v_~j~0_19} OutVars{~j~0=v_~j~0_19} AuxVars[] AssignedVars[][134], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 20#L704-8true, t1Thread1of1ForFork0InUse, 88#true, 96#true, 107#true, 103#true, 64#t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 94#(<= ~j~0 6)]) [2023-11-30 06:22:15,379 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,379 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,379 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,379 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,379 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][135], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 20#L704-8true, 90#(<= 6 ~j~0), t1Thread1of1ForFork0InUse, 107#true, 96#true, 103#true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 92#true]) [2023-11-30 06:22:15,380 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,380 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,380 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,380 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,380 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([233] L705-->t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~i~0_13) 0) InVars {~i~0=v_~i~0_13} OutVars{~i~0=v_~i~0_13} AuxVars[] AssignedVars[][142], [111#true, 24#L717true, 18#t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 14#L701true, 107#true, 96#true, 105#(<= ~i~0 3), 92#true]) [2023-11-30 06:22:15,380 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:15,380 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:15,380 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:15,381 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:15,381 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L705-->t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~i~0_17)) (< 2147483646 v_~i~0_17)) InVars {~i~0=v_~i~0_17} OutVars{~i~0=v_~i~0_17} AuxVars[] AssignedVars[][143], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 14#L701true, 88#true, 35#t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 96#true, 103#true, 109#(<= 3 ~i~0), 92#true]) [2023-11-30 06:22:15,381 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:15,381 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:15,381 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:15,381 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:15,381 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L705-->L707: Formula: (and (<= v_~i~0_19 2147483646) (<= 0 (+ 2147483649 v_~i~0_19)) (= v_~j~0_13 (+ v_~i~0_19 1))) InVars {~i~0=v_~i~0_19} OutVars{~i~0=v_~i~0_19, ~j~0=v_~j~0_13} AuxVars[] AssignedVars[~j~0][144], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 14#L701true, 96#true, 107#true, 80#L707true, 103#true, 92#true]) [2023-11-30 06:22:15,381 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:15,381 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:15,381 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:15,382 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:15,382 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([233] L705-->t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~i~0_13) 0) InVars {~i~0=v_~i~0_13} OutVars{~i~0=v_~i~0_13} AuxVars[] AssignedVars[][142], [111#true, 24#L717true, 18#t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 39#L696-8true, 88#true, 96#true, 107#true, 105#(<= ~i~0 3), 92#true]) [2023-11-30 06:22:15,382 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,382 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,382 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,382 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,382 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L705-->t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~i~0_17)) (< 2147483646 v_~i~0_17)) InVars {~i~0=v_~i~0_17} OutVars{~i~0=v_~i~0_17} AuxVars[] AssignedVars[][143], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 39#L696-8true, 88#true, 35#t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 96#true, 103#true, 109#(<= 3 ~i~0), 92#true]) [2023-11-30 06:22:15,382 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,382 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,382 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,382 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,383 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L705-->L707: Formula: (and (<= v_~i~0_19 2147483646) (<= 0 (+ 2147483649 v_~i~0_19)) (= v_~j~0_13 (+ v_~i~0_19 1))) InVars {~i~0=v_~i~0_19} OutVars{~i~0=v_~i~0_19, ~j~0=v_~j~0_13} AuxVars[] AssignedVars[~j~0][144], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 39#L696-8true, 88#true, 80#L707true, 96#true, 107#true, 103#true, 92#true]) [2023-11-30 06:22:15,383 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,383 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,383 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:15,383 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:15,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][133], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 44#L709true, t1Thread1of1ForFork0InUse, 88#true, 70#L699true, 107#true, 96#true, 103#true, 92#true]) [2023-11-30 06:22:15,385 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:15,385 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:15,385 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:15,385 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:15,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([215] L697-->t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~j~0_19) 0) InVars {~j~0=v_~j~0_19} OutVars{~j~0=v_~j~0_19} AuxVars[] AssignedVars[][134], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 44#L709true, t1Thread1of1ForFork0InUse, 88#true, 96#true, 107#true, 64#t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 103#true, 94#(<= ~j~0 6)]) [2023-11-30 06:22:15,386 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:15,386 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:15,386 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:15,386 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:15,386 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][135], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 90#(<= 6 ~j~0), 44#L709true, t1Thread1of1ForFork0InUse, 96#true, 107#true, 103#true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 92#true]) [2023-11-30 06:22:15,386 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:15,386 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:15,386 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:15,386 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:15,391 INFO L124 PetriNetUnfolderBase]: 1180/2522 cut-off events. [2023-11-30 06:22:15,391 INFO L125 PetriNetUnfolderBase]: For 8372/8970 co-relation queries the response was YES. [2023-11-30 06:22:15,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10641 conditions, 2522 events. 1180/2522 cut-off events. For 8372/8970 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 19600 event pairs, 420 based on Foata normal form. 15/1446 useless extension candidates. Maximal degree in co-relation 10602. Up to 1120 conditions per place. [2023-11-30 06:22:15,423 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 92 selfloop transitions, 4 changer transitions 0/164 dead transitions. [2023-11-30 06:22:15,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 164 transitions, 1405 flow [2023-11-30 06:22:15,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:15,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 340 transitions. [2023-11-30 06:22:15,427 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8095238095238095 [2023-11-30 06:22:15,428 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 340 transitions. [2023-11-30 06:22:15,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 340 transitions. [2023-11-30 06:22:15,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:15,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 340 transitions. [2023-11-30 06:22:15,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:15,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:15,430 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:15,433 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 13 predicate places. [2023-11-30 06:22:15,433 INFO L500 AbstractCegarLoop]: Abstraction has has 96 places, 164 transitions, 1405 flow [2023-11-30 06:22:15,433 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:15,433 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:15,433 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:22:15,434 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 06:22:15,434 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:15,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:15,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1508574190, now seen corresponding path program 1 times [2023-11-30 06:22:15,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:15,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505036228] [2023-11-30 06:22:15,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:15,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:15,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:15,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:15,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505036228] [2023-11-30 06:22:15,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505036228] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:22:15,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810933963] [2023-11-30 06:22:15,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:15,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:15,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:15,526 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-11-30 06:22:15,546 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-11-30 06:22:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:15,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 06:22:15,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:22:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:15,662 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 06:22:15,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810933963] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:15,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 06:22:15,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-30 06:22:15,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680804799] [2023-11-30 06:22:15,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:15,663 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 06:22:15,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:15,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 06:22:15,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-30 06:22:15,665 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:22:15,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 164 transitions, 1405 flow. Second operand has 6 states, 6 states have (on average 62.166666666666664) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:15,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:15,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:22:15,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:15,993 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][140], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 107#true, 96#true, 70#L699true, 103#true, 48#L704-7true, 92#true]) [2023-11-30 06:22:15,994 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:15,994 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:15,994 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:15,994 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:15,994 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([215] L697-->t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~j~0_19) 0) InVars {~j~0=v_~j~0_19} OutVars{~j~0=v_~j~0_19} AuxVars[] AssignedVars[][141], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 88#true, 107#true, 96#true, 103#true, 64#t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 48#L704-7true, 94#(<= ~j~0 6)]) [2023-11-30 06:22:15,994 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:15,994 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:15,994 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:15,994 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:15,995 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][142], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 90#(<= 6 ~j~0), t1Thread1of1ForFork0InUse, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 96#true, 107#true, 103#true, 48#L704-7true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 92#true]) [2023-11-30 06:22:15,995 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:15,995 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:15,995 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:15,995 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:16,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L705-->L707: Formula: (and (<= v_~i~0_19 2147483646) (<= 0 (+ 2147483649 v_~i~0_19)) (= v_~j~0_13 (+ v_~i~0_19 1))) InVars {~i~0=v_~i~0_19} OutVars{~i~0=v_~i~0_19, ~j~0=v_~j~0_13} AuxVars[] AssignedVars[~j~0][149], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 39#L696-8true, 80#L707true, 107#true, 96#true, 103#true, 92#true]) [2023-11-30 06:22:16,002 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,002 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,002 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,002 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([233] L705-->t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~i~0_13) 0) InVars {~i~0=v_~i~0_13} OutVars{~i~0=v_~i~0_13} AuxVars[] AssignedVars[][150], [111#true, 24#L717true, 18#t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 39#L696-8true, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 107#true, 96#true, 105#(<= ~i~0 3), 92#true]) [2023-11-30 06:22:16,003 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,003 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,003 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,003 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L705-->t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~i~0_17)) (< 2147483646 v_~i~0_17)) InVars {~i~0=v_~i~0_17} OutVars{~i~0=v_~i~0_17} AuxVars[] AssignedVars[][151], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 39#L696-8true, 96#true, 35#t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 103#true, 109#(<= 3 ~i~0), 92#true]) [2023-11-30 06:22:16,003 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,003 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,004 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,004 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,004 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L705-->L707: Formula: (and (<= v_~i~0_19 2147483646) (<= 0 (+ 2147483649 v_~i~0_19)) (= v_~j~0_13 (+ v_~i~0_19 1))) InVars {~i~0=v_~i~0_19} OutVars{~i~0=v_~i~0_19, ~j~0=v_~j~0_13} AuxVars[] AssignedVars[~j~0][152], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 14#L701true, 88#true, 96#true, 80#L707true, 107#true, 103#true, 118#true, 92#true]) [2023-11-30 06:22:16,004 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:16,004 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:16,004 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:16,004 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:16,004 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([233] L705-->t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~i~0_13) 0) InVars {~i~0=v_~i~0_13} OutVars{~i~0=v_~i~0_13} AuxVars[] AssignedVars[][153], [111#true, 24#L717true, 18#t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 14#L701true, 96#true, 107#true, 105#(<= ~i~0 3), 118#true, 92#true]) [2023-11-30 06:22:16,005 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:16,005 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:16,005 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:16,005 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:16,005 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L705-->t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~i~0_17)) (< 2147483646 v_~i~0_17)) InVars {~i~0=v_~i~0_17} OutVars{~i~0=v_~i~0_17} AuxVars[] AssignedVars[][154], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 14#L701true, 88#true, 35#t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 96#true, 103#true, 109#(<= 3 ~i~0), 118#true, 92#true]) [2023-11-30 06:22:16,005 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:16,005 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:16,005 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:16,006 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:16,006 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L705-->L707: Formula: (and (<= v_~i~0_19 2147483646) (<= 0 (+ 2147483649 v_~i~0_19)) (= v_~j~0_13 (+ v_~i~0_19 1))) InVars {~i~0=v_~i~0_19} OutVars{~i~0=v_~i~0_19, ~j~0=v_~j~0_13} AuxVars[] AssignedVars[~j~0][149], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 88#true, 96#true, 80#L707true, 107#true, 103#true, 52#L697true, 92#true]) [2023-11-30 06:22:16,006 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,007 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,007 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,007 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,007 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([233] L705-->t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~i~0_13) 0) InVars {~i~0=v_~i~0_13} OutVars{~i~0=v_~i~0_13} AuxVars[] AssignedVars[][150], [111#true, 24#L717true, 18#t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 107#true, 96#true, 105#(<= ~i~0 3), 52#L697true, 92#true]) [2023-11-30 06:22:16,007 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,007 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,007 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,007 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,008 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L705-->t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~i~0_17)) (< 2147483646 v_~i~0_17)) InVars {~i~0=v_~i~0_17} OutVars{~i~0=v_~i~0_17} AuxVars[] AssignedVars[][151], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 96#true, 35#t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 103#true, 109#(<= 3 ~i~0), 52#L697true, 92#true]) [2023-11-30 06:22:16,008 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,008 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,008 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,008 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,008 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][140], [111#true, 42#L705true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 88#true, 96#true, 70#L699true, 107#true, 103#true, 92#true]) [2023-11-30 06:22:16,008 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,008 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,009 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,009 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,009 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([215] L697-->t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~j~0_19) 0) InVars {~j~0=v_~j~0_19} OutVars{~j~0=v_~j~0_19} AuxVars[] AssignedVars[][141], [111#true, 42#L705true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 107#true, 96#true, 64#t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 103#true, 94#(<= ~j~0 6)]) [2023-11-30 06:22:16,009 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,009 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,009 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,009 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,009 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][142], [111#true, 42#L705true, 24#L717true, t2Thread1of1ForFork1InUse, 90#(<= 6 ~j~0), t1Thread1of1ForFork0InUse, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 107#true, 96#true, 103#true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 92#true]) [2023-11-30 06:22:16,010 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,010 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,010 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,010 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,010 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][140], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 20#L704-8true, t1Thread1of1ForFork0InUse, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 88#true, 107#true, 70#L699true, 96#true, 103#true, 92#true]) [2023-11-30 06:22:16,010 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,011 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,011 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,011 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,011 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([215] L697-->t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~j~0_19) 0) InVars {~j~0=v_~j~0_19} OutVars{~j~0=v_~j~0_19} AuxVars[] AssignedVars[][141], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 20#L704-8true, t1Thread1of1ForFork0InUse, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 88#true, 107#true, 96#true, 103#true, 64#t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 94#(<= ~j~0 6)]) [2023-11-30 06:22:16,011 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,011 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,011 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,011 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][142], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 20#L704-8true, 90#(<= 6 ~j~0), t1Thread1of1ForFork0InUse, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 96#true, 107#true, 103#true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 92#true]) [2023-11-30 06:22:16,012 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,012 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,012 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,012 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,014 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][140], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 44#L709true, t1Thread1of1ForFork0InUse, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 88#true, 70#L699true, 107#true, 96#true, 103#true, 92#true]) [2023-11-30 06:22:16,014 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:16,014 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:16,014 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:16,015 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:16,015 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([215] L697-->t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~j~0_19) 0) InVars {~j~0=v_~j~0_19} OutVars{~j~0=v_~j~0_19} AuxVars[] AssignedVars[][141], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 44#L709true, t1Thread1of1ForFork0InUse, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 96#true, 107#true, 64#t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 103#true, 94#(<= ~j~0 6)]) [2023-11-30 06:22:16,015 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:16,015 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:16,015 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:16,015 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:16,015 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][142], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 90#(<= 6 ~j~0), 44#L709true, t1Thread1of1ForFork0InUse, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 96#true, 107#true, 103#true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 92#true]) [2023-11-30 06:22:16,015 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:16,015 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:16,016 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:16,016 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:16,022 INFO L124 PetriNetUnfolderBase]: 1136/2463 cut-off events. [2023-11-30 06:22:16,022 INFO L125 PetriNetUnfolderBase]: For 11105/13189 co-relation queries the response was YES. [2023-11-30 06:22:16,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11761 conditions, 2463 events. 1136/2463 cut-off events. For 11105/13189 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 19081 event pairs, 321 based on Foata normal form. 98/1553 useless extension candidates. Maximal degree in co-relation 11720. Up to 1107 conditions per place. [2023-11-30 06:22:16,064 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 102 selfloop transitions, 7 changer transitions 0/177 dead transitions. [2023-11-30 06:22:16,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 177 transitions, 1821 flow [2023-11-30 06:22:16,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 06:22:16,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 06:22:16,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 468 transitions. [2023-11-30 06:22:16,066 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7959183673469388 [2023-11-30 06:22:16,066 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 468 transitions. [2023-11-30 06:22:16,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 468 transitions. [2023-11-30 06:22:16,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:16,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 468 transitions. [2023-11-30 06:22:16,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 66.85714285714286) internal successors, (468), 7 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:16,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 84.0) internal successors, (672), 8 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:16,069 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 84.0) internal successors, (672), 8 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:16,069 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 18 predicate places. [2023-11-30 06:22:16,069 INFO L500 AbstractCegarLoop]: Abstraction has has 101 places, 177 transitions, 1821 flow [2023-11-30 06:22:16,070 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.166666666666664) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:16,070 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:16,070 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:22:16,088 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-11-30 06:22:16,276 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:16,277 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:16,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:16,277 INFO L85 PathProgramCache]: Analyzing trace with hash -468909232, now seen corresponding path program 1 times [2023-11-30 06:22:16,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:16,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494675947] [2023-11-30 06:22:16,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:16,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:16,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:16,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:16,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494675947] [2023-11-30 06:22:16,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494675947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:16,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:16,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:16,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375360034] [2023-11-30 06:22:16,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:16,342 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:16,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:16,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:16,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:16,344 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:16,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 177 transitions, 1821 flow. Second operand has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:16,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:16,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:16,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:16,697 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][133], [111#true, 24#L717true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 88#true, 70#L699true, 107#true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 96#true, 103#true, 48#L704-7true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:16,697 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:16,698 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:16,698 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:16,698 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:16,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][134], [111#true, 24#L717true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 107#true, t2Thread1of1ForFork1InUse, 90#(<= 6 ~j~0), t1Thread1of1ForFork0InUse, 96#true, 103#true, 48#L704-7true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:16,698 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:16,698 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:16,698 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:16,699 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:16,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L705-->L707: Formula: (and (<= v_~i~0_19 2147483646) (<= 0 (+ 2147483649 v_~i~0_19)) (= v_~j~0_13 (+ v_~i~0_19 1))) InVars {~i~0=v_~i~0_19} OutVars{~i~0=v_~i~0_19, ~j~0=v_~j~0_13} AuxVars[] AssignedVars[~j~0][166], [111#true, 24#L717true, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 80#L707true, 107#true, 52#L697true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 96#true, 103#true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:16,714 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,715 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,715 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,715 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,715 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L705-->t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~i~0_17)) (< 2147483646 v_~i~0_17)) InVars {~i~0=v_~i~0_17} OutVars{~i~0=v_~i~0_17} AuxVars[] AssignedVars[][167], [111#true, 24#L717true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 88#true, 109#(<= 3 ~i~0), 52#L697true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 96#true, 35#t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 103#true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:16,715 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,715 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,715 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,715 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L705-->L707: Formula: (and (<= v_~i~0_19 2147483646) (<= 0 (+ 2147483649 v_~i~0_19)) (= v_~j~0_13 (+ v_~i~0_19 1))) InVars {~i~0=v_~i~0_19} OutVars{~i~0=v_~i~0_19, ~j~0=v_~j~0_13} AuxVars[] AssignedVars[~j~0][166], [111#true, 24#L717true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 88#true, 80#L707true, 107#true, 53#L696-7true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 96#true, 103#true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:16,716 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:16,716 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:16,716 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:16,716 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:16,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L705-->t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~i~0_17)) (< 2147483646 v_~i~0_17)) InVars {~i~0=v_~i~0_17} OutVars{~i~0=v_~i~0_17} AuxVars[] AssignedVars[][167], [111#true, 24#L717true, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 53#L696-7true, 109#(<= 3 ~i~0), t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 96#true, 35#t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 103#true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:16,716 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:16,717 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:16,717 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:16,717 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:16,717 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L705-->L707: Formula: (and (<= v_~i~0_19 2147483646) (<= 0 (+ 2147483649 v_~i~0_19)) (= v_~j~0_13 (+ v_~i~0_19 1))) InVars {~i~0=v_~i~0_19} OutVars{~i~0=v_~i~0_19, ~j~0=v_~j~0_13} AuxVars[] AssignedVars[~j~0][166], [111#true, 24#L717true, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 107#true, 80#L707true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 39#L696-8true, 96#true, 103#true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:16,717 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,717 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,717 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,717 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,718 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L705-->t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~i~0_17)) (< 2147483646 v_~i~0_17)) InVars {~i~0=v_~i~0_17} OutVars{~i~0=v_~i~0_17} AuxVars[] AssignedVars[][167], [111#true, 24#L717true, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 109#(<= 3 ~i~0), t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 39#L696-8true, 35#t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 96#true, 103#true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:16,718 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,718 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,718 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,718 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,718 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][133], [111#true, 24#L717true, 42#L705true, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 70#L699true, 107#true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 96#true, 103#true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:16,718 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,718 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,718 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,719 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,719 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][134], [111#true, 24#L717true, 42#L705true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 107#true, t2Thread1of1ForFork1InUse, 90#(<= 6 ~j~0), t1Thread1of1ForFork0InUse, 96#true, 103#true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:16,719 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,719 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,719 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,719 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,719 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L705-->L707: Formula: (and (<= v_~i~0_19 2147483646) (<= 0 (+ 2147483649 v_~i~0_19)) (= v_~j~0_13 (+ v_~i~0_19 1))) InVars {~i~0=v_~i~0_19} OutVars{~i~0=v_~i~0_19, ~j~0=v_~j~0_13} AuxVars[] AssignedVars[~j~0][170], [111#true, 24#L717true, 14#L701true, 88#true, 107#true, 80#L707true, 118#true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 96#true, 103#true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:16,719 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:16,720 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:16,720 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:16,720 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:16,720 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L705-->t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~i~0_17)) (< 2147483646 v_~i~0_17)) InVars {~i~0=v_~i~0_17} OutVars{~i~0=v_~i~0_17} AuxVars[] AssignedVars[][171], [111#true, 24#L717true, 14#L701true, 88#true, 109#(<= 3 ~i~0), 118#true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 35#t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 96#true, 103#true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:16,720 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:16,720 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:16,720 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:16,720 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:16,721 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][133], [111#true, 24#L717true, 20#L704-8true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 88#true, 107#true, 70#L699true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 96#true, 103#true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:16,721 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,721 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,721 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,721 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,722 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][134], [111#true, 24#L717true, 20#L704-8true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 107#true, t2Thread1of1ForFork1InUse, 90#(<= 6 ~j~0), t1Thread1of1ForFork0InUse, 96#true, 103#true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:16,722 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,722 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,722 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:16,722 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:16,737 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][133], [111#true, 24#L717true, 44#L709true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 88#true, 107#true, 70#L699true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 96#true, 103#true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:16,737 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:16,737 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:16,737 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:16,737 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:16,738 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][134], [111#true, 24#L717true, 44#L709true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 107#true, t2Thread1of1ForFork1InUse, 90#(<= 6 ~j~0), t1Thread1of1ForFork0InUse, 96#true, 103#true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:16,738 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:16,738 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:16,738 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:16,738 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:16,753 INFO L124 PetriNetUnfolderBase]: 1321/3048 cut-off events. [2023-11-30 06:22:16,753 INFO L125 PetriNetUnfolderBase]: For 20124/22295 co-relation queries the response was YES. [2023-11-30 06:22:16,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15632 conditions, 3048 events. 1321/3048 cut-off events. For 20124/22295 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 25735 event pairs, 224 based on Foata normal form. 5/1902 useless extension candidates. Maximal degree in co-relation 15587. Up to 1500 conditions per place. [2023-11-30 06:22:16,798 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 104 selfloop transitions, 26 changer transitions 0/204 dead transitions. [2023-11-30 06:22:16,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 204 transitions, 2413 flow [2023-11-30 06:22:16,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:16,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:16,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 367 transitions. [2023-11-30 06:22:16,800 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8738095238095238 [2023-11-30 06:22:16,800 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 367 transitions. [2023-11-30 06:22:16,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 367 transitions. [2023-11-30 06:22:16,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:16,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 367 transitions. [2023-11-30 06:22:16,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 73.4) internal successors, (367), 5 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:16,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:16,802 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:16,804 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 22 predicate places. [2023-11-30 06:22:16,804 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 204 transitions, 2413 flow [2023-11-30 06:22:16,804 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:16,804 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:16,804 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:22:16,804 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 06:22:16,804 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:16,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:16,805 INFO L85 PathProgramCache]: Analyzing trace with hash -468909231, now seen corresponding path program 1 times [2023-11-30 06:22:16,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:16,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215432975] [2023-11-30 06:22:16,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:16,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:16,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:16,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:16,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215432975] [2023-11-30 06:22:16,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215432975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:16,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:16,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:16,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031531122] [2023-11-30 06:22:16,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:16,863 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:16,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:16,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:16,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:16,864 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:16,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 204 transitions, 2413 flow. Second operand has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:16,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:16,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:16,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:17,181 INFO L124 PetriNetUnfolderBase]: 1076/2792 cut-off events. [2023-11-30 06:22:17,181 INFO L125 PetriNetUnfolderBase]: For 20445/21629 co-relation queries the response was YES. [2023-11-30 06:22:17,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14770 conditions, 2792 events. 1076/2792 cut-off events. For 20445/21629 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 25230 event pairs, 231 based on Foata normal form. 1/1813 useless extension candidates. Maximal degree in co-relation 14721. Up to 1369 conditions per place. [2023-11-30 06:22:17,223 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 105 selfloop transitions, 39 changer transitions 0/218 dead transitions. [2023-11-30 06:22:17,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 218 transitions, 2833 flow [2023-11-30 06:22:17,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:17,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 364 transitions. [2023-11-30 06:22:17,225 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2023-11-30 06:22:17,225 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 364 transitions. [2023-11-30 06:22:17,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 364 transitions. [2023-11-30 06:22:17,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:17,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 364 transitions. [2023-11-30 06:22:17,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:17,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:17,227 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:17,228 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 26 predicate places. [2023-11-30 06:22:17,228 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 218 transitions, 2833 flow [2023-11-30 06:22:17,228 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:17,228 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:17,228 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:22:17,228 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 06:22:17,228 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:17,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:17,229 INFO L85 PathProgramCache]: Analyzing trace with hash 856139216, now seen corresponding path program 1 times [2023-11-30 06:22:17,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:17,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950369579] [2023-11-30 06:22:17,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:17,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:17,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:17,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950369579] [2023-11-30 06:22:17,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950369579] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:17,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:17,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:17,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145060076] [2023-11-30 06:22:17,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:17,270 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:17,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:17,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:17,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:17,271 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:17,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 218 transitions, 2833 flow. Second operand has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:17,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:17,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:17,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:17,607 INFO L124 PetriNetUnfolderBase]: 968/2542 cut-off events. [2023-11-30 06:22:17,607 INFO L125 PetriNetUnfolderBase]: For 32152/33573 co-relation queries the response was YES. [2023-11-30 06:22:17,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14115 conditions, 2542 events. 968/2542 cut-off events. For 32152/33573 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 21876 event pairs, 193 based on Foata normal form. 1/1745 useless extension candidates. Maximal degree in co-relation 14062. Up to 1318 conditions per place. [2023-11-30 06:22:17,643 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 110 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2023-11-30 06:22:17,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 186 transitions, 2507 flow [2023-11-30 06:22:17,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 06:22:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 06:22:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2023-11-30 06:22:17,649 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2023-11-30 06:22:17,649 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 280 transitions. [2023-11-30 06:22:17,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 280 transitions. [2023-11-30 06:22:17,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:17,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 280 transitions. [2023-11-30 06:22:17,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:17,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:17,651 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:17,652 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 26 predicate places. [2023-11-30 06:22:17,652 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 186 transitions, 2507 flow [2023-11-30 06:22:17,652 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:17,652 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:17,653 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:22:17,653 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 06:22:17,653 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:17,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:17,653 INFO L85 PathProgramCache]: Analyzing trace with hash 535424785, now seen corresponding path program 1 times [2023-11-30 06:22:17,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:17,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332365565] [2023-11-30 06:22:17,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:17,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:17,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:17,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:17,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332365565] [2023-11-30 06:22:17,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332365565] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:17,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:17,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:17,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736598215] [2023-11-30 06:22:17,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:17,697 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:17,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:17,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:17,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:17,698 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:17,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 186 transitions, 2507 flow. Second operand has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:17,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:17,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:17,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:17,978 INFO L124 PetriNetUnfolderBase]: 1017/2712 cut-off events. [2023-11-30 06:22:17,978 INFO L125 PetriNetUnfolderBase]: For 47302/49890 co-relation queries the response was YES. [2023-11-30 06:22:17,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16078 conditions, 2712 events. 1017/2712 cut-off events. For 47302/49890 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 23440 event pairs, 180 based on Foata normal form. 5/1884 useless extension candidates. Maximal degree in co-relation 16021. Up to 1399 conditions per place. [2023-11-30 06:22:18,015 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 105 selfloop transitions, 15 changer transitions 0/194 dead transitions. [2023-11-30 06:22:18,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 194 transitions, 2903 flow [2023-11-30 06:22:18,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:18,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 361 transitions. [2023-11-30 06:22:18,017 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8595238095238096 [2023-11-30 06:22:18,017 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 361 transitions. [2023-11-30 06:22:18,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 361 transitions. [2023-11-30 06:22:18,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:18,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 361 transitions. [2023-11-30 06:22:18,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:18,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:18,021 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:18,022 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 30 predicate places. [2023-11-30 06:22:18,022 INFO L500 AbstractCegarLoop]: Abstraction has has 113 places, 194 transitions, 2903 flow [2023-11-30 06:22:18,022 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:18,022 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:18,022 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:22:18,022 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 06:22:18,023 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:18,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:18,023 INFO L85 PathProgramCache]: Analyzing trace with hash -478840111, now seen corresponding path program 1 times [2023-11-30 06:22:18,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:18,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32366216] [2023-11-30 06:22:18,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:18,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 06:22:18,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:18,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32366216] [2023-11-30 06:22:18,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32366216] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:18,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:18,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:18,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468947993] [2023-11-30 06:22:18,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:18,057 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:18,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:18,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:18,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:18,058 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:22:18,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 194 transitions, 2903 flow. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:18,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:18,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:22:18,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:18,354 INFO L124 PetriNetUnfolderBase]: 894/2410 cut-off events. [2023-11-30 06:22:18,355 INFO L125 PetriNetUnfolderBase]: For 46160/50019 co-relation queries the response was YES. [2023-11-30 06:22:18,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15677 conditions, 2410 events. 894/2410 cut-off events. For 46160/50019 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 20922 event pairs, 148 based on Foata normal form. 338/2074 useless extension candidates. Maximal degree in co-relation 15618. Up to 1245 conditions per place. [2023-11-30 06:22:18,390 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 120 selfloop transitions, 8 changer transitions 0/211 dead transitions. [2023-11-30 06:22:18,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 211 transitions, 3591 flow [2023-11-30 06:22:18,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:18,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 326 transitions. [2023-11-30 06:22:18,392 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7761904761904762 [2023-11-30 06:22:18,392 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 326 transitions. [2023-11-30 06:22:18,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 326 transitions. [2023-11-30 06:22:18,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:18,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 326 transitions. [2023-11-30 06:22:18,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 65.2) internal successors, (326), 5 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:18,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:18,395 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:18,395 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 33 predicate places. [2023-11-30 06:22:18,395 INFO L500 AbstractCegarLoop]: Abstraction has has 116 places, 211 transitions, 3591 flow [2023-11-30 06:22:18,396 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:18,396 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:18,396 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:22:18,396 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 06:22:18,396 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:18,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:18,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1696098036, now seen corresponding path program 1 times [2023-11-30 06:22:18,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:18,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793059500] [2023-11-30 06:22:18,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:18,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:18,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:18,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:18,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793059500] [2023-11-30 06:22:18,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793059500] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:22:18,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425785972] [2023-11-30 06:22:18,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:18,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:18,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:18,532 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-11-30 06:22:18,553 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-11-30 06:22:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:18,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 06:22:18,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:22:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:18,655 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 06:22:18,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425785972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:18,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 06:22:18,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-11-30 06:22:18,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018962549] [2023-11-30 06:22:18,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:18,656 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 06:22:18,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:18,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 06:22:18,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-30 06:22:18,658 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:22:18,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 211 transitions, 3591 flow. Second operand has 5 states, 5 states have (on average 62.8) internal successors, (314), 5 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:18,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:18,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:22:18,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:18,990 INFO L124 PetriNetUnfolderBase]: 919/2364 cut-off events. [2023-11-30 06:22:18,990 INFO L125 PetriNetUnfolderBase]: For 42403/45887 co-relation queries the response was YES. [2023-11-30 06:22:19,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17392 conditions, 2364 events. 919/2364 cut-off events. For 42403/45887 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 20036 event pairs, 69 based on Foata normal form. 108/1841 useless extension candidates. Maximal degree in co-relation 17331. Up to 1221 conditions per place. [2023-11-30 06:22:19,026 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 139 selfloop transitions, 6 changer transitions 0/226 dead transitions. [2023-11-30 06:22:19,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 226 transitions, 4293 flow [2023-11-30 06:22:19,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 06:22:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 06:22:19,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2023-11-30 06:22:19,027 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7767857142857143 [2023-11-30 06:22:19,028 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 261 transitions. [2023-11-30 06:22:19,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 261 transitions. [2023-11-30 06:22:19,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:19,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 261 transitions. [2023-11-30 06:22:19,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:19,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:19,029 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:19,030 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 35 predicate places. [2023-11-30 06:22:19,030 INFO L500 AbstractCegarLoop]: Abstraction has has 118 places, 226 transitions, 4293 flow [2023-11-30 06:22:19,031 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 62.8) internal successors, (314), 5 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:19,031 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:19,031 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:22:19,038 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-11-30 06:22:19,231 WARN L482 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-11-30 06:22:19,231 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:19,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:19,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1039431291, now seen corresponding path program 1 times [2023-11-30 06:22:19,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:19,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88974470] [2023-11-30 06:22:19,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:19,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 06:22:19,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:19,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88974470] [2023-11-30 06:22:19,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88974470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:19,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:19,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:19,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782978621] [2023-11-30 06:22:19,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:19,268 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:19,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:19,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:19,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:19,269 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:22:19,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 226 transitions, 4293 flow. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:19,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:19,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:22:19,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:19,611 INFO L124 PetriNetUnfolderBase]: 950/2488 cut-off events. [2023-11-30 06:22:19,612 INFO L125 PetriNetUnfolderBase]: For 46171/50517 co-relation queries the response was YES. [2023-11-30 06:22:19,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19402 conditions, 2488 events. 950/2488 cut-off events. For 46171/50517 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 20610 event pairs, 69 based on Foata normal form. 224/2162 useless extension candidates. Maximal degree in co-relation 19339. Up to 1206 conditions per place. [2023-11-30 06:22:19,652 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 152 selfloop transitions, 8 changer transitions 0/241 dead transitions. [2023-11-30 06:22:19,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 241 transitions, 5055 flow [2023-11-30 06:22:19,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:19,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:19,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 323 transitions. [2023-11-30 06:22:19,654 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7690476190476191 [2023-11-30 06:22:19,654 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 323 transitions. [2023-11-30 06:22:19,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 323 transitions. [2023-11-30 06:22:19,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:19,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 323 transitions. [2023-11-30 06:22:19,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 64.6) internal successors, (323), 5 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:19,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:19,656 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:19,656 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 38 predicate places. [2023-11-30 06:22:19,657 INFO L500 AbstractCegarLoop]: Abstraction has has 121 places, 241 transitions, 5055 flow [2023-11-30 06:22:19,657 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:19,657 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:19,657 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:22:19,657 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 06:22:19,657 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:19,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:19,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1709195249, now seen corresponding path program 1 times [2023-11-30 06:22:19,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:19,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265446916] [2023-11-30 06:22:19,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:19,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:19,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:19,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:19,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265446916] [2023-11-30 06:22:19,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265446916] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:22:19,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941654559] [2023-11-30 06:22:19,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:19,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:19,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:19,708 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-11-30 06:22:19,729 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-11-30 06:22:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:19,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 06:22:19,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:22:19,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:19,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 06:22:19,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:19,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941654559] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 06:22:19,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 06:22:19,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-30 06:22:19,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115200508] [2023-11-30 06:22:19,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 06:22:19,908 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-30 06:22:19,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:19,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-30 06:22:19,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-30 06:22:19,909 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:19,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 241 transitions, 5055 flow. Second operand has 8 states, 8 states have (on average 68.625) internal successors, (549), 8 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:19,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:19,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:19,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:20,286 INFO L124 PetriNetUnfolderBase]: 1017/2746 cut-off events. [2023-11-30 06:22:20,286 INFO L125 PetriNetUnfolderBase]: For 69817/75073 co-relation queries the response was YES. [2023-11-30 06:22:20,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22247 conditions, 2746 events. 1017/2746 cut-off events. For 69817/75073 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 21634 event pairs, 61 based on Foata normal form. 22/2259 useless extension candidates. Maximal degree in co-relation 22180. Up to 1455 conditions per place. [2023-11-30 06:22:20,332 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 145 selfloop transitions, 73 changer transitions 0/289 dead transitions. [2023-11-30 06:22:20,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 289 transitions, 6771 flow [2023-11-30 06:22:20,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 06:22:20,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 06:22:20,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 573 transitions. [2023-11-30 06:22:20,334 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8526785714285714 [2023-11-30 06:22:20,334 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 573 transitions. [2023-11-30 06:22:20,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 573 transitions. [2023-11-30 06:22:20,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:20,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 573 transitions. [2023-11-30 06:22:20,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 71.625) internal successors, (573), 8 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:20,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 84.0) internal successors, (756), 9 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:20,337 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 84.0) internal successors, (756), 9 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:20,338 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 45 predicate places. [2023-11-30 06:22:20,338 INFO L500 AbstractCegarLoop]: Abstraction has has 128 places, 289 transitions, 6771 flow [2023-11-30 06:22:20,338 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 68.625) internal successors, (549), 8 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:20,338 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:20,338 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:22:20,351 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-11-30 06:22:20,544 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:20,545 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:20,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:20,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1856336227, now seen corresponding path program 1 times [2023-11-30 06:22:20,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:20,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948594534] [2023-11-30 06:22:20,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:20,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:20,643 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:20,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:20,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948594534] [2023-11-30 06:22:20,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948594534] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:22:20,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329016939] [2023-11-30 06:22:20,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:20,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:20,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:20,645 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-11-30 06:22:20,661 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-11-30 06:22:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:20,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-30 06:22:20,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:22:20,767 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:20,768 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 06:22:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:20,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329016939] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 06:22:20,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 06:22:20,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-11-30 06:22:20,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779236898] [2023-11-30 06:22:20,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 06:22:20,845 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-30 06:22:20,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:20,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-30 06:22:20,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-30 06:22:20,846 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:20,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 289 transitions, 6771 flow. Second operand has 12 states, 12 states have (on average 68.5) internal successors, (822), 12 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:20,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:20,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:20,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:21,484 INFO L124 PetriNetUnfolderBase]: 1260/3352 cut-off events. [2023-11-30 06:22:21,485 INFO L125 PetriNetUnfolderBase]: For 121991/130499 co-relation queries the response was YES. [2023-11-30 06:22:21,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28740 conditions, 3352 events. 1260/3352 cut-off events. For 121991/130499 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 24960 event pairs, 88 based on Foata normal form. 28/2808 useless extension candidates. Maximal degree in co-relation 28669. Up to 1845 conditions per place. [2023-11-30 06:22:21,546 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 168 selfloop transitions, 103 changer transitions 0/342 dead transitions. [2023-11-30 06:22:21,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 342 transitions, 8865 flow [2023-11-30 06:22:21,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-30 06:22:21,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-30 06:22:21,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 930 transitions. [2023-11-30 06:22:21,549 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8516483516483516 [2023-11-30 06:22:21,549 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 930 transitions. [2023-11-30 06:22:21,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 930 transitions. [2023-11-30 06:22:21,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:21,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 930 transitions. [2023-11-30 06:22:21,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 71.53846153846153) internal successors, (930), 13 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:21,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 84.0) internal successors, (1176), 14 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:21,554 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 84.0) internal successors, (1176), 14 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:21,555 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 57 predicate places. [2023-11-30 06:22:21,555 INFO L500 AbstractCegarLoop]: Abstraction has has 140 places, 342 transitions, 8865 flow [2023-11-30 06:22:21,555 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 68.5) internal successors, (822), 12 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:21,555 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:21,556 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:22:21,566 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-11-30 06:22:21,762 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-30 06:22:21,762 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:21,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:21,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1596023075, now seen corresponding path program 1 times [2023-11-30 06:22:21,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:21,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481978033] [2023-11-30 06:22:21,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:21,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:21,894 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:21,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:21,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481978033] [2023-11-30 06:22:21,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481978033] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:22:21,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935160782] [2023-11-30 06:22:21,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:21,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:21,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:21,896 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-11-30 06:22:21,918 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-11-30 06:22:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:21,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-30 06:22:21,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:22:22,053 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:22,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 06:22:22,173 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:22,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935160782] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 06:22:22,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 06:22:22,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2023-11-30 06:22:22,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264837701] [2023-11-30 06:22:22,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 06:22:22,174 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-30 06:22:22,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:22,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-30 06:22:22,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2023-11-30 06:22:22,177 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:22,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 342 transitions, 8865 flow. Second operand has 16 states, 16 states have (on average 68.3125) internal successors, (1093), 16 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:22,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:22,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:22,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:23,251 INFO L124 PetriNetUnfolderBase]: 1836/5182 cut-off events. [2023-11-30 06:22:23,251 INFO L125 PetriNetUnfolderBase]: For 207169/218692 co-relation queries the response was YES. [2023-11-30 06:22:23,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44629 conditions, 5182 events. 1836/5182 cut-off events. For 207169/218692 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 39599 event pairs, 163 based on Foata normal form. 13/4377 useless extension candidates. Maximal degree in co-relation 44554. Up to 2913 conditions per place. [2023-11-30 06:22:23,339 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 239 selfloop transitions, 151 changer transitions 1/462 dead transitions. [2023-11-30 06:22:23,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 462 transitions, 13407 flow [2023-11-30 06:22:23,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-30 06:22:23,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-30 06:22:23,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1141 transitions. [2023-11-30 06:22:23,342 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8489583333333334 [2023-11-30 06:22:23,342 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1141 transitions. [2023-11-30 06:22:23,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1141 transitions. [2023-11-30 06:22:23,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:23,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1141 transitions. [2023-11-30 06:22:23,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 71.3125) internal successors, (1141), 16 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:23,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 84.0) internal successors, (1428), 17 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:23,347 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 84.0) internal successors, (1428), 17 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:23,348 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 72 predicate places. [2023-11-30 06:22:23,348 INFO L500 AbstractCegarLoop]: Abstraction has has 155 places, 462 transitions, 13407 flow [2023-11-30 06:22:23,349 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 68.3125) internal successors, (1093), 16 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:23,349 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:23,349 INFO L232 CegarLoopForPetriNet]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:22:23,356 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-11-30 06:22:23,556 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-30 06:22:23,556 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:23,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:23,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1268495049, now seen corresponding path program 2 times [2023-11-30 06:22:23,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:23,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824649265] [2023-11-30 06:22:23,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:23,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:23,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:23,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824649265] [2023-11-30 06:22:23,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824649265] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:22:23,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568095001] [2023-11-30 06:22:23,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 06:22:23,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:23,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:23,792 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-11-30 06:22:23,831 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-11-30 06:22:23,899 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 06:22:23,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 06:22:23,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-30 06:22:23,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:22:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:24,040 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 06:22:24,335 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:24,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568095001] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 06:22:24,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 06:22:24,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2023-11-30 06:22:24,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765535569] [2023-11-30 06:22:24,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 06:22:24,337 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-30 06:22:24,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:24,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-30 06:22:24,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2023-11-30 06:22:24,339 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:24,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 462 transitions, 13407 flow. Second operand has 28 states, 28 states have (on average 68.21428571428571) internal successors, (1910), 28 states have internal predecessors, (1910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:24,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:24,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:24,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:26,443 INFO L124 PetriNetUnfolderBase]: 3068/8044 cut-off events. [2023-11-30 06:22:26,443 INFO L125 PetriNetUnfolderBase]: For 438275/461720 co-relation queries the response was YES. [2023-11-30 06:22:26,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76094 conditions, 8044 events. 3068/8044 cut-off events. For 438275/461720 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 58868 event pairs, 228 based on Foata normal form. 20/6737 useless extension candidates. Maximal degree in co-relation 76015. Up to 4692 conditions per place. [2023-11-30 06:22:26,557 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 392 selfloop transitions, 263 changer transitions 0/726 dead transitions. [2023-11-30 06:22:26,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 726 transitions, 23517 flow [2023-11-30 06:22:26,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-30 06:22:26,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-30 06:22:26,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2071 transitions. [2023-11-30 06:22:26,562 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8501642036124795 [2023-11-30 06:22:26,562 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 2071 transitions. [2023-11-30 06:22:26,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 2071 transitions. [2023-11-30 06:22:26,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:26,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 2071 transitions. [2023-11-30 06:22:26,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 71.41379310344827) internal successors, (2071), 29 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:26,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 84.0) internal successors, (2520), 30 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:26,571 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 84.0) internal successors, (2520), 30 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:26,571 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 100 predicate places. [2023-11-30 06:22:26,571 INFO L500 AbstractCegarLoop]: Abstraction has has 183 places, 726 transitions, 23517 flow [2023-11-30 06:22:26,572 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 68.21428571428571) internal successors, (1910), 28 states have internal predecessors, (1910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:26,572 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:26,572 INFO L232 CegarLoopForPetriNet]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:22:26,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-30 06:22:26,777 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-30 06:22:26,778 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:26,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:26,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1110996361, now seen corresponding path program 2 times [2023-11-30 06:22:26,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:26,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851355818] [2023-11-30 06:22:26,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:26,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:27,397 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 0 proven. 742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:27,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:27,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851355818] [2023-11-30 06:22:27,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851355818] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:22:27,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329025855] [2023-11-30 06:22:27,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 06:22:27,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:27,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:27,399 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-11-30 06:22:27,404 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-11-30 06:22:27,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 06:22:27,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 06:22:27,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-30 06:22:27,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:22:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 716 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-30 06:22:28,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 06:22:28,478 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 716 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-30 06:22:28,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329025855] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 06:22:28,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 06:22:28,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2023-11-30 06:22:28,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490503287] [2023-11-30 06:22:28,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 06:22:28,480 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-11-30 06:22:28,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:28,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-30 06:22:28,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1760, Unknown=0, NotChecked=0, Total=2070 [2023-11-30 06:22:28,483 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 84 [2023-11-30 06:22:28,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 726 transitions, 23517 flow. Second operand has 46 states, 46 states have (on average 60.08695652173913) internal successors, (2764), 46 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:28,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:28,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 84 [2023-11-30 06:22:28,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:50,772 INFO L124 PetriNetUnfolderBase]: 15829/48055 cut-off events. [2023-11-30 06:22:50,772 INFO L125 PetriNetUnfolderBase]: For 1524940/1568869 co-relation queries the response was YES. [2023-11-30 06:22:51,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389049 conditions, 48055 events. 15829/48055 cut-off events. For 1524940/1568869 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 546898 event pairs, 402 based on Foata normal form. 2666/46005 useless extension candidates. Maximal degree in co-relation 388966. Up to 27923 conditions per place. [2023-11-30 06:22:51,280 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 0 selfloop transitions, 0 changer transitions 4389/4389 dead transitions. [2023-11-30 06:22:51,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 4389 transitions, 122394 flow [2023-11-30 06:22:51,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 437 states. [2023-11-30 06:22:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2023-11-30 06:22:51,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 26855 transitions. [2023-11-30 06:22:51,314 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7315843957720388 [2023-11-30 06:22:51,315 INFO L72 ComplementDD]: Start complementDD. Operand 437 states and 26855 transitions. [2023-11-30 06:22:51,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 437 states and 26855 transitions. [2023-11-30 06:22:51,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:51,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 437 states and 26855 transitions. [2023-11-30 06:22:51,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 438 states, 437 states have (on average 61.453089244851256) internal successors, (26855), 437 states have internal predecessors, (26855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:51,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 438 states, 438 states have (on average 84.0) internal successors, (36792), 438 states have internal predecessors, (36792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:51,451 INFO L81 ComplementDD]: Finished complementDD. Result has 438 states, 438 states have (on average 84.0) internal successors, (36792), 438 states have internal predecessors, (36792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:51,453 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 531 predicate places. [2023-11-30 06:22:51,453 INFO L500 AbstractCegarLoop]: Abstraction has has 614 places, 4389 transitions, 122394 flow [2023-11-30 06:22:51,454 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 60.08695652173913) internal successors, (2764), 46 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:51,459 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/triangular-longer-1.i_BEv2_AllErrorsAtOnce [2023-11-30 06:22:51,540 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2023-11-30 06:22:51,540 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 18 remaining) [2023-11-30 06:22:51,541 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-11-30 06:22:51,541 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-11-30 06:22:51,541 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-11-30 06:22:51,541 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-11-30 06:22:51,541 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-11-30 06:22:51,541 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-11-30 06:22:51,541 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2023-11-30 06:22:51,541 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2023-11-30 06:22:51,542 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2023-11-30 06:22:51,542 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-11-30 06:22:51,542 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-11-30 06:22:51,542 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-11-30 06:22:51,542 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-11-30 06:22:51,542 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-11-30 06:22:51,542 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-11-30 06:22:51,542 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-11-30 06:22:51,549 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-11-30 06:22:51,749 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:51,750 INFO L457 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:22:51,754 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 06:22:51,754 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 06:22:51,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 06:22:51 BasicIcfg [2023-11-30 06:22:51,763 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 06:22:51,764 INFO L158 Benchmark]: Toolchain (without parser) took 39394.70ms. Allocated memory was 488.6MB in the beginning and 6.9GB in the end (delta: 6.4GB). Free memory was 437.5MB in the beginning and 5.8GB in the end (delta: -5.3GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-11-30 06:22:51,764 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 371.2MB. Free memory is still 321.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 06:22:51,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.44ms. Allocated memory is still 488.6MB. Free memory was 437.5MB in the beginning and 417.9MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-11-30 06:22:51,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.33ms. Allocated memory is still 488.6MB. Free memory was 417.9MB in the beginning and 415.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 06:22:51,765 INFO L158 Benchmark]: Boogie Preprocessor took 40.60ms. Allocated memory is still 488.6MB. Free memory was 415.8MB in the beginning and 414.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 06:22:51,765 INFO L158 Benchmark]: RCFGBuilder took 356.87ms. Allocated memory is still 488.6MB. Free memory was 414.4MB in the beginning and 399.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-11-30 06:22:51,766 INFO L158 Benchmark]: TraceAbstraction took 38507.66ms. Allocated memory was 488.6MB in the beginning and 6.9GB in the end (delta: 6.4GB). Free memory was 399.1MB in the beginning and 5.8GB in the end (delta: -5.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2023-11-30 06:22:51,768 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 371.2MB. Free memory is still 321.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 433.44ms. Allocated memory is still 488.6MB. Free memory was 437.5MB in the beginning and 417.9MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 51.33ms. Allocated memory is still 488.6MB. Free memory was 417.9MB in the beginning and 415.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 40.60ms. Allocated memory is still 488.6MB. Free memory was 415.8MB in the beginning and 414.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 356.87ms. Allocated memory is still 488.6MB. Free memory was 414.4MB in the beginning and 399.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 38507.66ms. Allocated memory was 488.6MB in the beginning and 6.9GB in the end (delta: 6.4GB). Free memory was 399.1MB in the beginning and 5.8GB in the end (delta: -5.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 698]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 698]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 696]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 696]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 706]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 706]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 704]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 704]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 115 locations, 18 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: 38.4s, OverallIterations: 19, TraceHistogramMax: 12, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 31.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3528 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3528 mSDsluCounter, 286 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 223 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3100 IncrementalHoareTripleChecker+Invalid, 3225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 63 mSDtfsCounter, 3100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1548 GetRequests, 899 SyntacticMatches, 20 SemanticMatches, 629 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111435 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122394occurred in iteration=19, InterpolantAutomatonStates: 565, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1382 NumberOfCodeBlocks, 1382 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1798 ConstructedInterpolants, 0 QuantifiedInterpolants, 4606 SizeOfPredicates, 49 NumberOfNonLiveVariables, 1261 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 31 InterpolantComputations, 14 PerfectInterpolantSequences, 1484/3002 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 06:22:51,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...