/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:21:22,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:21:22,722 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 21:21:22,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:21:22,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:21:22,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:21:22,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:21:22,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:21:22,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:21:22,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:21:22,756 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:21:22,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:21:22,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:21:22,757 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:21:22,757 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:21:22,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:21:22,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:21:22,758 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:21:22,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:21:22,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:21:22,758 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:21:22,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:21:22,759 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:21:22,760 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:21:22,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:21:22,760 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:21:22,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:21:22,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:21:22,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:21:22,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:21:22,761 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:21:22,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:21:22,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:21:22,762 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:21:22,762 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:21:22,762 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-26 21:21:23,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:21:23,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:21:23,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:21:23,024 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:21:23,024 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:21:23,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-26 21:21:24,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:21:24,336 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:21:24,337 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-26 21:21:24,357 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1951ca494/788b9ddf8be74176ad896e91540be3c6/FLAGff69fe140 [2023-08-26 21:21:24,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1951ca494/788b9ddf8be74176ad896e91540be3c6 [2023-08-26 21:21:24,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:21:24,374 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:21:24,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:21:24,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:21:24,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:21:24,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:21:24" (1/1) ... [2023-08-26 21:21:24,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5c6aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:24, skipping insertion in model container [2023-08-26 21:21:24,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:21:24" (1/1) ... [2023-08-26 21:21:24,423 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:21:24,720 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:21:24,729 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:21:24,741 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:21:24,742 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:21:24,761 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:21:24,782 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:21:24,782 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:21:24,787 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:21:24,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:24 WrapperNode [2023-08-26 21:21:24,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:21:24,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:21:24,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:21:24,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:21:24,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:24" (1/1) ... [2023-08-26 21:21:24,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:24" (1/1) ... [2023-08-26 21:21:24,826 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 152 [2023-08-26 21:21:24,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:21:24,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:21:24,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:21:24,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:21:24,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:24" (1/1) ... [2023-08-26 21:21:24,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:24" (1/1) ... [2023-08-26 21:21:24,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:24" (1/1) ... [2023-08-26 21:21:24,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:24" (1/1) ... [2023-08-26 21:21:24,856 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:24" (1/1) ... [2023-08-26 21:21:24,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:24" (1/1) ... [2023-08-26 21:21:24,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:24" (1/1) ... [2023-08-26 21:21:24,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:24" (1/1) ... [2023-08-26 21:21:24,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:21:24,863 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:21:24,863 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:21:24,863 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:21:24,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:24" (1/1) ... [2023-08-26 21:21:24,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:21:24,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:21:24,932 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 21:21:24,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 21:21:24,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:21:24,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:21:24,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:21:24,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:21:24,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:21:24,986 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:21:24,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:21:24,986 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:21:24,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:21:24,987 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:21:24,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:21:24,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:21:24,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:21:24,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:21:24,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:21:24,988 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 21:21:25,093 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:21:25,095 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:21:25,365 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:21:25,475 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:21:25,475 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:21:25,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:21:25 BoogieIcfgContainer [2023-08-26 21:21:25,477 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:21:25,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:21:25,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:21:25,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:21:25,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:21:24" (1/3) ... [2023-08-26 21:21:25,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1427a4ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:21:25, skipping insertion in model container [2023-08-26 21:21:25,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:24" (2/3) ... [2023-08-26 21:21:25,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1427a4ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:21:25, skipping insertion in model container [2023-08-26 21:21:25,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:21:25" (3/3) ... [2023-08-26 21:21:25,482 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-26 21:21:25,492 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:21:25,492 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 21:21:25,492 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:21:25,534 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:21:25,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 116 transitions, 247 flow [2023-08-26 21:21:25,607 INFO L124 PetriNetUnfolderBase]: 3/113 cut-off events. [2023-08-26 21:21:25,607 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:21:25,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 3/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-26 21:21:25,611 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 116 transitions, 247 flow [2023-08-26 21:21:25,614 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 113 transitions, 235 flow [2023-08-26 21:21:25,616 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:21:25,624 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 113 transitions, 235 flow [2023-08-26 21:21:25,627 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 113 transitions, 235 flow [2023-08-26 21:21:25,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 113 transitions, 235 flow [2023-08-26 21:21:25,657 INFO L124 PetriNetUnfolderBase]: 3/113 cut-off events. [2023-08-26 21:21:25,657 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:21:25,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 3/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-26 21:21:25,659 INFO L119 LiptonReduction]: Number of co-enabled transitions 2616 [2023-08-26 21:21:28,723 INFO L134 LiptonReduction]: Checked pairs total: 9281 [2023-08-26 21:21:28,724 INFO L136 LiptonReduction]: Total number of compositions: 100 [2023-08-26 21:21:28,733 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:21:28,738 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5c4e1042, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:21:28,738 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-26 21:21:28,740 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:21:28,740 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-26 21:21:28,740 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:21:28,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:28,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:21:28,741 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:28,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:28,745 INFO L85 PathProgramCache]: Analyzing trace with hash 498975470, now seen corresponding path program 1 times [2023-08-26 21:21:28,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:28,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900644732] [2023-08-26 21:21:28,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:28,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:28,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:28,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:28,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900644732] [2023-08-26 21:21:28,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900644732] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:28,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:28,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:21:28,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013347848] [2023-08-26 21:21:28,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:28,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:21:28,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:28,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:21:28,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:21:28,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 216 [2023-08-26 21:21:28,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:28,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:28,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 216 [2023-08-26 21:21:28,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:29,189 INFO L124 PetriNetUnfolderBase]: 1578/2427 cut-off events. [2023-08-26 21:21:29,190 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 21:21:29,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4887 conditions, 2427 events. 1578/2427 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 12645 event pairs, 448 based on Foata normal form. 114/1716 useless extension candidates. Maximal degree in co-relation 4876. Up to 1916 conditions per place. [2023-08-26 21:21:29,205 INFO L140 encePairwiseOnDemand]: 205/216 looper letters, 42 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2023-08-26 21:21:29,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 205 flow [2023-08-26 21:21:29,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:21:29,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:21:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2023-08-26 21:21:29,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2023-08-26 21:21:29,216 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 330 transitions. [2023-08-26 21:21:29,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 330 transitions. [2023-08-26 21:21:29,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:29,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 330 transitions. [2023-08-26 21:21:29,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:29,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:29,225 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:29,226 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 3 states and 330 transitions. [2023-08-26 21:21:29,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 205 flow [2023-08-26 21:21:29,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 21:21:29,230 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 102 flow [2023-08-26 21:21:29,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-08-26 21:21:29,234 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-26 21:21:29,234 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 102 flow [2023-08-26 21:21:29,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:29,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:29,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:29,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:21:29,235 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:29,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:29,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1463679836, now seen corresponding path program 1 times [2023-08-26 21:21:29,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:29,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223410773] [2023-08-26 21:21:29,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:29,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:29,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:29,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:29,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223410773] [2023-08-26 21:21:29,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223410773] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:29,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:29,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:21:29,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236372542] [2023-08-26 21:21:29,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:29,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:21:29,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:29,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:21:29,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:21:29,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 216 [2023-08-26 21:21:29,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:29,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:29,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 216 [2023-08-26 21:21:29,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:29,665 INFO L124 PetriNetUnfolderBase]: 1105/1898 cut-off events. [2023-08-26 21:21:29,665 INFO L125 PetriNetUnfolderBase]: For 179/211 co-relation queries the response was YES. [2023-08-26 21:21:29,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4491 conditions, 1898 events. 1105/1898 cut-off events. For 179/211 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 11312 event pairs, 223 based on Foata normal form. 0/1501 useless extension candidates. Maximal degree in co-relation 4480. Up to 1315 conditions per place. [2023-08-26 21:21:29,676 INFO L140 encePairwiseOnDemand]: 213/216 looper letters, 39 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-26 21:21:29,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 47 transitions, 226 flow [2023-08-26 21:21:29,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:21:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:21:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2023-08-26 21:21:29,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015432098765432 [2023-08-26 21:21:29,681 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2023-08-26 21:21:29,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2023-08-26 21:21:29,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:29,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2023-08-26 21:21:29,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:29,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:29,686 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:29,686 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 102 flow. Second operand 3 states and 325 transitions. [2023-08-26 21:21:29,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 47 transitions, 226 flow [2023-08-26 21:21:29,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 47 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:21:29,689 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 100 flow [2023-08-26 21:21:29,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-08-26 21:21:29,690 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-26 21:21:29,690 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 100 flow [2023-08-26 21:21:29,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:29,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:29,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:29,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:21:29,699 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:29,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:29,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1976848659, now seen corresponding path program 1 times [2023-08-26 21:21:29,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:29,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460054895] [2023-08-26 21:21:29,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:29,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:30,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:30,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:30,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460054895] [2023-08-26 21:21:30,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460054895] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:30,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:30,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:21:30,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690341121] [2023-08-26 21:21:30,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:30,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:21:30,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:30,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:21:30,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:21:30,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 216 [2023-08-26 21:21:30,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:30,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:30,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 216 [2023-08-26 21:21:30,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:30,708 INFO L124 PetriNetUnfolderBase]: 3509/5504 cut-off events. [2023-08-26 21:21:30,709 INFO L125 PetriNetUnfolderBase]: For 856/977 co-relation queries the response was YES. [2023-08-26 21:21:30,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12990 conditions, 5504 events. 3509/5504 cut-off events. For 856/977 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 32274 event pairs, 421 based on Foata normal form. 8/4501 useless extension candidates. Maximal degree in co-relation 12978. Up to 2618 conditions per place. [2023-08-26 21:21:30,732 INFO L140 encePairwiseOnDemand]: 205/216 looper letters, 87 selfloop transitions, 22 changer transitions 0/112 dead transitions. [2023-08-26 21:21:30,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 112 transitions, 552 flow [2023-08-26 21:21:30,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:21:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:21:30,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 660 transitions. [2023-08-26 21:21:30,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4365079365079365 [2023-08-26 21:21:30,734 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 660 transitions. [2023-08-26 21:21:30,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 660 transitions. [2023-08-26 21:21:30,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:30,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 660 transitions. [2023-08-26 21:21:30,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.28571428571429) internal successors, (660), 7 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:30,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:30,738 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:30,738 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 100 flow. Second operand 7 states and 660 transitions. [2023-08-26 21:21:30,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 112 transitions, 552 flow [2023-08-26 21:21:30,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 112 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:21:30,740 INFO L231 Difference]: Finished difference. Result has 49 places, 53 transitions, 256 flow [2023-08-26 21:21:30,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=256, PETRI_PLACES=49, PETRI_TRANSITIONS=53} [2023-08-26 21:21:30,741 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2023-08-26 21:21:30,741 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 53 transitions, 256 flow [2023-08-26 21:21:30,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:30,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:30,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:30,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:21:30,741 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:30,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:30,742 INFO L85 PathProgramCache]: Analyzing trace with hash 673476002, now seen corresponding path program 1 times [2023-08-26 21:21:30,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:30,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546977487] [2023-08-26 21:21:30,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:30,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:30,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:30,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546977487] [2023-08-26 21:21:30,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546977487] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:30,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:30,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:21:30,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52966391] [2023-08-26 21:21:30,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:30,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:21:30,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:30,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:21:30,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:21:30,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 216 [2023-08-26 21:21:30,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 53 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:30,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:30,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 216 [2023-08-26 21:21:30,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:31,145 INFO L124 PetriNetUnfolderBase]: 2332/3606 cut-off events. [2023-08-26 21:21:31,145 INFO L125 PetriNetUnfolderBase]: For 4657/4849 co-relation queries the response was YES. [2023-08-26 21:21:31,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11948 conditions, 3606 events. 2332/3606 cut-off events. For 4657/4849 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 20575 event pairs, 473 based on Foata normal form. 27/3026 useless extension candidates. Maximal degree in co-relation 11931. Up to 2663 conditions per place. [2023-08-26 21:21:31,163 INFO L140 encePairwiseOnDemand]: 209/216 looper letters, 69 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2023-08-26 21:21:31,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 544 flow [2023-08-26 21:21:31,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:21:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:21:31,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2023-08-26 21:21:31,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47685185185185186 [2023-08-26 21:21:31,165 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 412 transitions. [2023-08-26 21:21:31,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 412 transitions. [2023-08-26 21:21:31,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:31,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 412 transitions. [2023-08-26 21:21:31,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:31,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:31,168 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:31,168 INFO L175 Difference]: Start difference. First operand has 49 places, 53 transitions, 256 flow. Second operand 4 states and 412 transitions. [2023-08-26 21:21:31,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 81 transitions, 544 flow [2023-08-26 21:21:31,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 81 transitions, 544 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:21:31,178 INFO L231 Difference]: Finished difference. Result has 49 places, 50 transitions, 252 flow [2023-08-26 21:21:31,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=49, PETRI_TRANSITIONS=50} [2023-08-26 21:21:31,180 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2023-08-26 21:21:31,180 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 252 flow [2023-08-26 21:21:31,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:31,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:31,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:31,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:21:31,181 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:31,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:31,181 INFO L85 PathProgramCache]: Analyzing trace with hash -199879537, now seen corresponding path program 1 times [2023-08-26 21:21:31,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:31,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464507465] [2023-08-26 21:21:31,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:31,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:31,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:31,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:31,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464507465] [2023-08-26 21:21:31,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464507465] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:31,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:31,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:21:31,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467604365] [2023-08-26 21:21:31,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:31,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:21:31,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:31,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:21:31,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:21:31,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 216 [2023-08-26 21:21:31,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 252 flow. Second operand has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:31,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:31,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 216 [2023-08-26 21:21:31,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:31,476 INFO L124 PetriNetUnfolderBase]: 1740/2690 cut-off events. [2023-08-26 21:21:31,476 INFO L125 PetriNetUnfolderBase]: For 4270/4428 co-relation queries the response was YES. [2023-08-26 21:21:31,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9317 conditions, 2690 events. 1740/2690 cut-off events. For 4270/4428 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 14627 event pairs, 353 based on Foata normal form. 25/2527 useless extension candidates. Maximal degree in co-relation 9298. Up to 1111 conditions per place. [2023-08-26 21:21:31,533 INFO L140 encePairwiseOnDemand]: 209/216 looper letters, 95 selfloop transitions, 7 changer transitions 0/110 dead transitions. [2023-08-26 21:21:31,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 110 transitions, 754 flow [2023-08-26 21:21:31,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:21:31,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:21:31,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2023-08-26 21:21:31,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49537037037037035 [2023-08-26 21:21:31,535 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 428 transitions. [2023-08-26 21:21:31,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 428 transitions. [2023-08-26 21:21:31,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:31,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 428 transitions. [2023-08-26 21:21:31,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:31,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:31,538 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:31,539 INFO L175 Difference]: Start difference. First operand has 49 places, 50 transitions, 252 flow. Second operand 4 states and 428 transitions. [2023-08-26 21:21:31,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 110 transitions, 754 flow [2023-08-26 21:21:31,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 110 transitions, 749 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:21:31,545 INFO L231 Difference]: Finished difference. Result has 51 places, 53 transitions, 291 flow [2023-08-26 21:21:31,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=291, PETRI_PLACES=51, PETRI_TRANSITIONS=53} [2023-08-26 21:21:31,547 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2023-08-26 21:21:31,547 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 53 transitions, 291 flow [2023-08-26 21:21:31,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:31,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:31,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:31,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:21:31,547 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:31,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:31,548 INFO L85 PathProgramCache]: Analyzing trace with hash -89517730, now seen corresponding path program 1 times [2023-08-26 21:21:31,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:31,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814047208] [2023-08-26 21:21:31,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:31,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:31,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:31,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814047208] [2023-08-26 21:21:31,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814047208] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:31,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:31,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:21:31,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33861864] [2023-08-26 21:21:31,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:31,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:21:31,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:31,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:21:31,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:21:31,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 216 [2023-08-26 21:21:31,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 53 transitions, 291 flow. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:31,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:31,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 216 [2023-08-26 21:21:31,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:32,133 INFO L124 PetriNetUnfolderBase]: 2623/4031 cut-off events. [2023-08-26 21:21:32,133 INFO L125 PetriNetUnfolderBase]: For 8051/8275 co-relation queries the response was YES. [2023-08-26 21:21:32,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15167 conditions, 4031 events. 2623/4031 cut-off events. For 8051/8275 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 21932 event pairs, 503 based on Foata normal form. 139/3913 useless extension candidates. Maximal degree in co-relation 15147. Up to 2304 conditions per place. [2023-08-26 21:21:32,200 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 89 selfloop transitions, 14 changer transitions 3/113 dead transitions. [2023-08-26 21:21:32,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 113 transitions, 822 flow [2023-08-26 21:21:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:21:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:21:32,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 496 transitions. [2023-08-26 21:21:32,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45925925925925926 [2023-08-26 21:21:32,202 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 496 transitions. [2023-08-26 21:21:32,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 496 transitions. [2023-08-26 21:21:32,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:32,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 496 transitions. [2023-08-26 21:21:32,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:32,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:32,205 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:32,205 INFO L175 Difference]: Start difference. First operand has 51 places, 53 transitions, 291 flow. Second operand 5 states and 496 transitions. [2023-08-26 21:21:32,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 113 transitions, 822 flow [2023-08-26 21:21:32,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 113 transitions, 794 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-26 21:21:32,216 INFO L231 Difference]: Finished difference. Result has 57 places, 66 transitions, 430 flow [2023-08-26 21:21:32,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=430, PETRI_PLACES=57, PETRI_TRANSITIONS=66} [2023-08-26 21:21:32,217 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2023-08-26 21:21:32,217 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 66 transitions, 430 flow [2023-08-26 21:21:32,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:32,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:32,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:32,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:21:32,217 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:32,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:32,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1519830292, now seen corresponding path program 1 times [2023-08-26 21:21:32,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:32,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059536739] [2023-08-26 21:21:32,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:32,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:32,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:32,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:32,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059536739] [2023-08-26 21:21:32,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059536739] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:32,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:32,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:21:32,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501440617] [2023-08-26 21:21:32,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:32,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:21:32,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:32,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:21:32,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:21:32,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 216 [2023-08-26 21:21:32,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 66 transitions, 430 flow. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:32,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:32,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 216 [2023-08-26 21:21:32,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:32,826 INFO L124 PetriNetUnfolderBase]: 2839/4411 cut-off events. [2023-08-26 21:21:32,826 INFO L125 PetriNetUnfolderBase]: For 12997/13174 co-relation queries the response was YES. [2023-08-26 21:21:32,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18166 conditions, 4411 events. 2839/4411 cut-off events. For 12997/13174 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 24733 event pairs, 289 based on Foata normal form. 112/4282 useless extension candidates. Maximal degree in co-relation 18142. Up to 2358 conditions per place. [2023-08-26 21:21:32,846 INFO L140 encePairwiseOnDemand]: 208/216 looper letters, 107 selfloop transitions, 46 changer transitions 3/163 dead transitions. [2023-08-26 21:21:32,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 163 transitions, 1358 flow [2023-08-26 21:21:32,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:21:32,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:21:32,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 696 transitions. [2023-08-26 21:21:32,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2023-08-26 21:21:32,848 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 696 transitions. [2023-08-26 21:21:32,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 696 transitions. [2023-08-26 21:21:32,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:32,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 696 transitions. [2023-08-26 21:21:32,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.42857142857143) internal successors, (696), 7 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:32,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:32,851 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:32,851 INFO L175 Difference]: Start difference. First operand has 57 places, 66 transitions, 430 flow. Second operand 7 states and 696 transitions. [2023-08-26 21:21:32,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 163 transitions, 1358 flow [2023-08-26 21:21:32,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 163 transitions, 1356 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-26 21:21:32,867 INFO L231 Difference]: Finished difference. Result has 69 places, 98 transitions, 908 flow [2023-08-26 21:21:32,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=908, PETRI_PLACES=69, PETRI_TRANSITIONS=98} [2023-08-26 21:21:32,867 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 29 predicate places. [2023-08-26 21:21:32,867 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 98 transitions, 908 flow [2023-08-26 21:21:32,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:32,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:32,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:32,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:21:32,868 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:32,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:32,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1516976122, now seen corresponding path program 2 times [2023-08-26 21:21:32,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:32,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331912995] [2023-08-26 21:21:32,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:32,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:33,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:33,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:33,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331912995] [2023-08-26 21:21:33,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331912995] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:33,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:33,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:21:33,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303464739] [2023-08-26 21:21:33,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:33,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:21:33,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:33,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:21:33,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:21:33,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 216 [2023-08-26 21:21:33,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 98 transitions, 908 flow. Second operand has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:33,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:33,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 216 [2023-08-26 21:21:33,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:33,794 INFO L124 PetriNetUnfolderBase]: 3056/4730 cut-off events. [2023-08-26 21:21:33,795 INFO L125 PetriNetUnfolderBase]: For 27825/28042 co-relation queries the response was YES. [2023-08-26 21:21:33,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23013 conditions, 4730 events. 3056/4730 cut-off events. For 27825/28042 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 26638 event pairs, 369 based on Foata normal form. 130/4600 useless extension candidates. Maximal degree in co-relation 22981. Up to 2364 conditions per place. [2023-08-26 21:21:33,832 INFO L140 encePairwiseOnDemand]: 209/216 looper letters, 115 selfloop transitions, 61 changer transitions 3/186 dead transitions. [2023-08-26 21:21:33,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 186 transitions, 1986 flow [2023-08-26 21:21:33,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:21:33,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:21:33,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 668 transitions. [2023-08-26 21:21:33,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4417989417989418 [2023-08-26 21:21:33,834 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 668 transitions. [2023-08-26 21:21:33,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 668 transitions. [2023-08-26 21:21:33,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:33,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 668 transitions. [2023-08-26 21:21:33,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:33,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:33,838 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:33,838 INFO L175 Difference]: Start difference. First operand has 69 places, 98 transitions, 908 flow. Second operand 7 states and 668 transitions. [2023-08-26 21:21:33,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 186 transitions, 1986 flow [2023-08-26 21:21:33,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 186 transitions, 1954 flow, removed 16 selfloop flow, removed 0 redundant places. [2023-08-26 21:21:33,892 INFO L231 Difference]: Finished difference. Result has 81 places, 121 transitions, 1436 flow [2023-08-26 21:21:33,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1436, PETRI_PLACES=81, PETRI_TRANSITIONS=121} [2023-08-26 21:21:33,894 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 41 predicate places. [2023-08-26 21:21:33,894 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 121 transitions, 1436 flow [2023-08-26 21:21:33,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:33,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:33,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:33,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:21:33,895 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:33,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:33,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1519881225, now seen corresponding path program 1 times [2023-08-26 21:21:33,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:33,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300350986] [2023-08-26 21:21:33,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:33,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:34,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:34,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300350986] [2023-08-26 21:21:34,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300350986] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:34,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:34,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:21:34,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111314720] [2023-08-26 21:21:34,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:34,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:21:34,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:34,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:21:34,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:21:34,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 216 [2023-08-26 21:21:34,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 121 transitions, 1436 flow. Second operand has 6 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:34,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:34,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 216 [2023-08-26 21:21:34,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:34,857 INFO L124 PetriNetUnfolderBase]: 3319/5100 cut-off events. [2023-08-26 21:21:34,857 INFO L125 PetriNetUnfolderBase]: For 51880/52222 co-relation queries the response was YES. [2023-08-26 21:21:34,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28348 conditions, 5100 events. 3319/5100 cut-off events. For 51880/52222 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 28884 event pairs, 385 based on Foata normal form. 171/4981 useless extension candidates. Maximal degree in co-relation 28308. Up to 2379 conditions per place. [2023-08-26 21:21:34,890 INFO L140 encePairwiseOnDemand]: 209/216 looper letters, 161 selfloop transitions, 39 changer transitions 3/210 dead transitions. [2023-08-26 21:21:34,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 210 transitions, 2598 flow [2023-08-26 21:21:34,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:21:34,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:21:34,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 680 transitions. [2023-08-26 21:21:34,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497354497354497 [2023-08-26 21:21:34,892 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 680 transitions. [2023-08-26 21:21:34,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 680 transitions. [2023-08-26 21:21:34,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:34,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 680 transitions. [2023-08-26 21:21:34,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:34,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:34,895 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:34,895 INFO L175 Difference]: Start difference. First operand has 81 places, 121 transitions, 1436 flow. Second operand 7 states and 680 transitions. [2023-08-26 21:21:34,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 210 transitions, 2598 flow [2023-08-26 21:21:34,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 210 transitions, 2548 flow, removed 25 selfloop flow, removed 0 redundant places. [2023-08-26 21:21:34,988 INFO L231 Difference]: Finished difference. Result has 91 places, 134 transitions, 1688 flow [2023-08-26 21:21:34,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=1394, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1688, PETRI_PLACES=91, PETRI_TRANSITIONS=134} [2023-08-26 21:21:34,988 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 51 predicate places. [2023-08-26 21:21:34,988 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 134 transitions, 1688 flow [2023-08-26 21:21:34,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:34,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:34,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:34,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:21:34,989 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:34,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:34,989 INFO L85 PathProgramCache]: Analyzing trace with hash -129987617, now seen corresponding path program 1 times [2023-08-26 21:21:34,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:34,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193857729] [2023-08-26 21:21:34,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:34,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:35,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:35,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:35,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193857729] [2023-08-26 21:21:35,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193857729] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:35,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:35,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:21:35,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688675036] [2023-08-26 21:21:35,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:35,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:21:35,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:35,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:21:35,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:21:35,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 216 [2023-08-26 21:21:35,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 134 transitions, 1688 flow. Second operand has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:35,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:35,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 216 [2023-08-26 21:21:35,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:35,850 INFO L124 PetriNetUnfolderBase]: 3497/5418 cut-off events. [2023-08-26 21:21:35,850 INFO L125 PetriNetUnfolderBase]: For 70142/70457 co-relation queries the response was YES. [2023-08-26 21:21:35,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32981 conditions, 5418 events. 3497/5418 cut-off events. For 70142/70457 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 31269 event pairs, 318 based on Foata normal form. 136/5267 useless extension candidates. Maximal degree in co-relation 32935. Up to 2786 conditions per place. [2023-08-26 21:21:35,886 INFO L140 encePairwiseOnDemand]: 209/216 looper letters, 141 selfloop transitions, 75 changer transitions 3/226 dead transitions. [2023-08-26 21:21:35,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 226 transitions, 2980 flow [2023-08-26 21:21:35,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:21:35,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:21:35,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 684 transitions. [2023-08-26 21:21:35,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2023-08-26 21:21:35,888 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 684 transitions. [2023-08-26 21:21:35,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 684 transitions. [2023-08-26 21:21:35,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:35,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 684 transitions. [2023-08-26 21:21:35,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:35,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:35,891 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:35,891 INFO L175 Difference]: Start difference. First operand has 91 places, 134 transitions, 1688 flow. Second operand 7 states and 684 transitions. [2023-08-26 21:21:35,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 226 transitions, 2980 flow [2023-08-26 21:21:36,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 226 transitions, 2906 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-08-26 21:21:36,065 INFO L231 Difference]: Finished difference. Result has 99 places, 155 transitions, 2291 flow [2023-08-26 21:21:36,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=1627, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2291, PETRI_PLACES=99, PETRI_TRANSITIONS=155} [2023-08-26 21:21:36,066 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 59 predicate places. [2023-08-26 21:21:36,066 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 155 transitions, 2291 flow [2023-08-26 21:21:36,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:36,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:36,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:36,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:21:36,066 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:36,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:36,067 INFO L85 PathProgramCache]: Analyzing trace with hash -221292227, now seen corresponding path program 2 times [2023-08-26 21:21:36,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:36,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248689683] [2023-08-26 21:21:36,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:36,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:36,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:36,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248689683] [2023-08-26 21:21:36,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248689683] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:36,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:36,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:21:36,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426348128] [2023-08-26 21:21:36,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:36,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:21:36,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:36,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:21:36,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:21:36,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 216 [2023-08-26 21:21:36,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 155 transitions, 2291 flow. Second operand has 7 states, 7 states have (on average 87.85714285714286) internal successors, (615), 7 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:36,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:36,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 216 [2023-08-26 21:21:36,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:37,052 INFO L124 PetriNetUnfolderBase]: 3553/5510 cut-off events. [2023-08-26 21:21:37,052 INFO L125 PetriNetUnfolderBase]: For 87468/87845 co-relation queries the response was YES. [2023-08-26 21:21:37,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36114 conditions, 5510 events. 3553/5510 cut-off events. For 87468/87845 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 32032 event pairs, 317 based on Foata normal form. 147/5343 useless extension candidates. Maximal degree in co-relation 36063. Up to 2185 conditions per place. [2023-08-26 21:21:37,093 INFO L140 encePairwiseOnDemand]: 209/216 looper letters, 157 selfloop transitions, 67 changer transitions 3/234 dead transitions. [2023-08-26 21:21:37,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 234 transitions, 3418 flow [2023-08-26 21:21:37,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:21:37,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:21:37,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 675 transitions. [2023-08-26 21:21:37,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2023-08-26 21:21:37,095 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 675 transitions. [2023-08-26 21:21:37,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 675 transitions. [2023-08-26 21:21:37,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:37,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 675 transitions. [2023-08-26 21:21:37,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.42857142857143) internal successors, (675), 7 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:37,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:37,099 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:37,099 INFO L175 Difference]: Start difference. First operand has 99 places, 155 transitions, 2291 flow. Second operand 7 states and 675 transitions. [2023-08-26 21:21:37,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 234 transitions, 3418 flow [2023-08-26 21:21:37,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 234 transitions, 3283 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-08-26 21:21:37,221 INFO L231 Difference]: Finished difference. Result has 107 places, 166 transitions, 2644 flow [2023-08-26 21:21:37,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=2179, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2644, PETRI_PLACES=107, PETRI_TRANSITIONS=166} [2023-08-26 21:21:37,221 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 67 predicate places. [2023-08-26 21:21:37,221 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 166 transitions, 2644 flow [2023-08-26 21:21:37,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.85714285714286) internal successors, (615), 7 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:37,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:37,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:37,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:21:37,222 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:37,222 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:37,222 INFO L85 PathProgramCache]: Analyzing trace with hash -129937645, now seen corresponding path program 1 times [2023-08-26 21:21:37,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:37,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90635265] [2023-08-26 21:21:37,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:37,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:37,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:37,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:37,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90635265] [2023-08-26 21:21:37,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90635265] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:37,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:37,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:21:37,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186229089] [2023-08-26 21:21:37,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:37,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:21:37,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:37,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:21:37,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:21:37,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 216 [2023-08-26 21:21:37,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 166 transitions, 2644 flow. Second operand has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:37,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:37,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 216 [2023-08-26 21:21:37,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:38,376 INFO L124 PetriNetUnfolderBase]: 3918/6050 cut-off events. [2023-08-26 21:21:38,376 INFO L125 PetriNetUnfolderBase]: For 105414/105858 co-relation queries the response was YES. [2023-08-26 21:21:38,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41343 conditions, 6050 events. 3918/6050 cut-off events. For 105414/105858 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 35626 event pairs, 423 based on Foata normal form. 159/5864 useless extension candidates. Maximal degree in co-relation 41288. Up to 3226 conditions per place. [2023-08-26 21:21:38,432 INFO L140 encePairwiseOnDemand]: 207/216 looper letters, 129 selfloop transitions, 117 changer transitions 3/256 dead transitions. [2023-08-26 21:21:38,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 256 transitions, 3925 flow [2023-08-26 21:21:38,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:21:38,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:21:38,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 875 transitions. [2023-08-26 21:21:38,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45010288065843623 [2023-08-26 21:21:38,434 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 875 transitions. [2023-08-26 21:21:38,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 875 transitions. [2023-08-26 21:21:38,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:38,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 875 transitions. [2023-08-26 21:21:38,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.22222222222223) internal successors, (875), 9 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:38,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:38,438 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:38,439 INFO L175 Difference]: Start difference. First operand has 107 places, 166 transitions, 2644 flow. Second operand 9 states and 875 transitions. [2023-08-26 21:21:38,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 256 transitions, 3925 flow [2023-08-26 21:21:38,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 256 transitions, 3842 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-26 21:21:38,648 INFO L231 Difference]: Finished difference. Result has 117 places, 192 transitions, 3364 flow [2023-08-26 21:21:38,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=2570, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3364, PETRI_PLACES=117, PETRI_TRANSITIONS=192} [2023-08-26 21:21:38,648 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 77 predicate places. [2023-08-26 21:21:38,648 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 192 transitions, 3364 flow [2023-08-26 21:21:38,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:38,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:38,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:38,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:21:38,649 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:38,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:38,649 INFO L85 PathProgramCache]: Analyzing trace with hash -219743095, now seen corresponding path program 2 times [2023-08-26 21:21:38,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:38,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570693867] [2023-08-26 21:21:38,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:38,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:38,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:38,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:38,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570693867] [2023-08-26 21:21:38,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570693867] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:38,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:38,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:21:38,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219762524] [2023-08-26 21:21:38,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:38,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:21:38,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:38,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:21:38,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:21:38,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 216 [2023-08-26 21:21:38,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 192 transitions, 3364 flow. Second operand has 7 states, 7 states have (on average 89.85714285714286) internal successors, (629), 7 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:38,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:38,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 216 [2023-08-26 21:21:38,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:39,792 INFO L124 PetriNetUnfolderBase]: 4449/6902 cut-off events. [2023-08-26 21:21:39,792 INFO L125 PetriNetUnfolderBase]: For 143508/143974 co-relation queries the response was YES. [2023-08-26 21:21:39,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51662 conditions, 6902 events. 4449/6902 cut-off events. For 143508/143974 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 41988 event pairs, 361 based on Foata normal form. 221/6756 useless extension candidates. Maximal degree in co-relation 51603. Up to 2842 conditions per place. [2023-08-26 21:21:39,840 INFO L140 encePairwiseOnDemand]: 207/216 looper letters, 200 selfloop transitions, 126 changer transitions 3/336 dead transitions. [2023-08-26 21:21:39,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 336 transitions, 5812 flow [2023-08-26 21:21:39,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 21:21:39,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 21:21:39,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1071 transitions. [2023-08-26 21:21:39,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45075757575757575 [2023-08-26 21:21:39,843 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1071 transitions. [2023-08-26 21:21:39,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1071 transitions. [2023-08-26 21:21:39,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:39,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1071 transitions. [2023-08-26 21:21:39,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 97.36363636363636) internal successors, (1071), 11 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:39,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 216.0) internal successors, (2592), 12 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:39,848 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 216.0) internal successors, (2592), 12 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:39,848 INFO L175 Difference]: Start difference. First operand has 117 places, 192 transitions, 3364 flow. Second operand 11 states and 1071 transitions. [2023-08-26 21:21:39,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 336 transitions, 5812 flow [2023-08-26 21:21:40,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 336 transitions, 5539 flow, removed 56 selfloop flow, removed 4 redundant places. [2023-08-26 21:21:40,349 INFO L231 Difference]: Finished difference. Result has 128 places, 231 transitions, 4188 flow [2023-08-26 21:21:40,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=3173, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4188, PETRI_PLACES=128, PETRI_TRANSITIONS=231} [2023-08-26 21:21:40,349 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 88 predicate places. [2023-08-26 21:21:40,350 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 231 transitions, 4188 flow [2023-08-26 21:21:40,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.85714285714286) internal successors, (629), 7 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:40,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:40,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:40,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:21:40,350 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:40,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:40,350 INFO L85 PathProgramCache]: Analyzing trace with hash 266813888, now seen corresponding path program 1 times [2023-08-26 21:21:40,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:40,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336997289] [2023-08-26 21:21:40,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:40,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:40,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:40,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336997289] [2023-08-26 21:21:40,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336997289] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:40,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:40,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:21:40,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221235983] [2023-08-26 21:21:40,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:40,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:21:40,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:40,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:21:40,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:21:40,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 216 [2023-08-26 21:21:40,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 231 transitions, 4188 flow. Second operand has 7 states, 7 states have (on average 89.0) internal successors, (623), 7 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:40,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:40,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 216 [2023-08-26 21:21:40,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:41,636 INFO L124 PetriNetUnfolderBase]: 4799/7472 cut-off events. [2023-08-26 21:21:41,636 INFO L125 PetriNetUnfolderBase]: For 150115/150666 co-relation queries the response was YES. [2023-08-26 21:21:41,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58853 conditions, 7472 events. 4799/7472 cut-off events. For 150115/150666 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 46379 event pairs, 419 based on Foata normal form. 187/7253 useless extension candidates. Maximal degree in co-relation 58789. Up to 3073 conditions per place. [2023-08-26 21:21:41,693 INFO L140 encePairwiseOnDemand]: 207/216 looper letters, 204 selfloop transitions, 131 changer transitions 3/345 dead transitions. [2023-08-26 21:21:41,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 345 transitions, 6214 flow [2023-08-26 21:21:41,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 21:21:41,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 21:21:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1060 transitions. [2023-08-26 21:21:41,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44612794612794615 [2023-08-26 21:21:41,695 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1060 transitions. [2023-08-26 21:21:41,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1060 transitions. [2023-08-26 21:21:41,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:41,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1060 transitions. [2023-08-26 21:21:41,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 96.36363636363636) internal successors, (1060), 11 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:41,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 216.0) internal successors, (2592), 12 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:41,700 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 216.0) internal successors, (2592), 12 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:41,700 INFO L175 Difference]: Start difference. First operand has 128 places, 231 transitions, 4188 flow. Second operand 11 states and 1060 transitions. [2023-08-26 21:21:41,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 345 transitions, 6214 flow [2023-08-26 21:21:42,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 345 transitions, 6017 flow, removed 89 selfloop flow, removed 1 redundant places. [2023-08-26 21:21:42,133 INFO L231 Difference]: Finished difference. Result has 141 places, 243 transitions, 4669 flow [2023-08-26 21:21:42,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=3999, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4669, PETRI_PLACES=141, PETRI_TRANSITIONS=243} [2023-08-26 21:21:42,134 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 101 predicate places. [2023-08-26 21:21:42,134 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 243 transitions, 4669 flow [2023-08-26 21:21:42,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.0) internal successors, (623), 7 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:42,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:42,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:42,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 21:21:42,135 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:42,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:42,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1777812234, now seen corresponding path program 2 times [2023-08-26 21:21:42,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:42,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251695450] [2023-08-26 21:21:42,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:42,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:42,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:42,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:42,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251695450] [2023-08-26 21:21:42,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251695450] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:42,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:42,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:21:42,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395809483] [2023-08-26 21:21:42,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:42,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:21:42,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:42,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:21:42,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:21:42,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 216 [2023-08-26 21:21:42,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 243 transitions, 4669 flow. Second operand has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:42,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:42,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 216 [2023-08-26 21:21:42,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:43,561 INFO L124 PetriNetUnfolderBase]: 5215/8135 cut-off events. [2023-08-26 21:21:43,561 INFO L125 PetriNetUnfolderBase]: For 185138/185771 co-relation queries the response was YES. [2023-08-26 21:21:43,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65919 conditions, 8135 events. 5215/8135 cut-off events. For 185138/185771 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 51497 event pairs, 491 based on Foata normal form. 194/7890 useless extension candidates. Maximal degree in co-relation 65850. Up to 3469 conditions per place. [2023-08-26 21:21:43,628 INFO L140 encePairwiseOnDemand]: 207/216 looper letters, 222 selfloop transitions, 146 changer transitions 3/378 dead transitions. [2023-08-26 21:21:43,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 378 transitions, 7283 flow [2023-08-26 21:21:43,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:21:43,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:21:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 863 transitions. [2023-08-26 21:21:43,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44393004115226337 [2023-08-26 21:21:43,630 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 863 transitions. [2023-08-26 21:21:43,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 863 transitions. [2023-08-26 21:21:43,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:43,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 863 transitions. [2023-08-26 21:21:43,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.88888888888889) internal successors, (863), 9 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:43,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:43,634 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:43,634 INFO L175 Difference]: Start difference. First operand has 141 places, 243 transitions, 4669 flow. Second operand 9 states and 863 transitions. [2023-08-26 21:21:43,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 378 transitions, 7283 flow [2023-08-26 21:21:44,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 378 transitions, 7128 flow, removed 41 selfloop flow, removed 2 redundant places. [2023-08-26 21:21:44,205 INFO L231 Difference]: Finished difference. Result has 152 places, 275 transitions, 5736 flow [2023-08-26 21:21:44,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=4542, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5736, PETRI_PLACES=152, PETRI_TRANSITIONS=275} [2023-08-26 21:21:44,206 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 112 predicate places. [2023-08-26 21:21:44,206 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 275 transitions, 5736 flow [2023-08-26 21:21:44,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:44,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:44,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:44,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 21:21:44,207 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:44,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:44,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1818923814, now seen corresponding path program 3 times [2023-08-26 21:21:44,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:44,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393740233] [2023-08-26 21:21:44,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:44,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:44,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:44,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:44,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393740233] [2023-08-26 21:21:44,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393740233] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:44,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:44,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:21:44,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944655434] [2023-08-26 21:21:44,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:44,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 21:21:44,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:44,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 21:21:44,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-26 21:21:44,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 216 [2023-08-26 21:21:44,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 275 transitions, 5736 flow. Second operand has 8 states, 8 states have (on average 80.75) internal successors, (646), 8 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:44,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:44,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 216 [2023-08-26 21:21:44,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:46,971 INFO L124 PetriNetUnfolderBase]: 8092/12142 cut-off events. [2023-08-26 21:21:46,971 INFO L125 PetriNetUnfolderBase]: For 306981/306981 co-relation queries the response was YES. [2023-08-26 21:21:47,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102227 conditions, 12142 events. 8092/12142 cut-off events. For 306981/306981 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 74141 event pairs, 318 based on Foata normal form. 62/11783 useless extension candidates. Maximal degree in co-relation 102152. Up to 4681 conditions per place. [2023-08-26 21:21:47,098 INFO L140 encePairwiseOnDemand]: 204/216 looper letters, 297 selfloop transitions, 256 changer transitions 6/559 dead transitions. [2023-08-26 21:21:47,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 559 transitions, 11060 flow [2023-08-26 21:21:47,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 21:21:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 21:21:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1177 transitions. [2023-08-26 21:21:47,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41915954415954415 [2023-08-26 21:21:47,101 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1177 transitions. [2023-08-26 21:21:47,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1177 transitions. [2023-08-26 21:21:47,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:47,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1177 transitions. [2023-08-26 21:21:47,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 90.53846153846153) internal successors, (1177), 13 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:47,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 216.0) internal successors, (3024), 14 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:47,106 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 216.0) internal successors, (3024), 14 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:47,106 INFO L175 Difference]: Start difference. First operand has 152 places, 275 transitions, 5736 flow. Second operand 13 states and 1177 transitions. [2023-08-26 21:21:47,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 559 transitions, 11060 flow [2023-08-26 21:21:48,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 559 transitions, 10825 flow, removed 73 selfloop flow, removed 2 redundant places. [2023-08-26 21:21:48,144 INFO L231 Difference]: Finished difference. Result has 173 places, 402 transitions, 8972 flow [2023-08-26 21:21:48,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=5579, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8972, PETRI_PLACES=173, PETRI_TRANSITIONS=402} [2023-08-26 21:21:48,145 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 133 predicate places. [2023-08-26 21:21:48,145 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 402 transitions, 8972 flow [2023-08-26 21:21:48,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 80.75) internal successors, (646), 8 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:48,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:48,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:48,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 21:21:48,145 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:48,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:48,146 INFO L85 PathProgramCache]: Analyzing trace with hash -453243832, now seen corresponding path program 1 times [2023-08-26 21:21:48,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:48,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830032877] [2023-08-26 21:21:48,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:48,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:48,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:48,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:48,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830032877] [2023-08-26 21:21:48,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830032877] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:48,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:48,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:21:48,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370213896] [2023-08-26 21:21:48,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:48,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:21:48,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:48,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:21:48,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:21:48,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 216 [2023-08-26 21:21:48,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 402 transitions, 8972 flow. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:48,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:48,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 216 [2023-08-26 21:21:48,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:48,983 INFO L124 PetriNetUnfolderBase]: 2183/3780 cut-off events. [2023-08-26 21:21:48,983 INFO L125 PetriNetUnfolderBase]: For 130618/131191 co-relation queries the response was YES. [2023-08-26 21:21:49,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33320 conditions, 3780 events. 2183/3780 cut-off events. For 130618/131191 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 24496 event pairs, 300 based on Foata normal form. 423/3884 useless extension candidates. Maximal degree in co-relation 33233. Up to 2131 conditions per place. [2023-08-26 21:21:49,020 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 322 selfloop transitions, 5 changer transitions 0/356 dead transitions. [2023-08-26 21:21:49,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 356 transitions, 7964 flow [2023-08-26 21:21:49,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:21:49,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:21:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 410 transitions. [2023-08-26 21:21:49,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47453703703703703 [2023-08-26 21:21:49,022 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 410 transitions. [2023-08-26 21:21:49,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 410 transitions. [2023-08-26 21:21:49,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:49,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 410 transitions. [2023-08-26 21:21:49,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:49,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:49,024 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:49,024 INFO L175 Difference]: Start difference. First operand has 173 places, 402 transitions, 8972 flow. Second operand 4 states and 410 transitions. [2023-08-26 21:21:49,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 356 transitions, 7964 flow [2023-08-26 21:21:49,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 356 transitions, 7628 flow, removed 158 selfloop flow, removed 2 redundant places. [2023-08-26 21:21:49,347 INFO L231 Difference]: Finished difference. Result has 176 places, 273 transitions, 5623 flow [2023-08-26 21:21:49,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=5541, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=5623, PETRI_PLACES=176, PETRI_TRANSITIONS=273} [2023-08-26 21:21:49,348 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 136 predicate places. [2023-08-26 21:21:49,348 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 273 transitions, 5623 flow [2023-08-26 21:21:49,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:49,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:49,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:49,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 21:21:49,349 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:49,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:49,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1106591167, now seen corresponding path program 1 times [2023-08-26 21:21:49,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:49,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243454078] [2023-08-26 21:21:49,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:49,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:49,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:49,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243454078] [2023-08-26 21:21:49,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243454078] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:49,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:49,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:21:49,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046943753] [2023-08-26 21:21:49,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:49,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:21:49,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:49,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:21:49,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:21:49,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 216 [2023-08-26 21:21:49,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 273 transitions, 5623 flow. Second operand has 7 states, 7 states have (on average 87.14285714285714) internal successors, (610), 7 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:49,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:49,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 216 [2023-08-26 21:21:49,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:50,732 INFO L124 PetriNetUnfolderBase]: 2745/4778 cut-off events. [2023-08-26 21:21:50,733 INFO L125 PetriNetUnfolderBase]: For 164926/165390 co-relation queries the response was YES. [2023-08-26 21:21:50,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42005 conditions, 4778 events. 2745/4778 cut-off events. For 164926/165390 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 31923 event pairs, 247 based on Foata normal form. 167/4710 useless extension candidates. Maximal degree in co-relation 41916. Up to 1666 conditions per place. [2023-08-26 21:21:50,781 INFO L140 encePairwiseOnDemand]: 209/216 looper letters, 228 selfloop transitions, 128 changer transitions 6/381 dead transitions. [2023-08-26 21:21:50,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 381 transitions, 8278 flow [2023-08-26 21:21:50,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 21:21:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 21:21:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 763 transitions. [2023-08-26 21:21:50,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44155092592592593 [2023-08-26 21:21:50,782 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 763 transitions. [2023-08-26 21:21:50,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 763 transitions. [2023-08-26 21:21:50,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:50,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 763 transitions. [2023-08-26 21:21:50,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 95.375) internal successors, (763), 8 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:50,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 216.0) internal successors, (1944), 9 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:50,785 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 216.0) internal successors, (1944), 9 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:50,785 INFO L175 Difference]: Start difference. First operand has 176 places, 273 transitions, 5623 flow. Second operand 8 states and 763 transitions. [2023-08-26 21:21:50,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 381 transitions, 8278 flow [2023-08-26 21:21:51,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 381 transitions, 8212 flow, removed 24 selfloop flow, removed 3 redundant places. [2023-08-26 21:21:51,220 INFO L231 Difference]: Finished difference. Result has 184 places, 286 transitions, 6515 flow [2023-08-26 21:21:51,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=5578, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6515, PETRI_PLACES=184, PETRI_TRANSITIONS=286} [2023-08-26 21:21:51,220 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 144 predicate places. [2023-08-26 21:21:51,220 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 286 transitions, 6515 flow [2023-08-26 21:21:51,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.14285714285714) internal successors, (610), 7 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:51,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:51,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:51,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 21:21:51,221 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:51,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:51,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1684449542, now seen corresponding path program 1 times [2023-08-26 21:21:51,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:51,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185548299] [2023-08-26 21:21:51,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:51,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:51,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:51,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:51,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185548299] [2023-08-26 21:21:51,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185548299] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:51,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:51,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:21:51,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91630468] [2023-08-26 21:21:51,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:51,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:21:51,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:51,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:21:51,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:21:51,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 216 [2023-08-26 21:21:51,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 286 transitions, 6515 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:51,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:51,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 216 [2023-08-26 21:21:51,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:51,706 INFO L124 PetriNetUnfolderBase]: 1262/2268 cut-off events. [2023-08-26 21:21:51,706 INFO L125 PetriNetUnfolderBase]: For 66369/66871 co-relation queries the response was YES. [2023-08-26 21:21:51,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16556 conditions, 2268 events. 1262/2268 cut-off events. For 66369/66871 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 14255 event pairs, 183 based on Foata normal form. 363/2469 useless extension candidates. Maximal degree in co-relation 16492. Up to 802 conditions per place. [2023-08-26 21:21:51,723 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 171 selfloop transitions, 8 changer transitions 0/195 dead transitions. [2023-08-26 21:21:51,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 195 transitions, 4115 flow [2023-08-26 21:21:51,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:21:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:21:51,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2023-08-26 21:21:51,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4740740740740741 [2023-08-26 21:21:51,725 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2023-08-26 21:21:51,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2023-08-26 21:21:51,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:51,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2023-08-26 21:21:51,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:51,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:51,726 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:51,726 INFO L175 Difference]: Start difference. First operand has 184 places, 286 transitions, 6515 flow. Second operand 5 states and 512 transitions. [2023-08-26 21:21:51,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 195 transitions, 4115 flow [2023-08-26 21:21:51,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 195 transitions, 3312 flow, removed 78 selfloop flow, removed 47 redundant places. [2023-08-26 21:21:51,813 INFO L231 Difference]: Finished difference. Result has 128 places, 119 transitions, 1878 flow [2023-08-26 21:21:51,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=1818, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1878, PETRI_PLACES=128, PETRI_TRANSITIONS=119} [2023-08-26 21:21:51,813 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 88 predicate places. [2023-08-26 21:21:51,813 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 119 transitions, 1878 flow [2023-08-26 21:21:51,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:51,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:51,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:51,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 21:21:51,814 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:51,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:51,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1446075252, now seen corresponding path program 1 times [2023-08-26 21:21:51,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:51,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692486865] [2023-08-26 21:21:51,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:51,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:51,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:51,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692486865] [2023-08-26 21:21:51,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692486865] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:51,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:51,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:21:51,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512566886] [2023-08-26 21:21:51,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:51,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:21:51,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:51,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:21:51,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:21:51,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 216 [2023-08-26 21:21:51,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 119 transitions, 1878 flow. Second operand has 5 states, 5 states have (on average 94.8) internal successors, (474), 5 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:51,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:51,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 216 [2023-08-26 21:21:51,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:52,127 INFO L124 PetriNetUnfolderBase]: 1197/2110 cut-off events. [2023-08-26 21:21:52,127 INFO L125 PetriNetUnfolderBase]: For 32487/32856 co-relation queries the response was YES. [2023-08-26 21:21:52,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14671 conditions, 2110 events. 1197/2110 cut-off events. For 32487/32856 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 12906 event pairs, 169 based on Foata normal form. 142/2188 useless extension candidates. Maximal degree in co-relation 14627. Up to 780 conditions per place. [2023-08-26 21:21:52,138 INFO L140 encePairwiseOnDemand]: 209/216 looper letters, 119 selfloop transitions, 10 changer transitions 50/192 dead transitions. [2023-08-26 21:21:52,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 192 transitions, 3555 flow [2023-08-26 21:21:52,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:21:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:21:52,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2023-08-26 21:21:52,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47685185185185186 [2023-08-26 21:21:52,139 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 515 transitions. [2023-08-26 21:21:52,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 515 transitions. [2023-08-26 21:21:52,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:52,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 515 transitions. [2023-08-26 21:21:52,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:52,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:52,141 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:52,141 INFO L175 Difference]: Start difference. First operand has 128 places, 119 transitions, 1878 flow. Second operand 5 states and 515 transitions. [2023-08-26 21:21:52,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 192 transitions, 3555 flow [2023-08-26 21:21:52,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 192 transitions, 3532 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-26 21:21:52,191 INFO L231 Difference]: Finished difference. Result has 126 places, 81 transitions, 1155 flow [2023-08-26 21:21:52,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=1842, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1155, PETRI_PLACES=126, PETRI_TRANSITIONS=81} [2023-08-26 21:21:52,192 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 86 predicate places. [2023-08-26 21:21:52,192 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 81 transitions, 1155 flow [2023-08-26 21:21:52,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.8) internal successors, (474), 5 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:52,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:52,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:52,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 21:21:52,192 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:52,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:52,192 INFO L85 PathProgramCache]: Analyzing trace with hash 506580681, now seen corresponding path program 1 times [2023-08-26 21:21:52,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:52,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936972190] [2023-08-26 21:21:52,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:52,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:52,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:52,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:52,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936972190] [2023-08-26 21:21:52,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936972190] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:52,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:52,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:21:52,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482412361] [2023-08-26 21:21:52,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:52,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:21:52,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:52,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:21:52,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:21:52,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 216 [2023-08-26 21:21:52,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 81 transitions, 1155 flow. Second operand has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:52,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:52,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 216 [2023-08-26 21:21:52,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:52,780 INFO L124 PetriNetUnfolderBase]: 2072/3477 cut-off events. [2023-08-26 21:21:52,780 INFO L125 PetriNetUnfolderBase]: For 38250/38250 co-relation queries the response was YES. [2023-08-26 21:21:52,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22462 conditions, 3477 events. 2072/3477 cut-off events. For 38250/38250 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 20806 event pairs, 309 based on Foata normal form. 14/3491 useless extension candidates. Maximal degree in co-relation 22418. Up to 1755 conditions per place. [2023-08-26 21:21:52,797 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 67 selfloop transitions, 11 changer transitions 59/137 dead transitions. [2023-08-26 21:21:52,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 137 transitions, 2102 flow [2023-08-26 21:21:52,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:21:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:21:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 539 transitions. [2023-08-26 21:21:52,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4158950617283951 [2023-08-26 21:21:52,798 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 539 transitions. [2023-08-26 21:21:52,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 539 transitions. [2023-08-26 21:21:52,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:52,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 539 transitions. [2023-08-26 21:21:52,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 89.83333333333333) internal successors, (539), 6 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:52,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:52,800 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:52,800 INFO L175 Difference]: Start difference. First operand has 126 places, 81 transitions, 1155 flow. Second operand 6 states and 539 transitions. [2023-08-26 21:21:52,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 137 transitions, 2102 flow [2023-08-26 21:21:52,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 137 transitions, 1725 flow, removed 46 selfloop flow, removed 24 redundant places. [2023-08-26 21:21:52,885 INFO L231 Difference]: Finished difference. Result has 88 places, 61 transitions, 699 flow [2023-08-26 21:21:52,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=699, PETRI_PLACES=88, PETRI_TRANSITIONS=61} [2023-08-26 21:21:52,885 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 48 predicate places. [2023-08-26 21:21:52,886 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 61 transitions, 699 flow [2023-08-26 21:21:52,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:52,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:52,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:52,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 21:21:52,886 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:52,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:52,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1797072394, now seen corresponding path program 1 times [2023-08-26 21:21:52,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:52,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860040735] [2023-08-26 21:21:52,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:52,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:53,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:53,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860040735] [2023-08-26 21:21:53,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860040735] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:53,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:53,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:21:53,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160099925] [2023-08-26 21:21:53,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:53,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:21:53,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:53,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:21:53,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:21:53,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 216 [2023-08-26 21:21:53,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 61 transitions, 699 flow. Second operand has 6 states, 6 states have (on average 81.0) internal successors, (486), 6 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:53,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:53,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 216 [2023-08-26 21:21:53,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:53,382 INFO L124 PetriNetUnfolderBase]: 592/1235 cut-off events. [2023-08-26 21:21:53,382 INFO L125 PetriNetUnfolderBase]: For 9028/9028 co-relation queries the response was YES. [2023-08-26 21:21:53,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7403 conditions, 1235 events. 592/1235 cut-off events. For 9028/9028 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7260 event pairs, 81 based on Foata normal form. 12/1247 useless extension candidates. Maximal degree in co-relation 7371. Up to 505 conditions per place. [2023-08-26 21:21:53,386 INFO L140 encePairwiseOnDemand]: 206/216 looper letters, 69 selfloop transitions, 9 changer transitions 75/153 dead transitions. [2023-08-26 21:21:53,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 153 transitions, 1959 flow [2023-08-26 21:21:53,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:21:53,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:21:53,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 620 transitions. [2023-08-26 21:21:53,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41005291005291006 [2023-08-26 21:21:53,388 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 620 transitions. [2023-08-26 21:21:53,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 620 transitions. [2023-08-26 21:21:53,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:53,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 620 transitions. [2023-08-26 21:21:53,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.57142857142857) internal successors, (620), 7 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:53,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:53,390 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:53,390 INFO L175 Difference]: Start difference. First operand has 88 places, 61 transitions, 699 flow. Second operand 7 states and 620 transitions. [2023-08-26 21:21:53,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 153 transitions, 1959 flow [2023-08-26 21:21:53,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 153 transitions, 1717 flow, removed 69 selfloop flow, removed 10 redundant places. [2023-08-26 21:21:53,404 INFO L231 Difference]: Finished difference. Result has 84 places, 49 transitions, 496 flow [2023-08-26 21:21:53,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=496, PETRI_PLACES=84, PETRI_TRANSITIONS=49} [2023-08-26 21:21:53,406 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 44 predicate places. [2023-08-26 21:21:53,406 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 49 transitions, 496 flow [2023-08-26 21:21:53,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.0) internal successors, (486), 6 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:53,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:53,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:53,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 21:21:53,406 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:53,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:53,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2057094700, now seen corresponding path program 1 times [2023-08-26 21:21:53,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:53,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947210797] [2023-08-26 21:21:53,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:53,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:53,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:53,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:53,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947210797] [2023-08-26 21:21:53,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947210797] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:53,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:53,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:21:53,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722240116] [2023-08-26 21:21:53,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:53,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:21:53,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:53,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:21:53,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:21:53,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 216 [2023-08-26 21:21:53,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 49 transitions, 496 flow. Second operand has 6 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:53,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:53,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 216 [2023-08-26 21:21:53,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:53,599 INFO L124 PetriNetUnfolderBase]: 163/385 cut-off events. [2023-08-26 21:21:53,599 INFO L125 PetriNetUnfolderBase]: For 2422/2433 co-relation queries the response was YES. [2023-08-26 21:21:53,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1873 conditions, 385 events. 163/385 cut-off events. For 2422/2433 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1920 event pairs, 25 based on Foata normal form. 46/428 useless extension candidates. Maximal degree in co-relation 1846. Up to 117 conditions per place. [2023-08-26 21:21:53,600 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 22 selfloop transitions, 11 changer transitions 35/71 dead transitions. [2023-08-26 21:21:53,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 71 transitions, 880 flow [2023-08-26 21:21:53,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:21:53,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:21:53,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 578 transitions. [2023-08-26 21:21:53,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44598765432098764 [2023-08-26 21:21:53,601 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 578 transitions. [2023-08-26 21:21:53,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 578 transitions. [2023-08-26 21:21:53,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:53,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 578 transitions. [2023-08-26 21:21:53,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:53,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:53,603 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:53,603 INFO L175 Difference]: Start difference. First operand has 84 places, 49 transitions, 496 flow. Second operand 6 states and 578 transitions. [2023-08-26 21:21:53,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 71 transitions, 880 flow [2023-08-26 21:21:53,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 71 transitions, 745 flow, removed 26 selfloop flow, removed 15 redundant places. [2023-08-26 21:21:53,607 INFO L231 Difference]: Finished difference. Result has 74 places, 29 transitions, 226 flow [2023-08-26 21:21:53,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=226, PETRI_PLACES=74, PETRI_TRANSITIONS=29} [2023-08-26 21:21:53,608 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 34 predicate places. [2023-08-26 21:21:53,608 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 29 transitions, 226 flow [2023-08-26 21:21:53,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:53,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:53,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:53,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 21:21:53,608 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:21:53,608 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:53,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2144890790, now seen corresponding path program 1 times [2023-08-26 21:21:53,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:53,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146320405] [2023-08-26 21:21:53,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:53,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:21:53,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:21:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:21:53,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:21:53,676 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:21:53,677 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-26 21:21:53,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-08-26 21:21:53,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-26 21:21:53,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-08-26 21:21:53,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-26 21:21:53,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (12 of 18 remaining) [2023-08-26 21:21:53,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-26 21:21:53,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-26 21:21:53,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-26 21:21:53,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-26 21:21:53,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-26 21:21:53,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-08-26 21:21:53,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-26 21:21:53,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-08-26 21:21:53,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-26 21:21:53,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (2 of 18 remaining) [2023-08-26 21:21:53,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-26 21:21:53,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-26 21:21:53,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-26 21:21:53,682 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:53,685 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:21:53,685 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:21:53,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:21:53 BasicIcfg [2023-08-26 21:21:53,738 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:21:53,739 INFO L158 Benchmark]: Toolchain (without parser) took 29364.38ms. Allocated memory was 390.1MB in the beginning and 2.0GB in the end (delta: 1.6GB). Free memory was 365.2MB in the beginning and 968.3MB in the end (delta: -603.1MB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2023-08-26 21:21:53,739 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 390.1MB. Free memory is still 366.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:21:53,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.95ms. Allocated memory is still 390.1MB. Free memory was 364.8MB in the beginning and 342.0MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:21:53,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.91ms. Allocated memory is still 390.1MB. Free memory was 342.0MB in the beginning and 339.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:21:53,739 INFO L158 Benchmark]: Boogie Preprocessor took 35.47ms. Allocated memory is still 390.1MB. Free memory was 339.2MB in the beginning and 337.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:21:53,739 INFO L158 Benchmark]: RCFGBuilder took 613.84ms. Allocated memory is still 390.1MB. Free memory was 337.4MB in the beginning and 353.4MB in the end (delta: -16.0MB). Peak memory consumption was 27.5MB. Max. memory is 16.0GB. [2023-08-26 21:21:53,740 INFO L158 Benchmark]: TraceAbstraction took 28260.22ms. Allocated memory was 390.1MB in the beginning and 2.0GB in the end (delta: 1.6GB). Free memory was 352.6MB in the beginning and 968.3MB in the end (delta: -615.7MB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2023-08-26 21:21:53,740 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.09ms. Allocated memory is still 390.1MB. Free memory is still 366.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 410.95ms. Allocated memory is still 390.1MB. Free memory was 364.8MB in the beginning and 342.0MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 38.91ms. Allocated memory is still 390.1MB. Free memory was 342.0MB in the beginning and 339.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.47ms. Allocated memory is still 390.1MB. Free memory was 339.2MB in the beginning and 337.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 613.84ms. Allocated memory is still 390.1MB. Free memory was 337.4MB in the beginning and 353.4MB in the end (delta: -16.0MB). Peak memory consumption was 27.5MB. Max. memory is 16.0GB. * TraceAbstraction took 28260.22ms. Allocated memory was 390.1MB in the beginning and 2.0GB in the end (delta: 1.6GB). Free memory was 352.6MB in the beginning and 968.3MB in the end (delta: -615.7MB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 120 PlacesBefore, 40 PlacesAfterwards, 113 TransitionsBefore, 31 TransitionsAfterwards, 2616 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 100 TotalNumberOfCompositions, 9281 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3138, independent: 2872, independent conditional: 0, independent unconditional: 2872, dependent: 266, dependent conditional: 0, dependent unconditional: 266, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1388, independent: 1341, independent conditional: 0, independent unconditional: 1341, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3138, independent: 1531, independent conditional: 0, independent unconditional: 1531, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 1388, unknown conditional: 0, unknown unconditional: 1388] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 121, Positive conditional cache size: 0, Positive unconditional cache size: 121, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1492; [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1492, ((void *)0), P0, ((void *)0))=-2, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t1493; [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1493, ((void *)0), P1, ((void *)0))=-1, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t1494; [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1494, ((void *)0), P2, ((void *)0))=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L769] EXPR 2 __unbuffered_cnt + 1 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L749] EXPR 1 __unbuffered_cnt + 1 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L798] EXPR 3 __unbuffered_cnt + 1 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={53:54}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 749]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 749]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 769]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 769]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 798]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 798]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 147 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 28.1s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1005 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1005 mSDsluCounter, 162 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 171 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3354 IncrementalHoareTripleChecker+Invalid, 3525 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 171 mSolverCounterUnsat, 65 mSDtfsCounter, 3354 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8972occurred in iteration=16, InterpolantAutomatonStates: 155, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 320 NumberOfCodeBlocks, 320 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 276 ConstructedInterpolants, 0 QuantifiedInterpolants, 2523 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 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 proved your program to be incorrect! [2023-08-26 21:21:53,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...