/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-longest-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 06:22:14,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 06:22:14,301 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:14,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 06:22:14,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 06:22:14,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 06:22:14,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 06:22:14,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 06:22:14,334 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 06:22:14,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 06:22:14,338 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 06:22:14,338 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 06:22:14,339 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 06:22:14,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 06:22:14,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 06:22:14,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 06:22:14,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 06:22:14,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 06:22:14,341 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 06:22:14,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 06:22:14,341 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 06:22:14,342 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 06:22:14,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 06:22:14,342 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 06:22:14,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 06:22:14,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 06:22:14,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 06:22:14,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 06:22:14,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 06:22:14,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 06:22:14,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 06:22:14,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 06:22:14,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 06:22:14,345 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:14,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 06:22:14,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 06:22:14,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 06:22:14,568 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 06:22:14,569 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 06:22:14,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-1.i [2023-11-30 06:22:15,738 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 06:22:15,932 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 06:22:15,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-1.i [2023-11-30 06:22:15,944 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e07d10e9/ddf622a27b9243a096185949456df60f/FLAGa947af45a [2023-11-30 06:22:15,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e07d10e9/ddf622a27b9243a096185949456df60f [2023-11-30 06:22:15,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 06:22:15,964 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 06:22:15,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 06:22:15,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 06:22:15,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 06:22:15,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 06:22:15" (1/1) ... [2023-11-30 06:22:15,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37e15b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:15, skipping insertion in model container [2023-11-30 06:22:15,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 06:22:15" (1/1) ... [2023-11-30 06:22:16,016 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 06:22:16,355 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 06:22:16,363 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 06:22:16,411 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 06:22:16,436 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 06:22:16,436 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 06:22:16,443 INFO L206 MainTranslator]: Completed translation [2023-11-30 06:22:16,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:16 WrapperNode [2023-11-30 06:22:16,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 06:22:16,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 06:22:16,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 06:22:16,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 06:22:16,452 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:16" (1/1) ... [2023-11-30 06:22:16,475 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:16" (1/1) ... [2023-11-30 06:22:16,494 INFO L138 Inliner]: procedures = 169, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2023-11-30 06:22:16,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 06:22:16,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 06:22:16,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 06:22:16,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 06:22:16,504 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:16" (1/1) ... [2023-11-30 06:22:16,504 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:16" (1/1) ... [2023-11-30 06:22:16,510 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:16" (1/1) ... [2023-11-30 06:22:16,511 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:16" (1/1) ... [2023-11-30 06:22:16,515 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:16" (1/1) ... [2023-11-30 06:22:16,518 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:16" (1/1) ... [2023-11-30 06:22:16,525 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:16" (1/1) ... [2023-11-30 06:22:16,526 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:16" (1/1) ... [2023-11-30 06:22:16,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 06:22:16,528 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 06:22:16,529 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 06:22:16,529 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 06:22:16,530 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:16" (1/1) ... [2023-11-30 06:22:16,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 06:22:16,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:16,556 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:16,561 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:16,578 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-30 06:22:16,578 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-30 06:22:16,578 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-30 06:22:16,578 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-30 06:22:16,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 06:22:16,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 06:22:16,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 06:22:16,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 06:22:16,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 06:22:16,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 06:22:16,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 06:22:16,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 06:22:16,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 06:22:16,580 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:16,699 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 06:22:16,701 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 06:22:16,884 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 06:22:16,907 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 06:22:16,907 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-30 06:22:16,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 06:22:16 BoogieIcfgContainer [2023-11-30 06:22:16,909 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 06:22:16,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 06:22:16,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 06:22:16,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 06:22:16,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 06:22:15" (1/3) ... [2023-11-30 06:22:16,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770bc2d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 06:22:16, skipping insertion in model container [2023-11-30 06:22:16,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:16" (2/3) ... [2023-11-30 06:22:16,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770bc2d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 06:22:16, skipping insertion in model container [2023-11-30 06:22:16,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 06:22:16" (3/3) ... [2023-11-30 06:22:16,916 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longest-1.i [2023-11-30 06:22:16,946 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 06:22:16,947 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-30 06:22:16,947 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 06:22:16,994 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 06:22:17,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 84 transitions, 176 flow [2023-11-30 06:22:17,056 INFO L124 PetriNetUnfolderBase]: 6/82 cut-off events. [2023-11-30 06:22:17,056 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 06:22:17,061 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:17,061 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 84 transitions, 176 flow [2023-11-30 06:22:17,065 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 82 transitions, 170 flow [2023-11-30 06:22:17,072 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 06:22:17,078 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;@10fb57f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 06:22:17,078 INFO L363 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-11-30 06:22:17,086 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 06:22:17,086 INFO L124 PetriNetUnfolderBase]: 1/28 cut-off events. [2023-11-30 06:22:17,086 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 06:22:17,086 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:17,087 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:17,087 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:17,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:17,092 INFO L85 PathProgramCache]: Analyzing trace with hash -184951082, now seen corresponding path program 1 times [2023-11-30 06:22:17,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:17,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518117431] [2023-11-30 06:22:17,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:17,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:17,391 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,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:17,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518117431] [2023-11-30 06:22:17,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518117431] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:17,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:17,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 06:22:17,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980571771] [2023-11-30 06:22:17,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:17,399 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 06:22:17,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:17,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 06:22:17,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 06:22:17,425 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 84 [2023-11-30 06:22:17,428 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:17,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:17,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 84 [2023-11-30 06:22:17,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:17,518 INFO L124 PetriNetUnfolderBase]: 90/315 cut-off events. [2023-11-30 06:22:17,518 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-30 06:22:17,520 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:17,524 INFO L140 encePairwiseOnDemand]: 76/84 looper letters, 13 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2023-11-30 06:22:17,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 200 flow [2023-11-30 06:22:17,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 06:22:17,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 06:22:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2023-11-30 06:22:17,535 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2023-11-30 06:22:17,536 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 232 transitions. [2023-11-30 06:22:17,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 232 transitions. [2023-11-30 06:22:17,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:17,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 232 transitions. [2023-11-30 06:22:17,544 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:17,549 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:17,550 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:17,555 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, -1 predicate places. [2023-11-30 06:22:17,556 INFO L500 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 200 flow [2023-11-30 06:22:17,556 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:17,556 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:17,556 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:17,556 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 06:22:17,557 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:17,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:17,557 INFO L85 PathProgramCache]: Analyzing trace with hash -184951081, now seen corresponding path program 1 times [2023-11-30 06:22:17,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:17,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480212580] [2023-11-30 06:22:17,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:17,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:17,653 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,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:17,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480212580] [2023-11-30 06:22:17,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480212580] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:17,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:17,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 06:22:17,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413045020] [2023-11-30 06:22:17,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:17,656 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 06:22:17,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:17,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 06:22:17,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 06:22:17,660 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 84 [2023-11-30 06:22:17,660 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:17,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:17,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 84 [2023-11-30 06:22:17,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:17,762 INFO L124 PetriNetUnfolderBase]: 75/327 cut-off events. [2023-11-30 06:22:17,762 INFO L125 PetriNetUnfolderBase]: For 33/61 co-relation queries the response was YES. [2023-11-30 06:22:17,764 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:17,767 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 19 selfloop transitions, 4 changer transitions 0/88 dead transitions. [2023-11-30 06:22:17,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 88 transitions, 274 flow [2023-11-30 06:22:17,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 06:22:17,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 06:22:17,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2023-11-30 06:22:17,774 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8849206349206349 [2023-11-30 06:22:17,774 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 223 transitions. [2023-11-30 06:22:17,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 223 transitions. [2023-11-30 06:22:17,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:17,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 223 transitions. [2023-11-30 06:22:17,777 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:17,779 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:17,779 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:17,780 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 1 predicate places. [2023-11-30 06:22:17,780 INFO L500 AbstractCegarLoop]: Abstraction has has 84 places, 88 transitions, 274 flow [2023-11-30 06:22:17,780 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:17,780 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:17,780 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:17,781 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 06:22:17,781 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:17,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:17,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1644321734, now seen corresponding path program 1 times [2023-11-30 06:22:17,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:17,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224856628] [2023-11-30 06:22:17,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:17,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:17,901 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,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:17,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224856628] [2023-11-30 06:22:17,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224856628] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:17,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:17,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:17,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48856249] [2023-11-30 06:22:17,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:17,903 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:17,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:17,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:17,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:17,905 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:22:17,905 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:17,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:17,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:22:17,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:18,122 INFO L124 PetriNetUnfolderBase]: 317/874 cut-off events. [2023-11-30 06:22:18,126 INFO L125 PetriNetUnfolderBase]: For 423/565 co-relation queries the response was YES. [2023-11-30 06:22:18,132 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:18,140 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 62 selfloop transitions, 4 changer transitions 0/125 dead transitions. [2023-11-30 06:22:18,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 125 transitions, 613 flow [2023-11-30 06:22:18,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:18,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 343 transitions. [2023-11-30 06:22:18,142 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2023-11-30 06:22:18,142 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 343 transitions. [2023-11-30 06:22:18,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 343 transitions. [2023-11-30 06:22:18,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:18,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 343 transitions. [2023-11-30 06:22:18,144 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:18,145 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,146 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,147 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 5 predicate places. [2023-11-30 06:22:18,147 INFO L500 AbstractCegarLoop]: Abstraction has has 88 places, 125 transitions, 613 flow [2023-11-30 06:22:18,147 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:18,148 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:18,148 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:18,148 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 06:22:18,148 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:18,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:18,149 INFO L85 PathProgramCache]: Analyzing trace with hash -2014346421, now seen corresponding path program 1 times [2023-11-30 06:22:18,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:18,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217475237] [2023-11-30 06:22:18,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:18,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:18,247 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:18,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:18,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217475237] [2023-11-30 06:22:18,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217475237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:18,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:18,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 06:22:18,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61494146] [2023-11-30 06:22:18,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:18,249 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 06:22:18,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:18,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 06:22:18,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 06:22:18,255 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 84 [2023-11-30 06:22:18,255 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:18,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:18,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 84 [2023-11-30 06:22:18,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:18,441 INFO L124 PetriNetUnfolderBase]: 479/1478 cut-off events. [2023-11-30 06:22:18,441 INFO L125 PetriNetUnfolderBase]: For 1228/1455 co-relation queries the response was YES. [2023-11-30 06:22:18,447 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:18,458 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 49 selfloop transitions, 15 changer transitions 0/138 dead transitions. [2023-11-30 06:22:18,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 138 transitions, 845 flow [2023-11-30 06:22:18,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 06:22:18,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 06:22:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2023-11-30 06:22:18,460 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8928571428571429 [2023-11-30 06:22:18,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 225 transitions. [2023-11-30 06:22:18,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 225 transitions. [2023-11-30 06:22:18,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:18,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 225 transitions. [2023-11-30 06:22:18,461 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:18,462 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:18,462 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:18,464 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 7 predicate places. [2023-11-30 06:22:18,464 INFO L500 AbstractCegarLoop]: Abstraction has has 90 places, 138 transitions, 845 flow [2023-11-30 06:22:18,465 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:18,465 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:18,466 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:18,466 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 06:22:18,466 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:18,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:18,466 INFO L85 PathProgramCache]: Analyzing trace with hash -2014346422, now seen corresponding path program 1 times [2023-11-30 06:22:18,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:18,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115457451] [2023-11-30 06:22:18,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:18,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:18,535 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:18,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:18,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115457451] [2023-11-30 06:22:18,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115457451] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:18,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:18,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 06:22:18,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921617671] [2023-11-30 06:22:18,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:18,536 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 06:22:18,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:18,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 06:22:18,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 06:22:18,538 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 84 [2023-11-30 06:22:18,538 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:18,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:18,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 84 [2023-11-30 06:22:18,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:18,677 INFO L124 PetriNetUnfolderBase]: 482/1304 cut-off events. [2023-11-30 06:22:18,677 INFO L125 PetriNetUnfolderBase]: For 1939/2254 co-relation queries the response was YES. [2023-11-30 06:22:18,682 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:18,693 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 49 selfloop transitions, 15 changer transitions 0/138 dead transitions. [2023-11-30 06:22:18,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 138 transitions, 961 flow [2023-11-30 06:22:18,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 06:22:18,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 06:22:18,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2023-11-30 06:22:18,695 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2023-11-30 06:22:18,695 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2023-11-30 06:22:18,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2023-11-30 06:22:18,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:18,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2023-11-30 06:22:18,696 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:18,696 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:18,697 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:18,699 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 9 predicate places. [2023-11-30 06:22:18,699 INFO L500 AbstractCegarLoop]: Abstraction has has 92 places, 138 transitions, 961 flow [2023-11-30 06:22:18,699 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:18,700 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:18,700 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:18,700 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 06:22:18,700 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:18,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:18,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1243348462, now seen corresponding path program 1 times [2023-11-30 06:22:18,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:18,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826025709] [2023-11-30 06:22:18,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:18,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:18,766 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:18,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:18,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826025709] [2023-11-30 06:22:18,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826025709] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:18,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:18,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:18,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335963610] [2023-11-30 06:22:18,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:18,772 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:18,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:18,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:18,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:18,773 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:22:18,774 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:18,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:18,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:22:18,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:19,065 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:19,066 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:19,066 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:19,066 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:19,066 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:19,067 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:19,067 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:19,067 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:19,067 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:19,067 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:19,067 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:19,068 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:19,068 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:19,068 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:19,068 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:19,075 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:19,075 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,075 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,075 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,076 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,076 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:19,076 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,076 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,076 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,076 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,076 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:19,076 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,077 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,077 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,077 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,077 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:19,077 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,077 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,077 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,077 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,077 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:19,078 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,078 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,078 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,078 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,078 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:19,078 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,078 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,078 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,079 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,079 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:19,079 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,079 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,079 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,079 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,080 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:19,080 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,080 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,080 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,080 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,080 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:19,080 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,080 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,081 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,081 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,081 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:19,081 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,081 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,081 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,082 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,082 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:19,082 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,082 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,082 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,082 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,082 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:19,082 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,083 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,083 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,083 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,083 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:19,083 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,083 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,083 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,083 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,084 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:19,084 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,084 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,084 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,084 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,084 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:19,084 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,084 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,085 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,085 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,087 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:19,088 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,088 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,088 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,088 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,088 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:19,088 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,088 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,088 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,088 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,089 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:19,089 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,089 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,089 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,089 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,095 INFO L124 PetriNetUnfolderBase]: 1180/2522 cut-off events. [2023-11-30 06:22:19,096 INFO L125 PetriNetUnfolderBase]: For 8372/8970 co-relation queries the response was YES. [2023-11-30 06:22:19,104 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:19,132 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 92 selfloop transitions, 4 changer transitions 0/164 dead transitions. [2023-11-30 06:22:19,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 164 transitions, 1405 flow [2023-11-30 06:22:19,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:19,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 340 transitions. [2023-11-30 06:22:19,137 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8095238095238095 [2023-11-30 06:22:19,137 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 340 transitions. [2023-11-30 06:22:19,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 340 transitions. [2023-11-30 06:22:19,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:19,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 340 transitions. [2023-11-30 06:22:19,138 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:19,140 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,140 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,142 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 13 predicate places. [2023-11-30 06:22:19,143 INFO L500 AbstractCegarLoop]: Abstraction has has 96 places, 164 transitions, 1405 flow [2023-11-30 06:22:19,143 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:19,143 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:19,143 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:19,143 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 06:22:19,143 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:19,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:19,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1508574190, now seen corresponding path program 1 times [2023-11-30 06:22:19,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:19,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898600721] [2023-11-30 06:22:19,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:19,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:19,236 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:19,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:19,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898600721] [2023-11-30 06:22:19,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898600721] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:22:19,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42118702] [2023-11-30 06:22:19,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:19,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:19,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:19,246 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:19,268 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:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:19,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 06:22:19,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:22:19,406 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:19,406 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 06:22:19,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42118702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:19,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 06:22:19,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-30 06:22:19,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352658875] [2023-11-30 06:22:19,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:19,407 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 06:22:19,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:19,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 06:22:19,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-30 06:22:19,409 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:22:19,409 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:19,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:19,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:22:19,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:19,775 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:19,775 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:19,776 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:19,776 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:19,776 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:19,776 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:19,776 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:19,776 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:19,776 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:19,776 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:19,777 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:19,777 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:19,777 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:19,777 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:19,777 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:19,784 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:19,784 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,784 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,784 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,784 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,784 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:19,785 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,785 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,785 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,785 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,785 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:19,785 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,785 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,785 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,786 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,786 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:19,786 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,786 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,786 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,786 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,786 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:19,786 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,787 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,787 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,787 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,787 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:19,787 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,787 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,787 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,787 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,788 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:19,788 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,789 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,789 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,789 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,789 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:19,789 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,789 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,789 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,789 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,790 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:19,790 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,790 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,790 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,790 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,790 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:19,790 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,790 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,790 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,791 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,791 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:19,791 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,791 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,791 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,791 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,791 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:19,792 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,792 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,792 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,792 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,792 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:19,792 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,793 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,793 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,793 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,793 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:19,793 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,793 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,793 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,793 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,794 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:19,794 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,794 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,794 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:19,794 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:19,796 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:19,796 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,797 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,797 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,797 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,797 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:19,797 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,797 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,797 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,797 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,798 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:19,798 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,798 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:19,798 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,798 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:19,805 INFO L124 PetriNetUnfolderBase]: 1136/2463 cut-off events. [2023-11-30 06:22:19,805 INFO L125 PetriNetUnfolderBase]: For 11105/13189 co-relation queries the response was YES. [2023-11-30 06:22:19,814 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:19,899 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 102 selfloop transitions, 7 changer transitions 0/177 dead transitions. [2023-11-30 06:22:19,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 177 transitions, 1821 flow [2023-11-30 06:22:19,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 06:22:19,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 06:22:19,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 468 transitions. [2023-11-30 06:22:19,905 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7959183673469388 [2023-11-30 06:22:19,906 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 468 transitions. [2023-11-30 06:22:19,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 468 transitions. [2023-11-30 06:22:19,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:19,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 468 transitions. [2023-11-30 06:22:19,907 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:19,908 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:19,908 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:19,909 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 18 predicate places. [2023-11-30 06:22:19,909 INFO L500 AbstractCegarLoop]: Abstraction has has 101 places, 177 transitions, 1821 flow [2023-11-30 06:22:19,910 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:19,910 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:19,910 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:19,919 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:20,119 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:20,119 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:20,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:20,120 INFO L85 PathProgramCache]: Analyzing trace with hash -468909232, now seen corresponding path program 1 times [2023-11-30 06:22:20,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:20,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559658656] [2023-11-30 06:22:20,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:20,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:20,173 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:20,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:20,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559658656] [2023-11-30 06:22:20,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559658656] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:20,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:20,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:20,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992384447] [2023-11-30 06:22:20,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:20,175 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:20,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:20,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:20,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:20,176 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:20,176 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:20,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:20,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:20,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:20,445 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:20,446 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:20,446 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:20,446 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:20,446 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:20,446 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:20,446 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:20,446 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:20,446 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:20,446 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:20,460 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:20,460 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:20,460 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:20,460 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:20,460 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:20,460 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:20,461 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:20,461 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:20,461 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:20,461 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:20,461 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:20,461 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:20,461 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:20,461 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:20,461 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:20,461 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:20,461 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:20,462 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:20,462 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:20,462 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:20,462 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:20,462 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:20,462 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:20,462 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:20,462 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:20,462 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:20,462 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:20,462 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:20,462 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:20,463 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:20,463 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:20,463 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:20,463 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:20,463 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:20,463 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:20,463 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:20,463 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:20,463 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:20,463 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:20,463 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:20,464 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:20,464 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:20,464 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:20,464 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:20,464 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:20,464 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:20,464 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:20,464 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:20,464 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:20,464 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:20,465 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:20,465 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:20,465 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:20,465 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:20,465 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:20,465 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:20,465 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:20,465 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:20,465 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:20,466 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:20,479 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:20,479 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:20,479 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:20,479 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:20,479 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:20,480 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:20,480 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:20,480 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:20,480 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:20,480 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:20,494 INFO L124 PetriNetUnfolderBase]: 1321/3048 cut-off events. [2023-11-30 06:22:20,494 INFO L125 PetriNetUnfolderBase]: For 20124/22295 co-relation queries the response was YES. [2023-11-30 06:22:20,505 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:20,531 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 104 selfloop transitions, 26 changer transitions 0/204 dead transitions. [2023-11-30 06:22:20,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 204 transitions, 2413 flow [2023-11-30 06:22:20,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:20,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 367 transitions. [2023-11-30 06:22:20,533 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8738095238095238 [2023-11-30 06:22:20,533 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 367 transitions. [2023-11-30 06:22:20,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 367 transitions. [2023-11-30 06:22:20,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:20,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 367 transitions. [2023-11-30 06:22:20,534 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:20,535 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:20,535 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:20,536 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 22 predicate places. [2023-11-30 06:22:20,536 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 204 transitions, 2413 flow [2023-11-30 06:22:20,536 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:20,536 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:20,536 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:20,536 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 06:22:20,537 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:20,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:20,537 INFO L85 PathProgramCache]: Analyzing trace with hash -468909231, now seen corresponding path program 1 times [2023-11-30 06:22:20,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:20,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121082825] [2023-11-30 06:22:20,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:20,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:20,590 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:20,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:20,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121082825] [2023-11-30 06:22:20,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121082825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:20,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:20,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:20,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247829059] [2023-11-30 06:22:20,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:20,591 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:20,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:20,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:20,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:20,592 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:20,593 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:20,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:20,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:20,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:20,882 INFO L124 PetriNetUnfolderBase]: 1076/2792 cut-off events. [2023-11-30 06:22:20,882 INFO L125 PetriNetUnfolderBase]: For 20445/21629 co-relation queries the response was YES. [2023-11-30 06:22:20,892 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:20,916 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 105 selfloop transitions, 39 changer transitions 0/218 dead transitions. [2023-11-30 06:22:20,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 218 transitions, 2833 flow [2023-11-30 06:22:20,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:20,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:20,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 364 transitions. [2023-11-30 06:22:20,918 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2023-11-30 06:22:20,918 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 364 transitions. [2023-11-30 06:22:20,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 364 transitions. [2023-11-30 06:22:20,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:20,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 364 transitions. [2023-11-30 06:22:20,919 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:20,920 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:20,920 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:20,921 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 26 predicate places. [2023-11-30 06:22:20,922 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 218 transitions, 2833 flow [2023-11-30 06:22:20,922 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:20,922 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:20,922 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:20,922 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 06:22:20,922 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:20,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:20,923 INFO L85 PathProgramCache]: Analyzing trace with hash 856139216, now seen corresponding path program 1 times [2023-11-30 06:22:20,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:20,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958000946] [2023-11-30 06:22:20,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:20,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:20,980 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:20,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:20,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958000946] [2023-11-30 06:22:20,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958000946] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:20,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:20,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:20,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107067244] [2023-11-30 06:22:20,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:20,984 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:20,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:20,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:20,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:20,986 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:20,986 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:20,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:20,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:20,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:21,310 INFO L124 PetriNetUnfolderBase]: 968/2542 cut-off events. [2023-11-30 06:22:21,310 INFO L125 PetriNetUnfolderBase]: For 32152/33573 co-relation queries the response was YES. [2023-11-30 06:22:21,320 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:21,346 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 110 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2023-11-30 06:22:21,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 186 transitions, 2507 flow [2023-11-30 06:22:21,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 06:22:21,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 06:22:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2023-11-30 06:22:21,348 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2023-11-30 06:22:21,348 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 280 transitions. [2023-11-30 06:22:21,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 280 transitions. [2023-11-30 06:22:21,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:21,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 280 transitions. [2023-11-30 06:22:21,349 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:21,350 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:21,351 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:21,352 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 26 predicate places. [2023-11-30 06:22:21,352 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 186 transitions, 2507 flow [2023-11-30 06:22:21,352 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:21,352 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:21,352 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:21,352 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 06:22:21,353 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:21,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:21,353 INFO L85 PathProgramCache]: Analyzing trace with hash 535424785, now seen corresponding path program 1 times [2023-11-30 06:22:21,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:21,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777092872] [2023-11-30 06:22:21,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:21,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:21,399 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:21,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:21,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777092872] [2023-11-30 06:22:21,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777092872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:21,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:21,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:21,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253560530] [2023-11-30 06:22:21,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:21,400 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:21,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:21,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:21,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:21,402 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:21,402 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:21,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:21,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:21,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:21,734 INFO L124 PetriNetUnfolderBase]: 1017/2712 cut-off events. [2023-11-30 06:22:21,734 INFO L125 PetriNetUnfolderBase]: For 47302/49890 co-relation queries the response was YES. [2023-11-30 06:22:21,745 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:21,771 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 105 selfloop transitions, 15 changer transitions 0/194 dead transitions. [2023-11-30 06:22:21,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 194 transitions, 2903 flow [2023-11-30 06:22:21,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:21,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:21,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 361 transitions. [2023-11-30 06:22:21,773 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8595238095238096 [2023-11-30 06:22:21,773 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 361 transitions. [2023-11-30 06:22:21,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 361 transitions. [2023-11-30 06:22:21,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:21,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 361 transitions. [2023-11-30 06:22:21,774 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:21,776 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:21,776 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:21,777 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 30 predicate places. [2023-11-30 06:22:21,777 INFO L500 AbstractCegarLoop]: Abstraction has has 113 places, 194 transitions, 2903 flow [2023-11-30 06:22:21,777 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:21,777 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:21,777 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:21,777 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 06:22:21,778 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:21,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:21,778 INFO L85 PathProgramCache]: Analyzing trace with hash -478840111, now seen corresponding path program 1 times [2023-11-30 06:22:21,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:21,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117254564] [2023-11-30 06:22:21,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:21,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:21,811 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:21,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:21,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117254564] [2023-11-30 06:22:21,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117254564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:21,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:21,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:21,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790146609] [2023-11-30 06:22:21,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:21,812 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:21,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:21,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:21,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:21,813 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:22:21,814 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:21,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:21,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:22:21,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:22,119 INFO L124 PetriNetUnfolderBase]: 894/2410 cut-off events. [2023-11-30 06:22:22,120 INFO L125 PetriNetUnfolderBase]: For 46160/50019 co-relation queries the response was YES. [2023-11-30 06:22:22,131 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:22,155 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 120 selfloop transitions, 8 changer transitions 0/211 dead transitions. [2023-11-30 06:22:22,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 211 transitions, 3591 flow [2023-11-30 06:22:22,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:22,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:22,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 326 transitions. [2023-11-30 06:22:22,157 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7761904761904762 [2023-11-30 06:22:22,157 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 326 transitions. [2023-11-30 06:22:22,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 326 transitions. [2023-11-30 06:22:22,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:22,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 326 transitions. [2023-11-30 06:22:22,159 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:22,159 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:22,160 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:22,160 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 33 predicate places. [2023-11-30 06:22:22,160 INFO L500 AbstractCegarLoop]: Abstraction has has 116 places, 211 transitions, 3591 flow [2023-11-30 06:22:22,160 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:22,160 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:22,161 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:22,161 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 06:22:22,161 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:22,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:22,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1696098036, now seen corresponding path program 1 times [2023-11-30 06:22:22,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:22,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373523461] [2023-11-30 06:22:22,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:22,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:22,217 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:22,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:22,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373523461] [2023-11-30 06:22:22,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373523461] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:22:22,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239003411] [2023-11-30 06:22:22,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:22,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:22,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:22,219 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:22,244 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:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:22,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 06:22:22,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:22:22,340 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:22,340 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 06:22:22,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239003411] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:22,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 06:22:22,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-11-30 06:22:22,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589156596] [2023-11-30 06:22:22,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:22,341 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 06:22:22,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:22,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 06:22:22,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-30 06:22:22,342 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:22:22,343 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:22,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:22,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:22:22,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:22,735 INFO L124 PetriNetUnfolderBase]: 919/2364 cut-off events. [2023-11-30 06:22:22,735 INFO L125 PetriNetUnfolderBase]: For 42403/45887 co-relation queries the response was YES. [2023-11-30 06:22:22,745 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:22,771 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 139 selfloop transitions, 6 changer transitions 0/226 dead transitions. [2023-11-30 06:22:22,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 226 transitions, 4293 flow [2023-11-30 06:22:22,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 06:22:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 06:22:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2023-11-30 06:22:22,772 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7767857142857143 [2023-11-30 06:22:22,772 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 261 transitions. [2023-11-30 06:22:22,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 261 transitions. [2023-11-30 06:22:22,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:22,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 261 transitions. [2023-11-30 06:22:22,773 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:22,774 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:22,774 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:22,775 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 35 predicate places. [2023-11-30 06:22:22,775 INFO L500 AbstractCegarLoop]: Abstraction has has 118 places, 226 transitions, 4293 flow [2023-11-30 06:22:22,775 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:22,776 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:22,776 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:22,783 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:22,982 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:22,982 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:22,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:22,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1039431291, now seen corresponding path program 1 times [2023-11-30 06:22:22,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:22,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937805441] [2023-11-30 06:22:22,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:22,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:23,035 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:23,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:23,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937805441] [2023-11-30 06:22:23,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937805441] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:23,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:23,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:23,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083344267] [2023-11-30 06:22:23,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:23,038 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:23,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:23,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:23,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:23,039 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:22:23,040 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:23,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:23,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:22:23,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:23,394 INFO L124 PetriNetUnfolderBase]: 950/2488 cut-off events. [2023-11-30 06:22:23,394 INFO L125 PetriNetUnfolderBase]: For 46171/50517 co-relation queries the response was YES. [2023-11-30 06:22:23,407 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:23,435 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 152 selfloop transitions, 8 changer transitions 0/241 dead transitions. [2023-11-30 06:22:23,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 241 transitions, 5055 flow [2023-11-30 06:22:23,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:23,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:23,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 323 transitions. [2023-11-30 06:22:23,437 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7690476190476191 [2023-11-30 06:22:23,437 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 323 transitions. [2023-11-30 06:22:23,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 323 transitions. [2023-11-30 06:22:23,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:23,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 323 transitions. [2023-11-30 06:22:23,438 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:23,439 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:23,439 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:23,439 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 38 predicate places. [2023-11-30 06:22:23,439 INFO L500 AbstractCegarLoop]: Abstraction has has 121 places, 241 transitions, 5055 flow [2023-11-30 06:22:23,439 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:23,440 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:23,440 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:23,440 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 06:22:23,440 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:23,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:23,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1709195249, now seen corresponding path program 1 times [2023-11-30 06:22:23,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:23,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636582604] [2023-11-30 06:22:23,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:23,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:23,489 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:23,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:23,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636582604] [2023-11-30 06:22:23,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636582604] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:22:23,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61203495] [2023-11-30 06:22:23,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:23,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:23,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:23,491 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:23,495 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:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:23,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 06:22:23,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:22:23,601 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:23,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 06:22:23,652 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:23,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61203495] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 06:22:23,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 06:22:23,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-30 06:22:23,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989330336] [2023-11-30 06:22:23,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 06:22:23,653 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-30 06:22:23,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:23,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-30 06:22:23,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-30 06:22:23,654 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:23,654 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:23,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:23,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:23,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:24,075 INFO L124 PetriNetUnfolderBase]: 1017/2746 cut-off events. [2023-11-30 06:22:24,075 INFO L125 PetriNetUnfolderBase]: For 69817/75073 co-relation queries the response was YES. [2023-11-30 06:22:24,092 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:24,124 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 145 selfloop transitions, 73 changer transitions 0/289 dead transitions. [2023-11-30 06:22:24,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 289 transitions, 6771 flow [2023-11-30 06:22:24,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 06:22:24,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 06:22:24,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 573 transitions. [2023-11-30 06:22:24,126 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8526785714285714 [2023-11-30 06:22:24,126 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 573 transitions. [2023-11-30 06:22:24,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 573 transitions. [2023-11-30 06:22:24,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:24,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 573 transitions. [2023-11-30 06:22:24,128 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:24,129 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:24,129 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:24,130 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 45 predicate places. [2023-11-30 06:22:24,130 INFO L500 AbstractCegarLoop]: Abstraction has has 128 places, 289 transitions, 6771 flow [2023-11-30 06:22:24,130 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:24,130 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:24,130 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:24,136 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:24,336 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:24,336 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:24,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:24,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1856336227, now seen corresponding path program 1 times [2023-11-30 06:22:24,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:24,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450598559] [2023-11-30 06:22:24,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:24,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:24,492 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:24,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:24,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450598559] [2023-11-30 06:22:24,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450598559] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:22:24,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831353431] [2023-11-30 06:22:24,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:24,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:24,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:24,494 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:24,497 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:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:24,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-30 06:22:24,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:22:24,623 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:24,623 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 06:22:24,712 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:24,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831353431] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 06:22:24,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 06:22:24,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-11-30 06:22:24,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251011517] [2023-11-30 06:22:24,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 06:22:24,713 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-30 06:22:24,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:24,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-30 06:22:24,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-30 06:22:24,714 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:24,715 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:24,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:24,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:24,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:25,250 INFO L124 PetriNetUnfolderBase]: 1260/3352 cut-off events. [2023-11-30 06:22:25,250 INFO L125 PetriNetUnfolderBase]: For 121991/130499 co-relation queries the response was YES. [2023-11-30 06:22:25,265 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:25,302 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 168 selfloop transitions, 103 changer transitions 0/342 dead transitions. [2023-11-30 06:22:25,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 342 transitions, 8865 flow [2023-11-30 06:22:25,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-30 06:22:25,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-30 06:22:25,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 930 transitions. [2023-11-30 06:22:25,305 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8516483516483516 [2023-11-30 06:22:25,305 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 930 transitions. [2023-11-30 06:22:25,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 930 transitions. [2023-11-30 06:22:25,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:25,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 930 transitions. [2023-11-30 06:22:25,307 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:25,309 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:25,309 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:25,310 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 57 predicate places. [2023-11-30 06:22:25,310 INFO L500 AbstractCegarLoop]: Abstraction has has 140 places, 342 transitions, 8865 flow [2023-11-30 06:22:25,310 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:25,310 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:25,310 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:25,320 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:25,516 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:25,516 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:25,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:25,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1596023075, now seen corresponding path program 1 times [2023-11-30 06:22:25,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:25,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566386318] [2023-11-30 06:22:25,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:25,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:25,639 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:25,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:25,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566386318] [2023-11-30 06:22:25,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566386318] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:22:25,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998187401] [2023-11-30 06:22:25,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:25,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:25,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:25,641 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:25,658 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:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:25,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-30 06:22:25,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:22:25,779 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:25,779 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 06:22:25,897 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:25,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998187401] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 06:22:25,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 06:22:25,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2023-11-30 06:22:25,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573097932] [2023-11-30 06:22:25,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 06:22:25,898 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-30 06:22:25,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:25,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-30 06:22:25,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2023-11-30 06:22:25,900 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:25,901 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:25,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:25,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:25,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:26,909 INFO L124 PetriNetUnfolderBase]: 1836/5182 cut-off events. [2023-11-30 06:22:26,909 INFO L125 PetriNetUnfolderBase]: For 207169/218692 co-relation queries the response was YES. [2023-11-30 06:22:26,939 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:26,992 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 239 selfloop transitions, 151 changer transitions 1/462 dead transitions. [2023-11-30 06:22:26,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 462 transitions, 13407 flow [2023-11-30 06:22:26,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-30 06:22:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-30 06:22:26,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1141 transitions. [2023-11-30 06:22:26,995 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8489583333333334 [2023-11-30 06:22:26,995 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1141 transitions. [2023-11-30 06:22:26,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1141 transitions. [2023-11-30 06:22:26,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:26,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1141 transitions. [2023-11-30 06:22:26,999 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:27,001 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:27,001 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:27,001 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 72 predicate places. [2023-11-30 06:22:27,002 INFO L500 AbstractCegarLoop]: Abstraction has has 155 places, 462 transitions, 13407 flow [2023-11-30 06:22:27,003 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:27,003 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:27,003 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:27,015 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:27,208 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:27,209 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:27,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:27,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1268495049, now seen corresponding path program 2 times [2023-11-30 06:22:27,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:27,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915057934] [2023-11-30 06:22:27,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:27,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:27,452 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:27,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:27,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915057934] [2023-11-30 06:22:27,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915057934] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:22:27,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445590516] [2023-11-30 06:22:27,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 06:22:27,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:27,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:27,454 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:27,473 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:27,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 06:22:27,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 06:22:27,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-30 06:22:27,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:22:27,666 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:27,666 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 06:22:27,958 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:27,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445590516] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 06:22:27,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 06:22:27,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2023-11-30 06:22:27,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113357877] [2023-11-30 06:22:27,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 06:22:27,960 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-30 06:22:27,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:27,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-30 06:22:27,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2023-11-30 06:22:27,963 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:27,964 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:27,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:27,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:27,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:30,112 INFO L124 PetriNetUnfolderBase]: 3068/8044 cut-off events. [2023-11-30 06:22:30,112 INFO L125 PetriNetUnfolderBase]: For 438275/461720 co-relation queries the response was YES. [2023-11-30 06:22:30,147 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:30,242 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 392 selfloop transitions, 263 changer transitions 0/726 dead transitions. [2023-11-30 06:22:30,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 726 transitions, 23517 flow [2023-11-30 06:22:30,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-30 06:22:30,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-30 06:22:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2071 transitions. [2023-11-30 06:22:30,253 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8501642036124795 [2023-11-30 06:22:30,253 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 2071 transitions. [2023-11-30 06:22:30,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 2071 transitions. [2023-11-30 06:22:30,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:30,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 2071 transitions. [2023-11-30 06:22:30,264 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:30,271 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:30,272 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:30,272 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 100 predicate places. [2023-11-30 06:22:30,272 INFO L500 AbstractCegarLoop]: Abstraction has has 183 places, 726 transitions, 23517 flow [2023-11-30 06:22:30,273 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:30,273 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:30,273 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:30,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-30 06:22:30,478 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:30,479 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:30,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:30,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1110996361, now seen corresponding path program 2 times [2023-11-30 06:22:30,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:30,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717092834] [2023-11-30 06:22:30,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:30,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:31,388 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:31,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:31,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717092834] [2023-11-30 06:22:31,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717092834] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:22:31,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498614413] [2023-11-30 06:22:31,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 06:22:31,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:31,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:31,392 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:31,409 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:31,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 06:22:31,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 06:22:31,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-30 06:22:31,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:22:31,665 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:31,666 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 06:22:32,308 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:32,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498614413] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 06:22:32,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 06:22:32,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2023-11-30 06:22:32,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281113429] [2023-11-30 06:22:32,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 06:22:32,309 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-30 06:22:32,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:32,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-30 06:22:32,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=1656, Unknown=0, NotChecked=0, Total=2256 [2023-11-30 06:22:32,313 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:32,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 726 transitions, 23517 flow. Second operand has 48 states, 48 states have (on average 68.10416666666667) internal successors, (3269), 48 states have internal predecessors, (3269), 0 states have call successors, (0), 0 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:32,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:32,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:32,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:36,959 INFO L124 PetriNetUnfolderBase]: 5385/14447 cut-off events. [2023-11-30 06:22:36,960 INFO L125 PetriNetUnfolderBase]: For 879988/919266 co-relation queries the response was YES. [2023-11-30 06:22:37,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140187 conditions, 14447 events. 5385/14447 cut-off events. For 879988/919266 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 104994 event pairs, 417 based on Foata normal form. 22/12215 useless extension candidates. Maximal degree in co-relation 140104. Up to 8601 conditions per place. [2023-11-30 06:22:37,176 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 687 selfloop transitions, 470 changer transitions 2/1230 dead transitions. [2023-11-30 06:22:37,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 1230 transitions, 43643 flow [2023-11-30 06:22:37,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-30 06:22:37,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-11-30 06:22:37,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 3429 transitions. [2023-11-30 06:22:37,181 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8504464285714286 [2023-11-30 06:22:37,181 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 3429 transitions. [2023-11-30 06:22:37,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 3429 transitions. [2023-11-30 06:22:37,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:37,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 3429 transitions. [2023-11-30 06:22:37,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 71.4375) internal successors, (3429), 48 states have internal predecessors, (3429), 0 states have call successors, (0), 0 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:37,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 84.0) internal successors, (4116), 49 states have internal predecessors, (4116), 0 states have call successors, (0), 0 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:37,195 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 84.0) internal successors, (4116), 49 states have internal predecessors, (4116), 0 states have call successors, (0), 0 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:37,196 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 147 predicate places. [2023-11-30 06:22:37,196 INFO L500 AbstractCegarLoop]: Abstraction has has 230 places, 1230 transitions, 43643 flow [2023-11-30 06:22:37,197 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 68.10416666666667) internal successors, (3269), 48 states have internal predecessors, (3269), 0 states have call successors, (0), 0 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:37,197 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:37,197 INFO L232 CegarLoopForPetriNet]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 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:37,206 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:37,403 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:37,404 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:37,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:37,404 INFO L85 PathProgramCache]: Analyzing trace with hash -432540715, now seen corresponding path program 3 times [2023-11-30 06:22:37,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:37,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004363934] [2023-11-30 06:22:37,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:37,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:39,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3173 backedges. 0 proven. 3173 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:39,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:39,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004363934] [2023-11-30 06:22:39,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004363934] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:22:39,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231602576] [2023-11-30 06:22:39,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-30 06:22:39,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:39,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:39,160 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 06:22:39,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-30 06:22:39,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2023-11-30 06:22:39,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 06:22:39,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-30 06:22:39,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:22:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3173 backedges. 2869 proven. 275 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-30 06:22:40,825 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 06:22:42,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3173 backedges. 2869 proven. 275 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-30 06:22:42,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231602576] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 06:22:42,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 06:22:42,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 43, 43] total 88 [2023-11-30 06:22:42,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759765422] [2023-11-30 06:22:42,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 06:22:42,234 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2023-11-30 06:22:42,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:42,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2023-11-30 06:22:42,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1057, Invalid=6599, Unknown=0, NotChecked=0, Total=7656 [2023-11-30 06:22:42,242 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 84 [2023-11-30 06:22:42,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 1230 transitions, 43643 flow. Second operand has 88 states, 88 states have (on average 60.0) internal successors, (5280), 88 states have internal predecessors, (5280), 0 states have call successors, (0), 0 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:42,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:42,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 84 [2023-11-30 06:22:42,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:25:03,519 INFO L124 PetriNetUnfolderBase]: 60140/188999 cut-off events. [2023-11-30 06:25:03,520 INFO L125 PetriNetUnfolderBase]: For 6443238/6558738 co-relation queries the response was YES. [2023-11-30 06:25:05,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1564981 conditions, 188999 events. 60140/188999 cut-off events. For 6443238/6558738 co-relation queries the response was YES. Maximal size of possible extension queue 1292. Compared 2452027 event pairs, 1406 based on Foata normal form. 4740/176141 useless extension candidates. Maximal degree in co-relation 1564894. Up to 116749 conditions per place. [2023-11-30 06:25:06,097 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 0 selfloop transitions, 0 changer transitions 16099/16099 dead transitions. [2023-11-30 06:25:06,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1694 places, 16099 transitions, 485172 flow [2023-11-30 06:25:06,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1471 states. [2023-11-30 06:25:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2023-11-30 06:25:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 90533 transitions. [2023-11-30 06:25:06,179 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7326810397850506 [2023-11-30 06:25:06,179 INFO L72 ComplementDD]: Start complementDD. Operand 1471 states and 90533 transitions. [2023-11-30 06:25:06,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1471 states and 90533 transitions. [2023-11-30 06:25:06,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:25:06,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 1471 states and 90533 transitions. [2023-11-30 06:25:06,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 1472 states, 1471 states have (on average 61.545207341944256) internal successors, (90533), 1471 states have internal predecessors, (90533), 0 states have call successors, (0), 0 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:25:06,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 1472 states, 1472 states have (on average 84.0) internal successors, (123648), 1472 states have internal predecessors, (123648), 0 states have call successors, (0), 0 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:25:06,556 INFO L81 ComplementDD]: Finished complementDD. Result has 1472 states, 1472 states have (on average 84.0) internal successors, (123648), 1472 states have internal predecessors, (123648), 0 states have call successors, (0), 0 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:25:06,558 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 1611 predicate places. [2023-11-30 06:25:06,558 INFO L500 AbstractCegarLoop]: Abstraction has has 1694 places, 16099 transitions, 485172 flow [2023-11-30 06:25:06,559 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 60.0) internal successors, (5280), 88 states have internal predecessors, (5280), 0 states have call successors, (0), 0 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:25:06,563 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/triangular-longest-1.i_BEv2_AllErrorsAtOnce [2023-11-30 06:25:06,772 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2023-11-30 06:25:06,772 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 18 remaining) [2023-11-30 06:25:06,772 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-11-30 06:25:06,773 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-11-30 06:25:06,773 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-11-30 06:25:06,773 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-11-30 06:25:06,773 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-11-30 06:25:06,773 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-11-30 06:25:06,773 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2023-11-30 06:25:06,773 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2023-11-30 06:25:06,773 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2023-11-30 06:25:06,773 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-11-30 06:25:06,773 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-11-30 06:25:06,773 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-11-30 06:25:06,775 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-11-30 06:25:06,775 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-11-30 06:25:06,775 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-11-30 06:25:06,775 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-11-30 06:25:06,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-30 06:25:06,980 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:25:06,981 INFO L457 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:25:06,986 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 06:25:06,986 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 06:25:06,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 06:25:06 BasicIcfg [2023-11-30 06:25:06,991 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 06:25:06,991 INFO L158 Benchmark]: Toolchain (without parser) took 171027.68ms. Allocated memory was 629.1MB in the beginning and 13.7GB in the end (delta: 13.1GB). Free memory was 574.4MB in the beginning and 10.0GB in the end (delta: -9.5GB). Peak memory consumption was 3.9GB. Max. memory is 16.0GB. [2023-11-30 06:25:06,991 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 371.2MB. Free memory is still 320.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 06:25:06,992 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.08ms. Allocated memory is still 629.1MB. Free memory was 574.4MB in the beginning and 554.8MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-11-30 06:25:06,992 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.25ms. Allocated memory is still 629.1MB. Free memory was 554.8MB in the beginning and 552.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 06:25:06,992 INFO L158 Benchmark]: Boogie Preprocessor took 32.53ms. Allocated memory is still 629.1MB. Free memory was 552.7MB in the beginning and 551.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 06:25:06,992 INFO L158 Benchmark]: RCFGBuilder took 380.55ms. Allocated memory is still 629.1MB. Free memory was 551.3MB in the beginning and 535.2MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-11-30 06:25:06,993 INFO L158 Benchmark]: TraceAbstraction took 170079.87ms. Allocated memory was 629.1MB in the beginning and 13.7GB in the end (delta: 13.1GB). Free memory was 534.5MB in the beginning and 10.0GB in the end (delta: -9.5GB). Peak memory consumption was 3.8GB. Max. memory is 16.0GB. [2023-11-30 06:25:06,994 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 320.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 478.08ms. Allocated memory is still 629.1MB. Free memory was 574.4MB in the beginning and 554.8MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 50.25ms. Allocated memory is still 629.1MB. Free memory was 554.8MB in the beginning and 552.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.53ms. Allocated memory is still 629.1MB. Free memory was 552.7MB in the beginning and 551.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 380.55ms. Allocated memory is still 629.1MB. Free memory was 551.3MB in the beginning and 535.2MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 170079.87ms. Allocated memory was 629.1MB in the beginning and 13.7GB in the end (delta: 13.1GB). Free memory was 534.5MB in the beginning and 10.0GB in the end (delta: -9.5GB). Peak memory consumption was 3.8GB. 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: 170.0s, OverallIterations: 20, TraceHistogramMax: 23, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 158.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9148 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9148 mSDsluCounter, 819 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 722 mSDsCounter, 206 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11258 IncrementalHoareTripleChecker+Invalid, 11464 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 206 mSolverCounterUnsat, 97 mSDtfsCounter, 11258 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3399 GetRequests, 1564 SyntacticMatches, 40 SemanticMatches, 1795 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1238247 ImplicationChecksByTransitivity, 45.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=485172occurred in iteration=20, InterpolantAutomatonStates: 1647, 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.5s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 2048 NumberOfCodeBlocks, 2039 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 2794 ConstructedInterpolants, 0 QuantifiedInterpolants, 7510 SizeOfPredicates, 91 NumberOfNonLiveVariables, 1871 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 34 InterpolantComputations, 14 PerfectInterpolantSequences, 5814/12521 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:25:07,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...