/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:29:46,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:29:46,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 21:29:46,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:29:46,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:29:46,983 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:29:46,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:29:46,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:29:46,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:29:46,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:29:46,988 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:29:46,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:29:46,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:29:46,989 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:29:46,990 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:29:46,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:29:46,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:29:46,990 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:29:46,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:29:46,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:29:46,990 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:29:46,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:29:46,991 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:29:46,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:29:46,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:29:46,992 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:29:46,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:29:46,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:29:46,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:29:46,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:29:46,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:29:46,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:29:46,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:29:46,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:29:46,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:29:46,994 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-26 21:29:47,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:29:47,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:29:47,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:29:47,234 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:29:47,235 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:29:47,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2023-08-26 21:29:48,165 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:29:48,374 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:29:48,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2023-08-26 21:29:48,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c18adbb5/e5414eee106b4defadb4eb61a425838f/FLAG7d404d94d [2023-08-26 21:29:48,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c18adbb5/e5414eee106b4defadb4eb61a425838f [2023-08-26 21:29:48,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:29:48,400 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:29:48,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:29:48,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:29:48,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:29:48,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:29:48" (1/1) ... [2023-08-26 21:29:48,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bbb0998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:48, skipping insertion in model container [2023-08-26 21:29:48,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:29:48" (1/1) ... [2023-08-26 21:29:48,440 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:29:48,684 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:29:48,694 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:29:48,722 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:29:48,723 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:29:48,746 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:29:48,769 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:29:48,769 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:29:48,773 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:29:48,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:48 WrapperNode [2023-08-26 21:29:48,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:29:48,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:29:48,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:29:48,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:29:48,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:48" (1/1) ... [2023-08-26 21:29:48,802 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:48" (1/1) ... [2023-08-26 21:29:48,829 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-08-26 21:29:48,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:29:48,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:29:48,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:29:48,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:29:48,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:48" (1/1) ... [2023-08-26 21:29:48,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:48" (1/1) ... [2023-08-26 21:29:48,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:48" (1/1) ... [2023-08-26 21:29:48,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:48" (1/1) ... [2023-08-26 21:29:48,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:48" (1/1) ... [2023-08-26 21:29:48,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:48" (1/1) ... [2023-08-26 21:29:48,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:48" (1/1) ... [2023-08-26 21:29:48,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:48" (1/1) ... [2023-08-26 21:29:48,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:29:48,870 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:29:48,870 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:29:48,870 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:29:48,871 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:48" (1/1) ... [2023-08-26 21:29:48,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:29:48,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:29:48,892 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 21:29:48,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 21:29:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:29:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:29:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:29:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:29:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:29:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:29:48,917 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:29:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:29:48,918 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:29:48,918 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:29:48,918 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:29:48,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:29:48,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:29:48,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:29:48,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:29:48,920 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 21:29:49,040 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:29:49,041 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:29:49,232 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:29:49,338 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:29:49,338 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:29:49,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:29:49 BoogieIcfgContainer [2023-08-26 21:29:49,343 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:29:49,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:29:49,344 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:29:49,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:29:49,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:29:48" (1/3) ... [2023-08-26 21:29:49,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7fb64a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:29:49, skipping insertion in model container [2023-08-26 21:29:49,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:48" (2/3) ... [2023-08-26 21:29:49,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7fb64a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:29:49, skipping insertion in model container [2023-08-26 21:29:49,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:29:49" (3/3) ... [2023-08-26 21:29:49,348 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2023-08-26 21:29:49,358 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:29:49,358 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 21:29:49,358 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:29:49,389 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:29:49,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 115 transitions, 245 flow [2023-08-26 21:29:49,436 INFO L124 PetriNetUnfolderBase]: 3/112 cut-off events. [2023-08-26 21:29:49,436 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:29:49,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 3/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-26 21:29:49,439 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 115 transitions, 245 flow [2023-08-26 21:29:49,442 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 112 transitions, 233 flow [2023-08-26 21:29:49,444 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:29:49,449 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 112 transitions, 233 flow [2023-08-26 21:29:49,451 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 112 transitions, 233 flow [2023-08-26 21:29:49,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 112 transitions, 233 flow [2023-08-26 21:29:49,471 INFO L124 PetriNetUnfolderBase]: 3/112 cut-off events. [2023-08-26 21:29:49,471 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:29:49,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 3/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-26 21:29:49,473 INFO L119 LiptonReduction]: Number of co-enabled transitions 2616 [2023-08-26 21:29:52,618 INFO L134 LiptonReduction]: Checked pairs total: 9246 [2023-08-26 21:29:52,618 INFO L136 LiptonReduction]: Total number of compositions: 102 [2023-08-26 21:29:52,626 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:29:52,630 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;@12e162a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:29:52,630 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-26 21:29:52,632 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:29:52,632 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-26 21:29:52,633 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:29:52,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:52,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:29:52,633 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:29:52,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:52,636 INFO L85 PathProgramCache]: Analyzing trace with hash 497066860, now seen corresponding path program 1 times [2023-08-26 21:29:52,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:52,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001702137] [2023-08-26 21:29:52,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:52,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:29:52,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:52,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001702137] [2023-08-26 21:29:52,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001702137] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:52,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:52,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:29:52,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722466836] [2023-08-26 21:29:52,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:52,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:29:52,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:52,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:29:52,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:29:52,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 217 [2023-08-26 21:29:52,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:52,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:52,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 217 [2023-08-26 21:29:52,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:53,173 INFO L124 PetriNetUnfolderBase]: 1108/1726 cut-off events. [2023-08-26 21:29:53,173 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-08-26 21:29:53,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3488 conditions, 1726 events. 1108/1726 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8634 event pairs, 318 based on Foata normal form. 0/1185 useless extension candidates. Maximal degree in co-relation 3477. Up to 1358 conditions per place. [2023-08-26 21:29:53,183 INFO L140 encePairwiseOnDemand]: 207/217 looper letters, 38 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2023-08-26 21:29:53,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 189 flow [2023-08-26 21:29:53,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:29:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:29:53,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-08-26 21:29:53,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930875576036866 [2023-08-26 21:29:53,198 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-08-26 21:29:53,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-08-26 21:29:53,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:53,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-08-26 21:29:53,206 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-26 21:29:53,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:53,209 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:53,211 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 65 flow. Second operand 3 states and 321 transitions. [2023-08-26 21:29:53,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 189 flow [2023-08-26 21:29:53,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 21:29:53,215 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 98 flow [2023-08-26 21:29:53,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-08-26 21:29:53,219 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2023-08-26 21:29:53,219 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 98 flow [2023-08-26 21:29:53,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:53,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:53,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:53,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:29:53,220 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:29:53,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:53,221 INFO L85 PathProgramCache]: Analyzing trace with hash 996193508, now seen corresponding path program 1 times [2023-08-26 21:29:53,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:53,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412188222] [2023-08-26 21:29:53,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:53,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:53,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:29:53,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:53,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412188222] [2023-08-26 21:29:53,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412188222] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:53,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:53,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:29:53,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866998067] [2023-08-26 21:29:53,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:53,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:29:53,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:53,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:29:53,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:29:53,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 217 [2023-08-26 21:29:53,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:53,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:53,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 217 [2023-08-26 21:29:53,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:53,567 INFO L124 PetriNetUnfolderBase]: 781/1355 cut-off events. [2023-08-26 21:29:53,567 INFO L125 PetriNetUnfolderBase]: For 134/159 co-relation queries the response was YES. [2023-08-26 21:29:53,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3229 conditions, 1355 events. 781/1355 cut-off events. For 134/159 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7706 event pairs, 167 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 3218. Up to 923 conditions per place. [2023-08-26 21:29:53,574 INFO L140 encePairwiseOnDemand]: 214/217 looper letters, 35 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-26 21:29:53,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 210 flow [2023-08-26 21:29:53,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:29:53,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:29:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2023-08-26 21:29:53,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48847926267281105 [2023-08-26 21:29:53,577 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2023-08-26 21:29:53,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2023-08-26 21:29:53,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:53,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2023-08-26 21:29:53,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:53,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:53,581 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:53,581 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 98 flow. Second operand 3 states and 318 transitions. [2023-08-26 21:29:53,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 210 flow [2023-08-26 21:29:53,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:29:53,582 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 96 flow [2023-08-26 21:29:53,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-08-26 21:29:53,583 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2023-08-26 21:29:53,583 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 96 flow [2023-08-26 21:29:53,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:53,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:53,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:53,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:29:53,589 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:29:53,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:53,591 INFO L85 PathProgramCache]: Analyzing trace with hash -435710053, now seen corresponding path program 1 times [2023-08-26 21:29:53,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:53,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953089663] [2023-08-26 21:29:53,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:53,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:54,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:29:54,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:54,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953089663] [2023-08-26 21:29:54,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953089663] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:54,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:54,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:29:54,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143730632] [2023-08-26 21:29:54,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:54,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:29:54,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:54,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:29:54,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:29:54,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 217 [2023-08-26 21:29:54,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 96 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-26 21:29:54,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:54,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 217 [2023-08-26 21:29:54,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:54,603 INFO L124 PetriNetUnfolderBase]: 2269/3677 cut-off events. [2023-08-26 21:29:54,604 INFO L125 PetriNetUnfolderBase]: For 496/527 co-relation queries the response was YES. [2023-08-26 21:29:54,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8679 conditions, 3677 events. 2269/3677 cut-off events. For 496/527 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 21025 event pairs, 287 based on Foata normal form. 9/3183 useless extension candidates. Maximal degree in co-relation 8667. Up to 2013 conditions per place. [2023-08-26 21:29:54,618 INFO L140 encePairwiseOnDemand]: 206/217 looper letters, 53 selfloop transitions, 12 changer transitions 0/68 dead transitions. [2023-08-26 21:29:54,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 68 transitions, 334 flow [2023-08-26 21:29:54,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:29:54,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:29:54,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 389 transitions. [2023-08-26 21:29:54,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44815668202764974 [2023-08-26 21:29:54,619 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 389 transitions. [2023-08-26 21:29:54,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 389 transitions. [2023-08-26 21:29:54,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:54,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 389 transitions. [2023-08-26 21:29:54,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:54,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:54,623 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:54,623 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 96 flow. Second operand 4 states and 389 transitions. [2023-08-26 21:29:54,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 68 transitions, 334 flow [2023-08-26 21:29:54,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 68 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:29:54,626 INFO L231 Difference]: Finished difference. Result has 42 places, 41 transitions, 184 flow [2023-08-26 21:29:54,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=42, PETRI_TRANSITIONS=41} [2023-08-26 21:29:54,627 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2023-08-26 21:29:54,628 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 41 transitions, 184 flow [2023-08-26 21:29:54,628 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-26 21:29:54,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:54,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:54,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:29:54,631 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:29:54,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:54,631 INFO L85 PathProgramCache]: Analyzing trace with hash -622111219, now seen corresponding path program 1 times [2023-08-26 21:29:54,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:54,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551403623] [2023-08-26 21:29:54,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:54,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:29:55,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:55,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551403623] [2023-08-26 21:29:55,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551403623] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:55,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:55,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:29:55,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656352216] [2023-08-26 21:29:55,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:55,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:29:55,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:55,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:29:55,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:29:55,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 217 [2023-08-26 21:29:55,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:55,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:55,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 217 [2023-08-26 21:29:55,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:55,417 INFO L124 PetriNetUnfolderBase]: 2244/3613 cut-off events. [2023-08-26 21:29:55,417 INFO L125 PetriNetUnfolderBase]: For 2255/2310 co-relation queries the response was YES. [2023-08-26 21:29:55,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11158 conditions, 3613 events. 2244/3613 cut-off events. For 2255/2310 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 20541 event pairs, 296 based on Foata normal form. 14/3237 useless extension candidates. Maximal degree in co-relation 11143. Up to 2002 conditions per place. [2023-08-26 21:29:55,438 INFO L140 encePairwiseOnDemand]: 206/217 looper letters, 61 selfloop transitions, 19 changer transitions 0/83 dead transitions. [2023-08-26 21:29:55,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 83 transitions, 524 flow [2023-08-26 21:29:55,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:29:55,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:29:55,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 386 transitions. [2023-08-26 21:29:55,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4447004608294931 [2023-08-26 21:29:55,440 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 386 transitions. [2023-08-26 21:29:55,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 386 transitions. [2023-08-26 21:29:55,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:55,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 386 transitions. [2023-08-26 21:29:55,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:55,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:55,442 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:55,442 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 184 flow. Second operand 4 states and 386 transitions. [2023-08-26 21:29:55,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 83 transitions, 524 flow [2023-08-26 21:29:55,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 83 transitions, 524 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:29:55,447 INFO L231 Difference]: Finished difference. Result has 48 places, 56 transitions, 368 flow [2023-08-26 21:29:55,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=368, PETRI_PLACES=48, PETRI_TRANSITIONS=56} [2023-08-26 21:29:55,448 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2023-08-26 21:29:55,449 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 56 transitions, 368 flow [2023-08-26 21:29:55,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:55,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:55,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:55,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:29:55,449 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:29:55,450 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:55,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1256247725, now seen corresponding path program 1 times [2023-08-26 21:29:55,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:55,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733622068] [2023-08-26 21:29:55,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:55,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:55,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:29:55,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:55,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733622068] [2023-08-26 21:29:55,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733622068] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:55,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:55,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:29:55,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570759896] [2023-08-26 21:29:55,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:55,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:29:55,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:55,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:29:55,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:29:55,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 217 [2023-08-26 21:29:55,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 56 transitions, 368 flow. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:55,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:55,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 217 [2023-08-26 21:29:55,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:55,788 INFO L124 PetriNetUnfolderBase]: 1470/2331 cut-off events. [2023-08-26 21:29:55,789 INFO L125 PetriNetUnfolderBase]: For 5784/5961 co-relation queries the response was YES. [2023-08-26 21:29:55,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9101 conditions, 2331 events. 1470/2331 cut-off events. For 5784/5961 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 12886 event pairs, 218 based on Foata normal form. 136/2169 useless extension candidates. Maximal degree in co-relation 9081. Up to 1612 conditions per place. [2023-08-26 21:29:55,802 INFO L140 encePairwiseOnDemand]: 210/217 looper letters, 67 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2023-08-26 21:29:55,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 81 transitions, 694 flow [2023-08-26 21:29:55,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:29:55,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:29:55,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 404 transitions. [2023-08-26 21:29:55,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46543778801843316 [2023-08-26 21:29:55,803 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 404 transitions. [2023-08-26 21:29:55,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 404 transitions. [2023-08-26 21:29:55,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:55,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 404 transitions. [2023-08-26 21:29:55,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:55,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:55,806 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:55,806 INFO L175 Difference]: Start difference. First operand has 48 places, 56 transitions, 368 flow. Second operand 4 states and 404 transitions. [2023-08-26 21:29:55,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 81 transitions, 694 flow [2023-08-26 21:29:55,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 81 transitions, 694 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:29:55,809 INFO L231 Difference]: Finished difference. Result has 48 places, 53 transitions, 364 flow [2023-08-26 21:29:55,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=364, PETRI_PLACES=48, PETRI_TRANSITIONS=53} [2023-08-26 21:29:55,809 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2023-08-26 21:29:55,809 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 53 transitions, 364 flow [2023-08-26 21:29:55,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:55,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:55,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:55,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:29:55,810 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:29:55,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:55,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1284694564, now seen corresponding path program 1 times [2023-08-26 21:29:55,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:55,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164750317] [2023-08-26 21:29:55,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:55,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:55,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:29:55,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:55,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164750317] [2023-08-26 21:29:55,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164750317] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:55,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:55,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:29:55,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592023298] [2023-08-26 21:29:55,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:55,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:29:55,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:55,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:29:55,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:29:55,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 217 [2023-08-26 21:29:55,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 53 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:55,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:55,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 217 [2023-08-26 21:29:55,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:56,065 INFO L124 PetriNetUnfolderBase]: 1137/1794 cut-off events. [2023-08-26 21:29:56,065 INFO L125 PetriNetUnfolderBase]: For 5035/5184 co-relation queries the response was YES. [2023-08-26 21:29:56,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7427 conditions, 1794 events. 1137/1794 cut-off events. For 5035/5184 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9449 event pairs, 148 based on Foata normal form. 108/1838 useless extension candidates. Maximal degree in co-relation 7405. Up to 807 conditions per place. [2023-08-26 21:29:56,075 INFO L140 encePairwiseOnDemand]: 210/217 looper letters, 85 selfloop transitions, 7 changer transitions 0/102 dead transitions. [2023-08-26 21:29:56,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 102 transitions, 878 flow [2023-08-26 21:29:56,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:29:56,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:29:56,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 418 transitions. [2023-08-26 21:29:56,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4815668202764977 [2023-08-26 21:29:56,076 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 418 transitions. [2023-08-26 21:29:56,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 418 transitions. [2023-08-26 21:29:56,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:56,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 418 transitions. [2023-08-26 21:29:56,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:56,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:56,079 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:56,079 INFO L175 Difference]: Start difference. First operand has 48 places, 53 transitions, 364 flow. Second operand 4 states and 418 transitions. [2023-08-26 21:29:56,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 102 transitions, 878 flow [2023-08-26 21:29:56,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 102 transitions, 873 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:29:56,081 INFO L231 Difference]: Finished difference. Result has 50 places, 56 transitions, 403 flow [2023-08-26 21:29:56,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=403, PETRI_PLACES=50, PETRI_TRANSITIONS=56} [2023-08-26 21:29:56,082 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2023-08-26 21:29:56,082 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 56 transitions, 403 flow [2023-08-26 21:29:56,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:56,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:56,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:56,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:29:56,083 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:29:56,083 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:56,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1647642153, now seen corresponding path program 1 times [2023-08-26 21:29:56,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:56,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709014575] [2023-08-26 21:29:56,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:56,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:29:56,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:56,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709014575] [2023-08-26 21:29:56,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709014575] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:56,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:56,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:29:56,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319159741] [2023-08-26 21:29:56,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:56,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:29:56,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:56,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:29:56,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:29:56,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 217 [2023-08-26 21:29:56,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 56 transitions, 403 flow. Second operand has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:56,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:56,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 217 [2023-08-26 21:29:56,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:56,835 INFO L124 PetriNetUnfolderBase]: 2048/3189 cut-off events. [2023-08-26 21:29:56,836 INFO L125 PetriNetUnfolderBase]: For 7809/7809 co-relation queries the response was YES. [2023-08-26 21:29:56,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14098 conditions, 3189 events. 2048/3189 cut-off events. For 7809/7809 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 16489 event pairs, 359 based on Foata normal form. 53/3194 useless extension candidates. Maximal degree in co-relation 14075. Up to 1435 conditions per place. [2023-08-26 21:29:56,852 INFO L140 encePairwiseOnDemand]: 206/217 looper letters, 75 selfloop transitions, 32 changer transitions 3/110 dead transitions. [2023-08-26 21:29:56,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 110 transitions, 947 flow [2023-08-26 21:29:56,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:29:56,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:29:56,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 393 transitions. [2023-08-26 21:29:56,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45276497695852536 [2023-08-26 21:29:56,854 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 393 transitions. [2023-08-26 21:29:56,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 393 transitions. [2023-08-26 21:29:56,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:56,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 393 transitions. [2023-08-26 21:29:56,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:56,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:56,856 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:56,856 INFO L175 Difference]: Start difference. First operand has 50 places, 56 transitions, 403 flow. Second operand 4 states and 393 transitions. [2023-08-26 21:29:56,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 110 transitions, 947 flow [2023-08-26 21:29:56,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 110 transitions, 909 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-26 21:29:56,861 INFO L231 Difference]: Finished difference. Result has 54 places, 68 transitions, 643 flow [2023-08-26 21:29:56,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=643, PETRI_PLACES=54, PETRI_TRANSITIONS=68} [2023-08-26 21:29:56,861 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2023-08-26 21:29:56,861 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 68 transitions, 643 flow [2023-08-26 21:29:56,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:56,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:56,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:56,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:29:56,862 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:29:56,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:56,862 INFO L85 PathProgramCache]: Analyzing trace with hash -2107391585, now seen corresponding path program 1 times [2023-08-26 21:29:56,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:56,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819712186] [2023-08-26 21:29:56,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:56,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:57,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:29:57,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:57,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819712186] [2023-08-26 21:29:57,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819712186] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:57,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:57,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:29:57,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661502983] [2023-08-26 21:29:57,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:57,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:29:57,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:57,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:29:57,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:29:57,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 217 [2023-08-26 21:29:57,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 68 transitions, 643 flow. Second operand has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:57,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:57,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 217 [2023-08-26 21:29:57,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:57,369 INFO L124 PetriNetUnfolderBase]: 1777/2856 cut-off events. [2023-08-26 21:29:57,369 INFO L125 PetriNetUnfolderBase]: For 8807/8859 co-relation queries the response was YES. [2023-08-26 21:29:57,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13895 conditions, 2856 events. 1777/2856 cut-off events. For 8807/8859 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 15356 event pairs, 214 based on Foata normal form. 39/2828 useless extension candidates. Maximal degree in co-relation 13869. Up to 2133 conditions per place. [2023-08-26 21:29:57,384 INFO L140 encePairwiseOnDemand]: 214/217 looper letters, 76 selfloop transitions, 7 changer transitions 0/94 dead transitions. [2023-08-26 21:29:57,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 94 transitions, 1061 flow [2023-08-26 21:29:57,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:29:57,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:29:57,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2023-08-26 21:29:57,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4685099846390169 [2023-08-26 21:29:57,385 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 305 transitions. [2023-08-26 21:29:57,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 305 transitions. [2023-08-26 21:29:57,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:57,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 305 transitions. [2023-08-26 21:29:57,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:57,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:57,387 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:57,387 INFO L175 Difference]: Start difference. First operand has 54 places, 68 transitions, 643 flow. Second operand 3 states and 305 transitions. [2023-08-26 21:29:57,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 94 transitions, 1061 flow [2023-08-26 21:29:57,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 94 transitions, 1057 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-26 21:29:57,393 INFO L231 Difference]: Finished difference. Result has 57 places, 68 transitions, 664 flow [2023-08-26 21:29:57,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=57, PETRI_TRANSITIONS=68} [2023-08-26 21:29:57,393 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 19 predicate places. [2023-08-26 21:29:57,393 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 68 transitions, 664 flow [2023-08-26 21:29:57,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:57,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:57,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:57,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:29:57,394 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:29:57,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:57,394 INFO L85 PathProgramCache]: Analyzing trace with hash 496067575, now seen corresponding path program 1 times [2023-08-26 21:29:57,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:57,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63363098] [2023-08-26 21:29:57,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:57,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:57,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:29:57,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:57,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63363098] [2023-08-26 21:29:57,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63363098] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:57,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:57,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:29:57,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353077999] [2023-08-26 21:29:57,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:57,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:29:57,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:57,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:29:57,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:29:57,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 217 [2023-08-26 21:29:57,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 68 transitions, 664 flow. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:57,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:57,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 217 [2023-08-26 21:29:57,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:57,999 INFO L124 PetriNetUnfolderBase]: 1908/3061 cut-off events. [2023-08-26 21:29:57,999 INFO L125 PetriNetUnfolderBase]: For 11301/11527 co-relation queries the response was YES. [2023-08-26 21:29:58,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15430 conditions, 3061 events. 1908/3061 cut-off events. For 11301/11527 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16830 event pairs, 209 based on Foata normal form. 145/3132 useless extension candidates. Maximal degree in co-relation 15401. Up to 1657 conditions per place. [2023-08-26 21:29:58,016 INFO L140 encePairwiseOnDemand]: 212/217 looper letters, 97 selfloop transitions, 15 changer transitions 0/123 dead transitions. [2023-08-26 21:29:58,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 123 transitions, 1416 flow [2023-08-26 21:29:58,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:29:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:29:58,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2023-08-26 21:29:58,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45852534562211983 [2023-08-26 21:29:58,018 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 398 transitions. [2023-08-26 21:29:58,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 398 transitions. [2023-08-26 21:29:58,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:58,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 398 transitions. [2023-08-26 21:29:58,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:58,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:58,020 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:58,020 INFO L175 Difference]: Start difference. First operand has 57 places, 68 transitions, 664 flow. Second operand 4 states and 398 transitions. [2023-08-26 21:29:58,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 123 transitions, 1416 flow [2023-08-26 21:29:58,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 123 transitions, 1402 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:29:58,027 INFO L231 Difference]: Finished difference. Result has 59 places, 75 transitions, 784 flow [2023-08-26 21:29:58,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=784, PETRI_PLACES=59, PETRI_TRANSITIONS=75} [2023-08-26 21:29:58,028 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2023-08-26 21:29:58,028 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 75 transitions, 784 flow [2023-08-26 21:29:58,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:58,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:58,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:58,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:29:58,029 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:29:58,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:58,029 INFO L85 PathProgramCache]: Analyzing trace with hash 337990498, now seen corresponding path program 1 times [2023-08-26 21:29:58,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:58,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56574253] [2023-08-26 21:29:58,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:58,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:58,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:29:58,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:58,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56574253] [2023-08-26 21:29:58,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56574253] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:58,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:58,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:29:58,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916514969] [2023-08-26 21:29:58,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:58,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:29:58,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:58,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:29:58,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:29:58,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 217 [2023-08-26 21:29:58,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 75 transitions, 784 flow. Second operand has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:58,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:58,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 217 [2023-08-26 21:29:58,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:58,959 INFO L124 PetriNetUnfolderBase]: 2954/4669 cut-off events. [2023-08-26 21:29:58,959 INFO L125 PetriNetUnfolderBase]: For 17956/17956 co-relation queries the response was YES. [2023-08-26 21:29:58,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24033 conditions, 4669 events. 2954/4669 cut-off events. For 17956/17956 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 26490 event pairs, 426 based on Foata normal form. 43/4616 useless extension candidates. Maximal degree in co-relation 24003. Up to 2000 conditions per place. [2023-08-26 21:29:58,987 INFO L140 encePairwiseOnDemand]: 206/217 looper letters, 93 selfloop transitions, 41 changer transitions 0/134 dead transitions. [2023-08-26 21:29:58,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 134 transitions, 1539 flow [2023-08-26 21:29:58,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:29:58,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:29:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 389 transitions. [2023-08-26 21:29:58,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44815668202764974 [2023-08-26 21:29:58,989 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 389 transitions. [2023-08-26 21:29:58,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 389 transitions. [2023-08-26 21:29:58,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:58,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 389 transitions. [2023-08-26 21:29:58,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:58,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:58,991 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:58,991 INFO L175 Difference]: Start difference. First operand has 59 places, 75 transitions, 784 flow. Second operand 4 states and 389 transitions. [2023-08-26 21:29:58,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 134 transitions, 1539 flow [2023-08-26 21:29:59,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 134 transitions, 1516 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:29:59,002 INFO L231 Difference]: Finished difference. Result has 63 places, 92 transitions, 1208 flow [2023-08-26 21:29:59,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1208, PETRI_PLACES=63, PETRI_TRANSITIONS=92} [2023-08-26 21:29:59,003 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 25 predicate places. [2023-08-26 21:29:59,003 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 92 transitions, 1208 flow [2023-08-26 21:29:59,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:59,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:59,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:59,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:29:59,003 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:29:59,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:59,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1871438106, now seen corresponding path program 1 times [2023-08-26 21:29:59,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:59,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969231422] [2023-08-26 21:29:59,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:59,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:59,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:29:59,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:59,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969231422] [2023-08-26 21:29:59,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969231422] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:59,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:59,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:29:59,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018983003] [2023-08-26 21:29:59,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:59,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:29:59,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:59,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:29:59,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:29:59,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 217 [2023-08-26 21:29:59,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 92 transitions, 1208 flow. Second operand has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:59,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:59,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 217 [2023-08-26 21:29:59,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:00,327 INFO L124 PetriNetUnfolderBase]: 3763/5891 cut-off events. [2023-08-26 21:30:00,327 INFO L125 PetriNetUnfolderBase]: For 33330/33330 co-relation queries the response was YES. [2023-08-26 21:30:00,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34008 conditions, 5891 events. 3763/5891 cut-off events. For 33330/33330 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 34188 event pairs, 470 based on Foata normal form. 8/5803 useless extension candidates. Maximal degree in co-relation 33975. Up to 4443 conditions per place. [2023-08-26 21:30:00,365 INFO L140 encePairwiseOnDemand]: 206/217 looper letters, 163 selfloop transitions, 80 changer transitions 0/243 dead transitions. [2023-08-26 21:30:00,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 243 transitions, 3563 flow [2023-08-26 21:30:00,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 21:30:00,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 21:30:00,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 739 transitions. [2023-08-26 21:30:00,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42569124423963134 [2023-08-26 21:30:00,367 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 739 transitions. [2023-08-26 21:30:00,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 739 transitions. [2023-08-26 21:30:00,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:00,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 739 transitions. [2023-08-26 21:30:00,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 92.375) internal successors, (739), 8 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:00,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:00,371 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:00,371 INFO L175 Difference]: Start difference. First operand has 63 places, 92 transitions, 1208 flow. Second operand 8 states and 739 transitions. [2023-08-26 21:30:00,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 243 transitions, 3563 flow [2023-08-26 21:30:00,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 243 transitions, 3563 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:30:00,408 INFO L231 Difference]: Finished difference. Result has 76 places, 165 transitions, 2714 flow [2023-08-26 21:30:00,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2714, PETRI_PLACES=76, PETRI_TRANSITIONS=165} [2023-08-26 21:30:00,408 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 38 predicate places. [2023-08-26 21:30:00,408 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 165 transitions, 2714 flow [2023-08-26 21:30:00,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:00,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:00,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:00,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:30:00,409 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:30:00,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:00,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1869737136, now seen corresponding path program 2 times [2023-08-26 21:30:00,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:00,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670745367] [2023-08-26 21:30:00,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:00,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:30:00,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:00,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670745367] [2023-08-26 21:30:00,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670745367] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:00,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:00,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:30:00,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558563537] [2023-08-26 21:30:00,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:00,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:30:00,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:00,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:30:00,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:30:00,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 217 [2023-08-26 21:30:00,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 165 transitions, 2714 flow. Second operand has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:00,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:00,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 217 [2023-08-26 21:30:00,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:01,670 INFO L124 PetriNetUnfolderBase]: 3608/5807 cut-off events. [2023-08-26 21:30:01,670 INFO L125 PetriNetUnfolderBase]: For 52130/52779 co-relation queries the response was YES. [2023-08-26 21:30:01,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38779 conditions, 5807 events. 3608/5807 cut-off events. For 52130/52779 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 36477 event pairs, 345 based on Foata normal form. 326/5953 useless extension candidates. Maximal degree in co-relation 38738. Up to 3606 conditions per place. [2023-08-26 21:30:01,706 INFO L140 encePairwiseOnDemand]: 212/217 looper letters, 182 selfloop transitions, 39 changer transitions 0/237 dead transitions. [2023-08-26 21:30:01,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 237 transitions, 4186 flow [2023-08-26 21:30:01,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:30:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:30:01,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 488 transitions. [2023-08-26 21:30:01,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497695852534562 [2023-08-26 21:30:01,707 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 488 transitions. [2023-08-26 21:30:01,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 488 transitions. [2023-08-26 21:30:01,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:01,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 488 transitions. [2023-08-26 21:30:01,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.6) internal successors, (488), 5 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:01,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:01,710 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:01,710 INFO L175 Difference]: Start difference. First operand has 76 places, 165 transitions, 2714 flow. Second operand 5 states and 488 transitions. [2023-08-26 21:30:01,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 237 transitions, 4186 flow [2023-08-26 21:30:01,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 237 transitions, 4162 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-26 21:30:01,766 INFO L231 Difference]: Finished difference. Result has 81 places, 181 transitions, 3125 flow [2023-08-26 21:30:01,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2690, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3125, PETRI_PLACES=81, PETRI_TRANSITIONS=181} [2023-08-26 21:30:01,767 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 43 predicate places. [2023-08-26 21:30:01,767 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 181 transitions, 3125 flow [2023-08-26 21:30:01,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:01,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:01,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:01,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:30:01,767 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:30:01,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:01,768 INFO L85 PathProgramCache]: Analyzing trace with hash -20528682, now seen corresponding path program 3 times [2023-08-26 21:30:01,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:01,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054068923] [2023-08-26 21:30:01,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:01,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:02,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:30:02,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:02,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054068923] [2023-08-26 21:30:02,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054068923] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:02,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:02,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:30:02,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421318775] [2023-08-26 21:30:02,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:02,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:30:02,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:02,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:30:02,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:30:02,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 217 [2023-08-26 21:30:02,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 181 transitions, 3125 flow. Second operand has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:02,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:02,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 217 [2023-08-26 21:30:02,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:03,067 INFO L124 PetriNetUnfolderBase]: 4165/6796 cut-off events. [2023-08-26 21:30:03,067 INFO L125 PetriNetUnfolderBase]: For 67050/67829 co-relation queries the response was YES. [2023-08-26 21:30:03,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45167 conditions, 6796 events. 4165/6796 cut-off events. For 67050/67829 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 44651 event pairs, 391 based on Foata normal form. 392/6923 useless extension candidates. Maximal degree in co-relation 45123. Up to 3329 conditions per place. [2023-08-26 21:30:03,106 INFO L140 encePairwiseOnDemand]: 212/217 looper letters, 161 selfloop transitions, 53 changer transitions 0/230 dead transitions. [2023-08-26 21:30:03,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 230 transitions, 4108 flow [2023-08-26 21:30:03,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:30:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:30:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2023-08-26 21:30:03,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4423963133640553 [2023-08-26 21:30:03,107 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 480 transitions. [2023-08-26 21:30:03,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 480 transitions. [2023-08-26 21:30:03,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:03,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 480 transitions. [2023-08-26 21:30:03,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:03,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:03,110 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:03,110 INFO L175 Difference]: Start difference. First operand has 81 places, 181 transitions, 3125 flow. Second operand 5 states and 480 transitions. [2023-08-26 21:30:03,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 230 transitions, 4108 flow [2023-08-26 21:30:03,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 230 transitions, 4079 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:30:03,171 INFO L231 Difference]: Finished difference. Result has 86 places, 182 transitions, 3302 flow [2023-08-26 21:30:03,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3096, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3302, PETRI_PLACES=86, PETRI_TRANSITIONS=182} [2023-08-26 21:30:03,171 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 48 predicate places. [2023-08-26 21:30:03,171 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 182 transitions, 3302 flow [2023-08-26 21:30:03,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:03,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:03,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:03,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:30:03,172 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:30:03,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:03,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1887807512, now seen corresponding path program 1 times [2023-08-26 21:30:03,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:03,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772670490] [2023-08-26 21:30:03,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:03,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:03,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:30:03,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:03,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772670490] [2023-08-26 21:30:03,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772670490] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:03,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:03,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:30:03,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479610519] [2023-08-26 21:30:03,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:03,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:30:03,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:03,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:30:03,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:30:03,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 217 [2023-08-26 21:30:03,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 182 transitions, 3302 flow. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:03,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:03,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 217 [2023-08-26 21:30:03,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:03,887 INFO L124 PetriNetUnfolderBase]: 2549/4653 cut-off events. [2023-08-26 21:30:03,887 INFO L125 PetriNetUnfolderBase]: For 62479/63097 co-relation queries the response was YES. [2023-08-26 21:30:03,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30727 conditions, 4653 events. 2549/4653 cut-off events. For 62479/63097 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 34515 event pairs, 190 based on Foata normal form. 840/5194 useless extension candidates. Maximal degree in co-relation 30680. Up to 2254 conditions per place. [2023-08-26 21:30:03,911 INFO L140 encePairwiseOnDemand]: 208/217 looper letters, 268 selfloop transitions, 11 changer transitions 0/299 dead transitions. [2023-08-26 21:30:03,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 299 transitions, 5912 flow [2023-08-26 21:30:03,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:30:03,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:30:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 495 transitions. [2023-08-26 21:30:03,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45622119815668205 [2023-08-26 21:30:03,913 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 495 transitions. [2023-08-26 21:30:03,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 495 transitions. [2023-08-26 21:30:03,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:03,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 495 transitions. [2023-08-26 21:30:03,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:03,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:03,915 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:03,915 INFO L175 Difference]: Start difference. First operand has 86 places, 182 transitions, 3302 flow. Second operand 5 states and 495 transitions. [2023-08-26 21:30:03,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 299 transitions, 5912 flow [2023-08-26 21:30:03,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 299 transitions, 5759 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-26 21:30:03,962 INFO L231 Difference]: Finished difference. Result has 88 places, 160 transitions, 2803 flow [2023-08-26 21:30:03,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2697, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2803, PETRI_PLACES=88, PETRI_TRANSITIONS=160} [2023-08-26 21:30:03,962 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 50 predicate places. [2023-08-26 21:30:03,962 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 160 transitions, 2803 flow [2023-08-26 21:30:03,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:03,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:03,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:03,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 21:30:03,963 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:30:03,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:03,963 INFO L85 PathProgramCache]: Analyzing trace with hash -219036101, now seen corresponding path program 1 times [2023-08-26 21:30:03,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:03,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957194063] [2023-08-26 21:30:03,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:03,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:30:04,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:04,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957194063] [2023-08-26 21:30:04,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957194063] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:04,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:04,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:30:04,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565819482] [2023-08-26 21:30:04,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:04,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:30:04,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:04,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:30:04,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:30:04,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 217 [2023-08-26 21:30:04,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 160 transitions, 2803 flow. Second operand has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:04,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:04,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 217 [2023-08-26 21:30:04,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:04,504 INFO L124 PetriNetUnfolderBase]: 1594/3233 cut-off events. [2023-08-26 21:30:04,504 INFO L125 PetriNetUnfolderBase]: For 50471/51259 co-relation queries the response was YES. [2023-08-26 21:30:04,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22080 conditions, 3233 events. 1594/3233 cut-off events. For 50471/51259 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 25062 event pairs, 171 based on Foata normal form. 802/3955 useless extension candidates. Maximal degree in co-relation 22032. Up to 1129 conditions per place. [2023-08-26 21:30:04,523 INFO L140 encePairwiseOnDemand]: 211/217 looper letters, 228 selfloop transitions, 9 changer transitions 0/256 dead transitions. [2023-08-26 21:30:04,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 256 transitions, 4906 flow [2023-08-26 21:30:04,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:30:04,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:30:04,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2023-08-26 21:30:04,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46359447004608295 [2023-08-26 21:30:04,525 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 503 transitions. [2023-08-26 21:30:04,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 503 transitions. [2023-08-26 21:30:04,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:04,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 503 transitions. [2023-08-26 21:30:04,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:04,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:04,527 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:04,527 INFO L175 Difference]: Start difference. First operand has 88 places, 160 transitions, 2803 flow. Second operand 5 states and 503 transitions. [2023-08-26 21:30:04,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 256 transitions, 4906 flow [2023-08-26 21:30:04,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 256 transitions, 4869 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-26 21:30:04,552 INFO L231 Difference]: Finished difference. Result has 92 places, 135 transitions, 2270 flow [2023-08-26 21:30:04,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2192, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2270, PETRI_PLACES=92, PETRI_TRANSITIONS=135} [2023-08-26 21:30:04,553 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 54 predicate places. [2023-08-26 21:30:04,553 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 135 transitions, 2270 flow [2023-08-26 21:30:04,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:04,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:04,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:04,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 21:30:04,553 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:30:04,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:04,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1444122658, now seen corresponding path program 1 times [2023-08-26 21:30:04,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:04,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121687805] [2023-08-26 21:30:04,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:04,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:04,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:30:04,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:04,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121687805] [2023-08-26 21:30:04,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121687805] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:04,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:04,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:30:04,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874142865] [2023-08-26 21:30:04,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:04,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:30:04,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:04,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:30:04,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:30:04,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 217 [2023-08-26 21:30:04,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 135 transitions, 2270 flow. Second operand has 5 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:04,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:04,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 217 [2023-08-26 21:30:04,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:05,027 INFO L124 PetriNetUnfolderBase]: 1527/2936 cut-off events. [2023-08-26 21:30:05,028 INFO L125 PetriNetUnfolderBase]: For 42758/43349 co-relation queries the response was YES. [2023-08-26 21:30:05,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22123 conditions, 2936 events. 1527/2936 cut-off events. For 42758/43349 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 21303 event pairs, 137 based on Foata normal form. 619/3493 useless extension candidates. Maximal degree in co-relation 22073. Up to 1090 conditions per place. [2023-08-26 21:30:05,045 INFO L140 encePairwiseOnDemand]: 210/217 looper letters, 71 selfloop transitions, 10 changer transitions 142/230 dead transitions. [2023-08-26 21:30:05,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 230 transitions, 4488 flow [2023-08-26 21:30:05,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:30:05,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:30:05,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 504 transitions. [2023-08-26 21:30:05,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645161290322581 [2023-08-26 21:30:05,047 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 504 transitions. [2023-08-26 21:30:05,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 504 transitions. [2023-08-26 21:30:05,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:05,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 504 transitions. [2023-08-26 21:30:05,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.8) internal successors, (504), 5 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:05,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:05,050 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:05,050 INFO L175 Difference]: Start difference. First operand has 92 places, 135 transitions, 2270 flow. Second operand 5 states and 504 transitions. [2023-08-26 21:30:05,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 230 transitions, 4488 flow [2023-08-26 21:30:05,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 230 transitions, 4471 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 21:30:05,079 INFO L231 Difference]: Finished difference. Result has 88 places, 60 transitions, 877 flow [2023-08-26 21:30:05,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2197, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=877, PETRI_PLACES=88, PETRI_TRANSITIONS=60} [2023-08-26 21:30:05,081 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 50 predicate places. [2023-08-26 21:30:05,081 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 60 transitions, 877 flow [2023-08-26 21:30:05,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:05,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:05,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:05,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 21:30:05,081 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:30:05,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:05,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1618046214, now seen corresponding path program 1 times [2023-08-26 21:30:05,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:05,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126758958] [2023-08-26 21:30:05,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:05,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:30:05,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:05,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126758958] [2023-08-26 21:30:05,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126758958] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:05,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:05,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:30:05,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276517403] [2023-08-26 21:30:05,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:05,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:30:05,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:05,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:30:05,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:30:05,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 217 [2023-08-26 21:30:05,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 60 transitions, 877 flow. Second operand has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:05,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:05,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 217 [2023-08-26 21:30:05,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:05,305 INFO L124 PetriNetUnfolderBase]: 164/394 cut-off events. [2023-08-26 21:30:05,306 INFO L125 PetriNetUnfolderBase]: For 4824/4857 co-relation queries the response was YES. [2023-08-26 21:30:05,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2793 conditions, 394 events. 164/394 cut-off events. For 4824/4857 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2053 event pairs, 8 based on Foata normal form. 57/443 useless extension candidates. Maximal degree in co-relation 2744. Up to 123 conditions per place. [2023-08-26 21:30:05,307 INFO L140 encePairwiseOnDemand]: 211/217 looper letters, 21 selfloop transitions, 11 changer transitions 52/87 dead transitions. [2023-08-26 21:30:05,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 87 transitions, 1417 flow [2023-08-26 21:30:05,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:30:05,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:30:05,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 571 transitions. [2023-08-26 21:30:05,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43855606758832566 [2023-08-26 21:30:05,309 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 571 transitions. [2023-08-26 21:30:05,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 571 transitions. [2023-08-26 21:30:05,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:05,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 571 transitions. [2023-08-26 21:30:05,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:05,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:05,313 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:05,313 INFO L175 Difference]: Start difference. First operand has 88 places, 60 transitions, 877 flow. Second operand 6 states and 571 transitions. [2023-08-26 21:30:05,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 87 transitions, 1417 flow [2023-08-26 21:30:05,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 87 transitions, 1114 flow, removed 38 selfloop flow, removed 22 redundant places. [2023-08-26 21:30:05,319 INFO L231 Difference]: Finished difference. Result has 71 places, 28 transitions, 230 flow [2023-08-26 21:30:05,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=230, PETRI_PLACES=71, PETRI_TRANSITIONS=28} [2023-08-26 21:30:05,319 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 33 predicate places. [2023-08-26 21:30:05,320 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 28 transitions, 230 flow [2023-08-26 21:30:05,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:05,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:05,320 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] [2023-08-26 21:30:05,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 21:30:05,320 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:30:05,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:05,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1643564514, now seen corresponding path program 1 times [2023-08-26 21:30:05,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:05,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610108263] [2023-08-26 21:30:05,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:05,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:30:05,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:30:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:30:05,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:30:05,412 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:30:05,412 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-26 21:30:05,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-08-26 21:30:05,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-26 21:30:05,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-08-26 21:30:05,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-26 21:30:05,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (12 of 18 remaining) [2023-08-26 21:30:05,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-26 21:30:05,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-26 21:30:05,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-26 21:30:05,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-26 21:30:05,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-26 21:30:05,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-08-26 21:30:05,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-26 21:30:05,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-08-26 21:30:05,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-26 21:30:05,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (2 of 18 remaining) [2023-08-26 21:30:05,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-26 21:30:05,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-26 21:30:05,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 21:30:05,416 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:05,421 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:30:05,421 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:30:05,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:30:05 BasicIcfg [2023-08-26 21:30:05,482 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:30:05,482 INFO L158 Benchmark]: Toolchain (without parser) took 17082.41ms. Allocated memory was 411.0MB in the beginning and 1.4GB in the end (delta: 1.0GB). Free memory was 386.2MB in the beginning and 973.7MB in the end (delta: -587.5MB). Peak memory consumption was 421.6MB. Max. memory is 16.0GB. [2023-08-26 21:30:05,482 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 411.0MB. Free memory is still 388.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:30:05,482 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.05ms. Allocated memory is still 411.0MB. Free memory was 386.2MB in the beginning and 363.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:30:05,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.86ms. Allocated memory is still 411.0MB. Free memory was 363.1MB in the beginning and 360.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:30:05,483 INFO L158 Benchmark]: Boogie Preprocessor took 39.86ms. Allocated memory is still 411.0MB. Free memory was 360.3MB in the beginning and 358.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:30:05,483 INFO L158 Benchmark]: RCFGBuilder took 472.61ms. Allocated memory is still 411.0MB. Free memory was 358.5MB in the beginning and 383.1MB in the end (delta: -24.5MB). Peak memory consumption was 38.1MB. Max. memory is 16.0GB. [2023-08-26 21:30:05,483 INFO L158 Benchmark]: TraceAbstraction took 16137.57ms. Allocated memory was 411.0MB in the beginning and 1.4GB in the end (delta: 1.0GB). Free memory was 382.0MB in the beginning and 973.7MB in the end (delta: -591.7MB). Peak memory consumption was 419.1MB. Max. memory is 16.0GB. [2023-08-26 21:30:05,484 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 411.0MB. Free memory is still 388.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 373.05ms. Allocated memory is still 411.0MB. Free memory was 386.2MB in the beginning and 363.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 54.86ms. Allocated memory is still 411.0MB. Free memory was 363.1MB in the beginning and 360.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 39.86ms. Allocated memory is still 411.0MB. Free memory was 360.3MB in the beginning and 358.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 472.61ms. Allocated memory is still 411.0MB. Free memory was 358.5MB in the beginning and 383.1MB in the end (delta: -24.5MB). Peak memory consumption was 38.1MB. Max. memory is 16.0GB. * TraceAbstraction took 16137.57ms. Allocated memory was 411.0MB in the beginning and 1.4GB in the end (delta: 1.0GB). Free memory was 382.0MB in the beginning and 973.7MB in the end (delta: -591.7MB). Peak memory consumption was 419.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 119 PlacesBefore, 38 PlacesAfterwards, 112 TransitionsBefore, 28 TransitionsAfterwards, 2616 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 102 TotalNumberOfCompositions, 9246 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3832, independent: 3567, independent conditional: 0, independent unconditional: 3567, dependent: 265, dependent conditional: 0, dependent unconditional: 265, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1398, independent: 1349, independent conditional: 0, independent unconditional: 1349, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3832, independent: 2218, independent conditional: 0, independent unconditional: 2218, dependent: 216, dependent conditional: 0, dependent unconditional: 216, unknown: 1398, unknown conditional: 0, unknown unconditional: 1398] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 100, Positive conditional cache size: 0, Positive unconditional cache size: 100, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492, ((void *)0), P0, ((void *)0))=-2, t2492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493, ((void *)0), P1, ((void *)0))=-1, t2492={5:0}, t2493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494, ((void *)0), P2, ((void *)0))=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L767] EXPR 2 __unbuffered_cnt + 1 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L747] EXPR 1 __unbuffered_cnt + 1 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L796] EXPR 3 __unbuffered_cnt + 1 [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe030_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 747]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 796]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 796]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 146 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: 16.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 434 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 434 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1276 IncrementalHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 38 mSDtfsCounter, 1276 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3302occurred in iteration=13, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 2240 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 21:30:05,502 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...