/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/mix057_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:21:24,634 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:21:24,710 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 21:21:24,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:21:24,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:21:24,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:21:24,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:21:24,747 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:21:24,748 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:21:24,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:21:24,752 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:21:24,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:21:24,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:21:24,753 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:21:24,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:21:24,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:21:24,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:21:24,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:21:24,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:21:24,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:21:24,755 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:21:24,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:21:24,755 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:21:24,756 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:21:24,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:21:24,756 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:21:24,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:21:24,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:21:24,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:21:24,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:21:24,758 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:21:24,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:21:24,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:21:24,758 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:21:24,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:21:24,759 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-26 21:21:25,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:21:25,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:21:25,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:21:25,087 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:21:25,088 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:21:25,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 21:21:26,334 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:21:26,658 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:21:26,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 21:21:26,678 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b0068b81/daf2af192c2243b0a0d8d571ce86b9d4/FLAGccc0fed82 [2023-08-26 21:21:26,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b0068b81/daf2af192c2243b0a0d8d571ce86b9d4 [2023-08-26 21:21:26,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:21:26,693 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:21:26,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:21:26,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:21:26,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:21:26,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:21:26" (1/1) ... [2023-08-26 21:21:26,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18ab832a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:26, skipping insertion in model container [2023-08-26 21:21:26,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:21:26" (1/1) ... [2023-08-26 21:21:26,762 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:21:27,159 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:21:27,175 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:21:27,202 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:21:27,209 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:21:27,259 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:21:27,296 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:21:27,296 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:21:27,302 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:21:27,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:27 WrapperNode [2023-08-26 21:21:27,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:21:27,304 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:21:27,304 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:21:27,304 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:21:27,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:27" (1/1) ... [2023-08-26 21:21:27,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:27" (1/1) ... [2023-08-26 21:21:27,380 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-08-26 21:21:27,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:21:27,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:21:27,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:21:27,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:21:27,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:27" (1/1) ... [2023-08-26 21:21:27,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:27" (1/1) ... [2023-08-26 21:21:27,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:27" (1/1) ... [2023-08-26 21:21:27,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:27" (1/1) ... [2023-08-26 21:21:27,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:27" (1/1) ... [2023-08-26 21:21:27,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:27" (1/1) ... [2023-08-26 21:21:27,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:27" (1/1) ... [2023-08-26 21:21:27,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:27" (1/1) ... [2023-08-26 21:21:27,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:21:27,441 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:21:27,441 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:21:27,441 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:21:27,442 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:27" (1/1) ... [2023-08-26 21:21:27,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:21:27,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:21:27,471 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 21:21:27,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 21:21:27,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:21:27,502 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:21:27,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:21:27,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:21:27,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:21:27,503 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:21:27,503 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:21:27,503 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:21:27,503 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:21:27,503 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:21:27,503 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:21:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 21:21:27,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 21:21:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:21:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:21:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:21:27,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:21:27,505 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 21:21:27,635 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:21:27,637 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:21:28,032 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:21:28,165 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:21:28,166 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:21:28,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:21:28 BoogieIcfgContainer [2023-08-26 21:21:28,183 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:21:28,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:21:28,189 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:21:28,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:21:28,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:21:26" (1/3) ... [2023-08-26 21:21:28,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3668b33d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:21:28, skipping insertion in model container [2023-08-26 21:21:28,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:27" (2/3) ... [2023-08-26 21:21:28,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3668b33d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:21:28, skipping insertion in model container [2023-08-26 21:21:28,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:21:28" (3/3) ... [2023-08-26 21:21:28,195 INFO L112 eAbstractionObserver]: Analyzing ICFG mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 21:21:28,211 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:21:28,212 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 21:21:28,213 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:21:28,282 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:21:28,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 139 transitions, 298 flow [2023-08-26 21:21:28,392 INFO L124 PetriNetUnfolderBase]: 3/135 cut-off events. [2023-08-26 21:21:28,392 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:21:28,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 3/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-26 21:21:28,399 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 139 transitions, 298 flow [2023-08-26 21:21:28,403 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 135 transitions, 282 flow [2023-08-26 21:21:28,406 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:21:28,414 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 135 transitions, 282 flow [2023-08-26 21:21:28,418 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 135 transitions, 282 flow [2023-08-26 21:21:28,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 135 transitions, 282 flow [2023-08-26 21:21:28,476 INFO L124 PetriNetUnfolderBase]: 3/135 cut-off events. [2023-08-26 21:21:28,476 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:21:28,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 3/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-26 21:21:28,482 INFO L119 LiptonReduction]: Number of co-enabled transitions 4414 [2023-08-26 21:21:32,138 INFO L134 LiptonReduction]: Checked pairs total: 16842 [2023-08-26 21:21:32,138 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-26 21:21:32,150 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:21:32,155 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;@456792b7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:21:32,155 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-26 21:21:32,158 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:21:32,158 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-08-26 21:21:32,158 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:21:32,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:32,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 21:21:32,159 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:32,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:32,163 INFO L85 PathProgramCache]: Analyzing trace with hash 609073, now seen corresponding path program 1 times [2023-08-26 21:21:32,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:32,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620782281] [2023-08-26 21:21:32,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:32,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:32,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:32,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620782281] [2023-08-26 21:21:32,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620782281] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:32,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:32,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:21:32,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629161385] [2023-08-26 21:21:32,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:32,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:21:32,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:32,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:21:32,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:21:32,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 251 [2023-08-26 21:21:32,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:32,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:32,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 251 [2023-08-26 21:21:32,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:35,024 INFO L124 PetriNetUnfolderBase]: 16914/24840 cut-off events. [2023-08-26 21:21:35,025 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2023-08-26 21:21:35,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47633 conditions, 24840 events. 16914/24840 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 1130. Compared 171155 event pairs, 2494 based on Foata normal form. 750/19889 useless extension candidates. Maximal degree in co-relation 47621. Up to 18869 conditions per place. [2023-08-26 21:21:35,197 INFO L140 encePairwiseOnDemand]: 247/251 looper letters, 54 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-08-26 21:21:35,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 259 flow [2023-08-26 21:21:35,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:21:35,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:21:35,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-08-26 21:21:35,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5325365205843293 [2023-08-26 21:21:35,215 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-08-26 21:21:35,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-08-26 21:21:35,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:35,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-08-26 21:21:35,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:35,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:35,230 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:35,232 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 3 states and 401 transitions. [2023-08-26 21:21:35,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 259 flow [2023-08-26 21:21:35,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 252 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 21:21:35,239 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 88 flow [2023-08-26 21:21:35,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-26 21:21:35,246 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-08-26 21:21:35,246 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 88 flow [2023-08-26 21:21:35,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:35,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:35,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 21:21:35,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:21:35,247 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:35,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:35,255 INFO L85 PathProgramCache]: Analyzing trace with hash 965487331, now seen corresponding path program 1 times [2023-08-26 21:21:35,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:35,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693333847] [2023-08-26 21:21:35,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:35,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:35,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:35,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:35,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693333847] [2023-08-26 21:21:35,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693333847] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:35,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:35,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:21:35,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171328572] [2023-08-26 21:21:35,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:35,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:21:35,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:35,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:21:35,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:21:35,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2023-08-26 21:21:35,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:35,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:35,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2023-08-26 21:21:35,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:37,552 INFO L124 PetriNetUnfolderBase]: 16914/22512 cut-off events. [2023-08-26 21:21:37,553 INFO L125 PetriNetUnfolderBase]: For 1111/1111 co-relation queries the response was YES. [2023-08-26 21:21:37,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46415 conditions, 22512 events. 16914/22512 cut-off events. For 1111/1111 co-relation queries the response was YES. Maximal size of possible extension queue 921. Compared 119066 event pairs, 16914 based on Foata normal form. 0/16792 useless extension candidates. Maximal degree in co-relation 46405. Up to 22475 conditions per place. [2023-08-26 21:21:37,805 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 30 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-08-26 21:21:37,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 34 transitions, 142 flow [2023-08-26 21:21:37,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:21:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:21:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-26 21:21:37,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4807436918990704 [2023-08-26 21:21:37,807 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-26 21:21:37,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-26 21:21:37,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:37,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-26 21:21:37,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:37,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:37,810 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:37,811 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 88 flow. Second operand 3 states and 362 transitions. [2023-08-26 21:21:37,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 34 transitions, 142 flow [2023-08-26 21:21:37,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:21:37,812 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 78 flow [2023-08-26 21:21:37,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2023-08-26 21:21:37,813 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2023-08-26 21:21:37,813 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 78 flow [2023-08-26 21:21:37,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:37,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:37,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 21:21:37,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:21:37,814 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:37,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:37,815 INFO L85 PathProgramCache]: Analyzing trace with hash 965487332, now seen corresponding path program 1 times [2023-08-26 21:21:37,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:37,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708520589] [2023-08-26 21:21:37,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:37,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:37,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:37,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:37,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708520589] [2023-08-26 21:21:37,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708520589] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:37,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:37,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:21:37,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108577200] [2023-08-26 21:21:37,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:37,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:21:37,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:37,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:21:37,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:21:37,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2023-08-26 21:21:37,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:37,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:37,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2023-08-26 21:21:37,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:39,170 INFO L124 PetriNetUnfolderBase]: 10938/14951 cut-off events. [2023-08-26 21:21:39,171 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:21:39,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30102 conditions, 14951 events. 10938/14951 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 80893 event pairs, 2969 based on Foata normal form. 0/11907 useless extension candidates. Maximal degree in co-relation 30096. Up to 11983 conditions per place. [2023-08-26 21:21:39,251 INFO L140 encePairwiseOnDemand]: 242/251 looper letters, 51 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2023-08-26 21:21:39,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 59 transitions, 246 flow [2023-08-26 21:21:39,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:21:39,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:21:39,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-08-26 21:21:39,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5139442231075697 [2023-08-26 21:21:39,254 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-08-26 21:21:39,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-08-26 21:21:39,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:39,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-08-26 21:21:39,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:39,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:39,257 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:39,258 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 78 flow. Second operand 3 states and 387 transitions. [2023-08-26 21:21:39,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 59 transitions, 246 flow [2023-08-26 21:21:39,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:21:39,259 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 116 flow [2023-08-26 21:21:39,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-26 21:21:39,260 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-08-26 21:21:39,260 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 116 flow [2023-08-26 21:21:39,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:39,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:39,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:39,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:21:39,261 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:39,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:39,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1923049266, now seen corresponding path program 1 times [2023-08-26 21:21:39,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:39,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724560400] [2023-08-26 21:21:39,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:39,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:39,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:39,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724560400] [2023-08-26 21:21:39,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724560400] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:39,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:39,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:21:39,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359667471] [2023-08-26 21:21:39,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:39,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:21:39,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:39,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:21:39,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:21:39,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2023-08-26 21:21:39,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:39,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:39,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2023-08-26 21:21:39,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:40,326 INFO L124 PetriNetUnfolderBase]: 7470/10254 cut-off events. [2023-08-26 21:21:40,326 INFO L125 PetriNetUnfolderBase]: For 852/852 co-relation queries the response was YES. [2023-08-26 21:21:40,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24394 conditions, 10254 events. 7470/10254 cut-off events. For 852/852 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 53752 event pairs, 2185 based on Foata normal form. 0/9112 useless extension candidates. Maximal degree in co-relation 24386. Up to 3924 conditions per place. [2023-08-26 21:21:40,386 INFO L140 encePairwiseOnDemand]: 242/251 looper letters, 70 selfloop transitions, 9 changer transitions 0/82 dead transitions. [2023-08-26 21:21:40,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 82 transitions, 380 flow [2023-08-26 21:21:40,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:21:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:21:40,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 519 transitions. [2023-08-26 21:21:40,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5169322709163346 [2023-08-26 21:21:40,389 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 519 transitions. [2023-08-26 21:21:40,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 519 transitions. [2023-08-26 21:21:40,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:40,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 519 transitions. [2023-08-26 21:21:40,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:40,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:40,393 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:40,393 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 116 flow. Second operand 4 states and 519 transitions. [2023-08-26 21:21:40,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 82 transitions, 380 flow [2023-08-26 21:21:40,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 82 transitions, 375 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:21:40,398 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 169 flow [2023-08-26 21:21:40,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-26 21:21:40,399 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-26 21:21:40,400 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 169 flow [2023-08-26 21:21:40,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:40,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:40,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:40,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:21:40,401 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:40,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:40,401 INFO L85 PathProgramCache]: Analyzing trace with hash -962466154, now seen corresponding path program 1 times [2023-08-26 21:21:40,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:40,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136269545] [2023-08-26 21:21:40,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:40,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:40,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:40,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:40,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136269545] [2023-08-26 21:21:40,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136269545] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:40,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:40,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:21:40,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522354115] [2023-08-26 21:21:40,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:40,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:21:40,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:40,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:21:40,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:21:40,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 251 [2023-08-26 21:21:40,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:40,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:40,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 251 [2023-08-26 21:21:40,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:43,309 INFO L124 PetriNetUnfolderBase]: 32649/44240 cut-off events. [2023-08-26 21:21:43,309 INFO L125 PetriNetUnfolderBase]: For 30651/30651 co-relation queries the response was YES. [2023-08-26 21:21:43,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112186 conditions, 44240 events. 32649/44240 cut-off events. For 30651/30651 co-relation queries the response was YES. Maximal size of possible extension queue 1381. Compared 252842 event pairs, 9151 based on Foata normal form. 0/40624 useless extension candidates. Maximal degree in co-relation 112176. Up to 17430 conditions per place. [2023-08-26 21:21:43,537 INFO L140 encePairwiseOnDemand]: 241/251 looper letters, 122 selfloop transitions, 16 changer transitions 0/138 dead transitions. [2023-08-26 21:21:43,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 138 transitions, 857 flow [2023-08-26 21:21:43,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:21:43,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:21:43,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2023-08-26 21:21:43,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48446215139442234 [2023-08-26 21:21:43,541 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2023-08-26 21:21:43,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2023-08-26 21:21:43,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:43,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2023-08-26 21:21:43,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:43,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:43,552 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:43,553 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 169 flow. Second operand 5 states and 608 transitions. [2023-08-26 21:21:43,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 138 transitions, 857 flow [2023-08-26 21:21:43,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 138 transitions, 791 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-26 21:21:43,597 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 279 flow [2023-08-26 21:21:43,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=279, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2023-08-26 21:21:43,600 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2023-08-26 21:21:43,600 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 279 flow [2023-08-26 21:21:43,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:43,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:43,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:43,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:21:43,601 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:43,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:43,602 INFO L85 PathProgramCache]: Analyzing trace with hash 228254903, now seen corresponding path program 1 times [2023-08-26 21:21:43,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:43,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630594627] [2023-08-26 21:21:43,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:43,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:43,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:43,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:43,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630594627] [2023-08-26 21:21:43,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630594627] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:43,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:43,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:21:43,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512468593] [2023-08-26 21:21:43,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:43,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:21:43,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:43,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:21:43,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:21:43,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 251 [2023-08-26 21:21:43,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 279 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:43,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:43,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 251 [2023-08-26 21:21:43,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:48,431 INFO L124 PetriNetUnfolderBase]: 39100/54491 cut-off events. [2023-08-26 21:21:48,431 INFO L125 PetriNetUnfolderBase]: For 55173/55780 co-relation queries the response was YES. [2023-08-26 21:21:48,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164815 conditions, 54491 events. 39100/54491 cut-off events. For 55173/55780 co-relation queries the response was YES. Maximal size of possible extension queue 2189. Compared 348048 event pairs, 11456 based on Foata normal form. 1271/52145 useless extension candidates. Maximal degree in co-relation 164801. Up to 35896 conditions per place. [2023-08-26 21:21:48,704 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 124 selfloop transitions, 13 changer transitions 0/143 dead transitions. [2023-08-26 21:21:48,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 143 transitions, 975 flow [2023-08-26 21:21:48,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:21:48,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:21:48,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions. [2023-08-26 21:21:48,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49163346613545816 [2023-08-26 21:21:48,707 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 617 transitions. [2023-08-26 21:21:48,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 617 transitions. [2023-08-26 21:21:48,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:48,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 617 transitions. [2023-08-26 21:21:48,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:48,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:48,712 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:48,712 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 279 flow. Second operand 5 states and 617 transitions. [2023-08-26 21:21:48,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 143 transitions, 975 flow [2023-08-26 21:21:48,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 143 transitions, 975 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:21:48,731 INFO L231 Difference]: Finished difference. Result has 63 places, 69 transitions, 424 flow [2023-08-26 21:21:48,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=424, PETRI_PLACES=63, PETRI_TRANSITIONS=69} [2023-08-26 21:21:48,732 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2023-08-26 21:21:48,732 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 69 transitions, 424 flow [2023-08-26 21:21:48,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:48,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:48,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:48,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:21:48,733 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:48,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:48,733 INFO L85 PathProgramCache]: Analyzing trace with hash 228282772, now seen corresponding path program 1 times [2023-08-26 21:21:48,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:48,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418871869] [2023-08-26 21:21:48,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:48,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:48,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:48,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:48,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418871869] [2023-08-26 21:21:48,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418871869] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:48,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:48,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:21:48,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682369694] [2023-08-26 21:21:48,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:48,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:21:48,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:48,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:21:48,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:21:48,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 251 [2023-08-26 21:21:48,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 69 transitions, 424 flow. Second operand has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:48,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:48,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 251 [2023-08-26 21:21:48,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:55,054 INFO L124 PetriNetUnfolderBase]: 51891/71316 cut-off events. [2023-08-26 21:21:55,054 INFO L125 PetriNetUnfolderBase]: For 120610/120610 co-relation queries the response was YES. [2023-08-26 21:21:55,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235807 conditions, 71316 events. 51891/71316 cut-off events. For 120610/120610 co-relation queries the response was YES. Maximal size of possible extension queue 2446. Compared 448758 event pairs, 3673 based on Foata normal form. 1027/69003 useless extension candidates. Maximal degree in co-relation 235788. Up to 19086 conditions per place. [2023-08-26 21:21:55,583 INFO L140 encePairwiseOnDemand]: 241/251 looper letters, 175 selfloop transitions, 46 changer transitions 0/221 dead transitions. [2023-08-26 21:21:55,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 221 transitions, 1718 flow [2023-08-26 21:21:55,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:21:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:21:55,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 836 transitions. [2023-08-26 21:21:55,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47581104154809334 [2023-08-26 21:21:55,586 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 836 transitions. [2023-08-26 21:21:55,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 836 transitions. [2023-08-26 21:21:55,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:55,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 836 transitions. [2023-08-26 21:21:55,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:55,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:55,591 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:55,591 INFO L175 Difference]: Start difference. First operand has 63 places, 69 transitions, 424 flow. Second operand 7 states and 836 transitions. [2023-08-26 21:21:55,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 221 transitions, 1718 flow [2023-08-26 21:21:55,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 221 transitions, 1709 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:21:55,665 INFO L231 Difference]: Finished difference. Result has 74 places, 106 transitions, 935 flow [2023-08-26 21:21:55,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=935, PETRI_PLACES=74, PETRI_TRANSITIONS=106} [2023-08-26 21:21:55,666 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 22 predicate places. [2023-08-26 21:21:55,666 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 106 transitions, 935 flow [2023-08-26 21:21:55,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:55,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:55,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:55,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:21:55,667 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:55,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:55,667 INFO L85 PathProgramCache]: Analyzing trace with hash 116236239, now seen corresponding path program 1 times [2023-08-26 21:21:55,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:55,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029671632] [2023-08-26 21:21:55,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:55,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:55,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:55,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:55,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029671632] [2023-08-26 21:21:55,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029671632] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:55,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:55,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:21:55,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556539093] [2023-08-26 21:21:55,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:55,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:21:55,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:55,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:21:55,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:21:55,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 251 [2023-08-26 21:21:55,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 106 transitions, 935 flow. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:55,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:55,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 251 [2023-08-26 21:21:55,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:22:04,527 INFO L124 PetriNetUnfolderBase]: 62584/89284 cut-off events. [2023-08-26 21:22:04,528 INFO L125 PetriNetUnfolderBase]: For 235072/236304 co-relation queries the response was YES. [2023-08-26 21:22:04,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313262 conditions, 89284 events. 62584/89284 cut-off events. For 235072/236304 co-relation queries the response was YES. Maximal size of possible extension queue 3799. Compared 638565 event pairs, 25969 based on Foata normal form. 1574/85532 useless extension candidates. Maximal degree in co-relation 313236. Up to 55352 conditions per place. [2023-08-26 21:22:05,141 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 174 selfloop transitions, 23 changer transitions 0/221 dead transitions. [2023-08-26 21:22:05,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 221 transitions, 2173 flow [2023-08-26 21:22:05,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:22:05,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:22:05,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2023-08-26 21:22:05,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4932270916334661 [2023-08-26 21:22:05,144 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 619 transitions. [2023-08-26 21:22:05,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 619 transitions. [2023-08-26 21:22:05,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:22:05,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 619 transitions. [2023-08-26 21:22:05,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states 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:22:05,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:05,148 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:05,148 INFO L175 Difference]: Start difference. First operand has 74 places, 106 transitions, 935 flow. Second operand 5 states and 619 transitions. [2023-08-26 21:22:05,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 221 transitions, 2173 flow [2023-08-26 21:22:05,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 221 transitions, 2173 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:22:05,930 INFO L231 Difference]: Finished difference. Result has 81 places, 128 transitions, 1272 flow [2023-08-26 21:22:05,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=935, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1272, PETRI_PLACES=81, PETRI_TRANSITIONS=128} [2023-08-26 21:22:05,932 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places. [2023-08-26 21:22:05,932 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 128 transitions, 1272 flow [2023-08-26 21:22:05,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states 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:22:05,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:22:05,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:22:05,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:22:05,933 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:22:05,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:22:05,934 INFO L85 PathProgramCache]: Analyzing trace with hash 306349251, now seen corresponding path program 1 times [2023-08-26 21:22:05,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:22:05,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905227351] [2023-08-26 21:22:05,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:22:05,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:22:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:22:06,048 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:22:06,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:22:06,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905227351] [2023-08-26 21:22:06,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905227351] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:22:06,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:22:06,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:22:06,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562638208] [2023-08-26 21:22:06,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:22:06,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:22:06,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:22:06,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:22:06,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:22:06,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 251 [2023-08-26 21:22:06,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 128 transitions, 1272 flow. Second operand has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:06,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:22:06,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 251 [2023-08-26 21:22:06,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:22:20,840 INFO L124 PetriNetUnfolderBase]: 103410/144496 cut-off events. [2023-08-26 21:22:20,840 INFO L125 PetriNetUnfolderBase]: For 493476/493476 co-relation queries the response was YES. [2023-08-26 21:22:21,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536199 conditions, 144496 events. 103410/144496 cut-off events. For 493476/493476 co-relation queries the response was YES. Maximal size of possible extension queue 5182. Compared 1041289 event pairs, 17288 based on Foata normal form. 1150/137953 useless extension candidates. Maximal degree in co-relation 536168. Up to 46030 conditions per place. [2023-08-26 21:22:21,815 INFO L140 encePairwiseOnDemand]: 241/251 looper letters, 218 selfloop transitions, 83 changer transitions 0/301 dead transitions. [2023-08-26 21:22:21,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 301 transitions, 2934 flow [2023-08-26 21:22:21,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:22:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:22:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 856 transitions. [2023-08-26 21:22:21,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4871940808195788 [2023-08-26 21:22:21,817 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 856 transitions. [2023-08-26 21:22:21,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 856 transitions. [2023-08-26 21:22:21,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:22:21,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 856 transitions. [2023-08-26 21:22:21,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:21,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states 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:22:21,822 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states 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:22:21,823 INFO L175 Difference]: Start difference. First operand has 81 places, 128 transitions, 1272 flow. Second operand 7 states and 856 transitions. [2023-08-26 21:22:21,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 301 transitions, 2934 flow [2023-08-26 21:22:23,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 301 transitions, 2921 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-26 21:22:23,607 INFO L231 Difference]: Finished difference. Result has 92 places, 153 transitions, 1907 flow [2023-08-26 21:22:23,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1907, PETRI_PLACES=92, PETRI_TRANSITIONS=153} [2023-08-26 21:22:23,608 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 40 predicate places. [2023-08-26 21:22:23,608 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 153 transitions, 1907 flow [2023-08-26 21:22:23,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:23,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:22:23,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:22:23,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:22:23,609 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:22:23,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:22:23,610 INFO L85 PathProgramCache]: Analyzing trace with hash 308404830, now seen corresponding path program 1 times [2023-08-26 21:22:23,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:22:23,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225244531] [2023-08-26 21:22:23,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:22:23,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:22:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:22:23,725 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:22:23,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:22:23,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225244531] [2023-08-26 21:22:23,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225244531] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:22:23,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:22:23,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:22:23,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425809447] [2023-08-26 21:22:23,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:22:23,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:22:23,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:22:23,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:22:23,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:22:23,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 251 [2023-08-26 21:22:23,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 153 transitions, 1907 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states 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:22:23,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:22:23,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 251 [2023-08-26 21:22:23,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:22:29,878 INFO L124 PetriNetUnfolderBase]: 36213/55376 cut-off events. [2023-08-26 21:22:29,879 INFO L125 PetriNetUnfolderBase]: For 258289/261225 co-relation queries the response was YES. [2023-08-26 21:22:30,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210665 conditions, 55376 events. 36213/55376 cut-off events. For 258289/261225 co-relation queries the response was YES. Maximal size of possible extension queue 2466. Compared 433248 event pairs, 11387 based on Foata normal form. 2502/51673 useless extension candidates. Maximal degree in co-relation 210627. Up to 41092 conditions per place. [2023-08-26 21:22:30,291 INFO L140 encePairwiseOnDemand]: 243/251 looper letters, 186 selfloop transitions, 12 changer transitions 0/243 dead transitions. [2023-08-26 21:22:30,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 243 transitions, 3073 flow [2023-08-26 21:22:30,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:22:30,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:22:30,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2023-08-26 21:22:30,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4932270916334661 [2023-08-26 21:22:30,294 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 619 transitions. [2023-08-26 21:22:30,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 619 transitions. [2023-08-26 21:22:30,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:22:30,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 619 transitions. [2023-08-26 21:22:30,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states 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:22:30,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:30,298 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:30,298 INFO L175 Difference]: Start difference. First operand has 92 places, 153 transitions, 1907 flow. Second operand 5 states and 619 transitions. [2023-08-26 21:22:30,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 243 transitions, 3073 flow [2023-08-26 21:22:31,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 243 transitions, 3025 flow, removed 24 selfloop flow, removed 0 redundant places. [2023-08-26 21:22:31,589 INFO L231 Difference]: Finished difference. Result has 99 places, 149 transitions, 1783 flow [2023-08-26 21:22:31,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1707, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1783, PETRI_PLACES=99, PETRI_TRANSITIONS=149} [2023-08-26 21:22:31,590 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 47 predicate places. [2023-08-26 21:22:31,590 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 149 transitions, 1783 flow [2023-08-26 21:22:31,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states 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:22:31,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:22:31,590 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:22:31,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:22:31,590 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:22:31,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:22:31,591 INFO L85 PathProgramCache]: Analyzing trace with hash -559311899, now seen corresponding path program 1 times [2023-08-26 21:22:31,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:22:31,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139466290] [2023-08-26 21:22:31,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:22:31,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:22:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:22:31,718 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:22:31,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:22:31,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139466290] [2023-08-26 21:22:31,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139466290] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:22:31,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:22:31,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:22:31,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575958204] [2023-08-26 21:22:31,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:22:31,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:22:31,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:22:31,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:22:31,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:22:31,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 251 [2023-08-26 21:22:31,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 149 transitions, 1783 flow. Second operand has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states 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:22:31,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:22:31,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 251 [2023-08-26 21:22:31,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:22:42,882 INFO L124 PetriNetUnfolderBase]: 66666/98822 cut-off events. [2023-08-26 21:22:42,882 INFO L125 PetriNetUnfolderBase]: For 548309/548309 co-relation queries the response was YES. [2023-08-26 21:22:43,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404995 conditions, 98822 events. 66666/98822 cut-off events. For 548309/548309 co-relation queries the response was YES. Maximal size of possible extension queue 3825. Compared 771745 event pairs, 10941 based on Foata normal form. 882/91210 useless extension candidates. Maximal degree in co-relation 404952. Up to 34107 conditions per place. [2023-08-26 21:22:43,623 INFO L140 encePairwiseOnDemand]: 241/251 looper letters, 240 selfloop transitions, 96 changer transitions 0/336 dead transitions. [2023-08-26 21:22:43,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 336 transitions, 3957 flow [2023-08-26 21:22:43,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:22:43,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:22:43,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 854 transitions. [2023-08-26 21:22:43,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4860557768924303 [2023-08-26 21:22:43,625 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 854 transitions. [2023-08-26 21:22:43,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 854 transitions. [2023-08-26 21:22:43,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:22:43,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 854 transitions. [2023-08-26 21:22:43,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states 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:22:43,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states 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:22:43,630 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states 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:22:43,631 INFO L175 Difference]: Start difference. First operand has 99 places, 149 transitions, 1783 flow. Second operand 7 states and 854 transitions. [2023-08-26 21:22:43,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 336 transitions, 3957 flow [2023-08-26 21:22:48,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 336 transitions, 3928 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 21:22:48,013 INFO L231 Difference]: Finished difference. Result has 110 places, 185 transitions, 2758 flow [2023-08-26 21:22:48,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1772, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2758, PETRI_PLACES=110, PETRI_TRANSITIONS=185} [2023-08-26 21:22:48,014 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 58 predicate places. [2023-08-26 21:22:48,014 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 185 transitions, 2758 flow [2023-08-26 21:22:48,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states 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:22:48,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:22:48,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:22:48,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:22:48,015 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:22:48,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:22:48,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1996877183, now seen corresponding path program 1 times [2023-08-26 21:22:48,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:22:48,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367329954] [2023-08-26 21:22:48,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:22:48,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:22:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:22:48,088 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:22:48,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:22:48,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367329954] [2023-08-26 21:22:48,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367329954] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:22:48,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:22:48,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:22:48,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354996504] [2023-08-26 21:22:48,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:22:48,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:22:48,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:22:48,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:22:48,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:22:48,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2023-08-26 21:22:48,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 185 transitions, 2758 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states 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:22:48,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:22:48,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2023-08-26 21:22:48,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:22:56,974 INFO L124 PetriNetUnfolderBase]: 45901/69526 cut-off events. [2023-08-26 21:22:56,974 INFO L125 PetriNetUnfolderBase]: For 440275/444051 co-relation queries the response was YES. [2023-08-26 21:22:57,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282825 conditions, 69526 events. 45901/69526 cut-off events. For 440275/444051 co-relation queries the response was YES. Maximal size of possible extension queue 3473. Compared 560724 event pairs, 6766 based on Foata normal form. 1164/68877 useless extension candidates. Maximal degree in co-relation 282775. Up to 27834 conditions per place. [2023-08-26 21:22:57,760 INFO L140 encePairwiseOnDemand]: 242/251 looper letters, 287 selfloop transitions, 17 changer transitions 0/366 dead transitions. [2023-08-26 21:22:57,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 366 transitions, 5860 flow [2023-08-26 21:22:57,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:22:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:22:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 645 transitions. [2023-08-26 21:22:57,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5139442231075697 [2023-08-26 21:22:57,762 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 645 transitions. [2023-08-26 21:22:57,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 645 transitions. [2023-08-26 21:22:57,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:22:57,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 645 transitions. [2023-08-26 21:22:57,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states 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:22:57,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:57,766 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:57,766 INFO L175 Difference]: Start difference. First operand has 110 places, 185 transitions, 2758 flow. Second operand 5 states and 645 transitions. [2023-08-26 21:22:57,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 366 transitions, 5860 flow [2023-08-26 21:23:00,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 366 transitions, 5685 flow, removed 17 selfloop flow, removed 1 redundant places. [2023-08-26 21:23:00,336 INFO L231 Difference]: Finished difference. Result has 114 places, 189 transitions, 2753 flow [2023-08-26 21:23:00,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=2671, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2753, PETRI_PLACES=114, PETRI_TRANSITIONS=189} [2023-08-26 21:23:00,336 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 62 predicate places. [2023-08-26 21:23:00,336 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 189 transitions, 2753 flow [2023-08-26 21:23:00,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states 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:23:00,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:23:00,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:23:00,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:23:00,337 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:23:00,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:23:00,338 INFO L85 PathProgramCache]: Analyzing trace with hash 231086338, now seen corresponding path program 1 times [2023-08-26 21:23:00,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:23:00,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426478456] [2023-08-26 21:23:00,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:23:00,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:23:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:23:00,485 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:23:00,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:23:00,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426478456] [2023-08-26 21:23:00,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426478456] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:23:00,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:23:00,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:23:00,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403344630] [2023-08-26 21:23:00,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:23:00,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:23:00,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:23:00,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:23:00,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:23:00,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 251 [2023-08-26 21:23:00,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 189 transitions, 2753 flow. Second operand has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states 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:23:00,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:23:00,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 251 [2023-08-26 21:23:00,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:23:17,181 INFO L124 PetriNetUnfolderBase]: 88627/131053 cut-off events. [2023-08-26 21:23:17,181 INFO L125 PetriNetUnfolderBase]: For 1009749/1009749 co-relation queries the response was YES. [2023-08-26 21:23:18,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596458 conditions, 131053 events. 88627/131053 cut-off events. For 1009749/1009749 co-relation queries the response was YES. Maximal size of possible extension queue 5631. Compared 1058100 event pairs, 21777 based on Foata normal form. 897/129450 useless extension candidates. Maximal degree in co-relation 596406. Up to 37035 conditions per place. [2023-08-26 21:23:18,479 INFO L140 encePairwiseOnDemand]: 241/251 looper letters, 315 selfloop transitions, 137 changer transitions 12/464 dead transitions. [2023-08-26 21:23:18,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 464 transitions, 6707 flow [2023-08-26 21:23:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:23:18,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:23:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 858 transitions. [2023-08-26 21:23:18,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48833238474672735 [2023-08-26 21:23:18,482 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 858 transitions. [2023-08-26 21:23:18,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 858 transitions. [2023-08-26 21:23:18,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:23:18,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 858 transitions. [2023-08-26 21:23:18,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.57142857142857) internal successors, (858), 7 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:18,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states 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:23:18,486 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states 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:23:18,487 INFO L175 Difference]: Start difference. First operand has 114 places, 189 transitions, 2753 flow. Second operand 7 states and 858 transitions. [2023-08-26 21:23:18,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 464 transitions, 6707 flow [2023-08-26 21:23:42,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 464 transitions, 6513 flow, removed 48 selfloop flow, removed 3 redundant places. [2023-08-26 21:23:42,604 INFO L231 Difference]: Finished difference. Result has 123 places, 273 transitions, 4813 flow [2023-08-26 21:23:42,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=2711, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4813, PETRI_PLACES=123, PETRI_TRANSITIONS=273} [2023-08-26 21:23:42,605 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 71 predicate places. [2023-08-26 21:23:42,605 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 273 transitions, 4813 flow [2023-08-26 21:23:42,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states 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:23:42,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:23:42,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:23:42,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:23:42,605 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:23:42,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:23:42,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1895600764, now seen corresponding path program 1 times [2023-08-26 21:23:42,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:23:42,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101684891] [2023-08-26 21:23:42,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:23:42,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:23:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:23:42,741 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:23:42,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:23:42,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101684891] [2023-08-26 21:23:42,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101684891] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:23:42,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:23:42,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:23:42,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568025383] [2023-08-26 21:23:42,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:23:42,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:23:42,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:23:42,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:23:42,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:23:42,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 251 [2023-08-26 21:23:42,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 273 transitions, 4813 flow. Second operand has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states 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:23:42,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:23:42,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 251 [2023-08-26 21:23:42,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:23:50,205 INFO L124 PetriNetUnfolderBase]: 34162/52857 cut-off events. [2023-08-26 21:23:50,206 INFO L125 PetriNetUnfolderBase]: For 386167/390934 co-relation queries the response was YES. [2023-08-26 21:23:50,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222806 conditions, 52857 events. 34162/52857 cut-off events. For 386167/390934 co-relation queries the response was YES. Maximal size of possible extension queue 2264. Compared 420590 event pairs, 4185 based on Foata normal form. 3491/54144 useless extension candidates. Maximal degree in co-relation 222748. Up to 18388 conditions per place. [2023-08-26 21:23:50,849 INFO L140 encePairwiseOnDemand]: 243/251 looper letters, 325 selfloop transitions, 22 changer transitions 4/417 dead transitions. [2023-08-26 21:23:50,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 417 transitions, 7239 flow [2023-08-26 21:23:50,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:23:50,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:23:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 865 transitions. [2023-08-26 21:23:50,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49231644849174727 [2023-08-26 21:23:50,852 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 865 transitions. [2023-08-26 21:23:50,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 865 transitions. [2023-08-26 21:23:50,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:23:50,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 865 transitions. [2023-08-26 21:23:50,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.57142857142857) internal successors, (865), 7 states have internal predecessors, (865), 0 states have call successors, (0), 0 states 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:23:50,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states 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:23:50,857 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states 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:23:50,857 INFO L175 Difference]: Start difference. First operand has 123 places, 273 transitions, 4813 flow. Second operand 7 states and 865 transitions. [2023-08-26 21:23:50,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 417 transitions, 7239 flow [2023-08-26 21:23:56,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 417 transitions, 6927 flow, removed 51 selfloop flow, removed 1 redundant places. [2023-08-26 21:23:56,557 INFO L231 Difference]: Finished difference. Result has 131 places, 216 transitions, 3506 flow [2023-08-26 21:23:56,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=3398, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3506, PETRI_PLACES=131, PETRI_TRANSITIONS=216} [2023-08-26 21:23:56,557 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 79 predicate places. [2023-08-26 21:23:56,558 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 216 transitions, 3506 flow [2023-08-26 21:23:56,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states 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:23:56,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:23:56,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:23:56,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 21:23:56,558 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:23:56,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:23:56,559 INFO L85 PathProgramCache]: Analyzing trace with hash 381525846, now seen corresponding path program 1 times [2023-08-26 21:23:56,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:23:56,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075308576] [2023-08-26 21:23:56,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:23:56,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:23:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:23:56,728 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:23:56,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:23:56,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075308576] [2023-08-26 21:23:56,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075308576] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:23:56,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:23:56,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:23:56,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989315505] [2023-08-26 21:23:56,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:23:56,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:23:56,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:23:56,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:23:56,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:23:56,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 251 [2023-08-26 21:23:56,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 216 transitions, 3506 flow. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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:23:56,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:23:56,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 251 [2023-08-26 21:23:56,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:24:02,291 INFO L124 PetriNetUnfolderBase]: 27377/41295 cut-off events. [2023-08-26 21:24:02,291 INFO L125 PetriNetUnfolderBase]: For 269793/273288 co-relation queries the response was YES. [2023-08-26 21:24:02,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194657 conditions, 41295 events. 27377/41295 cut-off events. For 269793/273288 co-relation queries the response was YES. Maximal size of possible extension queue 2183. Compared 308634 event pairs, 1665 based on Foata normal form. 2034/41439 useless extension candidates. Maximal degree in co-relation 194595. Up to 11506 conditions per place. [2023-08-26 21:24:02,886 INFO L140 encePairwiseOnDemand]: 243/251 looper letters, 331 selfloop transitions, 32 changer transitions 4/407 dead transitions. [2023-08-26 21:24:02,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 407 transitions, 6601 flow [2023-08-26 21:24:02,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:24:02,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:24:02,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1109 transitions. [2023-08-26 21:24:02,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4909251881363435 [2023-08-26 21:24:02,888 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1109 transitions. [2023-08-26 21:24:02,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1109 transitions. [2023-08-26 21:24:02,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:24:02,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1109 transitions. [2023-08-26 21:24:02,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.22222222222223) internal successors, (1109), 9 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states 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:24:02,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 251.0) internal successors, (2510), 10 states have internal predecessors, (2510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:02,894 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 251.0) internal successors, (2510), 10 states have internal predecessors, (2510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:02,894 INFO L175 Difference]: Start difference. First operand has 131 places, 216 transitions, 3506 flow. Second operand 9 states and 1109 transitions. [2023-08-26 21:24:02,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 407 transitions, 6601 flow [2023-08-26 21:24:13,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 407 transitions, 6367 flow, removed 76 selfloop flow, removed 8 redundant places. [2023-08-26 21:24:13,812 INFO L231 Difference]: Finished difference. Result has 129 places, 162 transitions, 2390 flow [2023-08-26 21:24:13,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=2266, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2390, PETRI_PLACES=129, PETRI_TRANSITIONS=162} [2023-08-26 21:24:13,812 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 77 predicate places. [2023-08-26 21:24:13,812 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 162 transitions, 2390 flow [2023-08-26 21:24:13,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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:24:13,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:13,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:24:13,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 21:24:13,813 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:24:13,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:13,813 INFO L85 PathProgramCache]: Analyzing trace with hash -2131956766, now seen corresponding path program 1 times [2023-08-26 21:24:13,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:13,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504394029] [2023-08-26 21:24:13,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:13,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:24:13,901 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:24:13,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:24:13,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504394029] [2023-08-26 21:24:13,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504394029] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:24:13,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:24:13,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:24:13,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170334816] [2023-08-26 21:24:13,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:24:13,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:24:13,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:24:13,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:24:13,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:24:13,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2023-08-26 21:24:13,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 162 transitions, 2390 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:13,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:24:13,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2023-08-26 21:24:13,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:24:19,017 INFO L124 PetriNetUnfolderBase]: 27270/40891 cut-off events. [2023-08-26 21:24:19,017 INFO L125 PetriNetUnfolderBase]: For 284216/287577 co-relation queries the response was YES. [2023-08-26 21:24:19,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206973 conditions, 40891 events. 27270/40891 cut-off events. For 284216/287577 co-relation queries the response was YES. Maximal size of possible extension queue 2187. Compared 300415 event pairs, 4776 based on Foata normal form. 1096/40814 useless extension candidates. Maximal degree in co-relation 206910. Up to 15628 conditions per place. [2023-08-26 21:24:19,323 INFO L140 encePairwiseOnDemand]: 242/251 looper letters, 114 selfloop transitions, 23 changer transitions 129/283 dead transitions. [2023-08-26 21:24:19,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 283 transitions, 4556 flow [2023-08-26 21:24:19,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:24:19,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:24:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 748 transitions. [2023-08-26 21:24:19,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49667994687915007 [2023-08-26 21:24:19,325 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 748 transitions. [2023-08-26 21:24:19,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 748 transitions. [2023-08-26 21:24:19,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:24:19,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 748 transitions. [2023-08-26 21:24:19,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.66666666666667) internal successors, (748), 6 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:19,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states 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:24:19,329 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states 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:24:19,330 INFO L175 Difference]: Start difference. First operand has 129 places, 162 transitions, 2390 flow. Second operand 6 states and 748 transitions. [2023-08-26 21:24:19,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 283 transitions, 4556 flow [2023-08-26 21:24:34,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 283 transitions, 4489 flow, removed 5 selfloop flow, removed 7 redundant places. [2023-08-26 21:24:34,403 INFO L231 Difference]: Finished difference. Result has 123 places, 84 transitions, 1081 flow [2023-08-26 21:24:34,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=2294, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1081, PETRI_PLACES=123, PETRI_TRANSITIONS=84} [2023-08-26 21:24:34,404 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 71 predicate places. [2023-08-26 21:24:34,404 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 84 transitions, 1081 flow [2023-08-26 21:24:34,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:34,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:34,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:24:34,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 21:24:34,405 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:24:34,405 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:34,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1503787450, now seen corresponding path program 1 times [2023-08-26 21:24:34,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:34,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860243261] [2023-08-26 21:24:34,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:34,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:24:34,628 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:24:34,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:24:34,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860243261] [2023-08-26 21:24:34,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860243261] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:24:34,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:24:34,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:24:34,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27531699] [2023-08-26 21:24:34,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:24:34,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:24:34,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:24:34,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:24:34,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:24:34,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 251 [2023-08-26 21:24:34,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 84 transitions, 1081 flow. Second operand has 7 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:34,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:24:34,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 251 [2023-08-26 21:24:34,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:24:37,272 INFO L124 PetriNetUnfolderBase]: 15688/24202 cut-off events. [2023-08-26 21:24:37,273 INFO L125 PetriNetUnfolderBase]: For 145367/147427 co-relation queries the response was YES. [2023-08-26 21:24:37,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110721 conditions, 24202 events. 15688/24202 cut-off events. For 145367/147427 co-relation queries the response was YES. Maximal size of possible extension queue 1562. Compared 183606 event pairs, 981 based on Foata normal form. 614/23732 useless extension candidates. Maximal degree in co-relation 110659. Up to 7453 conditions per place. [2023-08-26 21:24:37,523 INFO L140 encePairwiseOnDemand]: 243/251 looper letters, 53 selfloop transitions, 17 changer transitions 177/250 dead transitions. [2023-08-26 21:24:37,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 250 transitions, 3491 flow [2023-08-26 21:24:37,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 21:24:37,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 21:24:37,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1308 transitions. [2023-08-26 21:24:37,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4737413980441869 [2023-08-26 21:24:37,526 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1308 transitions. [2023-08-26 21:24:37,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1308 transitions. [2023-08-26 21:24:37,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:24:37,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1308 transitions. [2023-08-26 21:24:37,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 118.9090909090909) internal successors, (1308), 11 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:37,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 251.0) internal successors, (3012), 12 states have internal predecessors, (3012), 0 states have call successors, (0), 0 states 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:24:37,533 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 251.0) internal successors, (3012), 12 states have internal predecessors, (3012), 0 states have call successors, (0), 0 states 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:24:37,533 INFO L175 Difference]: Start difference. First operand has 123 places, 84 transitions, 1081 flow. Second operand 11 states and 1308 transitions. [2023-08-26 21:24:37,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 250 transitions, 3491 flow [2023-08-26 21:24:42,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 250 transitions, 3120 flow, removed 81 selfloop flow, removed 26 redundant places. [2023-08-26 21:24:42,977 INFO L231 Difference]: Finished difference. Result has 97 places, 40 transitions, 321 flow [2023-08-26 21:24:42,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=321, PETRI_PLACES=97, PETRI_TRANSITIONS=40} [2023-08-26 21:24:42,977 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 45 predicate places. [2023-08-26 21:24:42,978 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 40 transitions, 321 flow [2023-08-26 21:24:42,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:42,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:42,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:24:42,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 21:24:42,978 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:24:42,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:42,979 INFO L85 PathProgramCache]: Analyzing trace with hash 739597991, now seen corresponding path program 1 times [2023-08-26 21:24:42,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:42,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299172155] [2023-08-26 21:24:42,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:42,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:24:43,995 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:24:43,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:24:43,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299172155] [2023-08-26 21:24:43,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299172155] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:24:43,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:24:43,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 21:24:43,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144528291] [2023-08-26 21:24:43,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:24:43,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 21:24:43,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:24:43,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 21:24:43,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-26 21:24:44,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 251 [2023-08-26 21:24:44,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 40 transitions, 321 flow. Second operand has 9 states, 9 states have (on average 94.11111111111111) internal successors, (847), 9 states have internal predecessors, (847), 0 states have call successors, (0), 0 states 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:24:44,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:24:44,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 251 [2023-08-26 21:24:44,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:24:44,436 INFO L124 PetriNetUnfolderBase]: 705/1126 cut-off events. [2023-08-26 21:24:44,436 INFO L125 PetriNetUnfolderBase]: For 4212/4212 co-relation queries the response was YES. [2023-08-26 21:24:44,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4854 conditions, 1126 events. 705/1126 cut-off events. For 4212/4212 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4375 event pairs, 51 based on Foata normal form. 1/1127 useless extension candidates. Maximal degree in co-relation 4811. Up to 323 conditions per place. [2023-08-26 21:24:44,442 INFO L140 encePairwiseOnDemand]: 238/251 looper letters, 60 selfloop transitions, 11 changer transitions 52/123 dead transitions. [2023-08-26 21:24:44,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 123 transitions, 1096 flow [2023-08-26 21:24:44,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:24:44,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:24:44,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 907 transitions. [2023-08-26 21:24:44,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40150509074811863 [2023-08-26 21:24:44,446 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 907 transitions. [2023-08-26 21:24:44,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 907 transitions. [2023-08-26 21:24:44,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:24:44,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 907 transitions. [2023-08-26 21:24:44,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.77777777777777) internal successors, (907), 9 states have internal predecessors, (907), 0 states have call successors, (0), 0 states 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:24:44,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 251.0) internal successors, (2510), 10 states have internal predecessors, (2510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:44,458 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 251.0) internal successors, (2510), 10 states have internal predecessors, (2510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:44,458 INFO L175 Difference]: Start difference. First operand has 97 places, 40 transitions, 321 flow. Second operand 9 states and 907 transitions. [2023-08-26 21:24:44,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 123 transitions, 1096 flow [2023-08-26 21:24:44,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 123 transitions, 745 flow, removed 33 selfloop flow, removed 37 redundant places. [2023-08-26 21:24:44,468 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 224 flow [2023-08-26 21:24:44,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=224, PETRI_PLACES=63, PETRI_TRANSITIONS=44} [2023-08-26 21:24:44,468 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2023-08-26 21:24:44,468 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 224 flow [2023-08-26 21:24:44,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 94.11111111111111) internal successors, (847), 9 states have internal predecessors, (847), 0 states have call successors, (0), 0 states 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:24:44,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:44,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:24:44,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 21:24:44,469 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:24:44,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:44,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1059596515, now seen corresponding path program 2 times [2023-08-26 21:24:44,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:44,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058117894] [2023-08-26 21:24:44,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:44,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:24:45,404 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:24:45,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:24:45,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058117894] [2023-08-26 21:24:45,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058117894] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:24:45,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:24:45,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 21:24:45,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944604217] [2023-08-26 21:24:45,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:24:45,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 21:24:45,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:24:45,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 21:24:45,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-26 21:24:45,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 251 [2023-08-26 21:24:45,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 44 transitions, 224 flow. Second operand has 9 states, 9 states have (on average 94.11111111111111) internal successors, (847), 9 states have internal predecessors, (847), 0 states have call successors, (0), 0 states 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:24:45,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:24:45,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 251 [2023-08-26 21:24:45,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:24:45,738 INFO L124 PetriNetUnfolderBase]: 530/895 cut-off events. [2023-08-26 21:24:45,738 INFO L125 PetriNetUnfolderBase]: For 1170/1170 co-relation queries the response was YES. [2023-08-26 21:24:45,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3201 conditions, 895 events. 530/895 cut-off events. For 1170/1170 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3716 event pairs, 27 based on Foata normal form. 1/896 useless extension candidates. Maximal degree in co-relation 3185. Up to 195 conditions per place. [2023-08-26 21:24:45,741 INFO L140 encePairwiseOnDemand]: 237/251 looper letters, 98 selfloop transitions, 16 changer transitions 27/141 dead transitions. [2023-08-26 21:24:45,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 141 transitions, 992 flow [2023-08-26 21:24:45,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:24:45,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:24:45,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 902 transitions. [2023-08-26 21:24:45,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39929172200088536 [2023-08-26 21:24:45,742 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 902 transitions. [2023-08-26 21:24:45,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 902 transitions. [2023-08-26 21:24:45,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:24:45,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 902 transitions. [2023-08-26 21:24:45,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.22222222222223) internal successors, (902), 9 states have internal predecessors, (902), 0 states have call successors, (0), 0 states 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:24:45,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 251.0) internal successors, (2510), 10 states have internal predecessors, (2510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:45,745 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 251.0) internal successors, (2510), 10 states have internal predecessors, (2510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:45,746 INFO L175 Difference]: Start difference. First operand has 63 places, 44 transitions, 224 flow. Second operand 9 states and 902 transitions. [2023-08-26 21:24:45,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 141 transitions, 992 flow [2023-08-26 21:24:45,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 141 transitions, 964 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-08-26 21:24:45,752 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 296 flow [2023-08-26 21:24:45,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=296, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2023-08-26 21:24:45,752 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2023-08-26 21:24:45,752 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 296 flow [2023-08-26 21:24:45,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 94.11111111111111) internal successors, (847), 9 states have internal predecessors, (847), 0 states have call successors, (0), 0 states 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:24:45,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:45,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:24:45,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 21:24:45,753 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:24:45,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:45,753 INFO L85 PathProgramCache]: Analyzing trace with hash -285332405, now seen corresponding path program 3 times [2023-08-26 21:24:45,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:45,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226587336] [2023-08-26 21:24:45,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:45,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:24:45,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:24:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:24:45,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:24:45,864 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:24:45,865 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-26 21:24:45,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (21 of 23 remaining) [2023-08-26 21:24:45,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-26 21:24:45,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-26 21:24:45,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-26 21:24:45,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-26 21:24:45,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-26 21:24:45,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-26 21:24:45,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-26 21:24:45,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-26 21:24:45,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-26 21:24:45,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-26 21:24:45,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-26 21:24:45,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-26 21:24:45,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (8 of 23 remaining) [2023-08-26 21:24:45,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-26 21:24:45,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-26 21:24:45,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-26 21:24:45,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-26 21:24:45,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-26 21:24:45,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-26 21:24:45,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-26 21:24:45,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-26 21:24:45,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 21:24:45,870 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:24:45,875 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:24:45,875 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:24:45,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:24:45 BasicIcfg [2023-08-26 21:24:45,976 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:24:45,976 INFO L158 Benchmark]: Toolchain (without parser) took 199282.98ms. Allocated memory was 402.7MB in the beginning and 15.9GB in the end (delta: 15.5GB). Free memory was 377.2MB in the beginning and 15.0GB in the end (delta: -14.6GB). Peak memory consumption was 2.2GB. Max. memory is 16.0GB. [2023-08-26 21:24:45,976 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 402.7MB. Free memory was 380.4MB in the beginning and 380.2MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:24:45,976 INFO L158 Benchmark]: CACSL2BoogieTranslator took 609.20ms. Allocated memory is still 402.7MB. Free memory was 377.2MB in the beginning and 353.5MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:24:45,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.84ms. Allocated memory is still 402.7MB. Free memory was 353.5MB in the beginning and 350.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:24:45,977 INFO L158 Benchmark]: Boogie Preprocessor took 59.10ms. Allocated memory is still 402.7MB. Free memory was 350.6MB in the beginning and 348.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:24:45,977 INFO L158 Benchmark]: RCFGBuilder took 741.94ms. Allocated memory was 402.7MB in the beginning and 574.6MB in the end (delta: 172.0MB). Free memory was 348.6MB in the beginning and 550.1MB in the end (delta: -201.5MB). Peak memory consumption was 51.1MB. Max. memory is 16.0GB. [2023-08-26 21:24:45,977 INFO L158 Benchmark]: TraceAbstraction took 197786.80ms. Allocated memory was 574.6MB in the beginning and 15.9GB in the end (delta: 15.3GB). Free memory was 549.7MB in the beginning and 15.0GB in the end (delta: -14.5GB). Peak memory consumption was 2.2GB. Max. memory is 16.0GB. [2023-08-26 21:24:45,978 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.13ms. Allocated memory is still 402.7MB. Free memory was 380.4MB in the beginning and 380.2MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 609.20ms. Allocated memory is still 402.7MB. Free memory was 377.2MB in the beginning and 353.5MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 76.84ms. Allocated memory is still 402.7MB. Free memory was 353.5MB in the beginning and 350.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 59.10ms. Allocated memory is still 402.7MB. Free memory was 350.6MB in the beginning and 348.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 741.94ms. Allocated memory was 402.7MB in the beginning and 574.6MB in the end (delta: 172.0MB). Free memory was 348.6MB in the beginning and 550.1MB in the end (delta: -201.5MB). Peak memory consumption was 51.1MB. Max. memory is 16.0GB. * TraceAbstraction took 197786.80ms. Allocated memory was 574.6MB in the beginning and 15.9GB in the end (delta: 15.3GB). Free memory was 549.7MB in the beginning and 15.0GB in the end (delta: -14.5GB). Peak memory consumption was 2.2GB. 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.7s, 145 PlacesBefore, 52 PlacesAfterwards, 135 TransitionsBefore, 40 TransitionsAfterwards, 4414 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 2 ChoiceCompositions, 112 TotalNumberOfCompositions, 16842 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4840, independent: 4475, independent conditional: 0, independent unconditional: 4475, dependent: 365, dependent conditional: 0, dependent unconditional: 365, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2352, independent: 2283, independent conditional: 0, independent unconditional: 2283, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4840, independent: 2192, independent conditional: 0, independent unconditional: 2192, dependent: 296, dependent conditional: 0, dependent unconditional: 296, unknown: 2352, unknown conditional: 0, unknown unconditional: 2352] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 204, Positive conditional cache size: 0, Positive unconditional cache size: 204, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool a$flush_delayed; [L716] 0 int a$mem_tmp; [L717] 0 _Bool a$r_buff0_thd0; [L718] 0 _Bool a$r_buff0_thd1; [L719] 0 _Bool a$r_buff0_thd2; [L720] 0 _Bool a$r_buff0_thd3; [L721] 0 _Bool a$r_buff0_thd4; [L722] 0 _Bool a$r_buff1_thd0; [L723] 0 _Bool a$r_buff1_thd1; [L724] 0 _Bool a$r_buff1_thd2; [L725] 0 _Bool a$r_buff1_thd3; [L726] 0 _Bool a$r_buff1_thd4; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L857] 0 pthread_t t1513; [L858] FCALL, FORK 0 pthread_create(&t1513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1513, ((void *)0), P0, ((void *)0))=-3, t1513={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t1514; [L860] FCALL, FORK 0 pthread_create(&t1514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1514, ((void *)0), P1, ((void *)0))=-2, t1513={5:0}, t1514={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1515; [L862] FCALL, FORK 0 pthread_create(&t1515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1515, ((void *)0), P2, ((void *)0))=-1, t1513={5:0}, t1514={6:0}, t1515={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1516; [L864] FCALL, FORK 0 pthread_create(&t1516, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1516, ((void *)0), P3, ((void *)0))=0, t1513={5:0}, t1514={6:0}, t1515={7:0}, t1516={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L755] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, y=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, z=0] [L779] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=0] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=0] [L789] EXPR 2 __unbuffered_cnt + 1 [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L796] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, z=0] [L799] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, z=1] [L802] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L803] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L804] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L805] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L806] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, z=1] [L809] EXPR 3 __unbuffered_cnt + 1 [L809] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L811] 3 return 0; [L816] 4 z = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, z=2] [L819] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 4 a$flush_delayed = weak$$choice2 [L822] 4 a$mem_tmp = a [L823] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L824] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L825] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L826] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L827] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L828] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L829] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 __unbuffered_p3_EAX = a [L831] 4 a = a$flush_delayed ? a$mem_tmp : a [L832] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=0, x=2, y=2, z=2] [L835] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L836] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L837] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L838] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L839] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=0, x=2, y=2, z=2] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0: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$$choice2=0, x=2, y=2, z=2] [L769] EXPR 1 __unbuffered_cnt + 1 [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L842] EXPR 4 __unbuffered_cnt + 1 [L842] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L844] 4 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L871] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L872] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L873] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L874] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1513={5:0}, t1514={6:0}, t1515={7:0}, t1516={3:0}, weak$$choice2=0, x=2, y=2, z=2] [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L879] 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", "mix057_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 769]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 769]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 789]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 789]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 809]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 809]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 864]: 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: 862]: 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: 858]: 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: 860]: 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 9 procedures, 182 locations, 23 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: 197.6s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 189.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1173 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1173 mSDsluCounter, 147 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2941 IncrementalHoareTripleChecker+Invalid, 3068 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 65 mSDtfsCounter, 2941 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4813occurred in iteration=13, InterpolantAutomatonStates: 117, 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.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 333 NumberOfCodeBlocks, 333 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 2119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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:24:46,005 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...