/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/weaver/popl20-bad-ring.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 09:20:05,691 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 09:20:05,754 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 09:20:05,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 09:20:05,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 09:20:05,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 09:20:05,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 09:20:05,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 09:20:05,780 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 09:20:05,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 09:20:05,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 09:20:05,783 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 09:20:05,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 09:20:05,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 09:20:05,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 09:20:05,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 09:20:05,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 09:20:05,785 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 09:20:05,785 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 09:20:05,785 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 09:20:05,785 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 09:20:05,786 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 09:20:05,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 09:20:05,786 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 09:20:05,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 09:20:05,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 09:20:05,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 09:20:05,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 09:20:05,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 09:20:05,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 09:20:05,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 09:20:05,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 09:20:05,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 09:20:05,789 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 09:20:05,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 09:20:05,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 09:20:05,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 09:20:05,998 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 09:20:05,998 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 09:20:05,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2023-11-30 09:20:06,953 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 09:20:07,122 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 09:20:07,123 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2023-11-30 09:20:07,130 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/162438d03/361dba727d6544a498bb7e2af3e90074/FLAG0d32e9f29 [2023-11-30 09:20:07,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/162438d03/361dba727d6544a498bb7e2af3e90074 [2023-11-30 09:20:07,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 09:20:07,146 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 09:20:07,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 09:20:07,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 09:20:07,151 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 09:20:07,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 09:20:07" (1/1) ... [2023-11-30 09:20:07,152 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d452484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:20:07, skipping insertion in model container [2023-11-30 09:20:07,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 09:20:07" (1/1) ... [2023-11-30 09:20:07,181 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 09:20:07,296 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 09:20:07,303 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 09:20:07,323 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 09:20:07,333 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 09:20:07,333 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 09:20:07,342 INFO L206 MainTranslator]: Completed translation [2023-11-30 09:20:07,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:20:07 WrapperNode [2023-11-30 09:20:07,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 09:20:07,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 09:20:07,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 09:20:07,344 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 09:20:07,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:20:07" (1/1) ... [2023-11-30 09:20:07,354 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:20:07" (1/1) ... [2023-11-30 09:20:07,377 INFO L138 Inliner]: procedures = 25, calls = 62, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 364 [2023-11-30 09:20:07,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 09:20:07,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 09:20:07,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 09:20:07,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 09:20:07,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:20:07" (1/1) ... [2023-11-30 09:20:07,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:20:07" (1/1) ... [2023-11-30 09:20:07,387 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:20:07" (1/1) ... [2023-11-30 09:20:07,388 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:20:07" (1/1) ... [2023-11-30 09:20:07,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:20:07" (1/1) ... [2023-11-30 09:20:07,397 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:20:07" (1/1) ... [2023-11-30 09:20:07,399 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:20:07" (1/1) ... [2023-11-30 09:20:07,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:20:07" (1/1) ... [2023-11-30 09:20:07,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 09:20:07,404 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 09:20:07,404 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 09:20:07,404 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 09:20:07,404 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:20:07" (1/1) ... [2023-11-30 09:20:07,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 09:20:07,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:20:07,445 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 09:20:07,449 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 09:20:07,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 09:20:07,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 09:20:07,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 09:20:07,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 09:20:07,467 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 09:20:07,467 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 09:20:07,467 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 09:20:07,467 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 09:20:07,467 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-30 09:20:07,467 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-30 09:20:07,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 09:20:07,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 09:20:07,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 09:20:07,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 09:20:07,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 09:20:07,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 09:20:07,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 09:20:07,469 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 09:20:07,544 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 09:20:07,545 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 09:20:07,955 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 09:20:08,095 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 09:20:08,095 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-30 09:20:08,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 09:20:08 BoogieIcfgContainer [2023-11-30 09:20:08,097 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 09:20:08,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 09:20:08,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 09:20:08,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 09:20:08,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 09:20:07" (1/3) ... [2023-11-30 09:20:08,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1e3d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 09:20:08, skipping insertion in model container [2023-11-30 09:20:08,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:20:07" (2/3) ... [2023-11-30 09:20:08,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1e3d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 09:20:08, skipping insertion in model container [2023-11-30 09:20:08,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 09:20:08" (3/3) ... [2023-11-30 09:20:08,102 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring.wvr.c [2023-11-30 09:20:08,115 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 09:20:08,115 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-11-30 09:20:08,115 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 09:20:08,213 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-30 09:20:08,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 315 places, 327 transitions, 675 flow [2023-11-30 09:20:08,392 INFO L124 PetriNetUnfolderBase]: 22/324 cut-off events. [2023-11-30 09:20:08,393 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-30 09:20:08,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 324 events. 22/324 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 374 event pairs, 0 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 271. Up to 3 conditions per place. [2023-11-30 09:20:08,405 INFO L82 GeneralOperation]: Start removeDead. Operand has 315 places, 327 transitions, 675 flow [2023-11-30 09:20:08,412 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 289 places, 300 transitions, 615 flow [2023-11-30 09:20:08,424 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 09:20:08,429 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;@75640cb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 09:20:08,429 INFO L363 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2023-11-30 09:20:08,443 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 09:20:08,443 INFO L124 PetriNetUnfolderBase]: 3/78 cut-off events. [2023-11-30 09:20:08,443 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 09:20:08,443 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:20:08,444 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, 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 09:20:08,444 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2023-11-30 09:20:08,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:20:08,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1773224945, now seen corresponding path program 1 times [2023-11-30 09:20:08,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:20:08,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272468084] [2023-11-30 09:20:08,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:20:08,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:20:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:20:08,748 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 09:20:08,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:20:08,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272468084] [2023-11-30 09:20:08,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272468084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:20:08,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 09:20:08,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 09:20:08,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660839109] [2023-11-30 09:20:08,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:20:08,757 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 09:20:08,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:20:08,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 09:20:08,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 09:20:08,783 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 327 [2023-11-30 09:20:08,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 300 transitions, 615 flow. Second operand has 4 states, 4 states have (on average 238.5) internal successors, (954), 4 states have internal predecessors, (954), 0 states have call successors, (0), 0 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 09:20:08,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:20:08,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 327 [2023-11-30 09:20:08,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:20:09,449 INFO L124 PetriNetUnfolderBase]: 1189/2890 cut-off events. [2023-11-30 09:20:09,449 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2023-11-30 09:20:09,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4769 conditions, 2890 events. 1189/2890 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 20603 event pairs, 720 based on Foata normal form. 276/1825 useless extension candidates. Maximal degree in co-relation 4351. Up to 1681 conditions per place. [2023-11-30 09:20:09,472 INFO L140 encePairwiseOnDemand]: 284/327 looper letters, 77 selfloop transitions, 15 changer transitions 7/305 dead transitions. [2023-11-30 09:20:09,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 305 transitions, 809 flow [2023-11-30 09:20:09,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 09:20:09,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 09:20:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1308 transitions. [2023-11-30 09:20:09,486 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8 [2023-11-30 09:20:09,487 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1308 transitions. [2023-11-30 09:20:09,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1308 transitions. [2023-11-30 09:20:09,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:20:09,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1308 transitions. [2023-11-30 09:20:09,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 261.6) internal successors, (1308), 5 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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 09:20:09,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 327.0) internal successors, (1962), 6 states have internal predecessors, (1962), 0 states have call successors, (0), 0 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 09:20:09,502 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 327.0) internal successors, (1962), 6 states have internal predecessors, (1962), 0 states have call successors, (0), 0 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 09:20:09,505 INFO L307 CegarLoopForPetriNet]: 289 programPoint places, -3 predicate places. [2023-11-30 09:20:09,505 INFO L500 AbstractCegarLoop]: Abstraction has has 286 places, 305 transitions, 809 flow [2023-11-30 09:20:09,506 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 238.5) internal successors, (954), 4 states have internal predecessors, (954), 0 states have call successors, (0), 0 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 09:20:09,506 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:20:09,506 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:20:09,507 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 09:20:09,507 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2023-11-30 09:20:09,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:20:09,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1901537420, now seen corresponding path program 1 times [2023-11-30 09:20:09,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:20:09,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245609159] [2023-11-30 09:20:09,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:20:09,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:20:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:20:09,755 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:20:09,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:20:09,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245609159] [2023-11-30 09:20:09,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245609159] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:20:09,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877653001] [2023-11-30 09:20:09,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:20:09,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:20:09,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:20:09,778 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 09:20:09,779 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 09:20:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:20:09,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 09:20:09,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:20:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:20:09,943 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 09:20:09,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877653001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:20:09,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 09:20:09,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-30 09:20:09,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875537754] [2023-11-30 09:20:09,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:20:09,945 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 09:20:09,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:20:09,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 09:20:09,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-30 09:20:09,947 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 327 [2023-11-30 09:20:09,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 305 transitions, 809 flow. Second operand has 6 states, 6 states have (on average 239.16666666666666) internal successors, (1435), 6 states have internal predecessors, (1435), 0 states have call successors, (0), 0 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 09:20:09,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:20:09,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 327 [2023-11-30 09:20:09,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:20:10,473 INFO L124 PetriNetUnfolderBase]: 1189/2887 cut-off events. [2023-11-30 09:20:10,473 INFO L125 PetriNetUnfolderBase]: For 532/3326 co-relation queries the response was YES. [2023-11-30 09:20:10,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6465 conditions, 2887 events. 1189/2887 cut-off events. For 532/3326 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 20681 event pairs, 720 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 5957. Up to 1678 conditions per place. [2023-11-30 09:20:10,489 INFO L140 encePairwiseOnDemand]: 309/327 looper letters, 65 selfloop transitions, 24 changer transitions 7/302 dead transitions. [2023-11-30 09:20:10,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 302 transitions, 975 flow [2023-11-30 09:20:10,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 09:20:10,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 09:20:10,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1751 transitions. [2023-11-30 09:20:10,492 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.764962865880297 [2023-11-30 09:20:10,492 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1751 transitions. [2023-11-30 09:20:10,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1751 transitions. [2023-11-30 09:20:10,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:20:10,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1751 transitions. [2023-11-30 09:20:10,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 250.14285714285714) internal successors, (1751), 7 states have internal predecessors, (1751), 0 states have call successors, (0), 0 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 09:20:10,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 327.0) internal successors, (2616), 8 states have internal predecessors, (2616), 0 states have call successors, (0), 0 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 09:20:10,499 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 327.0) internal successors, (2616), 8 states have internal predecessors, (2616), 0 states have call successors, (0), 0 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 09:20:10,500 INFO L307 CegarLoopForPetriNet]: 289 programPoint places, 0 predicate places. [2023-11-30 09:20:10,500 INFO L500 AbstractCegarLoop]: Abstraction has has 289 places, 302 transitions, 975 flow [2023-11-30 09:20:10,501 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.16666666666666) internal successors, (1435), 6 states have internal predecessors, (1435), 0 states have call successors, (0), 0 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 09:20:10,501 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:20:10,501 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:20:10,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-30 09:20:10,708 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:20:10,709 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2023-11-30 09:20:10,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:20:10,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1181883222, now seen corresponding path program 1 times [2023-11-30 09:20:10,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:20:10,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434446325] [2023-11-30 09:20:10,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:20:10,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:20:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:20:10,816 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:20:10,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:20:10,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434446325] [2023-11-30 09:20:10,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434446325] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:20:10,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329671142] [2023-11-30 09:20:10,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:20:10,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:20:10,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:20:10,833 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 09:20:10,860 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 09:20:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:20:10,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 09:20:10,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:20:10,947 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:20:10,947 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:20:10,985 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:20:10,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329671142] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:20:10,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:20:10,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-30 09:20:10,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319922688] [2023-11-30 09:20:10,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:20:10,986 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-30 09:20:10,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:20:10,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-30 09:20:10,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-30 09:20:10,988 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 327 [2023-11-30 09:20:10,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 302 transitions, 975 flow. Second operand has 12 states, 12 states have (on average 239.83333333333334) internal successors, (2878), 12 states have internal predecessors, (2878), 0 states have call successors, (0), 0 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 09:20:10,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:20:10,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 327 [2023-11-30 09:20:10,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:20:11,540 INFO L124 PetriNetUnfolderBase]: 1198/2992 cut-off events. [2023-11-30 09:20:11,541 INFO L125 PetriNetUnfolderBase]: For 1167/6755 co-relation queries the response was YES. [2023-11-30 09:20:11,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8506 conditions, 2992 events. 1198/2992 cut-off events. For 1167/6755 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 21027 event pairs, 720 based on Foata normal form. 0/1645 useless extension candidates. Maximal degree in co-relation 7563. Up to 1756 conditions per place. [2023-11-30 09:20:11,565 INFO L140 encePairwiseOnDemand]: 306/327 looper letters, 113 selfloop transitions, 54 changer transitions 7/380 dead transitions. [2023-11-30 09:20:11,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 380 transitions, 1777 flow [2023-11-30 09:20:11,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-30 09:20:11,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-30 09:20:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3494 transitions. [2023-11-30 09:20:11,571 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.763215377894277 [2023-11-30 09:20:11,571 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3494 transitions. [2023-11-30 09:20:11,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3494 transitions. [2023-11-30 09:20:11,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:20:11,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3494 transitions. [2023-11-30 09:20:11,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 249.57142857142858) internal successors, (3494), 14 states have internal predecessors, (3494), 0 states have call successors, (0), 0 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 09:20:11,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 327.0) internal successors, (4905), 15 states have internal predecessors, (4905), 0 states have call successors, (0), 0 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 09:20:11,584 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 327.0) internal successors, (4905), 15 states have internal predecessors, (4905), 0 states have call successors, (0), 0 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 09:20:11,585 INFO L307 CegarLoopForPetriNet]: 289 programPoint places, 13 predicate places. [2023-11-30 09:20:11,585 INFO L500 AbstractCegarLoop]: Abstraction has has 302 places, 380 transitions, 1777 flow [2023-11-30 09:20:11,586 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 239.83333333333334) internal successors, (2878), 12 states have internal predecessors, (2878), 0 states have call successors, (0), 0 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 09:20:11,586 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:20:11,586 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:20:11,593 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 09:20:11,791 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,SelfDestructingSolverStorable2 [2023-11-30 09:20:11,792 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2023-11-30 09:20:11,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:20:11,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1870671763, now seen corresponding path program 2 times [2023-11-30 09:20:11,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:20:11,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668908105] [2023-11-30 09:20:11,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:20:11,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:20:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:20:11,991 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:20:11,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:20:11,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668908105] [2023-11-30 09:20:11,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668908105] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:20:11,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870775219] [2023-11-30 09:20:11,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 09:20:11,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:20:11,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:20:11,993 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 09:20:12,019 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 09:20:12,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-30 09:20:12,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:20:12,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-30 09:20:12,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:20:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-30 09:20:12,188 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:20:12,284 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-30 09:20:12,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870775219] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:20:12,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:20:12,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2023-11-30 09:20:12,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754169440] [2023-11-30 09:20:12,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:20:12,285 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-30 09:20:12,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:20:12,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-30 09:20:12,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2023-11-30 09:20:12,290 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 327 [2023-11-30 09:20:12,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 380 transitions, 1777 flow. Second operand has 18 states, 18 states have (on average 215.77777777777777) internal successors, (3884), 18 states have internal predecessors, (3884), 0 states have call successors, (0), 0 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 09:20:12,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:20:12,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 327 [2023-11-30 09:20:12,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:20:13,338 INFO L124 PetriNetUnfolderBase]: 682/2082 cut-off events. [2023-11-30 09:20:13,338 INFO L125 PetriNetUnfolderBase]: For 1785/7971 co-relation queries the response was YES. [2023-11-30 09:20:13,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6819 conditions, 2082 events. 682/2082 cut-off events. For 1785/7971 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 13519 event pairs, 444 based on Foata normal form. 0/1349 useless extension candidates. Maximal degree in co-relation 5433. Up to 1123 conditions per place. [2023-11-30 09:20:13,353 INFO L140 encePairwiseOnDemand]: 292/327 looper letters, 139 selfloop transitions, 99 changer transitions 7/427 dead transitions. [2023-11-30 09:20:13,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 427 transitions, 2629 flow [2023-11-30 09:20:13,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-11-30 09:20:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2023-11-30 09:20:13,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 10635 transitions. [2023-11-30 09:20:13,371 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6637333832615615 [2023-11-30 09:20:13,371 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 10635 transitions. [2023-11-30 09:20:13,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 10635 transitions. [2023-11-30 09:20:13,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:20:13,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 10635 transitions. [2023-11-30 09:20:13,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 217.0408163265306) internal successors, (10635), 49 states have internal predecessors, (10635), 0 states have call successors, (0), 0 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 09:20:13,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 327.0) internal successors, (16350), 50 states have internal predecessors, (16350), 0 states have call successors, (0), 0 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 09:20:13,417 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 327.0) internal successors, (16350), 50 states have internal predecessors, (16350), 0 states have call successors, (0), 0 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 09:20:13,417 INFO L307 CegarLoopForPetriNet]: 289 programPoint places, 57 predicate places. [2023-11-30 09:20:13,418 INFO L500 AbstractCegarLoop]: Abstraction has has 346 places, 427 transitions, 2629 flow [2023-11-30 09:20:13,419 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 215.77777777777777) internal successors, (3884), 18 states have internal predecessors, (3884), 0 states have call successors, (0), 0 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 09:20:13,419 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:20:13,419 INFO L232 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:20:13,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-30 09:20:13,624 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:20:13,624 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2023-11-30 09:20:13,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:20:13,625 INFO L85 PathProgramCache]: Analyzing trace with hash -567622773, now seen corresponding path program 1 times [2023-11-30 09:20:13,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:20:13,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231723992] [2023-11-30 09:20:13,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:20:13,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:20:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:20:13,914 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:20:13,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:20:13,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231723992] [2023-11-30 09:20:13,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231723992] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:20:13,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654093984] [2023-11-30 09:20:13,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:20:13,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:20:13,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:20:13,916 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:20:13,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-30 09:20:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:20:14,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-30 09:20:14,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:20:14,105 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:20:14,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:20:14,352 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:20:14,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654093984] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:20:14,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:20:14,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 31 [2023-11-30 09:20:14,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071164827] [2023-11-30 09:20:14,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:20:14,354 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-30 09:20:14,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:20:14,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-30 09:20:14,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2023-11-30 09:20:14,359 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 327 [2023-11-30 09:20:14,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 427 transitions, 2629 flow. Second operand has 32 states, 32 states have (on average 240.40625) internal successors, (7693), 32 states have internal predecessors, (7693), 0 states have call successors, (0), 0 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 09:20:14,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:20:14,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 327 [2023-11-30 09:20:14,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:20:15,500 INFO L124 PetriNetUnfolderBase]: 706/2378 cut-off events. [2023-11-30 09:20:15,500 INFO L125 PetriNetUnfolderBase]: For 3321/11569 co-relation queries the response was YES. [2023-11-30 09:20:15,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9367 conditions, 2378 events. 706/2378 cut-off events. For 3321/11569 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 15064 event pairs, 444 based on Foata normal form. 0/1621 useless extension candidates. Maximal degree in co-relation 6360. Up to 1344 conditions per place. [2023-11-30 09:20:15,520 INFO L140 encePairwiseOnDemand]: 307/327 looper letters, 261 selfloop transitions, 174 changer transitions 7/648 dead transitions. [2023-11-30 09:20:15,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 648 transitions, 5709 flow [2023-11-30 09:20:15,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-30 09:20:15,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-11-30 09:20:15,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 10877 transitions. [2023-11-30 09:20:15,533 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7559772032249097 [2023-11-30 09:20:15,534 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 10877 transitions. [2023-11-30 09:20:15,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 10877 transitions. [2023-11-30 09:20:15,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:20:15,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 10877 transitions. [2023-11-30 09:20:15,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 247.20454545454547) internal successors, (10877), 44 states have internal predecessors, (10877), 0 states have call successors, (0), 0 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 09:20:15,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 327.0) internal successors, (14715), 45 states have internal predecessors, (14715), 0 states have call successors, (0), 0 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 09:20:15,567 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 327.0) internal successors, (14715), 45 states have internal predecessors, (14715), 0 states have call successors, (0), 0 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 09:20:15,567 INFO L307 CegarLoopForPetriNet]: 289 programPoint places, 100 predicate places. [2023-11-30 09:20:15,567 INFO L500 AbstractCegarLoop]: Abstraction has has 389 places, 648 transitions, 5709 flow [2023-11-30 09:20:15,569 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 240.40625) internal successors, (7693), 32 states have internal predecessors, (7693), 0 states have call successors, (0), 0 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 09:20:15,569 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:20:15,570 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:20:15,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-30 09:20:15,775 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:20:15,775 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2023-11-30 09:20:15,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:20:15,776 INFO L85 PathProgramCache]: Analyzing trace with hash 945088662, now seen corresponding path program 1 times [2023-11-30 09:20:15,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:20:15,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056479113] [2023-11-30 09:20:15,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:20:15,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:20:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:20:15,831 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 09:20:15,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:20:15,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056479113] [2023-11-30 09:20:15,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056479113] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:20:15,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 09:20:15,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 09:20:15,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335968879] [2023-11-30 09:20:15,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:20:15,832 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 09:20:15,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:20:15,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 09:20:15,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 09:20:15,833 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 327 [2023-11-30 09:20:15,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 648 transitions, 5709 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 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 09:20:15,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:20:15,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 327 [2023-11-30 09:20:15,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:20:16,261 INFO L124 PetriNetUnfolderBase]: 810/2554 cut-off events. [2023-11-30 09:20:16,262 INFO L125 PetriNetUnfolderBase]: For 3889/5509 co-relation queries the response was YES. [2023-11-30 09:20:16,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11737 conditions, 2554 events. 810/2554 cut-off events. For 3889/5509 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 16693 event pairs, 299 based on Foata normal form. 43/1790 useless extension candidates. Maximal degree in co-relation 8676. Up to 1549 conditions per place. [2023-11-30 09:20:16,280 INFO L140 encePairwiseOnDemand]: 323/327 looper letters, 37 selfloop transitions, 2 changer transitions 7/663 dead transitions. [2023-11-30 09:20:16,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 663 transitions, 5973 flow [2023-11-30 09:20:16,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 09:20:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 09:20:16,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 866 transitions. [2023-11-30 09:20:16,282 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8827726809378186 [2023-11-30 09:20:16,282 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 866 transitions. [2023-11-30 09:20:16,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 866 transitions. [2023-11-30 09:20:16,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:20:16,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 866 transitions. [2023-11-30 09:20:16,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 288.6666666666667) internal successors, (866), 3 states have internal predecessors, (866), 0 states have call successors, (0), 0 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 09:20:16,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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 09:20:16,284 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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 09:20:16,286 INFO L307 CegarLoopForPetriNet]: 289 programPoint places, 102 predicate places. [2023-11-30 09:20:16,286 INFO L500 AbstractCegarLoop]: Abstraction has has 391 places, 663 transitions, 5973 flow [2023-11-30 09:20:16,287 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 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 09:20:16,287 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:20:16,287 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:20:16,287 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 09:20:16,287 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2023-11-30 09:20:16,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:20:16,287 INFO L85 PathProgramCache]: Analyzing trace with hash 149671529, now seen corresponding path program 1 times [2023-11-30 09:20:16,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:20:16,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961535967] [2023-11-30 09:20:16,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:20:16,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:20:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:20:16,363 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 09:20:16,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:20:16,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961535967] [2023-11-30 09:20:16,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961535967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:20:16,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 09:20:16,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 09:20:16,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699716452] [2023-11-30 09:20:16,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:20:16,364 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 09:20:16,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:20:16,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 09:20:16,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 09:20:16,366 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 327 [2023-11-30 09:20:16,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 663 transitions, 5973 flow. Second operand has 3 states, 3 states have (on average 277.6666666666667) internal successors, (833), 3 states have internal predecessors, (833), 0 states have call successors, (0), 0 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 09:20:16,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:20:16,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 327 [2023-11-30 09:20:16,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:20:16,703 INFO L124 PetriNetUnfolderBase]: 602/2299 cut-off events. [2023-11-30 09:20:16,703 INFO L125 PetriNetUnfolderBase]: For 4615/5815 co-relation queries the response was YES. [2023-11-30 09:20:16,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10730 conditions, 2299 events. 602/2299 cut-off events. For 4615/5815 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 15155 event pairs, 90 based on Foata normal form. 13/1603 useless extension candidates. Maximal degree in co-relation 7628. Up to 1277 conditions per place. [2023-11-30 09:20:16,720 INFO L140 encePairwiseOnDemand]: 323/327 looper letters, 50 selfloop transitions, 5 changer transitions 7/679 dead transitions. [2023-11-30 09:20:16,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 679 transitions, 6313 flow [2023-11-30 09:20:16,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 09:20:16,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 09:20:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 860 transitions. [2023-11-30 09:20:16,724 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8766564729867482 [2023-11-30 09:20:16,727 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 860 transitions. [2023-11-30 09:20:16,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 860 transitions. [2023-11-30 09:20:16,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:20:16,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 860 transitions. [2023-11-30 09:20:16,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 286.6666666666667) internal successors, (860), 3 states have internal predecessors, (860), 0 states have call successors, (0), 0 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 09:20:16,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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 09:20:16,729 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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 09:20:16,729 INFO L307 CegarLoopForPetriNet]: 289 programPoint places, 104 predicate places. [2023-11-30 09:20:16,729 INFO L500 AbstractCegarLoop]: Abstraction has has 393 places, 679 transitions, 6313 flow [2023-11-30 09:20:16,730 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.6666666666667) internal successors, (833), 3 states have internal predecessors, (833), 0 states have call successors, (0), 0 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 09:20:16,730 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:20:16,730 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:20:16,730 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 09:20:16,730 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2023-11-30 09:20:16,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:20:16,731 INFO L85 PathProgramCache]: Analyzing trace with hash -460680911, now seen corresponding path program 1 times [2023-11-30 09:20:16,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:20:16,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644698315] [2023-11-30 09:20:16,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:20:16,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:20:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:20:16,786 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 09:20:16,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:20:16,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644698315] [2023-11-30 09:20:16,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644698315] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:20:16,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 09:20:16,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 09:20:16,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038012503] [2023-11-30 09:20:16,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:20:16,788 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 09:20:16,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:20:16,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 09:20:16,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 09:20:16,789 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 327 [2023-11-30 09:20:16,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 679 transitions, 6313 flow. Second operand has 3 states, 3 states have (on average 277.6666666666667) internal successors, (833), 3 states have internal predecessors, (833), 0 states have call successors, (0), 0 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 09:20:16,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:20:16,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 327 [2023-11-30 09:20:16,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:20:17,112 INFO L124 PetriNetUnfolderBase]: 508/1909 cut-off events. [2023-11-30 09:20:17,112 INFO L125 PetriNetUnfolderBase]: For 4318/5704 co-relation queries the response was YES. [2023-11-30 09:20:17,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10199 conditions, 1909 events. 508/1909 cut-off events. For 4318/5704 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10962 event pairs, 124 based on Foata normal form. 16/1327 useless extension candidates. Maximal degree in co-relation 7070. Up to 1147 conditions per place. [2023-11-30 09:20:17,125 INFO L140 encePairwiseOnDemand]: 323/327 looper letters, 46 selfloop transitions, 2 changer transitions 7/672 dead transitions. [2023-11-30 09:20:17,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 672 transitions, 6303 flow [2023-11-30 09:20:17,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 09:20:17,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 09:20:17,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 860 transitions. [2023-11-30 09:20:17,127 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8766564729867482 [2023-11-30 09:20:17,127 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 860 transitions. [2023-11-30 09:20:17,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 860 transitions. [2023-11-30 09:20:17,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:20:17,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 860 transitions. [2023-11-30 09:20:17,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 286.6666666666667) internal successors, (860), 3 states have internal predecessors, (860), 0 states have call successors, (0), 0 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 09:20:17,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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 09:20:17,130 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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 09:20:17,132 INFO L307 CegarLoopForPetriNet]: 289 programPoint places, 106 predicate places. [2023-11-30 09:20:17,132 INFO L500 AbstractCegarLoop]: Abstraction has has 395 places, 672 transitions, 6303 flow [2023-11-30 09:20:17,133 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.6666666666667) internal successors, (833), 3 states have internal predecessors, (833), 0 states have call successors, (0), 0 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 09:20:17,133 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:20:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:20:17,133 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 09:20:17,134 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2023-11-30 09:20:17,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:20:17,134 INFO L85 PathProgramCache]: Analyzing trace with hash -762199344, now seen corresponding path program 1 times [2023-11-30 09:20:17,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:20:17,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154418699] [2023-11-30 09:20:17,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:20:17,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:20:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:20:17,245 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 09:20:17,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:20:17,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154418699] [2023-11-30 09:20:17,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154418699] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:20:17,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 09:20:17,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 09:20:17,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894044514] [2023-11-30 09:20:17,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:20:17,247 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 09:20:17,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:20:17,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 09:20:17,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-30 09:20:17,248 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 327 [2023-11-30 09:20:17,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 672 transitions, 6303 flow. Second operand has 6 states, 6 states have (on average 238.66666666666666) internal successors, (1432), 6 states have internal predecessors, (1432), 0 states have call successors, (0), 0 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 09:20:17,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:20:17,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 327 [2023-11-30 09:20:17,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:20:17,668 INFO L124 PetriNetUnfolderBase]: 537/2390 cut-off events. [2023-11-30 09:20:17,668 INFO L125 PetriNetUnfolderBase]: For 6946/8566 co-relation queries the response was YES. [2023-11-30 09:20:17,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13386 conditions, 2390 events. 537/2390 cut-off events. For 6946/8566 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 14027 event pairs, 119 based on Foata normal form. 6/1757 useless extension candidates. Maximal degree in co-relation 7795. Up to 1413 conditions per place. [2023-11-30 09:20:17,684 INFO L140 encePairwiseOnDemand]: 315/327 looper letters, 502 selfloop transitions, 12 changer transitions 43/877 dead transitions. [2023-11-30 09:20:17,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 877 transitions, 9786 flow [2023-11-30 09:20:17,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 09:20:17,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 09:20:17,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2198 transitions. [2023-11-30 09:20:17,686 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7468569486918111 [2023-11-30 09:20:17,687 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2198 transitions. [2023-11-30 09:20:17,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2198 transitions. [2023-11-30 09:20:17,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:20:17,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2198 transitions. [2023-11-30 09:20:17,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 244.22222222222223) internal successors, (2198), 9 states have internal predecessors, (2198), 0 states have call successors, (0), 0 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 09:20:17,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 327.0) internal successors, (3270), 10 states have internal predecessors, (3270), 0 states have call successors, (0), 0 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 09:20:17,691 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 327.0) internal successors, (3270), 10 states have internal predecessors, (3270), 0 states have call successors, (0), 0 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 09:20:17,692 INFO L307 CegarLoopForPetriNet]: 289 programPoint places, 114 predicate places. [2023-11-30 09:20:17,692 INFO L500 AbstractCegarLoop]: Abstraction has has 403 places, 877 transitions, 9786 flow [2023-11-30 09:20:17,692 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 238.66666666666666) internal successors, (1432), 6 states have internal predecessors, (1432), 0 states have call successors, (0), 0 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 09:20:17,692 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:20:17,692 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:20:17,693 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 09:20:17,693 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2023-11-30 09:20:17,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:20:17,693 INFO L85 PathProgramCache]: Analyzing trace with hash -584353581, now seen corresponding path program 1 times [2023-11-30 09:20:17,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:20:17,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681056381] [2023-11-30 09:20:17,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:20:17,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:20:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:20:17,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 09:20:17,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:20:17,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681056381] [2023-11-30 09:20:17,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681056381] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:20:17,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 09:20:17,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 09:20:17,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680447306] [2023-11-30 09:20:17,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:20:17,826 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 09:20:17,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:20:17,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 09:20:17,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-30 09:20:17,827 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 327 [2023-11-30 09:20:17,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 877 transitions, 9786 flow. Second operand has 6 states, 6 states have (on average 239.33333333333334) internal successors, (1436), 6 states have internal predecessors, (1436), 0 states have call successors, (0), 0 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 09:20:17,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:20:17,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 327 [2023-11-30 09:20:17,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:20:18,447 INFO L124 PetriNetUnfolderBase]: 572/2963 cut-off events. [2023-11-30 09:20:18,447 INFO L125 PetriNetUnfolderBase]: For 11071/12925 co-relation queries the response was YES. [2023-11-30 09:20:18,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17331 conditions, 2963 events. 572/2963 cut-off events. For 11071/12925 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 18544 event pairs, 125 based on Foata normal form. 5/2292 useless extension candidates. Maximal degree in co-relation 8591. Up to 1702 conditions per place. [2023-11-30 09:20:18,465 INFO L140 encePairwiseOnDemand]: 313/327 looper letters, 628 selfloop transitions, 24 changer transitions 121/1093 dead transitions. [2023-11-30 09:20:18,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 1093 transitions, 14329 flow [2023-11-30 09:20:18,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 09:20:18,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 09:20:18,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2189 transitions. [2023-11-30 09:20:18,467 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7437988447162759 [2023-11-30 09:20:18,467 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2189 transitions. [2023-11-30 09:20:18,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2189 transitions. [2023-11-30 09:20:18,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:20:18,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2189 transitions. [2023-11-30 09:20:18,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 243.22222222222223) internal successors, (2189), 9 states have internal predecessors, (2189), 0 states have call successors, (0), 0 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 09:20:18,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 327.0) internal successors, (3270), 10 states have internal predecessors, (3270), 0 states have call successors, (0), 0 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 09:20:18,472 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 327.0) internal successors, (3270), 10 states have internal predecessors, (3270), 0 states have call successors, (0), 0 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 09:20:18,472 INFO L307 CegarLoopForPetriNet]: 289 programPoint places, 122 predicate places. [2023-11-30 09:20:18,473 INFO L500 AbstractCegarLoop]: Abstraction has has 411 places, 1093 transitions, 14329 flow [2023-11-30 09:20:18,473 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.33333333333334) internal successors, (1436), 6 states have internal predecessors, (1436), 0 states have call successors, (0), 0 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 09:20:18,473 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:20:18,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:20:18,473 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 09:20:18,473 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2023-11-30 09:20:18,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:20:18,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1181379959, now seen corresponding path program 1 times [2023-11-30 09:20:18,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:20:18,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837119744] [2023-11-30 09:20:18,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:20:18,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:20:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:20:18,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 09:20:18,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:20:18,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837119744] [2023-11-30 09:20:18,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837119744] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:20:18,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773943390] [2023-11-30 09:20:18,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:20:18,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:20:18,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:20:18,653 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:20:18,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-30 09:20:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:20:18,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-30 09:20:18,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:20:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-30 09:20:18,920 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 09:20:18,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773943390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:20:18,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 09:20:18,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2023-11-30 09:20:18,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472470894] [2023-11-30 09:20:18,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:20:18,921 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 09:20:18,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:20:18,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 09:20:18,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-30 09:20:18,922 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 327 [2023-11-30 09:20:18,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 1093 transitions, 14329 flow. Second operand has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 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 09:20:18,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:20:18,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 327 [2023-11-30 09:20:18,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:20:19,510 INFO L124 PetriNetUnfolderBase]: 425/2597 cut-off events. [2023-11-30 09:20:19,510 INFO L125 PetriNetUnfolderBase]: For 10809/12429 co-relation queries the response was YES. [2023-11-30 09:20:19,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15130 conditions, 2597 events. 425/2597 cut-off events. For 10809/12429 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 15291 event pairs, 76 based on Foata normal form. 0/2118 useless extension candidates. Maximal degree in co-relation 8593. Up to 1466 conditions per place. [2023-11-30 09:20:19,525 INFO L140 encePairwiseOnDemand]: 322/327 looper letters, 44 selfloop transitions, 3 changer transitions 121/1088 dead transitions. [2023-11-30 09:20:19,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 1088 transitions, 14343 flow [2023-11-30 09:20:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 09:20:19,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 09:20:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1111 transitions. [2023-11-30 09:20:19,527 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.849388379204893 [2023-11-30 09:20:19,527 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1111 transitions. [2023-11-30 09:20:19,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1111 transitions. [2023-11-30 09:20:19,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:20:19,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1111 transitions. [2023-11-30 09:20:19,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 277.75) internal successors, (1111), 4 states have internal predecessors, (1111), 0 states have call successors, (0), 0 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 09:20:19,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 327.0) internal successors, (1635), 5 states have internal predecessors, (1635), 0 states have call successors, (0), 0 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 09:20:19,530 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 327.0) internal successors, (1635), 5 states have internal predecessors, (1635), 0 states have call successors, (0), 0 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 09:20:19,531 INFO L307 CegarLoopForPetriNet]: 289 programPoint places, 123 predicate places. [2023-11-30 09:20:19,531 INFO L500 AbstractCegarLoop]: Abstraction has has 412 places, 1088 transitions, 14343 flow [2023-11-30 09:20:19,531 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 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 09:20:19,531 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:20:19,531 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:20:19,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-30 09:20:19,737 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-30 09:20:19,737 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2023-11-30 09:20:19,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:20:19,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1962581448, now seen corresponding path program 1 times [2023-11-30 09:20:19,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:20:19,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659552947] [2023-11-30 09:20:19,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:20:19,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:20:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:20:20,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 09:20:20,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:20:20,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659552947] [2023-11-30 09:20:20,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659552947] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:20:20,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621501373] [2023-11-30 09:20:20,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:20:20,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:20:20,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:20:20,429 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:20:20,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-30 09:20:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:20:20,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-30 09:20:20,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:20:21,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 09:20:21,069 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:20:21,185 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-30 09:20:21,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2023-11-30 09:20:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 09:20:21,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621501373] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:20:21,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:20:21,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 10] total 29 [2023-11-30 09:20:21,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755950410] [2023-11-30 09:20:21,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:20:21,665 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-30 09:20:21,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:20:21,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-30 09:20:21,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2023-11-30 09:20:21,670 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 327 [2023-11-30 09:20:21,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 1088 transitions, 14343 flow. Second operand has 30 states, 30 states have (on average 182.7) internal successors, (5481), 30 states have internal predecessors, (5481), 0 states have call successors, (0), 0 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 09:20:21,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:20:21,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 327 [2023-11-30 09:20:21,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:20:28,090 INFO L124 PetriNetUnfolderBase]: 9644/25063 cut-off events. [2023-11-30 09:20:28,091 INFO L125 PetriNetUnfolderBase]: For 175366/208606 co-relation queries the response was YES. [2023-11-30 09:20:28,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149194 conditions, 25063 events. 9644/25063 cut-off events. For 175366/208606 co-relation queries the response was YES. Maximal size of possible extension queue 844. Compared 256837 event pairs, 3102 based on Foata normal form. 205/16704 useless extension candidates. Maximal degree in co-relation 92260. Up to 10272 conditions per place. [2023-11-30 09:20:28,348 INFO L140 encePairwiseOnDemand]: 292/327 looper letters, 1343 selfloop transitions, 209 changer transitions 182/1881 dead transitions. [2023-11-30 09:20:28,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 1881 transitions, 31065 flow [2023-11-30 09:20:28,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-30 09:20:28,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-11-30 09:20:28,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 8441 transitions. [2023-11-30 09:20:28,355 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5736323479442745 [2023-11-30 09:20:28,355 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 8441 transitions. [2023-11-30 09:20:28,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 8441 transitions. [2023-11-30 09:20:28,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:20:28,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 8441 transitions. [2023-11-30 09:20:28,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 187.57777777777778) internal successors, (8441), 45 states have internal predecessors, (8441), 0 states have call successors, (0), 0 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 09:20:28,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 327.0) internal successors, (15042), 46 states have internal predecessors, (15042), 0 states have call successors, (0), 0 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 09:20:28,376 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 327.0) internal successors, (15042), 46 states have internal predecessors, (15042), 0 states have call successors, (0), 0 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 09:20:28,377 INFO L307 CegarLoopForPetriNet]: 289 programPoint places, 167 predicate places. [2023-11-30 09:20:28,377 INFO L500 AbstractCegarLoop]: Abstraction has has 456 places, 1881 transitions, 31065 flow [2023-11-30 09:20:28,378 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 182.7) internal successors, (5481), 30 states have internal predecessors, (5481), 0 states have call successors, (0), 0 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 09:20:28,378 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:20:28,378 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:20:28,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-30 09:20:28,583 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:20:28,584 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2023-11-30 09:20:28,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:20:28,585 INFO L85 PathProgramCache]: Analyzing trace with hash -2100662313, now seen corresponding path program 1 times [2023-11-30 09:20:28,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:20:28,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268585338] [2023-11-30 09:20:28,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:20:28,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:20:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:20:30,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:20:30,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:20:30,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268585338] [2023-11-30 09:20:30,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268585338] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:20:30,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957865720] [2023-11-30 09:20:30,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:20:30,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:20:30,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:20:30,412 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:20:30,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-30 09:20:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:20:30,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-30 09:20:30,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:20:30,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-30 09:20:30,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-30 09:20:31,235 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 09:20:31,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 09:20:31,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-30 09:20:31,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-30 09:20:31,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 09:20:31,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-30 09:20:31,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:20:31,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:20:37,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:20:37,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 51 [2023-11-30 09:20:37,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:20:37,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 760 treesize of output 720 [2023-11-30 09:20:37,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:20:37,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 126 [2023-11-30 09:20:37,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 106 [2023-11-30 09:20:37,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:20:37,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 101 [2023-11-30 09:20:37,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-30 09:20:37,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:20:37,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957865720] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:20:37,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:20:37,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22, 22] total 65 [2023-11-30 09:20:37,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021486928] [2023-11-30 09:20:37,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:20:37,957 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-11-30 09:20:37,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:20:37,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-11-30 09:20:37,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=3920, Unknown=32, NotChecked=0, Total=4290 [2023-11-30 09:20:37,962 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 327 [2023-11-30 09:20:37,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 1881 transitions, 31065 flow. Second operand has 66 states, 66 states have (on average 111.36363636363636) internal successors, (7350), 66 states have internal predecessors, (7350), 0 states have call successors, (0), 0 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 09:20:37,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:20:37,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 327 [2023-11-30 09:20:37,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:20:48,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:21:13,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:21:15,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:21:17,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:21:19,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:21:22,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:21:24,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:21:27,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:21:29,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:21:31,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:21:33,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:21:46,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:21:49,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:21:51,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:21:53,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:21:55,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:21:57,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:21:59,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:02,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:04,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:06,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:09,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:11,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:13,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:16,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:18,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:20,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:22,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:25,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:27,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:29,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:31,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:33,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:35,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:37,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:39,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:42,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:45,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:47,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:49,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:51,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:53,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:55,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:57,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:22:59,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:23:01,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:23:03,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:23:05,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:23:07,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:23:10,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:23:12,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:23:14,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:23:16,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:23:18,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:23:20,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:23:22,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:23:24,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:23:27,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:23:29,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:23:38,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:23:41,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:23:43,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:23:45,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:23:47,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:23:58,912 INFO L124 PetriNetUnfolderBase]: 9849/25802 cut-off events. [2023-11-30 09:23:58,913 INFO L125 PetriNetUnfolderBase]: For 198366/234497 co-relation queries the response was YES. [2023-11-30 09:23:59,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167239 conditions, 25802 events. 9849/25802 cut-off events. For 198366/234497 co-relation queries the response was YES. Maximal size of possible extension queue 825. Compared 267538 event pairs, 2726 based on Foata normal form. 71/17502 useless extension candidates. Maximal degree in co-relation 102511. Up to 10260 conditions per place. [2023-11-30 09:23:59,220 INFO L140 encePairwiseOnDemand]: 259/327 looper letters, 1638 selfloop transitions, 473 changer transitions 227/2433 dead transitions. [2023-11-30 09:23:59,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 2433 transitions, 42631 flow [2023-11-30 09:23:59,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2023-11-30 09:23:59,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2023-11-30 09:23:59,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 11073 transitions. [2023-11-30 09:23:59,229 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.34909675588763833 [2023-11-30 09:23:59,230 INFO L72 ComplementDD]: Start complementDD. Operand 97 states and 11073 transitions. [2023-11-30 09:23:59,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 11073 transitions. [2023-11-30 09:23:59,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:23:59,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 97 states and 11073 transitions. [2023-11-30 09:23:59,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 98 states, 97 states have (on average 114.15463917525773) internal successors, (11073), 97 states have internal predecessors, (11073), 0 states have call successors, (0), 0 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 09:23:59,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 98 states, 98 states have (on average 327.0) internal successors, (32046), 98 states have internal predecessors, (32046), 0 states have call successors, (0), 0 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 09:23:59,265 INFO L81 ComplementDD]: Finished complementDD. Result has 98 states, 98 states have (on average 327.0) internal successors, (32046), 98 states have internal predecessors, (32046), 0 states have call successors, (0), 0 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 09:23:59,266 INFO L307 CegarLoopForPetriNet]: 289 programPoint places, 262 predicate places. [2023-11-30 09:23:59,266 INFO L500 AbstractCegarLoop]: Abstraction has has 551 places, 2433 transitions, 42631 flow [2023-11-30 09:23:59,267 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 111.36363636363636) internal successors, (7350), 66 states have internal predecessors, (7350), 0 states have call successors, (0), 0 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 09:23:59,267 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:23:59,267 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:23:59,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-30 09:23:59,472 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:23:59,473 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2023-11-30 09:23:59,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:23:59,473 INFO L85 PathProgramCache]: Analyzing trace with hash -714894668, now seen corresponding path program 2 times [2023-11-30 09:23:59,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:23:59,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483063983] [2023-11-30 09:23:59,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:23:59,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:23:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:24:00,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 09:24:00,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:24:00,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483063983] [2023-11-30 09:24:00,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483063983] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:24:00,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768362239] [2023-11-30 09:24:00,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 09:24:00,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:24:00,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:24:00,332 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:24:00,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-30 09:24:00,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-30 09:24:00,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:24:00,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-30 09:24:00,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:24:01,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 09:24:01,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-30 09:24:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-30 09:24:01,222 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 09:24:01,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768362239] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:24:01,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 09:24:01,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18] total 27 [2023-11-30 09:24:01,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619608312] [2023-11-30 09:24:01,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:24:01,223 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-30 09:24:01,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:24:01,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-30 09:24:01,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=692, Unknown=0, NotChecked=0, Total=756 [2023-11-30 09:24:01,226 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 327 [2023-11-30 09:24:01,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 2433 transitions, 42631 flow. Second operand has 12 states, 12 states have (on average 225.0) internal successors, (2700), 12 states have internal predecessors, (2700), 0 states have call successors, (0), 0 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 09:24:01,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:24:01,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 327 [2023-11-30 09:24:01,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:24:11,893 INFO L124 PetriNetUnfolderBase]: 13657/34934 cut-off events. [2023-11-30 09:24:11,894 INFO L125 PetriNetUnfolderBase]: For 313230/370269 co-relation queries the response was YES. [2023-11-30 09:24:12,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243190 conditions, 34934 events. 13657/34934 cut-off events. For 313230/370269 co-relation queries the response was YES. Maximal size of possible extension queue 1149. Compared 375359 event pairs, 3527 based on Foata normal form. 87/23345 useless extension candidates. Maximal degree in co-relation 147105. Up to 13485 conditions per place. [2023-11-30 09:24:12,352 INFO L140 encePairwiseOnDemand]: 298/327 looper letters, 950 selfloop transitions, 130 changer transitions 234/2600 dead transitions. [2023-11-30 09:24:12,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 2600 transitions, 48070 flow [2023-11-30 09:24:12,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-30 09:24:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-30 09:24:12,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4312 transitions. [2023-11-30 09:24:12,356 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6940286496056656 [2023-11-30 09:24:12,356 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 4312 transitions. [2023-11-30 09:24:12,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 4312 transitions. [2023-11-30 09:24:12,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:24:12,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 4312 transitions. [2023-11-30 09:24:12,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 226.94736842105263) internal successors, (4312), 19 states have internal predecessors, (4312), 0 states have call successors, (0), 0 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 09:24:12,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 327.0) internal successors, (6540), 20 states have internal predecessors, (6540), 0 states have call successors, (0), 0 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 09:24:12,363 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 327.0) internal successors, (6540), 20 states have internal predecessors, (6540), 0 states have call successors, (0), 0 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 09:24:12,364 INFO L307 CegarLoopForPetriNet]: 289 programPoint places, 280 predicate places. [2023-11-30 09:24:12,364 INFO L500 AbstractCegarLoop]: Abstraction has has 569 places, 2600 transitions, 48070 flow [2023-11-30 09:24:12,364 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 225.0) internal successors, (2700), 12 states have internal predecessors, (2700), 0 states have call successors, (0), 0 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 09:24:12,364 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:24:12,364 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:24:12,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-30 09:24:12,569 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-30 09:24:12,569 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2023-11-30 09:24:12,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:24:12,569 INFO L85 PathProgramCache]: Analyzing trace with hash -2100662314, now seen corresponding path program 1 times [2023-11-30 09:24:12,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:24:12,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987639048] [2023-11-30 09:24:12,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:24:12,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:24:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:24:13,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 09:24:13,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:24:13,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987639048] [2023-11-30 09:24:13,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987639048] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:24:13,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977744648] [2023-11-30 09:24:13,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:24:13,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:24:13,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:24:13,476 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:24:13,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-30 09:24:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:24:13,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-30 09:24:13,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:24:13,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-30 09:24:14,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-30 09:24:14,657 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 09:24:14,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 09:24:14,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-30 09:24:15,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-30 09:24:15,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 09:24:15,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-30 09:24:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:24:15,686 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:24:18,068 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (~q1_front~0 Int) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int)) (v_~q1_back~0_84 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc39#1.base| v_ArrVal_433) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_434))) (or (< ~q1_front~0 0) (< c_~n1~0 (+ 1 v_~q1_back~0_84)) (< 0 (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_435) c_~q1~0.base) (+ c_~q1~0.offset (* ~q1_front~0 4))) 2147483648)) (not (= (select (select .cse0 c_~q1~0.base) (+ c_~q1~0.offset (* 4 v_~q1_back~0_84))) 0)) (< v_~q1_back~0_84 ~q1_front~0)))) is different from false [2023-11-30 09:24:19,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:24:19,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 53 [2023-11-30 09:24:19,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:24:19,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 224 [2023-11-30 09:24:19,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 128 [2023-11-30 09:24:19,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:24:19,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 176 [2023-11-30 09:24:19,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:24:19,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 109 [2023-11-30 09:24:20,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-30 09:24:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:24:20,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977744648] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:24:20,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:24:20,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 22] total 60 [2023-11-30 09:24:20,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337952695] [2023-11-30 09:24:20,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:24:20,860 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-30 09:24:20,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:24:20,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-30 09:24:20,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=3271, Unknown=25, NotChecked=116, Total=3660 [2023-11-30 09:24:20,868 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 327 [2023-11-30 09:24:20,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 2600 transitions, 48070 flow. Second operand has 61 states, 61 states have (on average 169.0) internal successors, (10309), 61 states have internal predecessors, (10309), 0 states have call successors, (0), 0 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 09:24:20,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:24:20,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 327 [2023-11-30 09:24:20,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:24:27,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:24:47,685 INFO L124 PetriNetUnfolderBase]: 13702/34753 cut-off events. [2023-11-30 09:24:47,686 INFO L125 PetriNetUnfolderBase]: For 407196/480278 co-relation queries the response was YES. [2023-11-30 09:24:47,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265842 conditions, 34753 events. 13702/34753 cut-off events. For 407196/480278 co-relation queries the response was YES. Maximal size of possible extension queue 1144. Compared 371484 event pairs, 3028 based on Foata normal form. 235/23583 useless extension candidates. Maximal degree in co-relation 160758. Up to 13558 conditions per place. [2023-11-30 09:24:48,127 INFO L140 encePairwiseOnDemand]: 270/327 looper letters, 1853 selfloop transitions, 496 changer transitions 234/2832 dead transitions. [2023-11-30 09:24:48,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 2832 transitions, 59480 flow [2023-11-30 09:24:48,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-11-30 09:24:48,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2023-11-30 09:24:48,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 9515 transitions. [2023-11-30 09:24:48,134 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5290519877675841 [2023-11-30 09:24:48,134 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 9515 transitions. [2023-11-30 09:24:48,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 9515 transitions. [2023-11-30 09:24:48,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:24:48,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 9515 transitions. [2023-11-30 09:24:48,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 173.0) internal successors, (9515), 55 states have internal predecessors, (9515), 0 states have call successors, (0), 0 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 09:24:48,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 327.0) internal successors, (18312), 56 states have internal predecessors, (18312), 0 states have call successors, (0), 0 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 09:24:48,152 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 327.0) internal successors, (18312), 56 states have internal predecessors, (18312), 0 states have call successors, (0), 0 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 09:24:48,152 INFO L307 CegarLoopForPetriNet]: 289 programPoint places, 334 predicate places. [2023-11-30 09:24:48,153 INFO L500 AbstractCegarLoop]: Abstraction has has 623 places, 2832 transitions, 59480 flow [2023-11-30 09:24:48,154 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 169.0) internal successors, (10309), 61 states have internal predecessors, (10309), 0 states have call successors, (0), 0 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 09:24:48,154 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:24:48,154 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:24:48,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-30 09:24:48,360 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-30 09:24:48,360 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2023-11-30 09:24:48,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:24:48,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1620357865, now seen corresponding path program 1 times [2023-11-30 09:24:48,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:24:48,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108223693] [2023-11-30 09:24:48,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:24:48,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:24:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:24:48,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-30 09:24:48,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:24:48,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108223693] [2023-11-30 09:24:48,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108223693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:24:48,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 09:24:48,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 09:24:48,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128016491] [2023-11-30 09:24:48,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:24:48,441 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 09:24:48,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:24:48,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 09:24:48,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 09:24:48,442 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 327 [2023-11-30 09:24:48,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 2832 transitions, 59480 flow. Second operand has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 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 09:24:48,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:24:48,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 327 [2023-11-30 09:24:48,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:25:00,793 INFO L124 PetriNetUnfolderBase]: 14958/37170 cut-off events. [2023-11-30 09:25:00,793 INFO L125 PetriNetUnfolderBase]: For 498169/593839 co-relation queries the response was YES. [2023-11-30 09:25:00,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304935 conditions, 37170 events. 14958/37170 cut-off events. For 498169/593839 co-relation queries the response was YES. Maximal size of possible extension queue 1203. Compared 399347 event pairs, 2711 based on Foata normal form. 225/25532 useless extension candidates. Maximal degree in co-relation 187102. Up to 15691 conditions per place. [2023-11-30 09:25:01,273 INFO L140 encePairwiseOnDemand]: 322/327 looper letters, 1040 selfloop transitions, 39 changer transitions 254/3041 dead transitions. [2023-11-30 09:25:01,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 3041 transitions, 68452 flow [2023-11-30 09:25:01,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 09:25:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 09:25:01,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1131 transitions. [2023-11-30 09:25:01,274 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8646788990825688 [2023-11-30 09:25:01,274 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1131 transitions. [2023-11-30 09:25:01,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1131 transitions. [2023-11-30 09:25:01,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:25:01,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1131 transitions. [2023-11-30 09:25:01,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 282.75) internal successors, (1131), 4 states have internal predecessors, (1131), 0 states have call successors, (0), 0 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 09:25:01,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 327.0) internal successors, (1635), 5 states have internal predecessors, (1635), 0 states have call successors, (0), 0 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 09:25:01,276 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 327.0) internal successors, (1635), 5 states have internal predecessors, (1635), 0 states have call successors, (0), 0 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 09:25:01,276 INFO L307 CegarLoopForPetriNet]: 289 programPoint places, 337 predicate places. [2023-11-30 09:25:01,277 INFO L500 AbstractCegarLoop]: Abstraction has has 626 places, 3041 transitions, 68452 flow [2023-11-30 09:25:01,277 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 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 09:25:01,277 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:25:01,277 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:25:01,277 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 09:25:01,277 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2023-11-30 09:25:01,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:25:01,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1308514891, now seen corresponding path program 1 times [2023-11-30 09:25:01,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:25:01,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816445854] [2023-11-30 09:25:01,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:25:01,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:25:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:25:01,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 09:25:01,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:25:01,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816445854] [2023-11-30 09:25:01,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816445854] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:25:01,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847995884] [2023-11-30 09:25:01,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:25:01,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:25:01,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:25:01,986 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:25:01,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-30 09:25:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:25:02,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-30 09:25:02,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:25:02,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-30 09:25:02,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-30 09:25:03,334 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 09:25:03,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 09:25:03,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-30 09:25:04,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 09:25:04,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-30 09:25:04,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 09:25:04,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-30 09:25:04,254 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-30 09:25:04,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2023-11-30 09:25:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:25:04,284 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:25:06,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:25:06,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2023-11-30 09:25:06,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:25:06,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 310 treesize of output 294 [2023-11-30 09:25:06,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 124 [2023-11-30 09:25:06,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2023-11-30 09:25:06,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 94 [2023-11-30 09:25:06,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:25:06,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 81 [2023-11-30 09:25:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:25:07,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847995884] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:25:07,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:25:07,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23, 24] total 62 [2023-11-30 09:25:07,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227663728] [2023-11-30 09:25:07,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:25:07,457 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-11-30 09:25:07,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:25:07,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-11-30 09:25:07,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=3635, Unknown=39, NotChecked=0, Total=3906 [2023-11-30 09:25:07,462 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 327 [2023-11-30 09:25:07,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 3041 transitions, 68452 flow. Second operand has 63 states, 63 states have (on average 159.31746031746033) internal successors, (10037), 63 states have internal predecessors, (10037), 0 states have call successors, (0), 0 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 09:25:07,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:25:07,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 327 [2023-11-30 09:25:07,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:25:19,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:25:21,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:25:24,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:25:26,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:25:28,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:25:30,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-30 09:25:42,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:25:44,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:25:49,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-30 09:26:21,416 INFO L124 PetriNetUnfolderBase]: 20046/48302 cut-off events. [2023-11-30 09:26:21,416 INFO L125 PetriNetUnfolderBase]: For 780901/974673 co-relation queries the response was YES. [2023-11-30 09:26:21,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432582 conditions, 48302 events. 20046/48302 cut-off events. For 780901/974673 co-relation queries the response was YES. Maximal size of possible extension queue 1694. Compared 539348 event pairs, 2084 based on Foata normal form. 1309/34692 useless extension candidates. Maximal degree in co-relation 307440. Up to 19698 conditions per place. [2023-11-30 09:26:22,348 INFO L140 encePairwiseOnDemand]: 273/327 looper letters, 2890 selfloop transitions, 575 changer transitions 282/3949 dead transitions. [2023-11-30 09:26:22,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 725 places, 3949 transitions, 101678 flow [2023-11-30 09:26:22,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2023-11-30 09:26:22,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2023-11-30 09:26:22,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 16372 transitions. [2023-11-30 09:26:22,360 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5006727828746177 [2023-11-30 09:26:22,360 INFO L72 ComplementDD]: Start complementDD. Operand 100 states and 16372 transitions. [2023-11-30 09:26:22,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 16372 transitions. [2023-11-30 09:26:22,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:26:22,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 100 states and 16372 transitions. [2023-11-30 09:26:22,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 101 states, 100 states have (on average 163.72) internal successors, (16372), 100 states have internal predecessors, (16372), 0 states have call successors, (0), 0 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 09:26:22,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 101 states, 101 states have (on average 327.0) internal successors, (33027), 101 states have internal predecessors, (33027), 0 states have call successors, (0), 0 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 09:26:22,477 INFO L81 ComplementDD]: Finished complementDD. Result has 101 states, 101 states have (on average 327.0) internal successors, (33027), 101 states have internal predecessors, (33027), 0 states have call successors, (0), 0 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 09:26:22,478 INFO L307 CegarLoopForPetriNet]: 289 programPoint places, 436 predicate places. [2023-11-30 09:26:22,478 INFO L500 AbstractCegarLoop]: Abstraction has has 725 places, 3949 transitions, 101678 flow [2023-11-30 09:26:22,479 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 159.31746031746033) internal successors, (10037), 63 states have internal predecessors, (10037), 0 states have call successors, (0), 0 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 09:26:22,479 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:26:22,479 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:26:22,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-30 09:26:22,684 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-30 09:26:22,684 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2023-11-30 09:26:22,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:26:22,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2069715548, now seen corresponding path program 1 times [2023-11-30 09:26:22,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:26:22,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893030672] [2023-11-30 09:26:22,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:26:22,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:26:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:26:23,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 09:26:23,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:26:23,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893030672] [2023-11-30 09:26:23,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893030672] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:26:23,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088243838] [2023-11-30 09:26:23,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:26:23,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:26:23,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:26:23,445 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:26:23,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-30 09:26:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:26:23,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-30 09:26:23,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:26:23,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-30 09:26:23,627 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-30 09:26:23,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-30 09:26:23,667 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-11-30 09:26:23,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 22 [2023-11-30 09:26:23,975 INFO L349 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2023-11-30 09:26:23,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 45 [2023-11-30 09:26:24,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-30 09:26:24,965 INFO L349 Elim1Store]: treesize reduction 40, result has 29.8 percent of original size [2023-11-30 09:26:24,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 32 [2023-11-30 09:26:25,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-30 09:26:25,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-30 09:26:25,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-30 09:26:25,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-30 09:26:26,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:26:26,031 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:26:27,836 WARN L854 $PredicateComparison]: unable to prove that (forall ((~q1_front~0 Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int)) (v_~q1_back~0_88 Int) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_552))) (or (< ~q1_front~0 0) (< 0 (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_553) c_~q1~0.base) (+ c_~q1~0.offset (* ~q1_front~0 4))) 2147483648)) (< c_~n1~0 (+ 1 v_~q1_back~0_88)) (< v_~q1_back~0_88 ~q1_front~0) (not (= 2 (select (select .cse0 c_~q1~0.base) (+ c_~q1~0.offset (* 4 v_~q1_back~0_88)))))))) is different from false [2023-11-30 09:26:31,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:26:31,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 59 [2023-11-30 09:26:31,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:26:31,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3008 treesize of output 2936 [2023-11-30 09:26:31,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:26:31,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 307 treesize of output 303 [2023-11-30 09:26:31,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:26:31,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 452 treesize of output 436 [2023-11-30 09:26:31,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:26:31,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 428 treesize of output 388 [2023-11-30 09:26:31,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 230 [2023-11-30 09:26:33,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-30 09:26:33,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088243838] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:26:33,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:26:33,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 24, 23] total 63 [2023-11-30 09:26:33,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107054495] [2023-11-30 09:26:33,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:26:33,008 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-11-30 09:26:33,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:26:33,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-11-30 09:26:33,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=3558, Unknown=24, NotChecked=122, Total=4032 [2023-11-30 09:26:33,012 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 327 [2023-11-30 09:26:33,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 725 places, 3949 transitions, 101678 flow. Second operand has 64 states, 64 states have (on average 167.84375) internal successors, (10742), 64 states have internal predecessors, (10742), 0 states have call successors, (0), 0 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 09:26:33,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:26:33,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 327 [2023-11-30 09:26:33,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:26:40,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:27:16,619 INFO L124 PetriNetUnfolderBase]: 20249/48957 cut-off events. [2023-11-30 09:27:16,619 INFO L125 PetriNetUnfolderBase]: For 869831/1063351 co-relation queries the response was YES. [2023-11-30 09:27:16,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467719 conditions, 48957 events. 20249/48957 cut-off events. For 869831/1063351 co-relation queries the response was YES. Maximal size of possible extension queue 1748. Compared 549334 event pairs, 2085 based on Foata normal form. 478/34450 useless extension candidates. Maximal degree in co-relation 333300. Up to 19986 conditions per place. [2023-11-30 09:27:17,480 INFO L140 encePairwiseOnDemand]: 278/327 looper letters, 3172 selfloop transitions, 314 changer transitions 286/4028 dead transitions. [2023-11-30 09:27:17,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 775 places, 4028 transitions, 111520 flow [2023-11-30 09:27:17,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-11-30 09:27:17,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2023-11-30 09:27:17,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 8731 transitions. [2023-11-30 09:27:17,485 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5235354080470108 [2023-11-30 09:27:17,485 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 8731 transitions. [2023-11-30 09:27:17,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 8731 transitions. [2023-11-30 09:27:17,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:27:17,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 8731 transitions. [2023-11-30 09:27:17,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 171.19607843137254) internal successors, (8731), 51 states have internal predecessors, (8731), 0 states have call successors, (0), 0 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 09:27:17,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 327.0) internal successors, (17004), 52 states have internal predecessors, (17004), 0 states have call successors, (0), 0 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 09:27:17,502 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 327.0) internal successors, (17004), 52 states have internal predecessors, (17004), 0 states have call successors, (0), 0 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 09:27:17,502 INFO L307 CegarLoopForPetriNet]: 289 programPoint places, 486 predicate places. [2023-11-30 09:27:17,502 INFO L500 AbstractCegarLoop]: Abstraction has has 775 places, 4028 transitions, 111520 flow [2023-11-30 09:27:17,503 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 167.84375) internal successors, (10742), 64 states have internal predecessors, (10742), 0 states have call successors, (0), 0 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 09:27:17,503 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:27:17,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:27:17,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-30 09:27:17,708 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-30 09:27:17,709 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2023-11-30 09:27:17,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:27:17,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2022462291, now seen corresponding path program 1 times [2023-11-30 09:27:17,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:27:17,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696337694] [2023-11-30 09:27:17,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:27:17,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:27:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:27:19,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:27:19,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:27:19,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696337694] [2023-11-30 09:27:19,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696337694] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:27:19,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625409389] [2023-11-30 09:27:19,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:27:19,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:27:19,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:27:19,160 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:27:19,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-30 09:27:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:27:19,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-30 09:27:19,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:27:19,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-30 09:27:19,468 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 09:27:19,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 09:27:20,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-30 09:27:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 09:27:20,632 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:27:20,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:27:20,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 34 [2023-11-30 09:27:20,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-30 09:27:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 09:27:22,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625409389] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:27:22,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:27:22,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 17, 17] total 56 [2023-11-30 09:27:22,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440632249] [2023-11-30 09:27:22,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:27:22,124 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-11-30 09:27:22,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:27:22,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-11-30 09:27:22,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=2926, Unknown=1, NotChecked=0, Total=3192 [2023-11-30 09:27:22,128 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 327 [2023-11-30 09:27:22,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 775 places, 4028 transitions, 111520 flow. Second operand has 57 states, 57 states have (on average 159.6140350877193) internal successors, (9098), 57 states have internal predecessors, (9098), 0 states have call successors, (0), 0 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 09:27:22,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:27:22,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 327 [2023-11-30 09:27:22,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:28:19,494 INFO L124 PetriNetUnfolderBase]: 34700/83679 cut-off events. [2023-11-30 09:28:19,494 INFO L125 PetriNetUnfolderBase]: For 1616048/2065417 co-relation queries the response was YES. [2023-11-30 09:28:19,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839040 conditions, 83679 events. 34700/83679 cut-off events. For 1616048/2065417 co-relation queries the response was YES. Maximal size of possible extension queue 2050. Compared 988183 event pairs, 3364 based on Foata normal form. 630/58563 useless extension candidates. Maximal degree in co-relation 331651. Up to 33572 conditions per place. [2023-11-30 09:28:21,364 INFO L140 encePairwiseOnDemand]: 268/327 looper letters, 4700 selfloop transitions, 550 changer transitions 370/5826 dead transitions. [2023-11-30 09:28:21,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 847 places, 5826 transitions, 181081 flow [2023-11-30 09:28:21,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2023-11-30 09:28:21,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2023-11-30 09:28:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 12528 transitions. [2023-11-30 09:28:21,373 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.4975574883831765 [2023-11-30 09:28:21,373 INFO L72 ComplementDD]: Start complementDD. Operand 77 states and 12528 transitions. [2023-11-30 09:28:21,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 12528 transitions. [2023-11-30 09:28:21,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:28:21,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 77 states and 12528 transitions. [2023-11-30 09:28:21,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 78 states, 77 states have (on average 162.7012987012987) internal successors, (12528), 77 states have internal predecessors, (12528), 0 states have call successors, (0), 0 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 09:28:21,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 78 states, 78 states have (on average 327.0) internal successors, (25506), 78 states have internal predecessors, (25506), 0 states have call successors, (0), 0 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 09:28:21,403 INFO L81 ComplementDD]: Finished complementDD. Result has 78 states, 78 states have (on average 327.0) internal successors, (25506), 78 states have internal predecessors, (25506), 0 states have call successors, (0), 0 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 09:28:21,403 INFO L307 CegarLoopForPetriNet]: 289 programPoint places, 558 predicate places. [2023-11-30 09:28:21,404 INFO L500 AbstractCegarLoop]: Abstraction has has 847 places, 5826 transitions, 181081 flow [2023-11-30 09:28:21,405 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 159.6140350877193) internal successors, (9098), 57 states have internal predecessors, (9098), 0 states have call successors, (0), 0 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 09:28:21,405 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:28:21,405 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:28:21,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-30 09:28:21,609 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:28:21,610 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2023-11-30 09:28:21,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:28:21,611 INFO L85 PathProgramCache]: Analyzing trace with hash 426823329, now seen corresponding path program 1 times [2023-11-30 09:28:21,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:28:21,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489375357] [2023-11-30 09:28:21,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:28:21,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:28:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:28:22,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 09:28:22,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:28:22,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489375357] [2023-11-30 09:28:22,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489375357] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:28:22,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814164360] [2023-11-30 09:28:22,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:28:22,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:28:22,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:28:22,533 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:28:22,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-30 09:28:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:28:22,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-30 09:28:22,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:28:23,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-30 09:28:23,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-30 09:28:24,103 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 09:28:24,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 09:28:24,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-30 09:28:25,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 09:28:25,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-30 09:28:25,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 09:28:25,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-30 09:28:25,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 09:28:25,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-30 09:28:25,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:28:25,745 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:28:29,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:28:29,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 57 [2023-11-30 09:28:29,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:28:29,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 460 treesize of output 460 [2023-11-30 09:28:29,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 288 treesize of output 240 [2023-11-30 09:28:29,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:28:29,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 384 treesize of output 368 [2023-11-30 09:28:29,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:28:29,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 360 treesize of output 320 [2023-11-30 09:28:29,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:28:29,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 209 [2023-11-30 09:28:32,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:28:32,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 157 [2023-11-30 09:28:33,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:28:33,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814164360] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:28:33,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:28:33,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 27, 25] total 69 [2023-11-30 09:28:33,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613903038] [2023-11-30 09:28:33,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:28:33,051 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2023-11-30 09:28:33,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:28:33,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2023-11-30 09:28:33,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=4428, Unknown=37, NotChecked=0, Total=4830 [2023-11-30 09:28:33,056 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 327 [2023-11-30 09:28:33,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 847 places, 5826 transitions, 181081 flow. Second operand has 70 states, 70 states have (on average 157.9) internal successors, (11053), 70 states have internal predecessors, (11053), 0 states have call successors, (0), 0 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 09:28:33,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:28:33,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 327 [2023-11-30 09:28:33,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:28:43,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:28:57,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:29:03,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:29:05,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:29:07,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:29:08,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:29:09,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:29:10,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:29:29,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:29:31,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:29:33,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:29:36,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:29:38,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:29:40,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:29:42,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:29:44,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:29:47,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:29:49,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:29:51,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:29:53,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:29:55,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:29:58,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:30:01,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:30:03,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:30:10,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:30:14,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:30:16,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:30:19,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:30:21,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:30:24,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:30:27,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:30:30,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:30:32,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:30:34,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:30:37,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:30:39,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:30:41,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:30:43,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:30:45,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:30:48,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:30:50,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:30:52,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:30:57,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:30:59,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:31:02,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:31:07,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:31:10,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:31:12,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:31:14,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:31:16,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:31:18,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:31:20,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:31:22,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:31:25,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:31:27,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:31:30,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:31:32,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:33:06,670 INFO L124 PetriNetUnfolderBase]: 39379/93555 cut-off events. [2023-11-30 09:33:06,670 INFO L125 PetriNetUnfolderBase]: For 2058235/2664993 co-relation queries the response was YES. [2023-11-30 09:33:07,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006447 conditions, 93555 events. 39379/93555 cut-off events. For 2058235/2664993 co-relation queries the response was YES. Maximal size of possible extension queue 2285. Compared 1111786 event pairs, 3619 based on Foata normal form. 4176/69354 useless extension candidates. Maximal degree in co-relation 398453. Up to 38664 conditions per place. [2023-11-30 09:33:08,905 INFO L140 encePairwiseOnDemand]: 262/327 looper letters, 5135 selfloop transitions, 799 changer transitions 377/6513 dead transitions. [2023-11-30 09:33:08,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 940 places, 6513 transitions, 217806 flow [2023-11-30 09:33:08,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-11-30 09:33:08,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2023-11-30 09:33:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 15119 transitions. [2023-11-30 09:33:08,933 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.49186674474591713 [2023-11-30 09:33:08,934 INFO L72 ComplementDD]: Start complementDD. Operand 94 states and 15119 transitions. [2023-11-30 09:33:08,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 15119 transitions. [2023-11-30 09:33:08,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:33:08,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 94 states and 15119 transitions. [2023-11-30 09:33:08,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 95 states, 94 states have (on average 160.8404255319149) internal successors, (15119), 94 states have internal predecessors, (15119), 0 states have call successors, (0), 0 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 09:33:08,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 95 states, 95 states have (on average 327.0) internal successors, (31065), 95 states have internal predecessors, (31065), 0 states have call successors, (0), 0 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 09:33:08,994 INFO L81 ComplementDD]: Finished complementDD. Result has 95 states, 95 states have (on average 327.0) internal successors, (31065), 95 states have internal predecessors, (31065), 0 states have call successors, (0), 0 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 09:33:08,995 INFO L307 CegarLoopForPetriNet]: 289 programPoint places, 651 predicate places. [2023-11-30 09:33:08,995 INFO L500 AbstractCegarLoop]: Abstraction has has 940 places, 6513 transitions, 217806 flow [2023-11-30 09:33:08,996 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 157.9) internal successors, (11053), 70 states have internal predecessors, (11053), 0 states have call successors, (0), 0 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 09:33:08,996 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:33:08,996 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:33:09,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-30 09:33:09,197 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2023-11-30 09:33:09,198 INFO L425 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 58 more)] === [2023-11-30 09:33:09,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:33:09,198 INFO L85 PathProgramCache]: Analyzing trace with hash -89592061, now seen corresponding path program 1 times [2023-11-30 09:33:09,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:33:09,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254661579] [2023-11-30 09:33:09,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:33:09,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:33:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:33:09,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 09:33:09,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:33:09,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254661579] [2023-11-30 09:33:09,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254661579] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:33:09,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068743808] [2023-11-30 09:33:09,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:33:09,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:33:09,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:33:09,480 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:33:09,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-30 09:33:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:33:09,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 09:33:09,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:33:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-30 09:33:09,711 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 09:33:09,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068743808] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:33:09,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 09:33:09,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2023-11-30 09:33:09,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089490122] [2023-11-30 09:33:09,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:33:09,712 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 09:33:09,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:33:09,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 09:33:09,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-30 09:33:09,713 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 327 [2023-11-30 09:33:09,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 940 places, 6513 transitions, 217806 flow. Second operand has 4 states, 4 states have (on average 277.75) internal successors, (1111), 4 states have internal predecessors, (1111), 0 states have call successors, (0), 0 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 09:33:09,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:33:09,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 327 [2023-11-30 09:33:09,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-11-30 09:33:50,822 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-30 09:33:50,831 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-30 09:33:51,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 09:33:51,086 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 61 remaining) [2023-11-30 09:33:51,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-30 09:33:51,298 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:33:51,301 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). [2023-11-30 09:33:51,302 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 61 remaining) [2023-11-30 09:33:51,303 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 61 remaining) [2023-11-30 09:33:51,303 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 61 remaining) [2023-11-30 09:33:51,303 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 61 remaining) [2023-11-30 09:33:51,303 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 61 remaining) [2023-11-30 09:33:51,303 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 61 remaining) [2023-11-30 09:33:51,303 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 61 remaining) [2023-11-30 09:33:51,303 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 61 remaining) [2023-11-30 09:33:51,303 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 61 remaining) [2023-11-30 09:33:51,303 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 61 remaining) [2023-11-30 09:33:51,303 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 61 remaining) [2023-11-30 09:33:51,303 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 61 remaining) [2023-11-30 09:33:51,303 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 61 remaining) [2023-11-30 09:33:51,304 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 61 remaining) [2023-11-30 09:33:51,304 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 61 remaining) [2023-11-30 09:33:51,304 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 61 remaining) [2023-11-30 09:33:51,304 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 61 remaining) [2023-11-30 09:33:51,304 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 61 remaining) [2023-11-30 09:33:51,304 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 61 remaining) [2023-11-30 09:33:51,304 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 61 remaining) [2023-11-30 09:33:51,304 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 61 remaining) [2023-11-30 09:33:51,304 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 61 remaining) [2023-11-30 09:33:51,304 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 61 remaining) [2023-11-30 09:33:51,304 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 61 remaining) [2023-11-30 09:33:51,305 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 61 remaining) [2023-11-30 09:33:51,305 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 61 remaining) [2023-11-30 09:33:51,305 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 61 remaining) [2023-11-30 09:33:51,305 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 61 remaining) [2023-11-30 09:33:51,305 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 61 remaining) [2023-11-30 09:33:51,305 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 61 remaining) [2023-11-30 09:33:51,305 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 61 remaining) [2023-11-30 09:33:51,305 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 61 remaining) [2023-11-30 09:33:51,305 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 61 remaining) [2023-11-30 09:33:51,305 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 61 remaining) [2023-11-30 09:33:51,305 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 61 remaining) [2023-11-30 09:33:51,305 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 61 remaining) [2023-11-30 09:33:51,305 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 61 remaining) [2023-11-30 09:33:51,305 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 61 remaining) [2023-11-30 09:33:51,305 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 61 remaining) [2023-11-30 09:33:51,305 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 61 remaining) [2023-11-30 09:33:51,306 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 61 remaining) [2023-11-30 09:33:51,306 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 61 remaining) [2023-11-30 09:33:51,306 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 61 remaining) [2023-11-30 09:33:51,306 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 61 remaining) [2023-11-30 09:33:51,306 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 61 remaining) [2023-11-30 09:33:51,306 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 61 remaining) [2023-11-30 09:33:51,306 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 61 remaining) [2023-11-30 09:33:51,306 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 61 remaining) [2023-11-30 09:33:51,306 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 61 remaining) [2023-11-30 09:33:51,306 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 61 remaining) [2023-11-30 09:33:51,306 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 61 remaining) [2023-11-30 09:33:51,306 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 61 remaining) [2023-11-30 09:33:51,306 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 61 remaining) [2023-11-30 09:33:51,306 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 61 remaining) [2023-11-30 09:33:51,306 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 61 remaining) [2023-11-30 09:33:51,306 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 61 remaining) [2023-11-30 09:33:51,306 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 61 remaining) [2023-11-30 09:33:51,307 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 61 remaining) [2023-11-30 09:33:51,307 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 61 remaining) [2023-11-30 09:33:51,307 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 61 remaining) [2023-11-30 09:33:51,307 INFO L457 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:33:51,319 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 09:33:51,320 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 09:33:51,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 09:33:51 BasicIcfg [2023-11-30 09:33:51,335 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 09:33:51,335 INFO L158 Benchmark]: Toolchain (without parser) took 824189.30ms. Allocated memory was 379.6MB in the beginning and 9.7GB in the end (delta: 9.3GB). Free memory was 340.4MB in the beginning and 5.1GB in the end (delta: -4.7GB). Peak memory consumption was 5.5GB. Max. memory is 16.0GB. [2023-11-30 09:33:51,335 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 314.6MB. Free memory is still 271.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 09:33:51,335 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.34ms. Allocated memory is still 379.6MB. Free memory was 340.4MB in the beginning and 327.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 09:33:51,335 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.12ms. Allocated memory is still 379.6MB. Free memory was 327.8MB in the beginning and 324.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 09:33:51,335 INFO L158 Benchmark]: Boogie Preprocessor took 25.02ms. Allocated memory is still 379.6MB. Free memory was 324.9MB in the beginning and 322.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 09:33:51,335 INFO L158 Benchmark]: RCFGBuilder took 693.19ms. Allocated memory is still 379.6MB. Free memory was 322.8MB in the beginning and 261.2MB in the end (delta: 61.6MB). Peak memory consumption was 60.8MB. Max. memory is 16.0GB. [2023-11-30 09:33:51,336 INFO L158 Benchmark]: TraceAbstraction took 823236.47ms. Allocated memory was 379.6MB in the beginning and 9.7GB in the end (delta: 9.3GB). Free memory was 259.9MB in the beginning and 5.1GB in the end (delta: -4.8GB). Peak memory consumption was 5.4GB. Max. memory is 16.0GB. [2023-11-30 09:33:51,336 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 314.6MB. Free memory is still 271.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 195.34ms. Allocated memory is still 379.6MB. Free memory was 340.4MB in the beginning and 327.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 34.12ms. Allocated memory is still 379.6MB. Free memory was 327.8MB in the beginning and 324.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.02ms. Allocated memory is still 379.6MB. Free memory was 324.9MB in the beginning and 322.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 693.19ms. Allocated memory is still 379.6MB. Free memory was 322.8MB in the beginning and 261.2MB in the end (delta: 61.6MB). Peak memory consumption was 60.8MB. Max. memory is 16.0GB. * TraceAbstraction took 823236.47ms. Allocated memory was 379.6MB in the beginning and 9.7GB in the end (delta: 9.3GB). Free memory was 259.9MB in the beginning and 5.1GB in the end (delta: -4.8GB). Peak memory consumption was 5.4GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 160]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 160]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 160]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 160]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 160]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 160]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 143]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 142]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - TimeoutResultAtElement [Line: 144]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 275/327 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 493741 conditions, 43283 events (18075/43282 cut-off events. For 1048113/1226762 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 509729 event pairs, 2607 based on Foata normal form. 915/34085 useless extension candidates. Maximal degree in co-relation 254814. Up to 16575 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 380 locations, 61 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 823.1s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 762.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 858 mSolverCounterUnknown, 16191 SdHoareTripleChecker+Valid, 340.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16191 mSDsluCounter, 19597 SdHoareTripleChecker+Invalid, 333.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 782 IncrementalHoareTripleChecker+Unchecked, 18625 mSDsCounter, 1023 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39939 IncrementalHoareTripleChecker+Invalid, 42602 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1023 mSolverCounterUnsat, 972 mSDtfsCounter, 39939 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4828 GetRequests, 3703 SyntacticMatches, 10 SemanticMatches, 1115 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 32752 ImplicationChecksByTransitivity, 161.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217806occurred in iteration=20, InterpolantAutomatonStates: 692, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 54.7s InterpolantComputationTime, 5749 NumberOfCodeBlocks, 5689 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 7384 ConstructedInterpolants, 853 QuantifiedInterpolants, 89289 SizeOfPredicates, 227 NumberOfNonLiveVariables, 5126 ConjunctsInSsa, 346 ConjunctsInUnsatCore, 45 InterpolantComputations, 11 PerfectInterpolantSequences, 162/973 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown [2023-11-30 09:33:51,572 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-11-30 09:33:51,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 !ENTRY org.eclipse.osgi 4 0 2023-11-30 09:33:51.614 !MESSAGE Application error !STACK 1 org.eclipse.core.internal.resources.ResourceException(/)[568]: java.io.FileNotFoundException: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/162438d03/.metadata/.plugins/org.eclipse.core.resources/.root/1.tree (No such file or directory) at java.base/java.io.FileOutputStream.open0(Native Method) at java.base/java.io.FileOutputStream.open(FileOutputStream.java:298) at java.base/java.io.FileOutputStream.(FileOutputStream.java:237) at java.base/java.io.FileOutputStream.(FileOutputStream.java:187) at org.eclipse.core.internal.localstore.SafeFileOutputStream.(SafeFileOutputStream.java:55) at org.eclipse.core.internal.resources.SaveManager.saveTree(SaveManager.java:1381) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1168) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2333) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2322) at de.uni_freiburg.informatik.ultimate.core.coreplugin.UltimateCore.start(UltimateCore.java:190) at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.base/java.lang.reflect.Method.invoke(Method.java:566) at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:657) at org.eclipse.equinox.launcher.Main.basicRun(Main.java:594) at org.eclipse.equinox.launcher.Main.run(Main.java:1465) at org.eclipse.equinox.launcher.Main.main(Main.java:1438) An error has occurred. See the log file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/162438d03/.metadata/.log.