/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 --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 10:20:03,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:20:03,856 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-27 10:20:03,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:20:03,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:20:03,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:20:03,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:20:03,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:20:03,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:20:03,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:20:03,892 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:20:03,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:20:03,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:20:03,893 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:20:03,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:20:03,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:20:03,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:20:03,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:20:03,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:20:03,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:20:03,894 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:20:03,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:20:03,894 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:20:03,895 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:20:03,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:20:03,895 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:20:03,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:20:03,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:20:03,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:20:03,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:20:03,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:20:03,897 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:20:03,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:20:03,897 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:20:03,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:20:03,897 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.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST 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-27 10:20:04,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:20:04,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:20:04,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:20:04,170 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:20:04,170 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:20:04,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-27 10:20:05,141 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:20:05,371 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:20:05,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-27 10:20:05,389 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4898b0483/e3065ef6b668425e9b2c33c3a8ee608e/FLAG1c3634fff [2023-08-27 10:20:05,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4898b0483/e3065ef6b668425e9b2c33c3a8ee608e [2023-08-27 10:20:05,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:20:05,710 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:20:05,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:20:05,711 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:20:05,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:20:05,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:20:05" (1/1) ... [2023-08-27 10:20:05,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae15224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:20:05, skipping insertion in model container [2023-08-27 10:20:05,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:20:05" (1/1) ... [2023-08-27 10:20:05,740 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:20:05,937 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:20:05,944 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:20:05,957 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 10:20:05,958 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 10:20:06,004 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:20:06,030 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:20:06,031 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:20:06,036 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:20:06,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:20:06 WrapperNode [2023-08-27 10:20:06,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:20:06,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:20:06,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:20:06,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:20:06,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:20:06" (1/1) ... [2023-08-27 10:20:06,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:20:06" (1/1) ... [2023-08-27 10:20:06,091 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 152 [2023-08-27 10:20:06,091 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:20:06,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:20:06,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:20:06,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:20:06,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:20:06" (1/1) ... [2023-08-27 10:20:06,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:20:06" (1/1) ... [2023-08-27 10:20:06,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:20:06" (1/1) ... [2023-08-27 10:20:06,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:20:06" (1/1) ... [2023-08-27 10:20:06,110 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:20:06" (1/1) ... [2023-08-27 10:20:06,112 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:20:06" (1/1) ... [2023-08-27 10:20:06,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:20:06" (1/1) ... [2023-08-27 10:20:06,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:20:06" (1/1) ... [2023-08-27 10:20:06,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:20:06,119 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:20:06,119 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:20:06,119 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:20:06,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:20:06" (1/1) ... [2023-08-27 10:20:06,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:20:06,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:20:06,166 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-27 10:20:06,221 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-27 10:20:06,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:20:06,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:20:06,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:20:06,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:20:06,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:20:06,242 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 10:20:06,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 10:20:06,243 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 10:20:06,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 10:20:06,243 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 10:20:06,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 10:20:06,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:20:06,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:20:06,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:20:06,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:20:06,246 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 10:20:06,384 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:20:06,385 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:20:06,699 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:20:06,826 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:20:06,826 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 10:20:06,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:20:06 BoogieIcfgContainer [2023-08-27 10:20:06,828 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:20:06,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:20:06,831 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:20:06,833 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:20:06,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:20:05" (1/3) ... [2023-08-27 10:20:06,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fcce4f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:20:06, skipping insertion in model container [2023-08-27 10:20:06,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:20:06" (2/3) ... [2023-08-27 10:20:06,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fcce4f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:20:06, skipping insertion in model container [2023-08-27 10:20:06,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:20:06" (3/3) ... [2023-08-27 10:20:06,835 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-27 10:20:06,846 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:20:06,846 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-27 10:20:06,847 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:20:06,919 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 10:20:06,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 117 transitions, 249 flow [2023-08-27 10:20:06,970 INFO L124 PetriNetUnfolderBase]: 3/114 cut-off events. [2023-08-27 10:20:06,971 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:20:06,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 3/114 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/103 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-27 10:20:06,974 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 117 transitions, 249 flow [2023-08-27 10:20:06,977 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 114 transitions, 237 flow [2023-08-27 10:20:06,979 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:20:06,985 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 114 transitions, 237 flow [2023-08-27 10:20:06,986 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 114 transitions, 237 flow [2023-08-27 10:20:06,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 114 transitions, 237 flow [2023-08-27 10:20:07,004 INFO L124 PetriNetUnfolderBase]: 3/114 cut-off events. [2023-08-27 10:20:07,004 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:20:07,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 3/114 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/103 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-27 10:20:07,006 INFO L119 LiptonReduction]: Number of co-enabled transitions 2732 [2023-08-27 10:20:10,044 INFO L134 LiptonReduction]: Checked pairs total: 9004 [2023-08-27 10:20:10,044 INFO L136 LiptonReduction]: Total number of compositions: 105 [2023-08-27 10:20:10,076 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:20:10,084 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;@470f0ce3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:20:10,084 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-27 10:20:10,093 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:20:10,093 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-27 10:20:10,093 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:20:10,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:10,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 10:20:10,094 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-27 10:20:10,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:10,098 INFO L85 PathProgramCache]: Analyzing trace with hash 578921634, now seen corresponding path program 1 times [2023-08-27 10:20:10,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:10,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327570677] [2023-08-27 10:20:10,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:10,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:10,284 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-27 10:20:10,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:10,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327570677] [2023-08-27 10:20:10,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327570677] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:10,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:10,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:20:10,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191155379] [2023-08-27 10:20:10,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:10,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:20:10,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:10,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:20:10,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:20:10,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 222 [2023-08-27 10:20:10,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 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-27 10:20:10,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:10,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 222 [2023-08-27 10:20:10,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:10,871 INFO L124 PetriNetUnfolderBase]: 1965/2969 cut-off events. [2023-08-27 10:20:10,871 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-08-27 10:20:10,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6000 conditions, 2969 events. 1965/2969 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14303 event pairs, 749 based on Foata normal form. 0/2233 useless extension candidates. Maximal degree in co-relation 5989. Up to 1970 conditions per place. [2023-08-27 10:20:10,887 INFO L140 encePairwiseOnDemand]: 212/222 looper letters, 44 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2023-08-27 10:20:10,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 209 flow [2023-08-27 10:20:10,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:20:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:20:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-08-27 10:20:10,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2023-08-27 10:20:10,897 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-08-27 10:20:10,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-08-27 10:20:10,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:10,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-08-27 10:20:10,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 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-27 10:20:10,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 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-27 10:20:10,906 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 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-27 10:20:10,907 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 67 flow. Second operand 3 states and 324 transitions. [2023-08-27 10:20:10,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 209 flow [2023-08-27 10:20:10,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 204 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 10:20:10,911 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 100 flow [2023-08-27 10:20:10,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-08-27 10:20:10,914 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2023-08-27 10:20:10,914 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 100 flow [2023-08-27 10:20:10,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 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-27 10:20:10,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:10,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:10,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:20:10,915 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-27 10:20:10,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:10,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1952989753, now seen corresponding path program 1 times [2023-08-27 10:20:10,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:10,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492224286] [2023-08-27 10:20:10,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:10,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:11,083 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-27 10:20:11,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:11,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492224286] [2023-08-27 10:20:11,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492224286] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:11,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:11,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:20:11,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176116921] [2023-08-27 10:20:11,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:11,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:20:11,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:11,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:20:11,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:20:11,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 222 [2023-08-27 10:20:11,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 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-27 10:20:11,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:11,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 222 [2023-08-27 10:20:11,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:11,363 INFO L124 PetriNetUnfolderBase]: 1431/2394 cut-off events. [2023-08-27 10:20:11,363 INFO L125 PetriNetUnfolderBase]: For 162/174 co-relation queries the response was YES. [2023-08-27 10:20:11,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5529 conditions, 2394 events. 1431/2394 cut-off events. For 162/174 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12922 event pairs, 304 based on Foata normal form. 0/2059 useless extension candidates. Maximal degree in co-relation 5518. Up to 1646 conditions per place. [2023-08-27 10:20:11,374 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 41 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-27 10:20:11,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 47 transitions, 230 flow [2023-08-27 10:20:11,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:20:11,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:20:11,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-08-27 10:20:11,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.481981981981982 [2023-08-27 10:20:11,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-08-27 10:20:11,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-08-27 10:20:11,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:11,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-08-27 10:20:11,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 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-27 10:20:11,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 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-27 10:20:11,384 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 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-27 10:20:11,384 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 100 flow. Second operand 3 states and 321 transitions. [2023-08-27 10:20:11,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 47 transitions, 230 flow [2023-08-27 10:20:11,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:20:11,387 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 98 flow [2023-08-27 10:20:11,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-08-27 10:20:11,388 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2023-08-27 10:20:11,388 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 98 flow [2023-08-27 10:20:11,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 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-27 10:20:11,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:11,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:11,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:20:11,395 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-27 10:20:11,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:11,395 INFO L85 PathProgramCache]: Analyzing trace with hash 77610288, now seen corresponding path program 1 times [2023-08-27 10:20:11,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:11,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920436715] [2023-08-27 10:20:11,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:11,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:11,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:20:11,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:11,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920436715] [2023-08-27 10:20:11,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920436715] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:11,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:11,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:20:11,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797345193] [2023-08-27 10:20:11,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:11,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:20:11,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:11,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:20:11,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:20:11,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 222 [2023-08-27 10:20:11,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 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-27 10:20:11,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:11,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 222 [2023-08-27 10:20:11,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:12,072 INFO L124 PetriNetUnfolderBase]: 1779/2814 cut-off events. [2023-08-27 10:20:12,072 INFO L125 PetriNetUnfolderBase]: For 413/459 co-relation queries the response was YES. [2023-08-27 10:20:12,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6574 conditions, 2814 events. 1779/2814 cut-off events. For 413/459 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14221 event pairs, 663 based on Foata normal form. 0/2466 useless extension candidates. Maximal degree in co-relation 6562. Up to 1498 conditions per place. [2023-08-27 10:20:12,082 INFO L140 encePairwiseOnDemand]: 211/222 looper letters, 52 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2023-08-27 10:20:12,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 326 flow [2023-08-27 10:20:12,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:20:12,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:20:12,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 384 transitions. [2023-08-27 10:20:12,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246 [2023-08-27 10:20:12,084 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 384 transitions. [2023-08-27 10:20:12,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 384 transitions. [2023-08-27 10:20:12,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:12,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 384 transitions. [2023-08-27 10:20:12,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 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-27 10:20:12,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:12,086 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:12,086 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 98 flow. Second operand 4 states and 384 transitions. [2023-08-27 10:20:12,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 326 flow [2023-08-27 10:20:12,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 65 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:20:12,088 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 170 flow [2023-08-27 10:20:12,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2023-08-27 10:20:12,089 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2023-08-27 10:20:12,089 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 170 flow [2023-08-27 10:20:12,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 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-27 10:20:12,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:12,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:12,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:20:12,090 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-27 10:20:12,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:12,090 INFO L85 PathProgramCache]: Analyzing trace with hash -273844033, now seen corresponding path program 1 times [2023-08-27 10:20:12,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:12,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445232499] [2023-08-27 10:20:12,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:12,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:12,169 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-27 10:20:12,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:12,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445232499] [2023-08-27 10:20:12,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445232499] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:12,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:12,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:20:12,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145805301] [2023-08-27 10:20:12,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:12,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:20:12,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:12,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:20:12,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:20:12,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 222 [2023-08-27 10:20:12,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 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-27 10:20:12,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:12,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 222 [2023-08-27 10:20:12,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:12,630 INFO L124 PetriNetUnfolderBase]: 1550/2385 cut-off events. [2023-08-27 10:20:12,630 INFO L125 PetriNetUnfolderBase]: For 1637/1688 co-relation queries the response was YES. [2023-08-27 10:20:12,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7301 conditions, 2385 events. 1550/2385 cut-off events. For 1637/1688 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11500 event pairs, 498 based on Foata normal form. 15/2186 useless extension candidates. Maximal degree in co-relation 7286. Up to 1482 conditions per place. [2023-08-27 10:20:12,658 INFO L140 encePairwiseOnDemand]: 215/222 looper letters, 53 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2023-08-27 10:20:12,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 59 transitions, 372 flow [2023-08-27 10:20:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:20:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:20:12,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2023-08-27 10:20:12,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4572072072072072 [2023-08-27 10:20:12,660 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 406 transitions. [2023-08-27 10:20:12,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 406 transitions. [2023-08-27 10:20:12,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:12,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 406 transitions. [2023-08-27 10:20:12,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 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-27 10:20:12,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:12,663 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:12,663 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 170 flow. Second operand 4 states and 406 transitions. [2023-08-27 10:20:12,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 59 transitions, 372 flow [2023-08-27 10:20:12,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:20:12,666 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 164 flow [2023-08-27 10:20:12,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2023-08-27 10:20:12,666 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2023-08-27 10:20:12,666 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 164 flow [2023-08-27 10:20:12,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 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-27 10:20:12,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:12,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:12,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:20:12,667 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-27 10:20:12,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:12,667 INFO L85 PathProgramCache]: Analyzing trace with hash -357850932, now seen corresponding path program 1 times [2023-08-27 10:20:12,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:12,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755896703] [2023-08-27 10:20:12,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:12,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:12,765 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-27 10:20:12,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:12,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755896703] [2023-08-27 10:20:12,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755896703] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:12,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:12,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:20:12,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420038552] [2023-08-27 10:20:12,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:12,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:20:12,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:12,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:20:12,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:20:12,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 222 [2023-08-27 10:20:12,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 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-27 10:20:12,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:12,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 222 [2023-08-27 10:20:12,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:13,047 INFO L124 PetriNetUnfolderBase]: 1292/1973 cut-off events. [2023-08-27 10:20:13,047 INFO L125 PetriNetUnfolderBase]: For 1569/1610 co-relation queries the response was YES. [2023-08-27 10:20:13,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6278 conditions, 1973 events. 1292/1973 cut-off events. For 1569/1610 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9106 event pairs, 453 based on Foata normal form. 7/1938 useless extension candidates. Maximal degree in co-relation 6262. Up to 959 conditions per place. [2023-08-27 10:20:13,058 INFO L140 encePairwiseOnDemand]: 215/222 looper letters, 74 selfloop transitions, 7 changer transitions 0/83 dead transitions. [2023-08-27 10:20:13,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 83 transitions, 530 flow [2023-08-27 10:20:13,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:20:13,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:20:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 423 transitions. [2023-08-27 10:20:13,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47635135135135137 [2023-08-27 10:20:13,059 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 423 transitions. [2023-08-27 10:20:13,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 423 transitions. [2023-08-27 10:20:13,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:13,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 423 transitions. [2023-08-27 10:20:13,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 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-27 10:20:13,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:13,062 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:13,062 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 164 flow. Second operand 4 states and 423 transitions. [2023-08-27 10:20:13,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 83 transitions, 530 flow [2023-08-27 10:20:13,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 83 transitions, 525 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:20:13,068 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 203 flow [2023-08-27 10:20:13,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=203, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2023-08-27 10:20:13,069 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2023-08-27 10:20:13,069 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 203 flow [2023-08-27 10:20:13,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 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-27 10:20:13,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:13,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:13,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:20:13,070 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-27 10:20:13,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:13,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1088298630, now seen corresponding path program 1 times [2023-08-27 10:20:13,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:13,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985058607] [2023-08-27 10:20:13,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:13,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:13,342 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-27 10:20:13,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:13,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985058607] [2023-08-27 10:20:13,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985058607] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:13,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:13,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:20:13,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233309789] [2023-08-27 10:20:13,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:13,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:20:13,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:13,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:20:13,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:20:13,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 222 [2023-08-27 10:20:13,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 203 flow. Second operand has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:13,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:13,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 222 [2023-08-27 10:20:13,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:13,735 INFO L124 PetriNetUnfolderBase]: 1572/2370 cut-off events. [2023-08-27 10:20:13,735 INFO L125 PetriNetUnfolderBase]: For 2438/2438 co-relation queries the response was YES. [2023-08-27 10:20:13,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8154 conditions, 2370 events. 1572/2370 cut-off events. For 2438/2438 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10858 event pairs, 220 based on Foata normal form. 6/2358 useless extension candidates. Maximal degree in co-relation 8137. Up to 1812 conditions per place. [2023-08-27 10:20:13,748 INFO L140 encePairwiseOnDemand]: 210/222 looper letters, 57 selfloop transitions, 22 changer transitions 3/82 dead transitions. [2023-08-27 10:20:13,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 82 transitions, 572 flow [2023-08-27 10:20:13,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:20:13,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:20:13,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 387 transitions. [2023-08-27 10:20:13,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4358108108108108 [2023-08-27 10:20:13,750 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 387 transitions. [2023-08-27 10:20:13,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 387 transitions. [2023-08-27 10:20:13,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:13,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 387 transitions. [2023-08-27 10:20:13,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 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-27 10:20:13,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:13,752 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:13,752 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 203 flow. Second operand 4 states and 387 transitions. [2023-08-27 10:20:13,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 82 transitions, 572 flow [2023-08-27 10:20:13,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 545 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-27 10:20:13,756 INFO L231 Difference]: Finished difference. Result has 48 places, 55 transitions, 376 flow [2023-08-27 10:20:13,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=376, PETRI_PLACES=48, PETRI_TRANSITIONS=55} [2023-08-27 10:20:13,757 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2023-08-27 10:20:13,757 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 55 transitions, 376 flow [2023-08-27 10:20:13,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:13,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:13,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:13,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:20:13,757 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-27 10:20:13,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:13,758 INFO L85 PathProgramCache]: Analyzing trace with hash 622479483, now seen corresponding path program 1 times [2023-08-27 10:20:13,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:13,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730250054] [2023-08-27 10:20:13,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:13,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:14,260 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-27 10:20:14,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:14,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730250054] [2023-08-27 10:20:14,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730250054] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:14,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:14,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:20:14,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660231629] [2023-08-27 10:20:14,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:14,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:20:14,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:14,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:20:14,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:20:14,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 222 [2023-08-27 10:20:14,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 55 transitions, 376 flow. Second operand has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 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-27 10:20:14,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:14,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 222 [2023-08-27 10:20:14,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:14,577 INFO L124 PetriNetUnfolderBase]: 1510/2315 cut-off events. [2023-08-27 10:20:14,577 INFO L125 PetriNetUnfolderBase]: For 3432/3461 co-relation queries the response was YES. [2023-08-27 10:20:14,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9629 conditions, 2315 events. 1510/2315 cut-off events. For 3432/3461 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10750 event pairs, 121 based on Foata normal form. 32/2329 useless extension candidates. Maximal degree in co-relation 9609. Up to 1753 conditions per place. [2023-08-27 10:20:14,590 INFO L140 encePairwiseOnDemand]: 215/222 looper letters, 79 selfloop transitions, 18 changer transitions 0/102 dead transitions. [2023-08-27 10:20:14,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 102 transitions, 881 flow [2023-08-27 10:20:14,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:20:14,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:20:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 402 transitions. [2023-08-27 10:20:14,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527027027027027 [2023-08-27 10:20:14,591 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 402 transitions. [2023-08-27 10:20:14,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 402 transitions. [2023-08-27 10:20:14,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:14,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 402 transitions. [2023-08-27 10:20:14,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 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-27 10:20:14,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:14,593 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:14,593 INFO L175 Difference]: Start difference. First operand has 48 places, 55 transitions, 376 flow. Second operand 4 states and 402 transitions. [2023-08-27 10:20:14,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 102 transitions, 881 flow [2023-08-27 10:20:14,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 102 transitions, 881 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:20:14,597 INFO L231 Difference]: Finished difference. Result has 53 places, 68 transitions, 555 flow [2023-08-27 10:20:14,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=555, PETRI_PLACES=53, PETRI_TRANSITIONS=68} [2023-08-27 10:20:14,598 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2023-08-27 10:20:14,598 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 68 transitions, 555 flow [2023-08-27 10:20:14,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 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-27 10:20:14,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:14,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:14,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 10:20:14,599 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-27 10:20:14,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:14,599 INFO L85 PathProgramCache]: Analyzing trace with hash -853012591, now seen corresponding path program 1 times [2023-08-27 10:20:14,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:14,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073036178] [2023-08-27 10:20:14,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:14,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:15,256 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-27 10:20:15,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:15,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073036178] [2023-08-27 10:20:15,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073036178] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:15,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:15,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:20:15,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154436366] [2023-08-27 10:20:15,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:15,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:20:15,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:15,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:20:15,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:20:15,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 222 [2023-08-27 10:20:15,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 68 transitions, 555 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-27 10:20:15,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:15,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 222 [2023-08-27 10:20:15,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:15,794 INFO L124 PetriNetUnfolderBase]: 1996/3137 cut-off events. [2023-08-27 10:20:15,795 INFO L125 PetriNetUnfolderBase]: For 5664/5664 co-relation queries the response was YES. [2023-08-27 10:20:15,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14292 conditions, 3137 events. 1996/3137 cut-off events. For 5664/5664 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 15938 event pairs, 95 based on Foata normal form. 33/3134 useless extension candidates. Maximal degree in co-relation 14268. Up to 1739 conditions per place. [2023-08-27 10:20:15,814 INFO L140 encePairwiseOnDemand]: 217/222 looper letters, 121 selfloop transitions, 24 changer transitions 0/150 dead transitions. [2023-08-27 10:20:15,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 150 transitions, 1435 flow [2023-08-27 10:20:15,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:20:15,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:20:15,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 587 transitions. [2023-08-27 10:20:15,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44069069069069067 [2023-08-27 10:20:15,815 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 587 transitions. [2023-08-27 10:20:15,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 587 transitions. [2023-08-27 10:20:15,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:15,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 587 transitions. [2023-08-27 10:20:15,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 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-27 10:20:15,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 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-27 10:20:15,818 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 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-27 10:20:15,818 INFO L175 Difference]: Start difference. First operand has 53 places, 68 transitions, 555 flow. Second operand 6 states and 587 transitions. [2023-08-27 10:20:15,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 150 transitions, 1435 flow [2023-08-27 10:20:15,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 150 transitions, 1418 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:20:15,825 INFO L231 Difference]: Finished difference. Result has 61 places, 81 transitions, 764 flow [2023-08-27 10:20:15,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=764, PETRI_PLACES=61, PETRI_TRANSITIONS=81} [2023-08-27 10:20:15,827 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 22 predicate places. [2023-08-27 10:20:15,828 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 81 transitions, 764 flow [2023-08-27 10:20:15,828 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-27 10:20:15,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:15,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:15,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 10:20:15,828 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-27 10:20:15,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:15,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1470456543, now seen corresponding path program 1 times [2023-08-27 10:20:15,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:15,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012325627] [2023-08-27 10:20:15,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:15,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:16,223 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-27 10:20:16,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:16,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012325627] [2023-08-27 10:20:16,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012325627] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:16,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:16,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:20:16,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260913378] [2023-08-27 10:20:16,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:16,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:20:16,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:16,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:20:16,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:20:16,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 222 [2023-08-27 10:20:16,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 81 transitions, 764 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 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-27 10:20:16,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:16,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 222 [2023-08-27 10:20:16,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:16,693 INFO L124 PetriNetUnfolderBase]: 1990/3111 cut-off events. [2023-08-27 10:20:16,694 INFO L125 PetriNetUnfolderBase]: For 7625/7625 co-relation queries the response was YES. [2023-08-27 10:20:16,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14819 conditions, 3111 events. 1990/3111 cut-off events. For 7625/7625 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15558 event pairs, 286 based on Foata normal form. 6/3084 useless extension candidates. Maximal degree in co-relation 14790. Up to 2348 conditions per place. [2023-08-27 10:20:16,713 INFO L140 encePairwiseOnDemand]: 214/222 looper letters, 78 selfloop transitions, 28 changer transitions 0/111 dead transitions. [2023-08-27 10:20:16,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 111 transitions, 1187 flow [2023-08-27 10:20:16,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:20:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:20:16,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2023-08-27 10:20:16,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4572072072072072 [2023-08-27 10:20:16,715 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 406 transitions. [2023-08-27 10:20:16,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 406 transitions. [2023-08-27 10:20:16,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:16,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 406 transitions. [2023-08-27 10:20:16,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 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-27 10:20:16,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:16,717 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:16,717 INFO L175 Difference]: Start difference. First operand has 61 places, 81 transitions, 764 flow. Second operand 4 states and 406 transitions. [2023-08-27 10:20:16,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 111 transitions, 1187 flow [2023-08-27 10:20:16,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 111 transitions, 1173 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:20:16,723 INFO L231 Difference]: Finished difference. Result has 65 places, 90 transitions, 939 flow [2023-08-27 10:20:16,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=939, PETRI_PLACES=65, PETRI_TRANSITIONS=90} [2023-08-27 10:20:16,724 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 26 predicate places. [2023-08-27 10:20:16,724 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 90 transitions, 939 flow [2023-08-27 10:20:16,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 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-27 10:20:16,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:16,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:16,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 10:20:16,725 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-27 10:20:16,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:16,725 INFO L85 PathProgramCache]: Analyzing trace with hash -274767390, now seen corresponding path program 1 times [2023-08-27 10:20:16,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:16,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119669615] [2023-08-27 10:20:16,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:16,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:17,308 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-27 10:20:17,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:17,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119669615] [2023-08-27 10:20:17,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119669615] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:17,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:17,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:20:17,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46613814] [2023-08-27 10:20:17,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:17,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:20:17,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:17,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:20:17,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:20:17,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 222 [2023-08-27 10:20:17,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 90 transitions, 939 flow. Second operand has 6 states, 6 states have (on average 88.33333333333333) internal successors, (530), 6 states have internal predecessors, (530), 0 states have call successors, (0), 0 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-27 10:20:17,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:17,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 222 [2023-08-27 10:20:17,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:17,856 INFO L124 PetriNetUnfolderBase]: 2258/3516 cut-off events. [2023-08-27 10:20:17,856 INFO L125 PetriNetUnfolderBase]: For 11114/11178 co-relation queries the response was YES. [2023-08-27 10:20:17,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17821 conditions, 3516 events. 2258/3516 cut-off events. For 11114/11178 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 18182 event pairs, 164 based on Foata normal form. 76/3559 useless extension candidates. Maximal degree in co-relation 17789. Up to 1590 conditions per place. [2023-08-27 10:20:17,881 INFO L140 encePairwiseOnDemand]: 213/222 looper letters, 107 selfloop transitions, 41 changer transitions 0/153 dead transitions. [2023-08-27 10:20:17,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 153 transitions, 1699 flow [2023-08-27 10:20:17,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:20:17,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:20:17,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 674 transitions. [2023-08-27 10:20:17,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4337194337194337 [2023-08-27 10:20:17,883 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 674 transitions. [2023-08-27 10:20:17,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 674 transitions. [2023-08-27 10:20:17,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:17,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 674 transitions. [2023-08-27 10:20:17,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.28571428571429) internal successors, (674), 7 states have internal predecessors, (674), 0 states have call successors, (0), 0 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-27 10:20:17,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 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-27 10:20:17,886 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 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-27 10:20:17,886 INFO L175 Difference]: Start difference. First operand has 65 places, 90 transitions, 939 flow. Second operand 7 states and 674 transitions. [2023-08-27 10:20:17,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 153 transitions, 1699 flow [2023-08-27 10:20:17,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 153 transitions, 1654 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-27 10:20:17,897 INFO L231 Difference]: Finished difference. Result has 70 places, 103 transitions, 1152 flow [2023-08-27 10:20:17,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1152, PETRI_PLACES=70, PETRI_TRANSITIONS=103} [2023-08-27 10:20:17,898 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 31 predicate places. [2023-08-27 10:20:17,898 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 103 transitions, 1152 flow [2023-08-27 10:20:17,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.33333333333333) internal successors, (530), 6 states have internal predecessors, (530), 0 states have call successors, (0), 0 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-27 10:20:17,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:17,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:17,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 10:20:17,898 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-27 10:20:17,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:17,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1136073514, now seen corresponding path program 2 times [2023-08-27 10:20:17,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:17,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939893223] [2023-08-27 10:20:17,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:17,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:18,272 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-27 10:20:18,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:18,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939893223] [2023-08-27 10:20:18,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939893223] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:18,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:18,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:20:18,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084066389] [2023-08-27 10:20:18,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:18,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:20:18,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:18,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:20:18,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:20:18,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 222 [2023-08-27 10:20:18,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 103 transitions, 1152 flow. Second operand has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 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-27 10:20:18,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:18,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 222 [2023-08-27 10:20:18,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:18,862 INFO L124 PetriNetUnfolderBase]: 2555/3968 cut-off events. [2023-08-27 10:20:18,862 INFO L125 PetriNetUnfolderBase]: For 16224/16290 co-relation queries the response was YES. [2023-08-27 10:20:18,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22012 conditions, 3968 events. 2555/3968 cut-off events. For 16224/16290 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 21177 event pairs, 150 based on Foata normal form. 87/4022 useless extension candidates. Maximal degree in co-relation 21979. Up to 2590 conditions per place. [2023-08-27 10:20:18,880 INFO L140 encePairwiseOnDemand]: 212/222 looper letters, 120 selfloop transitions, 69 changer transitions 0/194 dead transitions. [2023-08-27 10:20:18,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 194 transitions, 2349 flow [2023-08-27 10:20:18,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:20:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:20:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 700 transitions. [2023-08-27 10:20:18,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2023-08-27 10:20:18,882 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 700 transitions. [2023-08-27 10:20:18,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 700 transitions. [2023-08-27 10:20:18,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:18,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 700 transitions. [2023-08-27 10:20:18,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 0 states have call successors, (0), 0 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-27 10:20:18,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 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-27 10:20:18,886 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 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-27 10:20:18,886 INFO L175 Difference]: Start difference. First operand has 70 places, 103 transitions, 1152 flow. Second operand 7 states and 700 transitions. [2023-08-27 10:20:18,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 194 transitions, 2349 flow [2023-08-27 10:20:18,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 194 transitions, 2261 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-08-27 10:20:18,899 INFO L231 Difference]: Finished difference. Result has 77 places, 141 transitions, 1754 flow [2023-08-27 10:20:18,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1754, PETRI_PLACES=77, PETRI_TRANSITIONS=141} [2023-08-27 10:20:18,899 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 38 predicate places. [2023-08-27 10:20:18,899 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 141 transitions, 1754 flow [2023-08-27 10:20:18,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 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-27 10:20:18,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:18,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:18,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 10:20:18,900 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-27 10:20:18,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:18,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1534908304, now seen corresponding path program 3 times [2023-08-27 10:20:18,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:18,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751610979] [2023-08-27 10:20:18,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:18,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:19,350 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-27 10:20:19,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:19,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751610979] [2023-08-27 10:20:19,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751610979] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:19,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:19,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:20:19,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685702385] [2023-08-27 10:20:19,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:19,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 10:20:19,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:19,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 10:20:19,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-08-27 10:20:19,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 222 [2023-08-27 10:20:19,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 141 transitions, 1754 flow. Second operand has 8 states, 8 states have (on average 88.75) internal successors, (710), 8 states have internal predecessors, (710), 0 states have call successors, (0), 0 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-27 10:20:19,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:19,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 222 [2023-08-27 10:20:19,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:20,115 INFO L124 PetriNetUnfolderBase]: 3057/4714 cut-off events. [2023-08-27 10:20:20,115 INFO L125 PetriNetUnfolderBase]: For 27840/27917 co-relation queries the response was YES. [2023-08-27 10:20:20,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28298 conditions, 4714 events. 3057/4714 cut-off events. For 27840/27917 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 25696 event pairs, 175 based on Foata normal form. 82/4763 useless extension candidates. Maximal degree in co-relation 28262. Up to 2666 conditions per place. [2023-08-27 10:20:20,143 INFO L140 encePairwiseOnDemand]: 212/222 looper letters, 157 selfloop transitions, 85 changer transitions 0/247 dead transitions. [2023-08-27 10:20:20,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 247 transitions, 3446 flow [2023-08-27 10:20:20,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:20:20,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:20:20,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 591 transitions. [2023-08-27 10:20:20,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4436936936936937 [2023-08-27 10:20:20,145 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 591 transitions. [2023-08-27 10:20:20,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 591 transitions. [2023-08-27 10:20:20,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:20,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 591 transitions. [2023-08-27 10:20:20,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:20,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 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-27 10:20:20,148 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 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-27 10:20:20,148 INFO L175 Difference]: Start difference. First operand has 77 places, 141 transitions, 1754 flow. Second operand 6 states and 591 transitions. [2023-08-27 10:20:20,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 247 transitions, 3446 flow [2023-08-27 10:20:20,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 247 transitions, 3343 flow, removed 37 selfloop flow, removed 2 redundant places. [2023-08-27 10:20:20,186 INFO L231 Difference]: Finished difference. Result has 83 places, 173 transitions, 2450 flow [2023-08-27 10:20:20,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2450, PETRI_PLACES=83, PETRI_TRANSITIONS=173} [2023-08-27 10:20:20,186 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 44 predicate places. [2023-08-27 10:20:20,187 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 173 transitions, 2450 flow [2023-08-27 10:20:20,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.75) internal successors, (710), 8 states have internal predecessors, (710), 0 states have call successors, (0), 0 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-27 10:20:20,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:20,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:20,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 10:20:20,187 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-27 10:20:20,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:20,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1583803984, now seen corresponding path program 4 times [2023-08-27 10:20:20,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:20,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787060883] [2023-08-27 10:20:20,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:20,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:20,757 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-27 10:20:20,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:20,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787060883] [2023-08-27 10:20:20,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787060883] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:20,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:20,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:20:20,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166423886] [2023-08-27 10:20:20,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:20,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 10:20:20,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:20,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 10:20:20,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-27 10:20:20,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 222 [2023-08-27 10:20:20,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 173 transitions, 2450 flow. Second operand has 8 states, 8 states have (on average 87.75) internal successors, (702), 8 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:20,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:20,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 222 [2023-08-27 10:20:20,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:21,647 INFO L124 PetriNetUnfolderBase]: 3538/5429 cut-off events. [2023-08-27 10:20:21,647 INFO L125 PetriNetUnfolderBase]: For 41433/41550 co-relation queries the response was YES. [2023-08-27 10:20:21,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35338 conditions, 5429 events. 3538/5429 cut-off events. For 41433/41550 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 30549 event pairs, 334 based on Foata normal form. 118/5506 useless extension candidates. Maximal degree in co-relation 35299. Up to 2780 conditions per place. [2023-08-27 10:20:21,680 INFO L140 encePairwiseOnDemand]: 211/222 looper letters, 139 selfloop transitions, 128 changer transitions 0/272 dead transitions. [2023-08-27 10:20:21,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 272 transitions, 4014 flow [2023-08-27 10:20:21,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 10:20:21,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 10:20:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 764 transitions. [2023-08-27 10:20:21,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43018018018018017 [2023-08-27 10:20:21,682 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 764 transitions. [2023-08-27 10:20:21,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 764 transitions. [2023-08-27 10:20:21,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:21,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 764 transitions. [2023-08-27 10:20:21,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 95.5) internal successors, (764), 8 states have internal predecessors, (764), 0 states have call successors, (0), 0 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-27 10:20:21,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 222.0) internal successors, (1998), 9 states have internal predecessors, (1998), 0 states have call successors, (0), 0 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-27 10:20:21,686 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 222.0) internal successors, (1998), 9 states have internal predecessors, (1998), 0 states have call successors, (0), 0 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-27 10:20:21,686 INFO L175 Difference]: Start difference. First operand has 83 places, 173 transitions, 2450 flow. Second operand 8 states and 764 transitions. [2023-08-27 10:20:21,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 272 transitions, 4014 flow [2023-08-27 10:20:21,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 272 transitions, 3958 flow, removed 28 selfloop flow, removed 0 redundant places. [2023-08-27 10:20:21,769 INFO L231 Difference]: Finished difference. Result has 93 places, 214 transitions, 3364 flow [2023-08-27 10:20:21,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=2412, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3364, PETRI_PLACES=93, PETRI_TRANSITIONS=214} [2023-08-27 10:20:21,769 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 54 predicate places. [2023-08-27 10:20:21,769 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 214 transitions, 3364 flow [2023-08-27 10:20:21,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.75) internal successors, (702), 8 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:21,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:21,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:21,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 10:20:21,770 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-27 10:20:21,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:21,770 INFO L85 PathProgramCache]: Analyzing trace with hash -2010323958, now seen corresponding path program 1 times [2023-08-27 10:20:21,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:21,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278677616] [2023-08-27 10:20:21,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:21,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:22,422 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-27 10:20:22,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:22,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278677616] [2023-08-27 10:20:22,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278677616] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:22,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:22,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:20:22,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534979490] [2023-08-27 10:20:22,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:22,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 10:20:22,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:22,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 10:20:22,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-27 10:20:22,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 222 [2023-08-27 10:20:22,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 214 transitions, 3364 flow. Second operand has 8 states, 8 states have (on average 87.875) internal successors, (703), 8 states have internal predecessors, (703), 0 states have call successors, (0), 0 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-27 10:20:22,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:22,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 222 [2023-08-27 10:20:22,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:23,471 INFO L124 PetriNetUnfolderBase]: 3989/6138 cut-off events. [2023-08-27 10:20:23,471 INFO L125 PetriNetUnfolderBase]: For 64342/64552 co-relation queries the response was YES. [2023-08-27 10:20:23,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43880 conditions, 6138 events. 3989/6138 cut-off events. For 64342/64552 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 35604 event pairs, 271 based on Foata normal form. 172/6264 useless extension candidates. Maximal degree in co-relation 43836. Up to 3043 conditions per place. [2023-08-27 10:20:23,506 INFO L140 encePairwiseOnDemand]: 212/222 looper letters, 187 selfloop transitions, 135 changer transitions 0/327 dead transitions. [2023-08-27 10:20:23,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 327 transitions, 5285 flow [2023-08-27 10:20:23,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 10:20:23,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 10:20:23,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 872 transitions. [2023-08-27 10:20:23,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4364364364364364 [2023-08-27 10:20:23,509 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 872 transitions. [2023-08-27 10:20:23,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 872 transitions. [2023-08-27 10:20:23,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:23,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 872 transitions. [2023-08-27 10:20:23,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.88888888888889) internal successors, (872), 9 states have internal predecessors, (872), 0 states have call successors, (0), 0 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-27 10:20:23,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 222.0) internal successors, (2220), 10 states have internal predecessors, (2220), 0 states have call successors, (0), 0 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-27 10:20:23,513 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 222.0) internal successors, (2220), 10 states have internal predecessors, (2220), 0 states have call successors, (0), 0 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-27 10:20:23,513 INFO L175 Difference]: Start difference. First operand has 93 places, 214 transitions, 3364 flow. Second operand 9 states and 872 transitions. [2023-08-27 10:20:23,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 327 transitions, 5285 flow [2023-08-27 10:20:23,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 327 transitions, 5076 flow, removed 104 selfloop flow, removed 1 redundant places. [2023-08-27 10:20:23,652 INFO L231 Difference]: Finished difference. Result has 105 places, 254 transitions, 4321 flow [2023-08-27 10:20:23,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=3221, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4321, PETRI_PLACES=105, PETRI_TRANSITIONS=254} [2023-08-27 10:20:23,653 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 66 predicate places. [2023-08-27 10:20:23,653 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 254 transitions, 4321 flow [2023-08-27 10:20:23,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.875) internal successors, (703), 8 states have internal predecessors, (703), 0 states have call successors, (0), 0 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-27 10:20:23,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:23,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:23,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 10:20:23,654 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-27 10:20:23,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:23,654 INFO L85 PathProgramCache]: Analyzing trace with hash 236845204, now seen corresponding path program 1 times [2023-08-27 10:20:23,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:23,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737117968] [2023-08-27 10:20:23,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:23,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:24,080 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-27 10:20:24,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:24,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737117968] [2023-08-27 10:20:24,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737117968] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:24,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:24,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:20:24,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782196759] [2023-08-27 10:20:24,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:24,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:20:24,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:24,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:20:24,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:20:24,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 222 [2023-08-27 10:20:24,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 254 transitions, 4321 flow. Second operand has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:24,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:24,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 222 [2023-08-27 10:20:24,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:25,219 INFO L124 PetriNetUnfolderBase]: 4431/6870 cut-off events. [2023-08-27 10:20:25,219 INFO L125 PetriNetUnfolderBase]: For 78854/79092 co-relation queries the response was YES. [2023-08-27 10:20:25,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49951 conditions, 6870 events. 4431/6870 cut-off events. For 78854/79092 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 41165 event pairs, 355 based on Foata normal form. 264/7054 useless extension candidates. Maximal degree in co-relation 49901. Up to 4646 conditions per place. [2023-08-27 10:20:25,259 INFO L140 encePairwiseOnDemand]: 211/222 looper letters, 213 selfloop transitions, 119 changer transitions 3/340 dead transitions. [2023-08-27 10:20:25,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 340 transitions, 5816 flow [2023-08-27 10:20:25,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 10:20:25,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 10:20:25,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 778 transitions. [2023-08-27 10:20:25,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380630630630631 [2023-08-27 10:20:25,261 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 778 transitions. [2023-08-27 10:20:25,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 778 transitions. [2023-08-27 10:20:25,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:25,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 778 transitions. [2023-08-27 10:20:25,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 97.25) internal successors, (778), 8 states have internal predecessors, (778), 0 states have call successors, (0), 0 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-27 10:20:25,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 222.0) internal successors, (1998), 9 states have internal predecessors, (1998), 0 states have call successors, (0), 0 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-27 10:20:25,265 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 222.0) internal successors, (1998), 9 states have internal predecessors, (1998), 0 states have call successors, (0), 0 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-27 10:20:25,265 INFO L175 Difference]: Start difference. First operand has 105 places, 254 transitions, 4321 flow. Second operand 8 states and 778 transitions. [2023-08-27 10:20:25,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 340 transitions, 5816 flow [2023-08-27 10:20:25,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 340 transitions, 5606 flow, removed 49 selfloop flow, removed 2 redundant places. [2023-08-27 10:20:25,390 INFO L231 Difference]: Finished difference. Result has 112 places, 284 transitions, 4866 flow [2023-08-27 10:20:25,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=4114, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4866, PETRI_PLACES=112, PETRI_TRANSITIONS=284} [2023-08-27 10:20:25,390 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 73 predicate places. [2023-08-27 10:20:25,390 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 284 transitions, 4866 flow [2023-08-27 10:20:25,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:25,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:25,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:25,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 10:20:25,391 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-27 10:20:25,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:25,391 INFO L85 PathProgramCache]: Analyzing trace with hash 283429214, now seen corresponding path program 2 times [2023-08-27 10:20:25,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:25,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702844815] [2023-08-27 10:20:25,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:25,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:26,190 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-27 10:20:26,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:26,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702844815] [2023-08-27 10:20:26,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702844815] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:26,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:26,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 10:20:26,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546797328] [2023-08-27 10:20:26,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:26,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 10:20:26,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:26,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 10:20:26,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-27 10:20:26,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 222 [2023-08-27 10:20:26,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 284 transitions, 4866 flow. Second operand has 9 states, 9 states have (on average 85.66666666666667) internal successors, (771), 9 states have internal predecessors, (771), 0 states have call successors, (0), 0 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-27 10:20:26,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:26,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 222 [2023-08-27 10:20:26,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:27,847 INFO L124 PetriNetUnfolderBase]: 4830/7481 cut-off events. [2023-08-27 10:20:27,848 INFO L125 PetriNetUnfolderBase]: For 95654/95938 co-relation queries the response was YES. [2023-08-27 10:20:27,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56447 conditions, 7481 events. 4830/7481 cut-off events. For 95654/95938 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 45434 event pairs, 373 based on Foata normal form. 240/7642 useless extension candidates. Maximal degree in co-relation 56395. Up to 4170 conditions per place. [2023-08-27 10:20:27,908 INFO L140 encePairwiseOnDemand]: 211/222 looper letters, 228 selfloop transitions, 160 changer transitions 0/393 dead transitions. [2023-08-27 10:20:27,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 393 transitions, 6994 flow [2023-08-27 10:20:27,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 10:20:27,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 10:20:27,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 762 transitions. [2023-08-27 10:20:27,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42905405405405406 [2023-08-27 10:20:27,911 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 762 transitions. [2023-08-27 10:20:27,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 762 transitions. [2023-08-27 10:20:27,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:27,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 762 transitions. [2023-08-27 10:20:27,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 95.25) internal successors, (762), 8 states have internal predecessors, (762), 0 states have call successors, (0), 0 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-27 10:20:27,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 222.0) internal successors, (1998), 9 states have internal predecessors, (1998), 0 states have call successors, (0), 0 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-27 10:20:27,915 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 222.0) internal successors, (1998), 9 states have internal predecessors, (1998), 0 states have call successors, (0), 0 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-27 10:20:27,915 INFO L175 Difference]: Start difference. First operand has 112 places, 284 transitions, 4866 flow. Second operand 8 states and 762 transitions. [2023-08-27 10:20:27,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 393 transitions, 6994 flow [2023-08-27 10:20:28,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 393 transitions, 6845 flow, removed 31 selfloop flow, removed 3 redundant places. [2023-08-27 10:20:28,108 INFO L231 Difference]: Finished difference. Result has 118 places, 328 transitions, 6014 flow [2023-08-27 10:20:28,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=4722, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6014, PETRI_PLACES=118, PETRI_TRANSITIONS=328} [2023-08-27 10:20:28,109 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 79 predicate places. [2023-08-27 10:20:28,109 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 328 transitions, 6014 flow [2023-08-27 10:20:28,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 85.66666666666667) internal successors, (771), 9 states have internal predecessors, (771), 0 states have call successors, (0), 0 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-27 10:20:28,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:28,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:28,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 10:20:28,110 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-27 10:20:28,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:28,110 INFO L85 PathProgramCache]: Analyzing trace with hash 286571684, now seen corresponding path program 3 times [2023-08-27 10:20:28,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:28,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220656467] [2023-08-27 10:20:28,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:28,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:28,724 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-27 10:20:28,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:28,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220656467] [2023-08-27 10:20:28,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220656467] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:28,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:28,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:20:28,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293284026] [2023-08-27 10:20:28,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:28,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:20:28,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:28,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:20:28,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:20:28,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 222 [2023-08-27 10:20:28,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 328 transitions, 6014 flow. Second operand has 7 states, 7 states have (on average 88.14285714285714) internal successors, (617), 7 states have internal predecessors, (617), 0 states have call successors, (0), 0 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-27 10:20:28,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:28,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 222 [2023-08-27 10:20:28,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:30,681 INFO L124 PetriNetUnfolderBase]: 6055/9586 cut-off events. [2023-08-27 10:20:30,681 INFO L125 PetriNetUnfolderBase]: For 130237/130568 co-relation queries the response was YES. [2023-08-27 10:20:30,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73194 conditions, 9586 events. 6055/9586 cut-off events. For 130237/130568 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 62546 event pairs, 507 based on Foata normal form. 341/9779 useless extension candidates. Maximal degree in co-relation 73140. Up to 3927 conditions per place. [2023-08-27 10:20:30,766 INFO L140 encePairwiseOnDemand]: 214/222 looper letters, 289 selfloop transitions, 168 changer transitions 6/468 dead transitions. [2023-08-27 10:20:30,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 468 transitions, 8659 flow [2023-08-27 10:20:30,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:20:30,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:20:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 693 transitions. [2023-08-27 10:20:30,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44594594594594594 [2023-08-27 10:20:30,768 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 693 transitions. [2023-08-27 10:20:30,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 693 transitions. [2023-08-27 10:20:30,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:30,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 693 transitions. [2023-08-27 10:20:30,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 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-27 10:20:30,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 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-27 10:20:30,771 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 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-27 10:20:30,771 INFO L175 Difference]: Start difference. First operand has 118 places, 328 transitions, 6014 flow. Second operand 7 states and 693 transitions. [2023-08-27 10:20:30,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 468 transitions, 8659 flow [2023-08-27 10:20:31,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 468 transitions, 8425 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-27 10:20:31,067 INFO L231 Difference]: Finished difference. Result has 123 places, 369 transitions, 7147 flow [2023-08-27 10:20:31,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=5780, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7147, PETRI_PLACES=123, PETRI_TRANSITIONS=369} [2023-08-27 10:20:31,068 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 84 predicate places. [2023-08-27 10:20:31,068 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 369 transitions, 7147 flow [2023-08-27 10:20:31,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.14285714285714) internal successors, (617), 7 states have internal predecessors, (617), 0 states have call successors, (0), 0 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-27 10:20:31,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:31,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:31,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 10:20:31,068 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-27 10:20:31,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:31,069 INFO L85 PathProgramCache]: Analyzing trace with hash -159791290, now seen corresponding path program 1 times [2023-08-27 10:20:31,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:31,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622701490] [2023-08-27 10:20:31,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:31,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:31,286 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-27 10:20:31,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:31,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622701490] [2023-08-27 10:20:31,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622701490] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:31,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:31,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:20:31,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529874259] [2023-08-27 10:20:31,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:31,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:20:31,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:31,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:20:31,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:20:31,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 222 [2023-08-27 10:20:31,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 369 transitions, 7147 flow. Second operand has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:31,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:31,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 222 [2023-08-27 10:20:31,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:33,331 INFO L124 PetriNetUnfolderBase]: 7869/12295 cut-off events. [2023-08-27 10:20:33,331 INFO L125 PetriNetUnfolderBase]: For 178412/178412 co-relation queries the response was YES. [2023-08-27 10:20:33,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95715 conditions, 12295 events. 7869/12295 cut-off events. For 178412/178412 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 80728 event pairs, 1000 based on Foata normal form. 62/12195 useless extension candidates. Maximal degree in co-relation 95658. Up to 6805 conditions per place. [2023-08-27 10:20:33,563 INFO L140 encePairwiseOnDemand]: 210/222 looper letters, 414 selfloop transitions, 163 changer transitions 3/580 dead transitions. [2023-08-27 10:20:33,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 580 transitions, 11881 flow [2023-08-27 10:20:33,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:20:33,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:20:33,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 391 transitions. [2023-08-27 10:20:33,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4403153153153153 [2023-08-27 10:20:33,578 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 391 transitions. [2023-08-27 10:20:33,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 391 transitions. [2023-08-27 10:20:33,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:33,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 391 transitions. [2023-08-27 10:20:33,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 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-27 10:20:33,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:33,580 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:33,580 INFO L175 Difference]: Start difference. First operand has 123 places, 369 transitions, 7147 flow. Second operand 4 states and 391 transitions. [2023-08-27 10:20:33,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 580 transitions, 11881 flow [2023-08-27 10:20:34,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 580 transitions, 11665 flow, removed 80 selfloop flow, removed 1 redundant places. [2023-08-27 10:20:34,054 INFO L231 Difference]: Finished difference. Result has 128 places, 465 transitions, 9751 flow [2023-08-27 10:20:34,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=7015, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=9751, PETRI_PLACES=128, PETRI_TRANSITIONS=465} [2023-08-27 10:20:34,054 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 89 predicate places. [2023-08-27 10:20:34,055 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 465 transitions, 9751 flow [2023-08-27 10:20:34,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:34,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:34,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:34,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 10:20:34,055 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-27 10:20:34,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:34,055 INFO L85 PathProgramCache]: Analyzing trace with hash 190908368, now seen corresponding path program 1 times [2023-08-27 10:20:34,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:34,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841081233] [2023-08-27 10:20:34,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:34,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:34,930 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-27 10:20:34,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:34,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841081233] [2023-08-27 10:20:34,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841081233] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:34,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:34,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:20:34,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468518802] [2023-08-27 10:20:34,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:34,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 10:20:34,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:34,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 10:20:34,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-27 10:20:34,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 222 [2023-08-27 10:20:34,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 465 transitions, 9751 flow. Second operand has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 states have internal predecessors, (688), 0 states have call successors, (0), 0 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-27 10:20:34,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:34,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 222 [2023-08-27 10:20:34,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:37,699 INFO L124 PetriNetUnfolderBase]: 8122/12850 cut-off events. [2023-08-27 10:20:37,700 INFO L125 PetriNetUnfolderBase]: For 220961/221523 co-relation queries the response was YES. [2023-08-27 10:20:37,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107476 conditions, 12850 events. 8122/12850 cut-off events. For 220961/221523 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 87917 event pairs, 1067 based on Foata normal form. 515/13171 useless extension candidates. Maximal degree in co-relation 107415. Up to 9313 conditions per place. [2023-08-27 10:20:37,827 INFO L140 encePairwiseOnDemand]: 213/222 looper letters, 401 selfloop transitions, 257 changer transitions 0/664 dead transitions. [2023-08-27 10:20:37,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 664 transitions, 14440 flow [2023-08-27 10:20:37,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 10:20:37,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 10:20:37,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 851 transitions. [2023-08-27 10:20:37,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2023-08-27 10:20:37,830 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 851 transitions. [2023-08-27 10:20:37,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 851 transitions. [2023-08-27 10:20:37,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:37,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 851 transitions. [2023-08-27 10:20:37,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.55555555555556) internal successors, (851), 9 states have internal predecessors, (851), 0 states have call successors, (0), 0 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-27 10:20:37,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 222.0) internal successors, (2220), 10 states have internal predecessors, (2220), 0 states have call successors, (0), 0 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-27 10:20:37,834 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 222.0) internal successors, (2220), 10 states have internal predecessors, (2220), 0 states have call successors, (0), 0 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-27 10:20:37,834 INFO L175 Difference]: Start difference. First operand has 128 places, 465 transitions, 9751 flow. Second operand 9 states and 851 transitions. [2023-08-27 10:20:37,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 664 transitions, 14440 flow [2023-08-27 10:20:38,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 664 transitions, 14326 flow, removed 57 selfloop flow, removed 0 redundant places. [2023-08-27 10:20:38,519 INFO L231 Difference]: Finished difference. Result has 140 places, 558 transitions, 12347 flow [2023-08-27 10:20:38,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=9665, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12347, PETRI_PLACES=140, PETRI_TRANSITIONS=558} [2023-08-27 10:20:38,520 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 101 predicate places. [2023-08-27 10:20:38,520 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 558 transitions, 12347 flow [2023-08-27 10:20:38,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 states have internal predecessors, (688), 0 states have call successors, (0), 0 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-27 10:20:38,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:38,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:38,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-27 10:20:38,520 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:20:38,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:38,521 INFO L85 PathProgramCache]: Analyzing trace with hash 595637412, now seen corresponding path program 2 times [2023-08-27 10:20:38,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:38,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124405462] [2023-08-27 10:20:38,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:38,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:39,125 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-27 10:20:39,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:39,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124405462] [2023-08-27 10:20:39,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124405462] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:39,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:39,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:20:39,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973992917] [2023-08-27 10:20:39,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:39,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 10:20:39,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:39,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 10:20:39,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-27 10:20:39,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 222 [2023-08-27 10:20:39,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 558 transitions, 12347 flow. Second operand has 8 states, 8 states have (on average 87.0) internal successors, (696), 8 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-27 10:20:39,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:39,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 222 [2023-08-27 10:20:39,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:42,120 INFO L124 PetriNetUnfolderBase]: 8642/13750 cut-off events. [2023-08-27 10:20:42,120 INFO L125 PetriNetUnfolderBase]: For 249446/250005 co-relation queries the response was YES. [2023-08-27 10:20:42,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116381 conditions, 13750 events. 8642/13750 cut-off events. For 249446/250005 co-relation queries the response was YES. Maximal size of possible extension queue 912. Compared 96253 event pairs, 782 based on Foata normal form. 512/14060 useless extension candidates. Maximal degree in co-relation 116314. Up to 6790 conditions per place. [2023-08-27 10:20:42,236 INFO L140 encePairwiseOnDemand]: 211/222 looper letters, 391 selfloop transitions, 303 changer transitions 3/703 dead transitions. [2023-08-27 10:20:42,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 703 transitions, 15940 flow [2023-08-27 10:20:42,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 10:20:42,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 10:20:42,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 858 transitions. [2023-08-27 10:20:42,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4294294294294294 [2023-08-27 10:20:42,237 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 858 transitions. [2023-08-27 10:20:42,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 858 transitions. [2023-08-27 10:20:42,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:42,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 858 transitions. [2023-08-27 10:20:42,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.33333333333333) internal successors, (858), 9 states have internal predecessors, (858), 0 states have call successors, (0), 0 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-27 10:20:42,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 222.0) internal successors, (2220), 10 states have internal predecessors, (2220), 0 states have call successors, (0), 0 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-27 10:20:42,241 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 222.0) internal successors, (2220), 10 states have internal predecessors, (2220), 0 states have call successors, (0), 0 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-27 10:20:42,241 INFO L175 Difference]: Start difference. First operand has 140 places, 558 transitions, 12347 flow. Second operand 9 states and 858 transitions. [2023-08-27 10:20:42,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 703 transitions, 15940 flow [2023-08-27 10:20:43,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 703 transitions, 15565 flow, removed 115 selfloop flow, removed 1 redundant places. [2023-08-27 10:20:43,257 INFO L231 Difference]: Finished difference. Result has 151 places, 597 transitions, 13867 flow [2023-08-27 10:20:43,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=12003, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=264, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13867, PETRI_PLACES=151, PETRI_TRANSITIONS=597} [2023-08-27 10:20:43,258 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 112 predicate places. [2023-08-27 10:20:43,258 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 597 transitions, 13867 flow [2023-08-27 10:20:43,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.0) internal successors, (696), 8 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-27 10:20:43,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:43,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:43,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-27 10:20:43,258 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-27 10:20:43,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:43,259 INFO L85 PathProgramCache]: Analyzing trace with hash -677111202, now seen corresponding path program 3 times [2023-08-27 10:20:43,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:43,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833246173] [2023-08-27 10:20:43,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:43,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:43,776 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-27 10:20:43,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:43,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833246173] [2023-08-27 10:20:43,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833246173] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:43,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:43,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:20:43,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627996268] [2023-08-27 10:20:43,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:43,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:20:43,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:43,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:20:43,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:20:43,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 222 [2023-08-27 10:20:43,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 597 transitions, 13867 flow. Second operand has 7 states, 7 states have (on average 85.28571428571429) internal successors, (597), 7 states have internal predecessors, (597), 0 states have call successors, (0), 0 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-27 10:20:43,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:43,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 222 [2023-08-27 10:20:43,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:47,481 INFO L124 PetriNetUnfolderBase]: 9210/14702 cut-off events. [2023-08-27 10:20:47,481 INFO L125 PetriNetUnfolderBase]: For 297233/297853 co-relation queries the response was YES. [2023-08-27 10:20:47,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127453 conditions, 14702 events. 9210/14702 cut-off events. For 297233/297853 co-relation queries the response was YES. Maximal size of possible extension queue 954. Compared 104600 event pairs, 1175 based on Foata normal form. 535/14967 useless extension candidates. Maximal degree in co-relation 127381. Up to 9050 conditions per place. [2023-08-27 10:20:47,609 INFO L140 encePairwiseOnDemand]: 213/222 looper letters, 463 selfloop transitions, 265 changer transitions 3/737 dead transitions. [2023-08-27 10:20:47,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 737 transitions, 17567 flow [2023-08-27 10:20:47,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:20:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:20:47,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 660 transitions. [2023-08-27 10:20:47,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4247104247104247 [2023-08-27 10:20:47,611 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 660 transitions. [2023-08-27 10:20:47,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 660 transitions. [2023-08-27 10:20:47,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:47,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 660 transitions. [2023-08-27 10:20:47,612 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-27 10:20:47,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 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-27 10:20:47,614 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 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-27 10:20:47,615 INFO L175 Difference]: Start difference. First operand has 151 places, 597 transitions, 13867 flow. Second operand 7 states and 660 transitions. [2023-08-27 10:20:47,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 737 transitions, 17567 flow [2023-08-27 10:20:48,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 737 transitions, 17367 flow, removed 46 selfloop flow, removed 3 redundant places. [2023-08-27 10:20:48,708 INFO L231 Difference]: Finished difference. Result has 155 places, 606 transitions, 14563 flow [2023-08-27 10:20:48,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=13689, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=256, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=14563, PETRI_PLACES=155, PETRI_TRANSITIONS=606} [2023-08-27 10:20:48,709 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 116 predicate places. [2023-08-27 10:20:48,709 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 606 transitions, 14563 flow [2023-08-27 10:20:48,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.28571428571429) internal successors, (597), 7 states have internal predecessors, (597), 0 states have call successors, (0), 0 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-27 10:20:48,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:48,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:48,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-27 10:20:48,723 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-27 10:20:48,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:48,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1691212448, now seen corresponding path program 4 times [2023-08-27 10:20:48,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:48,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867586373] [2023-08-27 10:20:48,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:48,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:49,015 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-27 10:20:49,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:49,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867586373] [2023-08-27 10:20:49,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867586373] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:49,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:49,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:20:49,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859737362] [2023-08-27 10:20:49,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:49,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:20:49,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:49,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:20:49,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:20:49,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 222 [2023-08-27 10:20:49,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 606 transitions, 14563 flow. Second operand has 7 states, 7 states have (on average 91.28571428571429) internal successors, (639), 7 states have internal predecessors, (639), 0 states have call successors, (0), 0 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-27 10:20:49,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:49,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 222 [2023-08-27 10:20:49,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:53,354 INFO L124 PetriNetUnfolderBase]: 10907/17594 cut-off events. [2023-08-27 10:20:53,354 INFO L125 PetriNetUnfolderBase]: For 358898/359569 co-relation queries the response was YES. [2023-08-27 10:20:53,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152718 conditions, 17594 events. 10907/17594 cut-off events. For 358898/359569 co-relation queries the response was YES. Maximal size of possible extension queue 1151. Compared 130300 event pairs, 1983 based on Foata normal form. 613/17875 useless extension candidates. Maximal degree in co-relation 152645. Up to 12667 conditions per place. [2023-08-27 10:20:53,586 INFO L140 encePairwiseOnDemand]: 213/222 looper letters, 683 selfloop transitions, 138 changer transitions 3/830 dead transitions. [2023-08-27 10:20:53,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 830 transitions, 20467 flow [2023-08-27 10:20:53,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-27 10:20:53,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-27 10:20:53,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 988 transitions. [2023-08-27 10:20:53,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44504504504504505 [2023-08-27 10:20:53,592 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 988 transitions. [2023-08-27 10:20:53,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 988 transitions. [2023-08-27 10:20:53,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:53,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 988 transitions. [2023-08-27 10:20:53,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.8) internal successors, (988), 10 states have internal predecessors, (988), 0 states have call successors, (0), 0 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-27 10:20:53,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 222.0) internal successors, (2442), 11 states have internal predecessors, (2442), 0 states have call successors, (0), 0 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-27 10:20:53,595 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 222.0) internal successors, (2442), 11 states have internal predecessors, (2442), 0 states have call successors, (0), 0 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-27 10:20:53,595 INFO L175 Difference]: Start difference. First operand has 155 places, 606 transitions, 14563 flow. Second operand 10 states and 988 transitions. [2023-08-27 10:20:53,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 830 transitions, 20467 flow [2023-08-27 10:20:55,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 830 transitions, 20210 flow, removed 74 selfloop flow, removed 3 redundant places. [2023-08-27 10:20:55,044 INFO L231 Difference]: Finished difference. Result has 166 places, 655 transitions, 16016 flow [2023-08-27 10:20:55,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=14325, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16016, PETRI_PLACES=166, PETRI_TRANSITIONS=655} [2023-08-27 10:20:55,044 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 127 predicate places. [2023-08-27 10:20:55,044 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 655 transitions, 16016 flow [2023-08-27 10:20:55,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.28571428571429) internal successors, (639), 7 states have internal predecessors, (639), 0 states have call successors, (0), 0 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-27 10:20:55,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:55,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:55,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-27 10:20:55,045 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-27 10:20:55,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:55,045 INFO L85 PathProgramCache]: Analyzing trace with hash -748960656, now seen corresponding path program 5 times [2023-08-27 10:20:55,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:55,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205256226] [2023-08-27 10:20:55,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:55,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:55,457 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-27 10:20:55,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:55,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205256226] [2023-08-27 10:20:55,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205256226] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:55,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:55,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:20:55,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624668164] [2023-08-27 10:20:55,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:55,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:20:55,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:55,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:20:55,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:20:55,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 222 [2023-08-27 10:20:55,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 655 transitions, 16016 flow. Second operand has 7 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 0 states have call successors, (0), 0 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-27 10:20:55,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:55,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 222 [2023-08-27 10:20:55,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:21:00,108 INFO L124 PetriNetUnfolderBase]: 11585/18741 cut-off events. [2023-08-27 10:21:00,109 INFO L125 PetriNetUnfolderBase]: For 389702/390414 co-relation queries the response was YES. [2023-08-27 10:21:00,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163089 conditions, 18741 events. 11585/18741 cut-off events. For 389702/390414 co-relation queries the response was YES. Maximal size of possible extension queue 1235. Compared 141053 event pairs, 2340 based on Foata normal form. 676/19055 useless extension candidates. Maximal degree in co-relation 163011. Up to 14735 conditions per place. [2023-08-27 10:21:00,273 INFO L140 encePairwiseOnDemand]: 213/222 looper letters, 625 selfloop transitions, 121 changer transitions 3/755 dead transitions. [2023-08-27 10:21:00,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 755 transitions, 19187 flow [2023-08-27 10:21:00,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:21:00,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:21:00,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 574 transitions. [2023-08-27 10:21:00,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43093093093093093 [2023-08-27 10:21:00,274 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 574 transitions. [2023-08-27 10:21:00,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 574 transitions. [2023-08-27 10:21:00,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:21:00,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 574 transitions. [2023-08-27 10:21:00,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 0 states have call successors, (0), 0 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-27 10:21:00,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 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-27 10:21:00,276 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 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-27 10:21:00,276 INFO L175 Difference]: Start difference. First operand has 166 places, 655 transitions, 16016 flow. Second operand 6 states and 574 transitions. [2023-08-27 10:21:00,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 755 transitions, 19187 flow [2023-08-27 10:21:01,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 755 transitions, 18962 flow, removed 63 selfloop flow, removed 2 redundant places. [2023-08-27 10:21:01,712 INFO L231 Difference]: Finished difference. Result has 170 places, 655 transitions, 16041 flow [2023-08-27 10:21:01,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=15791, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=16041, PETRI_PLACES=170, PETRI_TRANSITIONS=655} [2023-08-27 10:21:01,712 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 131 predicate places. [2023-08-27 10:21:01,712 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 655 transitions, 16041 flow [2023-08-27 10:21:01,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 0 states have call successors, (0), 0 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-27 10:21:01,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:21:01,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:21:01,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-27 10:21:01,713 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-27 10:21:01,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:21:01,713 INFO L85 PathProgramCache]: Analyzing trace with hash -740040966, now seen corresponding path program 6 times [2023-08-27 10:21:01,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:21:01,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56179538] [2023-08-27 10:21:01,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:21:01,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:21:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:21:02,317 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-27 10:21:02,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:21:02,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56179538] [2023-08-27 10:21:02,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56179538] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:21:02,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:21:02,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:21:02,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853633096] [2023-08-27 10:21:02,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:21:02,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:21:02,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:21:02,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:21:02,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:21:02,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 222 [2023-08-27 10:21:02,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 655 transitions, 16041 flow. Second operand has 6 states, 6 states have (on average 89.66666666666667) internal successors, (538), 6 states have internal predecessors, (538), 0 states have call successors, (0), 0 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-27 10:21:02,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:21:02,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 222 [2023-08-27 10:21:02,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:21:06,949 INFO L124 PetriNetUnfolderBase]: 12237/20000 cut-off events. [2023-08-27 10:21:06,949 INFO L125 PetriNetUnfolderBase]: For 424396/425113 co-relation queries the response was YES. [2023-08-27 10:21:07,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171445 conditions, 20000 events. 12237/20000 cut-off events. For 424396/425113 co-relation queries the response was YES. Maximal size of possible extension queue 1289. Compared 154558 event pairs, 1849 based on Foata normal form. 639/20100 useless extension candidates. Maximal degree in co-relation 171365. Up to 10518 conditions per place. [2023-08-27 10:21:07,152 INFO L140 encePairwiseOnDemand]: 215/222 looper letters, 438 selfloop transitions, 275 changer transitions 3/722 dead transitions. [2023-08-27 10:21:07,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 722 transitions, 18566 flow [2023-08-27 10:21:07,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:21:07,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:21:07,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 583 transitions. [2023-08-27 10:21:07,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4376876876876877 [2023-08-27 10:21:07,154 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 583 transitions. [2023-08-27 10:21:07,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 583 transitions. [2023-08-27 10:21:07,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:21:07,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 583 transitions. [2023-08-27 10:21:07,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 0 states have call successors, (0), 0 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-27 10:21:07,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 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-27 10:21:07,156 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 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-27 10:21:07,156 INFO L175 Difference]: Start difference. First operand has 170 places, 655 transitions, 16041 flow. Second operand 6 states and 583 transitions. [2023-08-27 10:21:07,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 722 transitions, 18566 flow [2023-08-27 10:21:08,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 722 transitions, 18444 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 10:21:08,954 INFO L231 Difference]: Finished difference. Result has 174 places, 676 transitions, 17515 flow [2023-08-27 10:21:08,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=15919, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=254, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=17515, PETRI_PLACES=174, PETRI_TRANSITIONS=676} [2023-08-27 10:21:08,955 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 135 predicate places. [2023-08-27 10:21:08,955 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 676 transitions, 17515 flow [2023-08-27 10:21:08,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.66666666666667) internal successors, (538), 6 states have internal predecessors, (538), 0 states have call successors, (0), 0 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-27 10:21:08,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:21:08,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:21:08,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-27 10:21:08,955 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:21:08,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:21:08,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1241153239, now seen corresponding path program 1 times [2023-08-27 10:21:08,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:21:08,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846586751] [2023-08-27 10:21:08,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:21:08,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:21:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:21:09,046 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-27 10:21:09,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:21:09,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846586751] [2023-08-27 10:21:09,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846586751] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:21:09,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:21:09,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:21:09,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435278577] [2023-08-27 10:21:09,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:21:09,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:21:09,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:21:09,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:21:09,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:21:09,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 222 [2023-08-27 10:21:09,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 676 transitions, 17515 flow. Second operand has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:21:09,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:21:09,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 222 [2023-08-27 10:21:09,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:21:12,152 INFO L124 PetriNetUnfolderBase]: 7301/13098 cut-off events. [2023-08-27 10:21:12,152 INFO L125 PetriNetUnfolderBase]: For 388328/389040 co-relation queries the response was YES. [2023-08-27 10:21:12,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108212 conditions, 13098 events. 7301/13098 cut-off events. For 388328/389040 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 110665 event pairs, 1117 based on Foata normal form. 1844/14357 useless extension candidates. Maximal degree in co-relation 108130. Up to 9568 conditions per place. [2023-08-27 10:21:12,263 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 1020 selfloop transitions, 8 changer transitions 3/1037 dead transitions. [2023-08-27 10:21:12,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 1037 transitions, 27876 flow [2023-08-27 10:21:12,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:21:12,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:21:12,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-08-27 10:21:12,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45675675675675675 [2023-08-27 10:21:12,264 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-08-27 10:21:12,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-08-27 10:21:12,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:21:12,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-08-27 10:21:12,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 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-27 10:21:12,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 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-27 10:21:12,265 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 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-27 10:21:12,265 INFO L175 Difference]: Start difference. First operand has 174 places, 676 transitions, 17515 flow. Second operand 5 states and 507 transitions. [2023-08-27 10:21:12,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 1037 transitions, 27876 flow [2023-08-27 10:21:13,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 1037 transitions, 27517 flow, removed 82 selfloop flow, removed 6 redundant places. [2023-08-27 10:21:13,111 INFO L231 Difference]: Finished difference. Result has 174 places, 515 transitions, 12700 flow [2023-08-27 10:21:13,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=12491, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12700, PETRI_PLACES=174, PETRI_TRANSITIONS=515} [2023-08-27 10:21:13,112 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 135 predicate places. [2023-08-27 10:21:13,112 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 515 transitions, 12700 flow [2023-08-27 10:21:13,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:21:13,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:21:13,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:21:13,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-27 10:21:13,112 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:21:13,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:21:13,112 INFO L85 PathProgramCache]: Analyzing trace with hash -647279203, now seen corresponding path program 1 times [2023-08-27 10:21:13,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:21:13,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168816710] [2023-08-27 10:21:13,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:21:13,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:21:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:21:13,220 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-27 10:21:13,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:21:13,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168816710] [2023-08-27 10:21:13,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168816710] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:21:13,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:21:13,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:21:13,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761389107] [2023-08-27 10:21:13,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:21:13,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:21:13,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:21:13,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:21:13,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:21:13,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 222 [2023-08-27 10:21:13,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 515 transitions, 12700 flow. Second operand has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 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-27 10:21:13,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:21:13,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 222 [2023-08-27 10:21:13,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:21:15,195 INFO L124 PetriNetUnfolderBase]: 4483/8621 cut-off events. [2023-08-27 10:21:15,195 INFO L125 PetriNetUnfolderBase]: For 280410/281124 co-relation queries the response was YES. [2023-08-27 10:21:15,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70127 conditions, 8621 events. 4483/8621 cut-off events. For 280410/281124 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 73692 event pairs, 371 based on Foata normal form. 1479/9563 useless extension candidates. Maximal degree in co-relation 70044. Up to 2796 conditions per place. [2023-08-27 10:21:15,260 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 921 selfloop transitions, 15 changer transitions 3/944 dead transitions. [2023-08-27 10:21:15,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 944 transitions, 24699 flow [2023-08-27 10:21:15,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:21:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:21:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 708 transitions. [2023-08-27 10:21:15,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4555984555984556 [2023-08-27 10:21:15,261 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 708 transitions. [2023-08-27 10:21:15,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 708 transitions. [2023-08-27 10:21:15,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:21:15,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 708 transitions. [2023-08-27 10:21:15,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.14285714285714) internal successors, (708), 7 states have internal predecessors, (708), 0 states have call successors, (0), 0 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-27 10:21:15,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 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-27 10:21:15,264 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 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-27 10:21:15,264 INFO L175 Difference]: Start difference. First operand has 174 places, 515 transitions, 12700 flow. Second operand 7 states and 708 transitions. [2023-08-27 10:21:15,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 944 transitions, 24699 flow [2023-08-27 10:21:15,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 944 transitions, 23466 flow, removed 279 selfloop flow, removed 15 redundant places. [2023-08-27 10:21:15,605 INFO L231 Difference]: Finished difference. Result has 168 places, 330 transitions, 7455 flow [2023-08-27 10:21:15,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=7322, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7455, PETRI_PLACES=168, PETRI_TRANSITIONS=330} [2023-08-27 10:21:15,606 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 129 predicate places. [2023-08-27 10:21:15,606 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 330 transitions, 7455 flow [2023-08-27 10:21:15,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 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-27 10:21:15,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:21:15,606 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-27 10:21:15,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-27 10:21:15,606 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:21:15,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:21:15,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1816027861, now seen corresponding path program 1 times [2023-08-27 10:21:15,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:21:15,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393972998] [2023-08-27 10:21:15,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:21:15,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:21:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:21:15,654 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-27 10:21:15,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:21:15,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393972998] [2023-08-27 10:21:15,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393972998] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:21:15,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:21:15,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:21:15,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123166758] [2023-08-27 10:21:15,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:21:15,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:21:15,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:21:15,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:21:15,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:21:15,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 222 [2023-08-27 10:21:15,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 330 transitions, 7455 flow. Second operand has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 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-27 10:21:15,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:21:15,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 222 [2023-08-27 10:21:15,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:21:17,315 INFO L124 PetriNetUnfolderBase]: 4242/7933 cut-off events. [2023-08-27 10:21:17,316 INFO L125 PetriNetUnfolderBase]: For 186789/187169 co-relation queries the response was YES. [2023-08-27 10:21:17,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68236 conditions, 7933 events. 4242/7933 cut-off events. For 186789/187169 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 65219 event pairs, 365 based on Foata normal form. 324/8237 useless extension candidates. Maximal degree in co-relation 68160. Up to 3015 conditions per place. [2023-08-27 10:21:17,362 INFO L140 encePairwiseOnDemand]: 215/222 looper letters, 116 selfloop transitions, 10 changer transitions 418/546 dead transitions. [2023-08-27 10:21:17,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 546 transitions, 13434 flow [2023-08-27 10:21:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:21:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:21:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2023-08-27 10:21:17,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45765765765765765 [2023-08-27 10:21:17,364 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 508 transitions. [2023-08-27 10:21:17,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 508 transitions. [2023-08-27 10:21:17,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:21:17,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 508 transitions. [2023-08-27 10:21:17,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 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-27 10:21:17,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 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-27 10:21:17,365 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 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-27 10:21:17,365 INFO L175 Difference]: Start difference. First operand has 168 places, 330 transitions, 7455 flow. Second operand 5 states and 508 transitions. [2023-08-27 10:21:17,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 546 transitions, 13434 flow [2023-08-27 10:21:17,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 546 transitions, 13387 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-08-27 10:21:17,937 INFO L231 Difference]: Finished difference. Result has 165 places, 88 transitions, 1759 flow [2023-08-27 10:21:17,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=7396, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1759, PETRI_PLACES=165, PETRI_TRANSITIONS=88} [2023-08-27 10:21:17,937 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 126 predicate places. [2023-08-27 10:21:17,937 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 88 transitions, 1759 flow [2023-08-27 10:21:17,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 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-27 10:21:17,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:21:17,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:21:17,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-27 10:21:17,938 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:21:17,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:21:17,938 INFO L85 PathProgramCache]: Analyzing trace with hash -637573958, now seen corresponding path program 1 times [2023-08-27 10:21:17,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:21:17,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591417743] [2023-08-27 10:21:17,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:21:17,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:21:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:21:18,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:21:18,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:21:18,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591417743] [2023-08-27 10:21:18,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591417743] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:21:18,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:21:18,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:21:18,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441695630] [2023-08-27 10:21:18,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:21:18,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:21:18,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:21:18,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:21:18,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:21:18,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 222 [2023-08-27 10:21:18,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 88 transitions, 1759 flow. Second operand has 7 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-27 10:21:18,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:21:18,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 222 [2023-08-27 10:21:18,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:21:18,437 INFO L124 PetriNetUnfolderBase]: 181/387 cut-off events. [2023-08-27 10:21:18,438 INFO L125 PetriNetUnfolderBase]: For 9663/9670 co-relation queries the response was YES. [2023-08-27 10:21:18,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3492 conditions, 387 events. 181/387 cut-off events. For 9663/9670 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1618 event pairs, 23 based on Foata normal form. 12/399 useless extension candidates. Maximal degree in co-relation 3416. Up to 254 conditions per place. [2023-08-27 10:21:18,440 INFO L140 encePairwiseOnDemand]: 213/222 looper letters, 71 selfloop transitions, 25 changer transitions 18/116 dead transitions. [2023-08-27 10:21:18,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 116 transitions, 2283 flow [2023-08-27 10:21:18,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-27 10:21:18,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-27 10:21:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 915 transitions. [2023-08-27 10:21:18,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41216216216216217 [2023-08-27 10:21:18,441 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 915 transitions. [2023-08-27 10:21:18,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 915 transitions. [2023-08-27 10:21:18,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:21:18,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 915 transitions. [2023-08-27 10:21:18,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 91.5) internal successors, (915), 10 states have internal predecessors, (915), 0 states have call successors, (0), 0 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-27 10:21:18,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 222.0) internal successors, (2442), 11 states have internal predecessors, (2442), 0 states have call successors, (0), 0 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-27 10:21:18,444 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 222.0) internal successors, (2442), 11 states have internal predecessors, (2442), 0 states have call successors, (0), 0 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-27 10:21:18,444 INFO L175 Difference]: Start difference. First operand has 165 places, 88 transitions, 1759 flow. Second operand 10 states and 915 transitions. [2023-08-27 10:21:18,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 116 transitions, 2283 flow [2023-08-27 10:21:18,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 116 transitions, 1701 flow, removed 112 selfloop flow, removed 52 redundant places. [2023-08-27 10:21:18,457 INFO L231 Difference]: Finished difference. Result has 107 places, 84 transitions, 1277 flow [2023-08-27 10:21:18,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=1276, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1277, PETRI_PLACES=107, PETRI_TRANSITIONS=84} [2023-08-27 10:21:18,458 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 68 predicate places. [2023-08-27 10:21:18,458 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 84 transitions, 1277 flow [2023-08-27 10:21:18,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 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-27 10:21:18,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:21:18,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:21:18,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-27 10:21:18,458 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:21:18,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:21:18,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1522936211, now seen corresponding path program 1 times [2023-08-27 10:21:18,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:21:18,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986697985] [2023-08-27 10:21:18,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:21:18,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:21:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:21:18,594 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-27 10:21:18,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:21:18,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986697985] [2023-08-27 10:21:18,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986697985] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:21:18,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:21:18,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:21:18,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637563174] [2023-08-27 10:21:18,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:21:18,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:21:18,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:21:18,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:21:18,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:21:18,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 222 [2023-08-27 10:21:18,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 84 transitions, 1277 flow. Second operand has 6 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 0 states have call successors, (0), 0 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-27 10:21:18,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:21:18,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 222 [2023-08-27 10:21:18,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:21:18,693 INFO L124 PetriNetUnfolderBase]: 137/291 cut-off events. [2023-08-27 10:21:18,693 INFO L125 PetriNetUnfolderBase]: For 3802/3802 co-relation queries the response was YES. [2023-08-27 10:21:18,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2075 conditions, 291 events. 137/291 cut-off events. For 3802/3802 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1118 event pairs, 11 based on Foata normal form. 16/307 useless extension candidates. Maximal degree in co-relation 2032. Up to 128 conditions per place. [2023-08-27 10:21:18,694 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 82 selfloop transitions, 10 changer transitions 30/124 dead transitions. [2023-08-27 10:21:18,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 124 transitions, 2157 flow [2023-08-27 10:21:18,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:21:18,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:21:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 666 transitions. [2023-08-27 10:21:18,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2023-08-27 10:21:18,695 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 666 transitions. [2023-08-27 10:21:18,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 666 transitions. [2023-08-27 10:21:18,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:21:18,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 666 transitions. [2023-08-27 10:21:18,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 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-27 10:21:18,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 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-27 10:21:18,697 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 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-27 10:21:18,697 INFO L175 Difference]: Start difference. First operand has 107 places, 84 transitions, 1277 flow. Second operand 7 states and 666 transitions. [2023-08-27 10:21:18,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 124 transitions, 2157 flow [2023-08-27 10:21:18,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 124 transitions, 1974 flow, removed 45 selfloop flow, removed 13 redundant places. [2023-08-27 10:21:18,704 INFO L231 Difference]: Finished difference. Result has 102 places, 69 transitions, 945 flow [2023-08-27 10:21:18,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=1083, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=945, PETRI_PLACES=102, PETRI_TRANSITIONS=69} [2023-08-27 10:21:18,704 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 63 predicate places. [2023-08-27 10:21:18,705 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 69 transitions, 945 flow [2023-08-27 10:21:18,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 0 states have call successors, (0), 0 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-27 10:21:18,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:21:18,705 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-27 10:21:18,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-27 10:21:18,705 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:21:18,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:21:18,705 INFO L85 PathProgramCache]: Analyzing trace with hash -755449740, now seen corresponding path program 1 times [2023-08-27 10:21:18,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:21:18,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117262627] [2023-08-27 10:21:18,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:21:18,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:21:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:21:19,420 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-27 10:21:19,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:21:19,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117262627] [2023-08-27 10:21:19,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117262627] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:21:19,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:21:19,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:21:19,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791517261] [2023-08-27 10:21:19,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:21:19,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 10:21:19,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:21:19,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 10:21:19,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-27 10:21:19,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 222 [2023-08-27 10:21:19,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 69 transitions, 945 flow. Second operand has 8 states, 8 states have (on average 85.5) internal successors, (684), 8 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-27 10:21:19,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:21:19,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 222 [2023-08-27 10:21:19,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:21:19,651 INFO L124 PetriNetUnfolderBase]: 134/311 cut-off events. [2023-08-27 10:21:19,652 INFO L125 PetriNetUnfolderBase]: For 2499/2503 co-relation queries the response was YES. [2023-08-27 10:21:19,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2063 conditions, 311 events. 134/311 cut-off events. For 2499/2503 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1325 event pairs, 30 based on Foata normal form. 4/314 useless extension candidates. Maximal degree in co-relation 2030. Up to 137 conditions per place. [2023-08-27 10:21:19,653 INFO L140 encePairwiseOnDemand]: 217/222 looper letters, 49 selfloop transitions, 9 changer transitions 35/95 dead transitions. [2023-08-27 10:21:19,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 95 transitions, 1366 flow [2023-08-27 10:21:19,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:21:19,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:21:19,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 542 transitions. [2023-08-27 10:21:19,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4069069069069069 [2023-08-27 10:21:19,654 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 542 transitions. [2023-08-27 10:21:19,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 542 transitions. [2023-08-27 10:21:19,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:21:19,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 542 transitions. [2023-08-27 10:21:19,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 0 states have call successors, (0), 0 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-27 10:21:19,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 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-27 10:21:19,656 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 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-27 10:21:19,656 INFO L175 Difference]: Start difference. First operand has 102 places, 69 transitions, 945 flow. Second operand 6 states and 542 transitions. [2023-08-27 10:21:19,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 95 transitions, 1366 flow [2023-08-27 10:21:19,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 95 transitions, 1232 flow, removed 19 selfloop flow, removed 11 redundant places. [2023-08-27 10:21:19,661 INFO L231 Difference]: Finished difference. Result has 95 places, 58 transitions, 714 flow [2023-08-27 10:21:19,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=714, PETRI_PLACES=95, PETRI_TRANSITIONS=58} [2023-08-27 10:21:19,662 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 56 predicate places. [2023-08-27 10:21:19,662 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 58 transitions, 714 flow [2023-08-27 10:21:19,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 85.5) internal successors, (684), 8 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-27 10:21:19,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:21:19,662 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-27 10:21:19,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-27 10:21:19,662 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:21:19,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:21:19,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1138579618, now seen corresponding path program 2 times [2023-08-27 10:21:19,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:21:19,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775652255] [2023-08-27 10:21:19,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:21:19,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:21:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:21:20,707 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-27 10:21:20,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:21:20,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775652255] [2023-08-27 10:21:20,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775652255] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:21:20,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:21:20,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 10:21:20,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390017482] [2023-08-27 10:21:20,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:21:20,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 10:21:20,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:21:20,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 10:21:20,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-27 10:21:20,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 222 [2023-08-27 10:21:20,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 58 transitions, 714 flow. Second operand has 9 states, 9 states have (on average 82.22222222222223) internal successors, (740), 9 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:21:20,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:21:20,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 222 [2023-08-27 10:21:20,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:21:21,037 INFO L124 PetriNetUnfolderBase]: 96/233 cut-off events. [2023-08-27 10:21:21,038 INFO L125 PetriNetUnfolderBase]: For 1512/1515 co-relation queries the response was YES. [2023-08-27 10:21:21,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1377 conditions, 233 events. 96/233 cut-off events. For 1512/1515 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 889 event pairs, 10 based on Foata normal form. 3/235 useless extension candidates. Maximal degree in co-relation 1340. Up to 68 conditions per place. [2023-08-27 10:21:21,038 INFO L140 encePairwiseOnDemand]: 214/222 looper letters, 36 selfloop transitions, 8 changer transitions 60/105 dead transitions. [2023-08-27 10:21:21,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 105 transitions, 1218 flow [2023-08-27 10:21:21,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-27 10:21:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-27 10:21:21,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 856 transitions. [2023-08-27 10:21:21,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3855855855855856 [2023-08-27 10:21:21,040 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 856 transitions. [2023-08-27 10:21:21,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 856 transitions. [2023-08-27 10:21:21,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:21:21,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 856 transitions. [2023-08-27 10:21:21,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 85.6) internal successors, (856), 10 states have internal predecessors, (856), 0 states have call successors, (0), 0 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-27 10:21:21,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 222.0) internal successors, (2442), 11 states have internal predecessors, (2442), 0 states have call successors, (0), 0 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-27 10:21:21,043 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 222.0) internal successors, (2442), 11 states have internal predecessors, (2442), 0 states have call successors, (0), 0 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-27 10:21:21,043 INFO L175 Difference]: Start difference. First operand has 95 places, 58 transitions, 714 flow. Second operand 10 states and 856 transitions. [2023-08-27 10:21:21,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 105 transitions, 1218 flow [2023-08-27 10:21:21,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 105 transitions, 1137 flow, removed 7 selfloop flow, removed 12 redundant places. [2023-08-27 10:21:21,047 INFO L231 Difference]: Finished difference. Result has 89 places, 30 transitions, 264 flow [2023-08-27 10:21:21,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=264, PETRI_PLACES=89, PETRI_TRANSITIONS=30} [2023-08-27 10:21:21,048 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 50 predicate places. [2023-08-27 10:21:21,048 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 30 transitions, 264 flow [2023-08-27 10:21:21,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.22222222222223) internal successors, (740), 9 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:21:21,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:21:21,048 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-27 10:21:21,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-27 10:21:21,048 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:21:21,049 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:21:21,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1886301802, now seen corresponding path program 3 times [2023-08-27 10:21:21,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:21:21,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694059053] [2023-08-27 10:21:21,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:21:21,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:21:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:21:21,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 10:21:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:21:21,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 10:21:21,166 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 10:21:21,166 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-27 10:21:21,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-08-27 10:21:21,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-27 10:21:21,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-08-27 10:21:21,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-27 10:21:21,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (12 of 18 remaining) [2023-08-27 10:21:21,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-27 10:21:21,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-27 10:21:21,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-27 10:21:21,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-27 10:21:21,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-27 10:21:21,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-08-27 10:21:21,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-27 10:21:21,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-08-27 10:21:21,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-27 10:21:21,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (2 of 18 remaining) [2023-08-27 10:21:21,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-27 10:21:21,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-27 10:21:21,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-27 10:21:21,174 INFO L445 BasicCegarLoop]: Path program histogram: [6, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:21:21,178 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:21:21,178 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:21:21,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:21:21 BasicIcfg [2023-08-27 10:21:21,237 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:21:21,237 INFO L158 Benchmark]: Toolchain (without parser) took 75527.12ms. Allocated memory was 310.4MB in the beginning and 6.7GB in the end (delta: 6.4GB). Free memory was 284.8MB in the beginning and 3.8GB in the end (delta: -3.5GB). Peak memory consumption was 2.9GB. Max. memory is 16.0GB. [2023-08-27 10:21:21,237 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 310.4MB. Free memory was 288.3MB in the beginning and 288.2MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:21:21,237 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.07ms. Allocated memory is still 310.4MB. Free memory was 284.8MB in the beginning and 258.9MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-27 10:21:21,237 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.74ms. Allocated memory is still 310.4MB. Free memory was 258.9MB in the beginning and 256.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:21:21,238 INFO L158 Benchmark]: Boogie Preprocessor took 26.26ms. Allocated memory is still 310.4MB. Free memory was 256.4MB in the beginning and 253.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 10:21:21,238 INFO L158 Benchmark]: RCFGBuilder took 709.52ms. Allocated memory is still 310.4MB. Free memory was 253.5MB in the beginning and 198.1MB in the end (delta: 55.4MB). Peak memory consumption was 54.5MB. Max. memory is 16.0GB. [2023-08-27 10:21:21,240 INFO L158 Benchmark]: TraceAbstraction took 74406.15ms. Allocated memory was 310.4MB in the beginning and 6.7GB in the end (delta: 6.4GB). Free memory was 198.1MB in the beginning and 3.8GB in the end (delta: -3.6GB). Peak memory consumption was 2.8GB. Max. memory is 16.0GB. [2023-08-27 10:21:21,241 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 310.4MB. Free memory was 288.3MB in the beginning and 288.2MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 326.07ms. Allocated memory is still 310.4MB. Free memory was 284.8MB in the beginning and 258.9MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 53.74ms. Allocated memory is still 310.4MB. Free memory was 258.9MB in the beginning and 256.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.26ms. Allocated memory is still 310.4MB. Free memory was 256.4MB in the beginning and 253.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 709.52ms. Allocated memory is still 310.4MB. Free memory was 253.5MB in the beginning and 198.1MB in the end (delta: 55.4MB). Peak memory consumption was 54.5MB. Max. memory is 16.0GB. * TraceAbstraction took 74406.15ms. Allocated memory was 310.4MB in the beginning and 6.7GB in the end (delta: 6.4GB). Free memory was 198.1MB in the beginning and 3.8GB in the end (delta: -3.6GB). Peak memory consumption was 2.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 121 PlacesBefore, 39 PlacesAfterwards, 114 TransitionsBefore, 29 TransitionsAfterwards, 2732 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 105 TotalNumberOfCompositions, 9004 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3215, independent: 2967, independent conditional: 0, independent unconditional: 2967, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1478, independent: 1417, independent conditional: 0, independent unconditional: 1417, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3215, independent: 1550, independent conditional: 0, independent unconditional: 1550, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 1478, unknown conditional: 0, unknown unconditional: 1478] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 105, Positive conditional cache size: 0, Positive unconditional cache size: 105, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2537, ((void *)0), P0, ((void *)0))=-2, t2537={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2538, ((void *)0), P1, ((void *)0))=-1, t2537={5:0}, t2538={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2539, ((void *)0), P2, ((void *)0))=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L765] EXPR 1 __unbuffered_cnt + 1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L805] EXPR 2 __unbuffered_cnt + 1 [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L834] EXPR 3 __unbuffered_cnt + 1 [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={66:67}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 765]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 765]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 805]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 805]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 852]: 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: 850]: 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: 854]: 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, 149 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: 74.2s, OverallIterations: 32, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 57.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1311 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1311 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 648 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4209 IncrementalHoareTripleChecker+Invalid, 4857 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 648 mSolverCounterUnsat, 7 mSDtfsCounter, 4209 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17515occurred in iteration=24, InterpolantAutomatonStates: 197, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 477 NumberOfCodeBlocks, 477 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 425 ConstructedInterpolants, 0 QuantifiedInterpolants, 6045 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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-27 10:21:21,259 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...