/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/goblint-regression/28-race_reach_60-invariant_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 08:00:46,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 08:00:46,459 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 08:00:46,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 08:00:46,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 08:00:46,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 08:00:46,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 08:00:46,484 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 08:00:46,485 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 08:00:46,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 08:00:46,488 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 08:00:46,488 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 08:00:46,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 08:00:46,489 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 08:00:46,489 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 08:00:46,489 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 08:00:46,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 08:00:46,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 08:00:46,490 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 08:00:46,490 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 08:00:46,490 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 08:00:46,491 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 08:00:46,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 08:00:46,491 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 08:00:46,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 08:00:46,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 08:00:46,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 08:00:46,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 08:00:46,492 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 08:00:46,492 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 08:00:46,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 08:00:46,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 08:00:46,493 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 08:00:46,493 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 08:00:46,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 08:00:46,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 08:00:46,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 08:00:46,690 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 08:00:46,690 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 08:00:46,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_60-invariant_racefree.i [2023-11-30 08:00:47,641 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 08:00:47,837 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 08:00:47,838 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_60-invariant_racefree.i [2023-11-30 08:00:47,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77b056778/d9cc98305a0a4768936c6eca48ccdc0d/FLAGde91effb8 [2023-11-30 08:00:47,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77b056778/d9cc98305a0a4768936c6eca48ccdc0d [2023-11-30 08:00:47,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 08:00:47,867 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 08:00:47,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 08:00:47,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 08:00:47,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 08:00:47,872 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 08:00:47" (1/1) ... [2023-11-30 08:00:47,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f0f80c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:00:47, skipping insertion in model container [2023-11-30 08:00:47,873 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 08:00:47" (1/1) ... [2023-11-30 08:00:47,919 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 08:00:48,162 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 08:00:48,177 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 08:00:48,218 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 08:00:48,247 INFO L206 MainTranslator]: Completed translation [2023-11-30 08:00:48,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:00:48 WrapperNode [2023-11-30 08:00:48,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 08:00:48,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 08:00:48,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 08:00:48,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 08:00:48,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:00:48" (1/1) ... [2023-11-30 08:00:48,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:00:48" (1/1) ... [2023-11-30 08:00:48,308 INFO L138 Inliner]: procedures = 171, calls = 44, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 186 [2023-11-30 08:00:48,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 08:00:48,309 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 08:00:48,309 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 08:00:48,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 08:00:48,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:00:48" (1/1) ... [2023-11-30 08:00:48,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:00:48" (1/1) ... [2023-11-30 08:00:48,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:00:48" (1/1) ... [2023-11-30 08:00:48,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:00:48" (1/1) ... [2023-11-30 08:00:48,334 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:00:48" (1/1) ... [2023-11-30 08:00:48,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:00:48" (1/1) ... [2023-11-30 08:00:48,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:00:48" (1/1) ... [2023-11-30 08:00:48,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:00:48" (1/1) ... [2023-11-30 08:00:48,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 08:00:48,352 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 08:00:48,353 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 08:00:48,353 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 08:00:48,353 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:00:48" (1/1) ... [2023-11-30 08:00:48,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 08:00:48,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 08:00:48,375 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 08:00:48,380 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 08:00:48,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 08:00:48,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 08:00:48,396 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-30 08:00:48,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 08:00:48,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 08:00:48,396 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-30 08:00:48,396 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-30 08:00:48,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 08:00:48,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 08:00:48,396 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-30 08:00:48,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 08:00:48,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 08:00:48,397 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 08:00:48,487 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 08:00:48,489 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 08:00:48,690 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 08:00:48,743 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 08:00:48,744 INFO L309 CfgBuilder]: Removed 18 assume(true) statements. [2023-11-30 08:00:48,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 08:00:48 BoogieIcfgContainer [2023-11-30 08:00:48,745 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 08:00:48,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 08:00:48,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 08:00:48,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 08:00:48,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 08:00:47" (1/3) ... [2023-11-30 08:00:48,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0e0467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 08:00:48, skipping insertion in model container [2023-11-30 08:00:48,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:00:48" (2/3) ... [2023-11-30 08:00:48,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0e0467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 08:00:48, skipping insertion in model container [2023-11-30 08:00:48,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 08:00:48" (3/3) ... [2023-11-30 08:00:48,750 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_60-invariant_racefree.i [2023-11-30 08:00:48,762 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 08:00:48,762 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-11-30 08:00:48,762 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 08:00:48,836 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-30 08:00:48,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 185 transitions, 377 flow [2023-11-30 08:00:48,933 INFO L124 PetriNetUnfolderBase]: 36/261 cut-off events. [2023-11-30 08:00:48,933 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 08:00:48,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 261 events. 36/261 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 997 event pairs, 0 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 149. Up to 6 conditions per place. [2023-11-30 08:00:48,940 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 185 transitions, 377 flow [2023-11-30 08:00:48,944 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 182 transitions, 371 flow [2023-11-30 08:00:48,951 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 08:00:48,955 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;@26cd091d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 08:00:48,955 INFO L363 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-11-30 08:00:48,969 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 08:00:48,969 INFO L124 PetriNetUnfolderBase]: 3/59 cut-off events. [2023-11-30 08:00:48,969 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 08:00:48,969 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:00:48,970 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, 1, 1] [2023-11-30 08:00:48,970 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-30 08:00:48,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:00:48,974 INFO L85 PathProgramCache]: Analyzing trace with hash -598594419, now seen corresponding path program 1 times [2023-11-30 08:00:48,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:00:48,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724628514] [2023-11-30 08:00:48,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:00:48,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:00:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:00:49,184 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 08:00:49,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:00:49,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724628514] [2023-11-30 08:00:49,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724628514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:00:49,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:00:49,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 08:00:49,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082559117] [2023-11-30 08:00:49,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:00:49,192 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 08:00:49,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:00:49,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 08:00:49,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 08:00:49,217 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 185 [2023-11-30 08:00:49,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 182 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 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 08:00:49,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:00:49,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 185 [2023-11-30 08:00:49,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:00:49,406 INFO L124 PetriNetUnfolderBase]: 137/919 cut-off events. [2023-11-30 08:00:49,406 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-30 08:00:49,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1225 conditions, 919 events. 137/919 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5836 event pairs, 9 based on Foata normal form. 185/1008 useless extension candidates. Maximal degree in co-relation 1167. Up to 269 conditions per place. [2023-11-30 08:00:49,415 INFO L140 encePairwiseOnDemand]: 160/185 looper letters, 37 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2023-11-30 08:00:49,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 165 transitions, 415 flow [2023-11-30 08:00:49,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 08:00:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 08:00:49,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2023-11-30 08:00:49,431 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8504504504504504 [2023-11-30 08:00:49,432 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2023-11-30 08:00:49,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2023-11-30 08:00:49,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:00:49,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2023-11-30 08:00:49,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 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 08:00:49,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 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 08:00:49,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 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 08:00:49,448 INFO L307 CegarLoopForPetriNet]: 162 programPoint places, -4 predicate places. [2023-11-30 08:00:49,448 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 165 transitions, 415 flow [2023-11-30 08:00:49,449 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 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 08:00:49,449 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:00:49,449 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, 1, 1] [2023-11-30 08:00:49,449 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 08:00:49,449 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-30 08:00:49,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:00:49,450 INFO L85 PathProgramCache]: Analyzing trace with hash -803816586, now seen corresponding path program 1 times [2023-11-30 08:00:49,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:00:49,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345786976] [2023-11-30 08:00:49,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:00:49,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:00:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:00:49,583 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 08:00:49,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:00:49,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345786976] [2023-11-30 08:00:49,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345786976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:00:49,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:00:49,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 08:00:49,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017534068] [2023-11-30 08:00:49,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:00:49,586 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 08:00:49,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:00:49,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 08:00:49,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 08:00:49,588 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 185 [2023-11-30 08:00:49,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 165 transitions, 415 flow. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 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 08:00:49,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:00:49,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 185 [2023-11-30 08:00:49,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:00:49,834 INFO L124 PetriNetUnfolderBase]: 164/927 cut-off events. [2023-11-30 08:00:49,834 INFO L125 PetriNetUnfolderBase]: For 148/180 co-relation queries the response was YES. [2023-11-30 08:00:49,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1621 conditions, 927 events. 164/927 cut-off events. For 148/180 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5964 event pairs, 0 based on Foata normal form. 10/854 useless extension candidates. Maximal degree in co-relation 1552. Up to 279 conditions per place. [2023-11-30 08:00:49,839 INFO L140 encePairwiseOnDemand]: 179/185 looper letters, 56 selfloop transitions, 4 changer transitions 0/181 dead transitions. [2023-11-30 08:00:49,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 181 transitions, 603 flow [2023-11-30 08:00:49,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 08:00:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 08:00:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 702 transitions. [2023-11-30 08:00:49,841 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7589189189189189 [2023-11-30 08:00:49,841 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 702 transitions. [2023-11-30 08:00:49,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 702 transitions. [2023-11-30 08:00:49,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:00:49,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 702 transitions. [2023-11-30 08:00:49,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.4) internal successors, (702), 5 states have internal predecessors, (702), 0 states have call successors, (0), 0 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 08:00:49,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 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 08:00:49,845 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 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 08:00:49,846 INFO L307 CegarLoopForPetriNet]: 162 programPoint places, -2 predicate places. [2023-11-30 08:00:49,846 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 181 transitions, 603 flow [2023-11-30 08:00:49,846 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 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 08:00:49,846 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:00:49,846 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 08:00:49,847 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 08:00:49,847 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-30 08:00:49,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:00:49,848 INFO L85 PathProgramCache]: Analyzing trace with hash 352459762, now seen corresponding path program 1 times [2023-11-30 08:00:49,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:00:49,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032066928] [2023-11-30 08:00:49,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:00:49,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:00:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:00:49,923 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 08:00:49,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:00:49,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032066928] [2023-11-30 08:00:49,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032066928] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:00:49,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:00:49,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 08:00:49,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049550527] [2023-11-30 08:00:49,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:00:49,924 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 08:00:49,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:00:49,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 08:00:49,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 08:00:49,925 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 185 [2023-11-30 08:00:49,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 181 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 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 08:00:49,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:00:49,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 185 [2023-11-30 08:00:49,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:00:50,076 INFO L124 PetriNetUnfolderBase]: 252/1326 cut-off events. [2023-11-30 08:00:50,077 INFO L125 PetriNetUnfolderBase]: For 708/785 co-relation queries the response was YES. [2023-11-30 08:00:50,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2625 conditions, 1326 events. 252/1326 cut-off events. For 708/785 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 9407 event pairs, 108 based on Foata normal form. 2/1191 useless extension candidates. Maximal degree in co-relation 2546. Up to 359 conditions per place. [2023-11-30 08:00:50,082 INFO L140 encePairwiseOnDemand]: 180/185 looper letters, 56 selfloop transitions, 4 changer transitions 0/182 dead transitions. [2023-11-30 08:00:50,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 182 transitions, 712 flow [2023-11-30 08:00:50,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 08:00:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 08:00:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2023-11-30 08:00:50,087 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7855855855855856 [2023-11-30 08:00:50,087 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2023-11-30 08:00:50,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2023-11-30 08:00:50,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:00:50,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2023-11-30 08:00:50,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 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 08:00:50,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 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 08:00:50,090 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 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 08:00:50,091 INFO L307 CegarLoopForPetriNet]: 162 programPoint places, 0 predicate places. [2023-11-30 08:00:50,091 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 182 transitions, 712 flow [2023-11-30 08:00:50,091 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 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 08:00:50,091 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:00:50,091 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, 1, 1, 1, 1] [2023-11-30 08:00:50,092 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 08:00:50,092 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-30 08:00:50,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:00:50,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1627973925, now seen corresponding path program 1 times [2023-11-30 08:00:50,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:00:50,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500537209] [2023-11-30 08:00:50,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:00:50,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:00:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 08:00:50,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 08:00:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 08:00:50,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 08:00:50,158 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 08:00:50,159 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2023-11-30 08:00:50,161 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2023-11-30 08:00:50,161 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2023-11-30 08:00:50,161 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2023-11-30 08:00:50,165 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2023-11-30 08:00:50,165 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2023-11-30 08:00:50,166 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2023-11-30 08:00:50,167 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2023-11-30 08:00:50,167 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2023-11-30 08:00:50,167 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2023-11-30 08:00:50,167 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2023-11-30 08:00:50,167 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2023-11-30 08:00:50,167 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2023-11-30 08:00:50,167 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2023-11-30 08:00:50,168 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2023-11-30 08:00:50,168 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2023-11-30 08:00:50,168 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2023-11-30 08:00:50,168 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 08:00:50,168 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-30 08:00:50,170 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 08:00:50,171 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-30 08:00:50,213 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 08:00:50,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 251 transitions, 518 flow [2023-11-30 08:00:50,262 INFO L124 PetriNetUnfolderBase]: 62/441 cut-off events. [2023-11-30 08:00:50,262 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-30 08:00:50,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 441 events. 62/441 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1912 event pairs, 0 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 263. Up to 9 conditions per place. [2023-11-30 08:00:50,265 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 251 transitions, 518 flow [2023-11-30 08:00:50,269 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 251 transitions, 518 flow [2023-11-30 08:00:50,270 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 08:00:50,272 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;@26cd091d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 08:00:50,272 INFO L363 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2023-11-30 08:00:50,277 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 08:00:50,277 INFO L124 PetriNetUnfolderBase]: 3/61 cut-off events. [2023-11-30 08:00:50,277 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 08:00:50,278 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:00:50,278 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, 1, 1] [2023-11-30 08:00:50,278 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-11-30 08:00:50,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:00:50,279 INFO L85 PathProgramCache]: Analyzing trace with hash 809861613, now seen corresponding path program 1 times [2023-11-30 08:00:50,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:00:50,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695567238] [2023-11-30 08:00:50,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:00:50,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:00:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:00:50,314 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 08:00:50,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:00:50,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695567238] [2023-11-30 08:00:50,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695567238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:00:50,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:00:50,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 08:00:50,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900685660] [2023-11-30 08:00:50,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:00:50,315 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 08:00:50,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:00:50,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 08:00:50,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 08:00:50,317 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 251 [2023-11-30 08:00:50,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 251 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 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 08:00:50,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:00:50,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 251 [2023-11-30 08:00:50,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:00:51,598 INFO L124 PetriNetUnfolderBase]: 3127/12679 cut-off events. [2023-11-30 08:00:51,598 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2023-11-30 08:00:51,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17486 conditions, 12679 events. 3127/12679 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 145937 event pairs, 1377 based on Foata normal form. 3174/14414 useless extension candidates. Maximal degree in co-relation 1958. Up to 4718 conditions per place. [2023-11-30 08:00:51,659 INFO L140 encePairwiseOnDemand]: 216/251 looper letters, 50 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2023-11-30 08:00:51,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 223 transitions, 566 flow [2023-11-30 08:00:51,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 08:00:51,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 08:00:51,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2023-11-30 08:00:51,661 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8326693227091634 [2023-11-30 08:00:51,661 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 627 transitions. [2023-11-30 08:00:51,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 627 transitions. [2023-11-30 08:00:51,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:00:51,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 627 transitions. [2023-11-30 08:00:51,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 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 08:00:51,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 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 08:00:51,664 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 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 08:00:51,665 INFO L307 CegarLoopForPetriNet]: 220 programPoint places, -7 predicate places. [2023-11-30 08:00:51,665 INFO L500 AbstractCegarLoop]: Abstraction has has 213 places, 223 transitions, 566 flow [2023-11-30 08:00:51,665 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 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 08:00:51,665 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:00:51,665 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, 1, 1] [2023-11-30 08:00:51,665 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 08:00:51,665 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-11-30 08:00:51,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:00:51,666 INFO L85 PathProgramCache]: Analyzing trace with hash 663744790, now seen corresponding path program 1 times [2023-11-30 08:00:51,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:00:51,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956302660] [2023-11-30 08:00:51,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:00:51,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:00:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:00:51,700 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 08:00:51,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:00:51,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956302660] [2023-11-30 08:00:51,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956302660] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:00:51,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:00:51,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 08:00:51,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915019663] [2023-11-30 08:00:51,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:00:51,702 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 08:00:51,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:00:51,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 08:00:51,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 08:00:51,703 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 251 [2023-11-30 08:00:51,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 223 transitions, 566 flow. Second operand has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:00:51,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:00:51,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 251 [2023-11-30 08:00:51,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:00:52,898 INFO L124 PetriNetUnfolderBase]: 3913/12806 cut-off events. [2023-11-30 08:00:52,898 INFO L125 PetriNetUnfolderBase]: For 2514/3968 co-relation queries the response was YES. [2023-11-30 08:00:52,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24747 conditions, 12806 events. 3913/12806 cut-off events. For 2514/3968 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 139686 event pairs, 2714 based on Foata normal form. 7/11201 useless extension candidates. Maximal degree in co-relation 2963. Up to 6118 conditions per place. [2023-11-30 08:00:52,964 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 74 selfloop transitions, 4 changer transitions 0/244 dead transitions. [2023-11-30 08:00:52,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 244 transitions, 800 flow [2023-11-30 08:00:52,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 08:00:52,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 08:00:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 940 transitions. [2023-11-30 08:00:52,967 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.749003984063745 [2023-11-30 08:00:52,967 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 940 transitions. [2023-11-30 08:00:52,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 940 transitions. [2023-11-30 08:00:52,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:00:52,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 940 transitions. [2023-11-30 08:00:52,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 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 08:00:52,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 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 08:00:52,972 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 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 08:00:52,974 INFO L307 CegarLoopForPetriNet]: 220 programPoint places, -3 predicate places. [2023-11-30 08:00:52,974 INFO L500 AbstractCegarLoop]: Abstraction has has 217 places, 244 transitions, 800 flow [2023-11-30 08:00:52,975 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:00:52,975 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:00:52,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 08:00:52,975 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 08:00:52,975 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-11-30 08:00:52,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:00:52,975 INFO L85 PathProgramCache]: Analyzing trace with hash 918733101, now seen corresponding path program 1 times [2023-11-30 08:00:52,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:00:52,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106191987] [2023-11-30 08:00:52,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:00:52,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:00:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:00:53,011 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 08:00:53,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:00:53,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106191987] [2023-11-30 08:00:53,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106191987] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:00:53,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:00:53,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 08:00:53,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315687659] [2023-11-30 08:00:53,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:00:53,012 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 08:00:53,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:00:53,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 08:00:53,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 08:00:53,013 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 251 [2023-11-30 08:00:53,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 244 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 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 08:00:53,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:00:53,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 251 [2023-11-30 08:00:53,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:00:55,765 INFO L124 PetriNetUnfolderBase]: 9640/29711 cut-off events. [2023-11-30 08:00:55,765 INFO L125 PetriNetUnfolderBase]: For 18580/21131 co-relation queries the response was YES. [2023-11-30 08:00:55,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64854 conditions, 29711 events. 9640/29711 cut-off events. For 18580/21131 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 359829 event pairs, 4395 based on Foata normal form. 15/26627 useless extension candidates. Maximal degree in co-relation 42209. Up to 10199 conditions per place. [2023-11-30 08:00:55,917 INFO L140 encePairwiseOnDemand]: 240/251 looper letters, 94 selfloop transitions, 9 changer transitions 0/270 dead transitions. [2023-11-30 08:00:55,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 270 transitions, 1108 flow [2023-11-30 08:00:55,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 08:00:55,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 08:00:55,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions. [2023-11-30 08:00:55,919 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7848605577689243 [2023-11-30 08:00:55,919 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 591 transitions. [2023-11-30 08:00:55,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 591 transitions. [2023-11-30 08:00:55,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:00:55,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 591 transitions. [2023-11-30 08:00:55,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 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 08:00:55,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 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 08:00:55,922 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 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 08:00:55,923 INFO L307 CegarLoopForPetriNet]: 220 programPoint places, -1 predicate places. [2023-11-30 08:00:55,923 INFO L500 AbstractCegarLoop]: Abstraction has has 219 places, 270 transitions, 1108 flow [2023-11-30 08:00:55,924 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 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 08:00:55,924 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:00:55,924 INFO L232 CegarLoopForPetriNet]: trace histogram [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] [2023-11-30 08:00:55,924 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 08:00:55,924 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-11-30 08:00:55,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:00:55,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1875782440, now seen corresponding path program 1 times [2023-11-30 08:00:55,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:00:55,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637658855] [2023-11-30 08:00:55,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:00:55,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:00:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:00:55,999 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:00:55,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:00:55,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637658855] [2023-11-30 08:00:56,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637658855] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 08:00:56,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911312323] [2023-11-30 08:00:56,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:00:56,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:00:56,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 08:00:56,005 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 08:00:56,037 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 08:00:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:00:56,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 08:00:56,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 08:00:56,148 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:00:56,148 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 08:00:56,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911312323] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:00:56,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 08:00:56,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-11-30 08:00:56,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947792131] [2023-11-30 08:00:56,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:00:56,150 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 08:00:56,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:00:56,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 08:00:56,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-30 08:00:56,153 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 251 [2023-11-30 08:00:56,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 270 transitions, 1108 flow. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 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 08:00:56,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:00:56,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 251 [2023-11-30 08:00:56,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:00:58,775 INFO L124 PetriNetUnfolderBase]: 9544/29850 cut-off events. [2023-11-30 08:00:58,776 INFO L125 PetriNetUnfolderBase]: For 35243/38786 co-relation queries the response was YES. [2023-11-30 08:00:58,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74610 conditions, 29850 events. 9544/29850 cut-off events. For 35243/38786 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 362910 event pairs, 4006 based on Foata normal form. 37/26980 useless extension candidates. Maximal degree in co-relation 48479. Up to 10002 conditions per place. [2023-11-30 08:00:59,147 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 98 selfloop transitions, 6 changer transitions 0/285 dead transitions. [2023-11-30 08:00:59,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 285 transitions, 1440 flow [2023-11-30 08:00:59,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 08:00:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 08:00:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 748 transitions. [2023-11-30 08:00:59,149 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7450199203187251 [2023-11-30 08:00:59,149 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 748 transitions. [2023-11-30 08:00:59,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 748 transitions. [2023-11-30 08:00:59,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:00:59,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 748 transitions. [2023-11-30 08:00:59,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:00:59,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 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 08:00:59,152 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 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 08:00:59,153 INFO L307 CegarLoopForPetriNet]: 220 programPoint places, 1 predicate places. [2023-11-30 08:00:59,153 INFO L500 AbstractCegarLoop]: Abstraction has has 221 places, 285 transitions, 1440 flow [2023-11-30 08:00:59,153 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 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 08:00:59,153 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:00:59,153 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 08:00:59,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-30 08:00:59,358 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:00:59,358 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-11-30 08:00:59,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:00:59,358 INFO L85 PathProgramCache]: Analyzing trace with hash 2020975742, now seen corresponding path program 1 times [2023-11-30 08:00:59,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:00:59,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840362942] [2023-11-30 08:00:59,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:00:59,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:00:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:00:59,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:00:59,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:00:59,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840362942] [2023-11-30 08:00:59,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840362942] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 08:00:59,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152537285] [2023-11-30 08:00:59,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:00:59,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:00:59,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 08:00:59,448 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 08:00:59,488 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 08:00:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:00:59,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 08:00:59,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 08:00:59,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:00:59,582 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 08:00:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:00:59,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152537285] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 08:00:59,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 08:00:59,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-30 08:00:59,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855137501] [2023-11-30 08:00:59,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 08:00:59,614 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-30 08:00:59,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:00:59,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-30 08:00:59,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-30 08:00:59,615 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 251 [2023-11-30 08:00:59,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 285 transitions, 1440 flow. Second operand has 10 states, 10 states have (on average 175.2) internal successors, (1752), 10 states have internal predecessors, (1752), 0 states have call successors, (0), 0 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 08:00:59,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:00:59,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 251 [2023-11-30 08:00:59,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:00:59,777 INFO L124 PetriNetUnfolderBase]: 575/1324 cut-off events. [2023-11-30 08:00:59,777 INFO L125 PetriNetUnfolderBase]: For 2623/4119 co-relation queries the response was YES. [2023-11-30 08:00:59,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5563 conditions, 1324 events. 575/1324 cut-off events. For 2623/4119 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8918 event pairs, 54 based on Foata normal form. 65/1242 useless extension candidates. Maximal degree in co-relation 2606. Up to 882 conditions per place. [2023-11-30 08:00:59,784 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 57 selfloop transitions, 7 changer transitions 0/128 dead transitions. [2023-11-30 08:00:59,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 128 transitions, 868 flow [2023-11-30 08:00:59,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 08:00:59,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 08:00:59,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1615 transitions. [2023-11-30 08:00:59,790 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7149181053563524 [2023-11-30 08:00:59,790 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1615 transitions. [2023-11-30 08:00:59,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1615 transitions. [2023-11-30 08:00:59,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:00:59,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1615 transitions. [2023-11-30 08:00:59,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 179.44444444444446) internal successors, (1615), 9 states have internal predecessors, (1615), 0 states have call successors, (0), 0 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 08:00:59,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 251.0) internal successors, (2510), 10 states have internal predecessors, (2510), 0 states have call successors, (0), 0 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 08:00:59,798 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 251.0) internal successors, (2510), 10 states have internal predecessors, (2510), 0 states have call successors, (0), 0 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 08:00:59,799 INFO L307 CegarLoopForPetriNet]: 220 programPoint places, -113 predicate places. [2023-11-30 08:00:59,799 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 128 transitions, 868 flow [2023-11-30 08:00:59,799 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 175.2) internal successors, (1752), 10 states have internal predecessors, (1752), 0 states have call successors, (0), 0 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 08:00:59,799 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:00:59,800 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2023-11-30 08:00:59,822 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 08:01:00,004 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,SelfDestructingSolverStorable8 [2023-11-30 08:01:00,005 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-11-30 08:01:00,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:01:00,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1886325609, now seen corresponding path program 1 times [2023-11-30 08:01:00,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:01:00,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201569736] [2023-11-30 08:01:00,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:01:00,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:01:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 08:01:00,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 08:01:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 08:01:00,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 08:01:00,036 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 08:01:00,036 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2023-11-30 08:01:00,036 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2023-11-30 08:01:00,036 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2023-11-30 08:01:00,036 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2023-11-30 08:01:00,036 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2023-11-30 08:01:00,036 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2023-11-30 08:01:00,037 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2023-11-30 08:01:00,037 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2023-11-30 08:01:00,037 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2023-11-30 08:01:00,037 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2023-11-30 08:01:00,037 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2023-11-30 08:01:00,037 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2023-11-30 08:01:00,037 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2023-11-30 08:01:00,037 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2023-11-30 08:01:00,037 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2023-11-30 08:01:00,037 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2023-11-30 08:01:00,038 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2023-11-30 08:01:00,038 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2023-11-30 08:01:00,038 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2023-11-30 08:01:00,038 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2023-11-30 08:01:00,038 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2023-11-30 08:01:00,038 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 08:01:00,038 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-30 08:01:00,039 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 08:01:00,039 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-30 08:01:00,067 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-30 08:01:00,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 317 transitions, 661 flow [2023-11-30 08:01:00,118 INFO L124 PetriNetUnfolderBase]: 93/664 cut-off events. [2023-11-30 08:01:00,118 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-30 08:01:00,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 664 events. 93/664 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3039 event pairs, 1 based on Foata normal form. 0/519 useless extension candidates. Maximal degree in co-relation 449. Up to 16 conditions per place. [2023-11-30 08:01:00,125 INFO L82 GeneralOperation]: Start removeDead. Operand has 276 places, 317 transitions, 661 flow [2023-11-30 08:01:00,130 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 276 places, 317 transitions, 661 flow [2023-11-30 08:01:00,131 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 08:01:00,131 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;@26cd091d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 08:01:00,131 INFO L363 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2023-11-30 08:01:00,133 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 08:01:00,133 INFO L124 PetriNetUnfolderBase]: 3/59 cut-off events. [2023-11-30 08:01:00,133 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 08:01:00,133 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:01:00,133 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, 1, 1] [2023-11-30 08:01:00,134 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2023-11-30 08:01:00,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:01:00,134 INFO L85 PathProgramCache]: Analyzing trace with hash 860414861, now seen corresponding path program 1 times [2023-11-30 08:01:00,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:01:00,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920515533] [2023-11-30 08:01:00,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:01:00,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:01:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:01:00,174 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 08:01:00,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:01:00,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920515533] [2023-11-30 08:01:00,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920515533] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:01:00,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:01:00,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 08:01:00,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682791499] [2023-11-30 08:01:00,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:01:00,176 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 08:01:00,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:01:00,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 08:01:00,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 08:01:00,177 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 317 [2023-11-30 08:01:00,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 317 transitions, 661 flow. Second operand has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 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 08:01:00,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:01:00,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 317 [2023-11-30 08:01:00,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:01:14,148 INFO L124 PetriNetUnfolderBase]: 48137/147446 cut-off events. [2023-11-30 08:01:14,148 INFO L125 PetriNetUnfolderBase]: For 2026/2026 co-relation queries the response was YES. [2023-11-30 08:01:14,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212892 conditions, 147446 events. 48137/147446 cut-off events. For 2026/2026 co-relation queries the response was YES. Maximal size of possible extension queue 3397. Compared 2207225 event pairs, 29935 based on Foata normal form. 44775/176946 useless extension candidates. Maximal degree in co-relation 17760. Up to 64596 conditions per place. [2023-11-30 08:01:15,675 INFO L140 encePairwiseOnDemand]: 272/317 looper letters, 61 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2023-11-30 08:01:15,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 276 transitions, 705 flow [2023-11-30 08:01:15,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 08:01:15,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 08:01:15,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2023-11-30 08:01:15,678 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8201892744479495 [2023-11-30 08:01:15,678 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 780 transitions. [2023-11-30 08:01:15,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 780 transitions. [2023-11-30 08:01:15,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:01:15,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 780 transitions. [2023-11-30 08:01:15,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 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 08:01:15,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 0 states have call successors, (0), 0 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 08:01:15,682 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 0 states have call successors, (0), 0 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 08:01:15,682 INFO L307 CegarLoopForPetriNet]: 276 programPoint places, -10 predicate places. [2023-11-30 08:01:15,682 INFO L500 AbstractCegarLoop]: Abstraction has has 266 places, 276 transitions, 705 flow [2023-11-30 08:01:15,682 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 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 08:01:15,682 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:01:15,683 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, 1, 1] [2023-11-30 08:01:15,683 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 08:01:15,683 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2023-11-30 08:01:15,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:01:15,683 INFO L85 PathProgramCache]: Analyzing trace with hash 773403382, now seen corresponding path program 1 times [2023-11-30 08:01:15,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:01:15,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891297578] [2023-11-30 08:01:15,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:01:15,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:01:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:01:15,709 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 08:01:15,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:01:15,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891297578] [2023-11-30 08:01:15,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891297578] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:01:15,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:01:15,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 08:01:15,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143914213] [2023-11-30 08:01:15,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:01:15,710 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 08:01:15,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:01:15,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 08:01:15,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 08:01:15,711 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 317 [2023-11-30 08:01:15,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 276 transitions, 705 flow. Second operand has 4 states, 4 states have (on average 217.75) internal successors, (871), 4 states have internal predecessors, (871), 0 states have call successors, (0), 0 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 08:01:15,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:01:15,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 317 [2023-11-30 08:01:15,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:01:34,223 INFO L124 PetriNetUnfolderBase]: 63024/185287 cut-off events. [2023-11-30 08:01:34,223 INFO L125 PetriNetUnfolderBase]: For 26259/34235 co-relation queries the response was YES. [2023-11-30 08:01:35,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349871 conditions, 185287 events. 63024/185287 cut-off events. For 26259/34235 co-relation queries the response was YES. Maximal size of possible extension queue 4678. Compared 2819385 event pairs, 44094 based on Foata normal form. 7/165339 useless extension candidates. Maximal degree in co-relation 28215. Up to 84508 conditions per place. [2023-11-30 08:01:35,979 INFO L140 encePairwiseOnDemand]: 311/317 looper letters, 85 selfloop transitions, 4 changer transitions 0/297 dead transitions. [2023-11-30 08:01:35,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 297 transitions, 961 flow [2023-11-30 08:01:35,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 08:01:35,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 08:01:35,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1171 transitions. [2023-11-30 08:01:35,981 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.738801261829653 [2023-11-30 08:01:35,981 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1171 transitions. [2023-11-30 08:01:35,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1171 transitions. [2023-11-30 08:01:35,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:01:35,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1171 transitions. [2023-11-30 08:01:35,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 234.2) internal successors, (1171), 5 states have internal predecessors, (1171), 0 states have call successors, (0), 0 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 08:01:35,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 317.0) internal successors, (1902), 6 states have internal predecessors, (1902), 0 states have call successors, (0), 0 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 08:01:35,987 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 317.0) internal successors, (1902), 6 states have internal predecessors, (1902), 0 states have call successors, (0), 0 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 08:01:35,987 INFO L307 CegarLoopForPetriNet]: 276 programPoint places, -6 predicate places. [2023-11-30 08:01:35,987 INFO L500 AbstractCegarLoop]: Abstraction has has 270 places, 297 transitions, 961 flow [2023-11-30 08:01:35,988 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 217.75) internal successors, (871), 4 states have internal predecessors, (871), 0 states have call successors, (0), 0 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 08:01:35,988 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:01:35,988 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 08:01:35,988 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 08:01:35,988 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2023-11-30 08:01:35,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:01:35,988 INFO L85 PathProgramCache]: Analyzing trace with hash 877064746, now seen corresponding path program 1 times [2023-11-30 08:01:35,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:01:35,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539043820] [2023-11-30 08:01:35,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:01:35,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:01:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:01:36,017 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 08:01:36,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:01:36,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539043820] [2023-11-30 08:01:36,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539043820] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:01:36,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:01:36,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 08:01:36,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573837906] [2023-11-30 08:01:36,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:01:36,019 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 08:01:36,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:01:36,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 08:01:36,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 08:01:36,020 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 317 [2023-11-30 08:01:36,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 297 transitions, 961 flow. Second operand has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 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 08:01:36,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:01:36,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 317 [2023-11-30 08:01:36,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:02:45,895 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1299] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} AuxVars[] AssignedVars[][335], [t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, 101#L716-5true, t_funThread3of3ForFork0NotInUse, 292#(= ~x~0 0), 283#true, 134#L702-12true, 279#true]) [2023-11-30 08:02:45,895 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2023-11-30 08:02:45,895 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-30 08:02:45,895 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-30 08:02:45,910 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 08:02:45,947 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1298] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_12|} AuxVars[] AssignedVars[][318], [t_funThread1of3ForFork0NotInUse, t_funThread2of3ForFork0InUse, 101#L716-5true, t_funThread3of3ForFork0NotInUse, 236#L702-12true, 292#(= ~x~0 0), 283#true, 279#true]) [2023-11-30 08:02:45,947 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2023-11-30 08:02:45,947 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 08:02:45,947 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-30 08:02:45,948 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-30 08:02:46,092 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1299] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} AuxVars[] AssignedVars[][335], [17#L702-3true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, 101#L716-5true, t_funThread3of3ForFork0NotInUse, 292#(= ~x~0 0), 283#true, 279#true]) [2023-11-30 08:02:46,092 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2023-11-30 08:02:46,092 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 08:02:46,092 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-30 08:02:46,092 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-30 08:02:46,166 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1298] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_12|} AuxVars[] AssignedVars[][318], [t_funThread1of3ForFork0NotInUse, t_funThread2of3ForFork0InUse, 101#L716-5true, t_funThread3of3ForFork0NotInUse, 292#(= ~x~0 0), 283#true, 226#L702-3true, 279#true]) [2023-11-30 08:02:46,166 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2023-11-30 08:02:46,166 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 08:02:46,166 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-30 08:02:46,166 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-30 08:02:46,383 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1299] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} AuxVars[] AssignedVars[][335], [t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, 101#L716-5true, t_funThread3of3ForFork0NotInUse, 181#L702-5true, 292#(= ~x~0 0), 283#true, 279#true]) [2023-11-30 08:02:46,396 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2023-11-30 08:02:46,396 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 08:02:46,396 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-30 08:02:46,396 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-30 08:02:46,459 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1298] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_12|} AuxVars[] AssignedVars[][318], [t_funThread1of3ForFork0NotInUse, t_funThread2of3ForFork0InUse, 101#L716-5true, t_funThread3of3ForFork0NotInUse, 292#(= ~x~0 0), 283#true, 107#L702-5true, 279#true]) [2023-11-30 08:02:46,459 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2023-11-30 08:02:46,459 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 08:02:46,459 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-30 08:02:46,459 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-30 08:02:47,736 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1299] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} AuxVars[] AssignedVars[][335], [t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, 101#L716-5true, t_funThread3of3ForFork0NotInUse, 292#(= ~x~0 0), 283#true, 77#L702-10true, 279#true]) [2023-11-30 08:02:47,736 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2023-11-30 08:02:47,736 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2023-11-30 08:02:47,736 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2023-11-30 08:02:47,736 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-30 08:02:47,763 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1298] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_12|} AuxVars[] AssignedVars[][318], [t_funThread1of3ForFork0NotInUse, t_funThread2of3ForFork0InUse, 101#L716-5true, t_funThread3of3ForFork0NotInUse, 292#(= ~x~0 0), 283#true, 198#L702-10true, 279#true]) [2023-11-30 08:02:47,763 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2023-11-30 08:02:47,763 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2023-11-30 08:02:47,763 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2023-11-30 08:02:47,764 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-30 08:02:48,017 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1299] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_14|} AuxVars[] AssignedVars[][335], [t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, 101#L716-5true, 83#L703-2true, t_funThread3of3ForFork0NotInUse, 292#(= ~x~0 0), 283#true, 279#true]) [2023-11-30 08:02:48,018 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2023-11-30 08:02:48,018 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2023-11-30 08:02:48,018 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-30 08:02:48,018 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-30 08:02:48,030 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1298] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_12|} AuxVars[] AssignedVars[][318], [t_funThread1of3ForFork0NotInUse, 101#L716-5true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 292#(= ~x~0 0), 283#true, 7#L703-2true, 279#true]) [2023-11-30 08:02:48,030 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2023-11-30 08:02:48,030 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-30 08:02:48,030 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2023-11-30 08:02:48,030 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-30 08:02:48,259 INFO L124 PetriNetUnfolderBase]: 260269/622147 cut-off events. [2023-11-30 08:02:48,259 INFO L125 PetriNetUnfolderBase]: For 385178/408276 co-relation queries the response was YES. [2023-11-30 08:02:51,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1433584 conditions, 622147 events. 260269/622147 cut-off events. For 385178/408276 co-relation queries the response was YES. Maximal size of possible extension queue 13264. Compared 9628222 event pairs, 116733 based on Foata normal form. 127/571053 useless extension candidates. Maximal degree in co-relation 719381. Up to 227291 conditions per place. [2023-11-30 08:02:55,298 INFO L140 encePairwiseOnDemand]: 302/317 looper letters, 125 selfloop transitions, 12 changer transitions 0/339 dead transitions. [2023-11-30 08:02:55,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 339 transitions, 1412 flow [2023-11-30 08:02:55,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 08:02:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 08:02:55,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 737 transitions. [2023-11-30 08:02:55,314 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7749737118822292 [2023-11-30 08:02:55,314 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 737 transitions. [2023-11-30 08:02:55,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 737 transitions. [2023-11-30 08:02:55,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:02:55,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 737 transitions. [2023-11-30 08:02:55,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 0 states have call successors, (0), 0 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 08:02:55,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 0 states have call successors, (0), 0 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 08:02:55,317 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 0 states have call successors, (0), 0 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 08:02:55,317 INFO L307 CegarLoopForPetriNet]: 276 programPoint places, -4 predicate places. [2023-11-30 08:02:55,317 INFO L500 AbstractCegarLoop]: Abstraction has has 272 places, 339 transitions, 1412 flow [2023-11-30 08:02:55,318 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 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 08:02:55,318 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:02:55,318 INFO L232 CegarLoopForPetriNet]: trace histogram [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] [2023-11-30 08:02:55,318 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 08:02:55,318 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2023-11-30 08:02:55,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:02:55,318 INFO L85 PathProgramCache]: Analyzing trace with hash 996627208, now seen corresponding path program 1 times [2023-11-30 08:02:55,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:02:55,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248765159] [2023-11-30 08:02:55,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:02:55,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:02:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:02:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:02:55,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:02:55,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248765159] [2023-11-30 08:02:55,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248765159] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 08:02:55,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021119689] [2023-11-30 08:02:55,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:02:55,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:02:55,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 08:02:55,418 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 08:02:55,421 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 08:02:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:02:55,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 08:02:55,515 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 08:02:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:02:55,566 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 08:02:55,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021119689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:02:55,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 08:02:55,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-11-30 08:02:55,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071249589] [2023-11-30 08:02:55,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:02:55,568 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 08:02:55,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:02:55,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 08:02:55,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-30 08:02:55,570 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 317 [2023-11-30 08:02:55,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 339 transitions, 1412 flow. Second operand has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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 08:02:55,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:02:55,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 317 [2023-11-30 08:02:55,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand