/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/mix055.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:21:00,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:21:00,685 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:00,688 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:21:00,689 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:21:00,711 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:21:00,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:21:00,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:21:00,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:21:00,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:21:00,715 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:21:00,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:21:00,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:21:00,716 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:21:00,717 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:21:00,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:21:00,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:21:00,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:21:00,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:21:00,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:21:00,717 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:21:00,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:21:00,718 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:21:00,718 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:21:00,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:21:00,719 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:21:00,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:21:00,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:21:00,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:21:00,719 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:21:00,720 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:21:00,720 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:21:00,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:21:00,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:21:00,720 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:21:00,721 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:00,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:21:00,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:21:00,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:21:00,961 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:21:00,961 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:21:00,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2023-08-26 21:21:01,855 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:21:02,063 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:21:02,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2023-08-26 21:21:02,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f9ff1597/03b7a1d286c6477f989730508bdd1bbe/FLAGc5dbceb6b [2023-08-26 21:21:02,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f9ff1597/03b7a1d286c6477f989730508bdd1bbe [2023-08-26 21:21:02,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:21:02,095 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:21:02,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:21:02,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:21:02,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:21:02,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:21:02" (1/1) ... [2023-08-26 21:21:02,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e6c42e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:02, skipping insertion in model container [2023-08-26 21:21:02,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:21:02" (1/1) ... [2023-08-26 21:21:02,148 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:21:02,442 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:21:02,452 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:21:02,473 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:21:02,475 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:21:02,490 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:21:02,513 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:21:02,513 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:21:02,517 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:21:02,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:02 WrapperNode [2023-08-26 21:21:02,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:21:02,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:21:02,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:21:02,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:21:02,523 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:02" (1/1) ... [2023-08-26 21:21:02,533 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:02" (1/1) ... [2023-08-26 21:21:02,551 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 168 [2023-08-26 21:21:02,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:21:02,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:21:02,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:21:02,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:21:02,558 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:02" (1/1) ... [2023-08-26 21:21:02,558 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:02" (1/1) ... [2023-08-26 21:21:02,560 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:02" (1/1) ... [2023-08-26 21:21:02,560 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:02" (1/1) ... [2023-08-26 21:21:02,565 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:02" (1/1) ... [2023-08-26 21:21:02,566 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:02" (1/1) ... [2023-08-26 21:21:02,567 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:02" (1/1) ... [2023-08-26 21:21:02,568 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:02" (1/1) ... [2023-08-26 21:21:02,570 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:21:02,570 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:21:02,570 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:21:02,570 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:21:02,571 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:02" (1/1) ... [2023-08-26 21:21:02,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:21:02,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:21:02,595 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:02,605 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:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:21:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:21:02,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:21:02,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:21:02,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:21:02,623 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:21:02,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:21:02,624 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:21:02,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:21:02,624 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:21:02,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:21:02,624 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 21:21:02,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 21:21:02,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:21:02,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:21:02,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:21:02,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:21:02,627 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:02,723 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:21:02,724 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:21:03,038 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:21:03,176 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:21:03,176 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:21:03,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:21:03 BoogieIcfgContainer [2023-08-26 21:21:03,178 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:21:03,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:21:03,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:21:03,182 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:21:03,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:21:02" (1/3) ... [2023-08-26 21:21:03,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d023285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:21:03, skipping insertion in model container [2023-08-26 21:21:03,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:21:02" (2/3) ... [2023-08-26 21:21:03,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d023285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:21:03, skipping insertion in model container [2023-08-26 21:21:03,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:21:03" (3/3) ... [2023-08-26 21:21:03,184 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055.opt.i [2023-08-26 21:21:03,194 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:21:03,195 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 21:21:03,195 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:21:03,234 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:21:03,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 138 transitions, 296 flow [2023-08-26 21:21:03,310 INFO L124 PetriNetUnfolderBase]: 3/134 cut-off events. [2023-08-26 21:21:03,310 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:21:03,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 3/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-26 21:21:03,315 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 138 transitions, 296 flow [2023-08-26 21:21:03,320 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 134 transitions, 280 flow [2023-08-26 21:21:03,323 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:21:03,333 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 134 transitions, 280 flow [2023-08-26 21:21:03,336 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 134 transitions, 280 flow [2023-08-26 21:21:03,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 134 transitions, 280 flow [2023-08-26 21:21:03,375 INFO L124 PetriNetUnfolderBase]: 3/134 cut-off events. [2023-08-26 21:21:03,375 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:21:03,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 3/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-26 21:21:03,378 INFO L119 LiptonReduction]: Number of co-enabled transitions 4052 [2023-08-26 21:21:06,657 INFO L134 LiptonReduction]: Checked pairs total: 13504 [2023-08-26 21:21:06,658 INFO L136 LiptonReduction]: Total number of compositions: 114 [2023-08-26 21:21:06,666 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:21:06,670 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;@225332b1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:21:06,670 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-26 21:21:06,672 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:21:06,672 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-26 21:21:06,672 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:21:06,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:06,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:21:06,673 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:06,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:06,676 INFO L85 PathProgramCache]: Analyzing trace with hash 570101641, now seen corresponding path program 1 times [2023-08-26 21:21:06,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:06,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391273787] [2023-08-26 21:21:06,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:06,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:06,843 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:06,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:06,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391273787] [2023-08-26 21:21:06,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391273787] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:06,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:06,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:21:06,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215063635] [2023-08-26 21:21:06,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:06,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:21:06,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:06,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:21:06,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:21:06,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 252 [2023-08-26 21:21:06,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call 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:06,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:06,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 252 [2023-08-26 21:21:06,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:07,943 INFO L124 PetriNetUnfolderBase]: 10471/14214 cut-off events. [2023-08-26 21:21:07,943 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-08-26 21:21:07,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28454 conditions, 14214 events. 10471/14214 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 778. Compared 80447 event pairs, 10471 based on Foata normal form. 480/10063 useless extension candidates. Maximal degree in co-relation 28442. Up to 14032 conditions per place. [2023-08-26 21:21:08,018 INFO L140 encePairwiseOnDemand]: 246/252 looper letters, 28 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-08-26 21:21:08,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 33 transitions, 136 flow [2023-08-26 21:21:08,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:21:08,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:21:08,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-08-26 21:21:08,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2023-08-26 21:21:08,027 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-08-26 21:21:08,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-08-26 21:21:08,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:08,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-08-26 21:21:08,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call 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:08,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call 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:08,036 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call 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:08,037 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 3 states and 364 transitions. [2023-08-26 21:21:08,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 33 transitions, 136 flow [2023-08-26 21:21:08,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 21:21:08,041 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 76 flow [2023-08-26 21:21:08,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2023-08-26 21:21:08,045 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2023-08-26 21:21:08,045 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 76 flow [2023-08-26 21:21:08,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call 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:08,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:08,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:21:08,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:21:08,046 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:08,046 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:08,046 INFO L85 PathProgramCache]: Analyzing trace with hash 570101642, now seen corresponding path program 1 times [2023-08-26 21:21:08,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:08,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743735554] [2023-08-26 21:21:08,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:08,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:08,082 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:08,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:08,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743735554] [2023-08-26 21:21:08,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743735554] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:08,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:08,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:21:08,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109198211] [2023-08-26 21:21:08,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:08,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:21:08,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:08,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:21:08,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:21:08,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 252 [2023-08-26 21:21:08,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call 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:08,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:08,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 252 [2023-08-26 21:21:08,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:08,666 INFO L124 PetriNetUnfolderBase]: 6741/9366 cut-off events. [2023-08-26 21:21:08,666 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:21:08,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18830 conditions, 9366 events. 6741/9366 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 51379 event pairs, 1578 based on Foata normal form. 0/6704 useless extension candidates. Maximal degree in co-relation 18824. Up to 8131 conditions per place. [2023-08-26 21:21:08,706 INFO L140 encePairwiseOnDemand]: 243/252 looper letters, 47 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2023-08-26 21:21:08,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 232 flow [2023-08-26 21:21:08,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:21:08,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:21:08,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2023-08-26 21:21:08,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5105820105820106 [2023-08-26 21:21:08,708 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2023-08-26 21:21:08,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2023-08-26 21:21:08,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:08,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2023-08-26 21:21:08,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:08,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call 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:08,711 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call 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:08,711 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 76 flow. Second operand 3 states and 386 transitions. [2023-08-26 21:21:08,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 232 flow [2023-08-26 21:21:08,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 231 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:21:08,713 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 114 flow [2023-08-26 21:21:08,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2023-08-26 21:21:08,713 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-26 21:21:08,713 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 114 flow [2023-08-26 21:21:08,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call 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:08,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:08,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:08,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:21:08,714 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P3Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:08,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:08,714 INFO L85 PathProgramCache]: Analyzing trace with hash 864104498, now seen corresponding path program 1 times [2023-08-26 21:21:08,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:08,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122050265] [2023-08-26 21:21:08,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:08,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:08,853 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:08,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:08,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122050265] [2023-08-26 21:21:08,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122050265] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:08,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:08,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:21:08,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749915577] [2023-08-26 21:21:08,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:08,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:21:08,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:08,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:21:08,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:21:08,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 252 [2023-08-26 21:21:08,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call 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:08,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:08,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 252 [2023-08-26 21:21:08,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:09,417 INFO L124 PetriNetUnfolderBase]: 5621/8223 cut-off events. [2023-08-26 21:21:09,418 INFO L125 PetriNetUnfolderBase]: For 815/815 co-relation queries the response was YES. [2023-08-26 21:21:09,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19889 conditions, 8223 events. 5621/8223 cut-off events. For 815/815 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 50061 event pairs, 947 based on Foata normal form. 0/6231 useless extension candidates. Maximal degree in co-relation 19881. Up to 6289 conditions per place. [2023-08-26 21:21:09,459 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 49 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-08-26 21:21:09,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 55 transitions, 273 flow [2023-08-26 21:21:09,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:21:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:21:09,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2023-08-26 21:21:09,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2023-08-26 21:21:09,461 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2023-08-26 21:21:09,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2023-08-26 21:21:09,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:09,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2023-08-26 21:21:09,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call 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:09,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call 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:09,463 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call 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:09,464 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 114 flow. Second operand 3 states and 390 transitions. [2023-08-26 21:21:09,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 55 transitions, 273 flow [2023-08-26 21:21:09,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 55 transitions, 265 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:21:09,466 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 111 flow [2023-08-26 21:21:09,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-26 21:21:09,467 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-26 21:21:09,467 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 111 flow [2023-08-26 21:21:09,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call 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:09,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:09,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:09,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:21:09,471 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:09,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:09,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1626163226, now seen corresponding path program 1 times [2023-08-26 21:21:09,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:09,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183741336] [2023-08-26 21:21:09,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:09,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:09,532 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:09,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:09,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183741336] [2023-08-26 21:21:09,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183741336] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:09,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:09,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:21:09,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084679892] [2023-08-26 21:21:09,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:09,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:21:09,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:09,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:21:09,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:21:09,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 252 [2023-08-26 21:21:09,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call 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:09,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:09,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 252 [2023-08-26 21:21:09,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:09,972 INFO L124 PetriNetUnfolderBase]: 3389/4828 cut-off events. [2023-08-26 21:21:09,973 INFO L125 PetriNetUnfolderBase]: For 679/679 co-relation queries the response was YES. [2023-08-26 21:21:09,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11660 conditions, 4828 events. 3389/4828 cut-off events. For 679/679 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 24296 event pairs, 680 based on Foata normal form. 0/4113 useless extension candidates. Maximal degree in co-relation 11651. Up to 2243 conditions per place. [2023-08-26 21:21:09,996 INFO L140 encePairwiseOnDemand]: 243/252 looper letters, 61 selfloop transitions, 9 changer transitions 0/74 dead transitions. [2023-08-26 21:21:09,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 74 transitions, 349 flow [2023-08-26 21:21:09,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:21:09,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:21:09,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2023-08-26 21:21:09,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5099206349206349 [2023-08-26 21:21:09,998 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2023-08-26 21:21:09,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2023-08-26 21:21:09,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:09,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2023-08-26 21:21:09,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call 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:10,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call 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:10,001 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call 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:10,001 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 111 flow. Second operand 4 states and 514 transitions. [2023-08-26 21:21:10,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 74 transitions, 349 flow [2023-08-26 21:21:10,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 74 transitions, 341 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:21:10,005 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 165 flow [2023-08-26 21:21:10,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-26 21:21:10,006 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-26 21:21:10,006 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 165 flow [2023-08-26 21:21:10,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call 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:10,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:10,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:10,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:21:10,007 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:10,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:10,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1494396346, now seen corresponding path program 1 times [2023-08-26 21:21:10,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:10,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856045707] [2023-08-26 21:21:10,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:10,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:10,552 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:10,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:10,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856045707] [2023-08-26 21:21:10,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856045707] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:10,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:10,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:21:10,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200356606] [2023-08-26 21:21:10,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:10,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:21:10,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:10,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:21:10,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:21:10,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 252 [2023-08-26 21:21:10,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 165 flow. Second operand has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:10,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:10,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 252 [2023-08-26 21:21:10,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:12,007 INFO L124 PetriNetUnfolderBase]: 16150/22386 cut-off events. [2023-08-26 21:21:12,008 INFO L125 PetriNetUnfolderBase]: For 16267/16267 co-relation queries the response was YES. [2023-08-26 21:21:12,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60358 conditions, 22386 events. 16150/22386 cut-off events. For 16267/16267 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 124335 event pairs, 1547 based on Foata normal form. 0/20106 useless extension candidates. Maximal degree in co-relation 60348. Up to 12551 conditions per place. [2023-08-26 21:21:12,091 INFO L140 encePairwiseOnDemand]: 241/252 looper letters, 141 selfloop transitions, 22 changer transitions 0/163 dead transitions. [2023-08-26 21:21:12,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 163 transitions, 1003 flow [2023-08-26 21:21:12,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:21:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:21:12,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 823 transitions. [2023-08-26 21:21:12,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4665532879818594 [2023-08-26 21:21:12,094 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 823 transitions. [2023-08-26 21:21:12,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 823 transitions. [2023-08-26 21:21:12,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:12,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 823 transitions. [2023-08-26 21:21:12,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.57142857142857) internal successors, (823), 7 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call 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:12,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call 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:12,100 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call 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:12,100 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 165 flow. Second operand 7 states and 823 transitions. [2023-08-26 21:21:12,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 163 transitions, 1003 flow [2023-08-26 21:21:12,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 163 transitions, 921 flow, removed 20 selfloop flow, removed 2 redundant places. [2023-08-26 21:21:12,113 INFO L231 Difference]: Finished difference. Result has 56 places, 61 transitions, 297 flow [2023-08-26 21:21:12,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=297, PETRI_PLACES=56, PETRI_TRANSITIONS=61} [2023-08-26 21:21:12,115 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2023-08-26 21:21:12,115 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 61 transitions, 297 flow [2023-08-26 21:21:12,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:12,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:12,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:12,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:21:12,116 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:12,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:12,116 INFO L85 PathProgramCache]: Analyzing trace with hash 918299487, now seen corresponding path program 1 times [2023-08-26 21:21:12,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:12,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768287285] [2023-08-26 21:21:12,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:12,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:12,402 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:12,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:12,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768287285] [2023-08-26 21:21:12,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768287285] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:12,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:12,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:21:12,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478208220] [2023-08-26 21:21:12,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:12,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:21:12,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:12,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:21:12,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:21:12,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 252 [2023-08-26 21:21:12,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 61 transitions, 297 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call 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:12,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:12,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 252 [2023-08-26 21:21:12,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:14,093 INFO L124 PetriNetUnfolderBase]: 15471/23100 cut-off events. [2023-08-26 21:21:14,094 INFO L125 PetriNetUnfolderBase]: For 23966/25051 co-relation queries the response was YES. [2023-08-26 21:21:14,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74206 conditions, 23100 events. 15471/23100 cut-off events. For 23966/25051 co-relation queries the response was YES. Maximal size of possible extension queue 1073. Compared 154670 event pairs, 3304 based on Foata normal form. 556/21401 useless extension candidates. Maximal degree in co-relation 74192. Up to 12952 conditions per place. [2023-08-26 21:21:14,209 INFO L140 encePairwiseOnDemand]: 248/252 looper letters, 124 selfloop transitions, 9 changer transitions 0/143 dead transitions. [2023-08-26 21:21:14,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 143 transitions, 959 flow [2023-08-26 21:21:14,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:21:14,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:21:14,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2023-08-26 21:21:14,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2023-08-26 21:21:14,211 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 624 transitions. [2023-08-26 21:21:14,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 624 transitions. [2023-08-26 21:21:14,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:14,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 624 transitions. [2023-08-26 21:21:14,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call 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:14,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:14,214 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:14,214 INFO L175 Difference]: Start difference. First operand has 56 places, 61 transitions, 297 flow. Second operand 5 states and 624 transitions. [2023-08-26 21:21:14,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 143 transitions, 959 flow [2023-08-26 21:21:14,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 143 transitions, 959 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:21:14,293 INFO L231 Difference]: Finished difference. Result has 63 places, 66 transitions, 366 flow [2023-08-26 21:21:14,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=366, PETRI_PLACES=63, PETRI_TRANSITIONS=66} [2023-08-26 21:21:14,295 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2023-08-26 21:21:14,295 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 66 transitions, 366 flow [2023-08-26 21:21:14,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call 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:14,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:14,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:14,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:21:14,296 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:14,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:14,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1869946728, now seen corresponding path program 1 times [2023-08-26 21:21:14,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:14,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973658463] [2023-08-26 21:21:14,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:14,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:15,040 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:15,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:15,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973658463] [2023-08-26 21:21:15,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973658463] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:15,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:15,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:21:15,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584347576] [2023-08-26 21:21:15,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:15,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:21:15,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:15,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:21:15,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:21:15,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 252 [2023-08-26 21:21:15,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 66 transitions, 366 flow. Second operand has 6 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 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:15,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:15,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 252 [2023-08-26 21:21:15,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:17,883 INFO L124 PetriNetUnfolderBase]: 29222/41238 cut-off events. [2023-08-26 21:21:17,883 INFO L125 PetriNetUnfolderBase]: For 55043/55043 co-relation queries the response was YES. [2023-08-26 21:21:17,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139222 conditions, 41238 events. 29222/41238 cut-off events. For 55043/55043 co-relation queries the response was YES. Maximal size of possible extension queue 1440. Compared 255333 event pairs, 3522 based on Foata normal form. 519/38860 useless extension candidates. Maximal degree in co-relation 139203. Up to 15599 conditions per place. [2023-08-26 21:21:18,104 INFO L140 encePairwiseOnDemand]: 241/252 looper letters, 204 selfloop transitions, 95 changer transitions 0/299 dead transitions. [2023-08-26 21:21:18,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 299 transitions, 2123 flow [2023-08-26 21:21:18,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 21:21:18,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 21:21:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1266 transitions. [2023-08-26 21:21:18,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45670995670995673 [2023-08-26 21:21:18,107 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1266 transitions. [2023-08-26 21:21:18,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1266 transitions. [2023-08-26 21:21:18,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:18,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1266 transitions. [2023-08-26 21:21:18,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 115.0909090909091) internal successors, (1266), 11 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call 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:18,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 252.0) internal successors, (3024), 12 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:18,113 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 252.0) internal successors, (3024), 12 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:18,113 INFO L175 Difference]: Start difference. First operand has 63 places, 66 transitions, 366 flow. Second operand 11 states and 1266 transitions. [2023-08-26 21:21:18,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 299 transitions, 2123 flow [2023-08-26 21:21:18,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 299 transitions, 2118 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:21:18,265 INFO L231 Difference]: Finished difference. Result has 81 places, 152 transitions, 1321 flow [2023-08-26 21:21:18,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1321, PETRI_PLACES=81, PETRI_TRANSITIONS=152} [2023-08-26 21:21:18,265 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 31 predicate places. [2023-08-26 21:21:18,266 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 152 transitions, 1321 flow [2023-08-26 21:21:18,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 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:18,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:18,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:18,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:21:18,266 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:18,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:18,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1869254808, now seen corresponding path program 2 times [2023-08-26 21:21:18,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:18,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830857040] [2023-08-26 21:21:18,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:18,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:18,953 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:18,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:18,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830857040] [2023-08-26 21:21:18,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830857040] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:18,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:18,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:21:18,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682870818] [2023-08-26 21:21:18,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:18,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:21:18,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:18,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:21:18,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:21:18,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 252 [2023-08-26 21:21:18,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 152 transitions, 1321 flow. Second operand has 6 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 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:18,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:18,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 252 [2023-08-26 21:21:18,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:23,435 INFO L124 PetriNetUnfolderBase]: 35339/50165 cut-off events. [2023-08-26 21:21:23,435 INFO L125 PetriNetUnfolderBase]: For 159702/159702 co-relation queries the response was YES. [2023-08-26 21:21:23,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207442 conditions, 50165 events. 35339/50165 cut-off events. For 159702/159702 co-relation queries the response was YES. Maximal size of possible extension queue 1881. Compared 323537 event pairs, 3689 based on Foata normal form. 581/47163 useless extension candidates. Maximal degree in co-relation 207413. Up to 13430 conditions per place. [2023-08-26 21:21:23,884 INFO L140 encePairwiseOnDemand]: 241/252 looper letters, 283 selfloop transitions, 95 changer transitions 0/378 dead transitions. [2023-08-26 21:21:23,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 378 transitions, 3588 flow [2023-08-26 21:21:23,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:21:23,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:21:23,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1048 transitions. [2023-08-26 21:21:23,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4620811287477954 [2023-08-26 21:21:23,886 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1048 transitions. [2023-08-26 21:21:23,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1048 transitions. [2023-08-26 21:21:23,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:23,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1048 transitions. [2023-08-26 21:21:23,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 116.44444444444444) internal successors, (1048), 9 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call 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:23,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 252.0) internal successors, (2520), 10 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call 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:23,891 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 252.0) internal successors, (2520), 10 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call 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:23,891 INFO L175 Difference]: Start difference. First operand has 81 places, 152 transitions, 1321 flow. Second operand 9 states and 1048 transitions. [2023-08-26 21:21:23,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 378 transitions, 3588 flow [2023-08-26 21:21:24,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 378 transitions, 3572 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-08-26 21:21:24,998 INFO L231 Difference]: Finished difference. Result has 95 places, 201 transitions, 2165 flow [2023-08-26 21:21:24,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=1305, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2165, PETRI_PLACES=95, PETRI_TRANSITIONS=201} [2023-08-26 21:21:24,998 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 45 predicate places. [2023-08-26 21:21:24,998 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 201 transitions, 2165 flow [2023-08-26 21:21:24,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 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:24,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:24,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:24,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:21:24,999 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:25,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:25,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1489335713, now seen corresponding path program 1 times [2023-08-26 21:21:25,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:25,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727726660] [2023-08-26 21:21:25,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:25,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:25,050 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:25,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:25,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727726660] [2023-08-26 21:21:25,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727726660] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:25,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:25,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:21:25,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669710805] [2023-08-26 21:21:25,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:25,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:21:25,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:25,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:21:25,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:21:25,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 252 [2023-08-26 21:21:25,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 201 transitions, 2165 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call 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:25,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:25,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 252 [2023-08-26 21:21:25,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:28,053 INFO L124 PetriNetUnfolderBase]: 19340/28358 cut-off events. [2023-08-26 21:21:28,054 INFO L125 PetriNetUnfolderBase]: For 163425/169427 co-relation queries the response was YES. [2023-08-26 21:21:28,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129623 conditions, 28358 events. 19340/28358 cut-off events. For 163425/169427 co-relation queries the response was YES. Maximal size of possible extension queue 1855. Compared 204185 event pairs, 2208 based on Foata normal form. 1847/28450 useless extension candidates. Maximal degree in co-relation 129586. Up to 10525 conditions per place. [2023-08-26 21:21:28,229 INFO L140 encePairwiseOnDemand]: 243/252 looper letters, 391 selfloop transitions, 13 changer transitions 0/469 dead transitions. [2023-08-26 21:21:28,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 469 transitions, 6043 flow [2023-08-26 21:21:28,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:21:28,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:21:28,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 642 transitions. [2023-08-26 21:21:28,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095238095238095 [2023-08-26 21:21:28,230 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 642 transitions. [2023-08-26 21:21:28,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 642 transitions. [2023-08-26 21:21:28,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:28,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 642 transitions. [2023-08-26 21:21:28,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:28,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:28,233 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:28,233 INFO L175 Difference]: Start difference. First operand has 95 places, 201 transitions, 2165 flow. Second operand 5 states and 642 transitions. [2023-08-26 21:21:28,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 469 transitions, 6043 flow [2023-08-26 21:21:28,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 469 transitions, 5937 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-08-26 21:21:28,772 INFO L231 Difference]: Finished difference. Result has 98 places, 205 transitions, 2206 flow [2023-08-26 21:21:28,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=2132, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2206, PETRI_PLACES=98, PETRI_TRANSITIONS=205} [2023-08-26 21:21:28,774 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 48 predicate places. [2023-08-26 21:21:28,774 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 205 transitions, 2206 flow [2023-08-26 21:21:28,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:28,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:28,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:28,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:21:28,774 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:28,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:28,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1593133739, now seen corresponding path program 1 times [2023-08-26 21:21:28,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:28,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298302962] [2023-08-26 21:21:28,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:28,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:28,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:28,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:28,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298302962] [2023-08-26 21:21:28,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298302962] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:28,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:28,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:21:28,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726999924] [2023-08-26 21:21:28,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:28,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:21:28,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:28,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:21:28,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:21:28,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 252 [2023-08-26 21:21:28,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 205 transitions, 2206 flow. Second operand has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:28,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:28,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 252 [2023-08-26 21:21:28,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:30,817 INFO L124 PetriNetUnfolderBase]: 10092/15616 cut-off events. [2023-08-26 21:21:30,818 INFO L125 PetriNetUnfolderBase]: For 107341/111174 co-relation queries the response was YES. [2023-08-26 21:21:30,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78355 conditions, 15616 events. 10092/15616 cut-off events. For 107341/111174 co-relation queries the response was YES. Maximal size of possible extension queue 906. Compared 111151 event pairs, 2281 based on Foata normal form. 1266/15550 useless extension candidates. Maximal degree in co-relation 78316. Up to 10710 conditions per place. [2023-08-26 21:21:30,903 INFO L140 encePairwiseOnDemand]: 244/252 looper letters, 218 selfloop transitions, 12 changer transitions 4/282 dead transitions. [2023-08-26 21:21:30,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 282 transitions, 3365 flow [2023-08-26 21:21:30,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:21:30,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:21:30,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2023-08-26 21:21:30,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2023-08-26 21:21:30,906 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 602 transitions. [2023-08-26 21:21:30,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 602 transitions. [2023-08-26 21:21:30,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:30,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 602 transitions. [2023-08-26 21:21:30,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:30,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:30,909 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:30,909 INFO L175 Difference]: Start difference. First operand has 98 places, 205 transitions, 2206 flow. Second operand 5 states and 602 transitions. [2023-08-26 21:21:30,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 282 transitions, 3365 flow [2023-08-26 21:21:31,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 282 transitions, 3293 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-08-26 21:21:31,323 INFO L231 Difference]: Finished difference. Result has 102 places, 181 transitions, 1933 flow [2023-08-26 21:21:31,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=1833, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1933, PETRI_PLACES=102, PETRI_TRANSITIONS=181} [2023-08-26 21:21:31,324 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 52 predicate places. [2023-08-26 21:21:31,324 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 181 transitions, 1933 flow [2023-08-26 21:21:31,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:31,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:31,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:31,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:21:31,325 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:31,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:31,325 INFO L85 PathProgramCache]: Analyzing trace with hash -644915597, now seen corresponding path program 1 times [2023-08-26 21:21:31,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:31,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025372406] [2023-08-26 21:21:31,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:31,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:31,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:31,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:31,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025372406] [2023-08-26 21:21:31,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025372406] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:31,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:31,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:21:31,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517318972] [2023-08-26 21:21:31,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:31,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:21:31,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:31,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:21:31,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:21:31,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 252 [2023-08-26 21:21:31,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 181 transitions, 1933 flow. Second operand has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:31,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:31,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 252 [2023-08-26 21:21:31,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:32,350 INFO L124 PetriNetUnfolderBase]: 5370/8345 cut-off events. [2023-08-26 21:21:32,350 INFO L125 PetriNetUnfolderBase]: For 62898/65844 co-relation queries the response was YES. [2023-08-26 21:21:32,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41173 conditions, 8345 events. 5370/8345 cut-off events. For 62898/65844 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 53763 event pairs, 600 based on Foata normal form. 1076/8802 useless extension candidates. Maximal degree in co-relation 41131. Up to 2634 conditions per place. [2023-08-26 21:21:32,403 INFO L140 encePairwiseOnDemand]: 244/252 looper letters, 230 selfloop transitions, 22 changer transitions 4/285 dead transitions. [2023-08-26 21:21:32,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 285 transitions, 3347 flow [2023-08-26 21:21:32,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:21:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:21:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 840 transitions. [2023-08-26 21:21:32,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2023-08-26 21:21:32,405 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 840 transitions. [2023-08-26 21:21:32,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 840 transitions. [2023-08-26 21:21:32,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:32,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 840 transitions. [2023-08-26 21:21:32,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call 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,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call 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,408 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call 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,409 INFO L175 Difference]: Start difference. First operand has 102 places, 181 transitions, 1933 flow. Second operand 7 states and 840 transitions. [2023-08-26 21:21:32,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 285 transitions, 3347 flow [2023-08-26 21:21:32,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 285 transitions, 3308 flow, removed 15 selfloop flow, removed 1 redundant places. [2023-08-26 21:21:32,598 INFO L231 Difference]: Finished difference. Result has 110 places, 138 transitions, 1435 flow [2023-08-26 21:21:32,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=1303, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1435, PETRI_PLACES=110, PETRI_TRANSITIONS=138} [2023-08-26 21:21:32,599 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 60 predicate places. [2023-08-26 21:21:32,599 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 138 transitions, 1435 flow [2023-08-26 21:21:32,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:32,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:32,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:32,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:21:32,599 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:32,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:32,600 INFO L85 PathProgramCache]: Analyzing trace with hash -57681389, now seen corresponding path program 1 times [2023-08-26 21:21:32,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:32,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879812186] [2023-08-26 21:21:32,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:32,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:32,689 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,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:32,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879812186] [2023-08-26 21:21:32,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879812186] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:32,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:32,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:21:32,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515596922] [2023-08-26 21:21:32,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:32,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:21:32,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:32,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:21:32,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:21:32,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 252 [2023-08-26 21:21:32,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 138 transitions, 1435 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call 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,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:32,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 252 [2023-08-26 21:21:32,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:33,846 INFO L124 PetriNetUnfolderBase]: 7503/12032 cut-off events. [2023-08-26 21:21:33,846 INFO L125 PetriNetUnfolderBase]: For 90850/92393 co-relation queries the response was YES. [2023-08-26 21:21:33,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65203 conditions, 12032 events. 7503/12032 cut-off events. For 90850/92393 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 82953 event pairs, 2400 based on Foata normal form. 199/11484 useless extension candidates. Maximal degree in co-relation 65157. Up to 5107 conditions per place. [2023-08-26 21:21:33,938 INFO L140 encePairwiseOnDemand]: 248/252 looper letters, 192 selfloop transitions, 29 changer transitions 8/247 dead transitions. [2023-08-26 21:21:33,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 247 transitions, 2862 flow [2023-08-26 21:21:33,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:21:33,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:21:33,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2023-08-26 21:21:33,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063492063492063 [2023-08-26 21:21:33,940 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 638 transitions. [2023-08-26 21:21:33,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 638 transitions. [2023-08-26 21:21:33,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:33,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 638 transitions. [2023-08-26 21:21:33,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:33,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:33,943 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:33,943 INFO L175 Difference]: Start difference. First operand has 110 places, 138 transitions, 1435 flow. Second operand 5 states and 638 transitions. [2023-08-26 21:21:33,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 247 transitions, 2862 flow [2023-08-26 21:21:34,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 247 transitions, 2788 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-26 21:21:34,511 INFO L231 Difference]: Finished difference. Result has 113 places, 145 transitions, 1587 flow [2023-08-26 21:21:34,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1587, PETRI_PLACES=113, PETRI_TRANSITIONS=145} [2023-08-26 21:21:34,511 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 63 predicate places. [2023-08-26 21:21:34,511 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 145 transitions, 1587 flow [2023-08-26 21:21:34,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:34,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:34,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:34,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:21:34,512 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:34,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:34,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1095352675, now seen corresponding path program 1 times [2023-08-26 21:21:34,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:34,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254497630] [2023-08-26 21:21:34,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:34,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:34,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:34,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:34,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254497630] [2023-08-26 21:21:34,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254497630] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:34,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:34,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:21:34,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97592003] [2023-08-26 21:21:34,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:34,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:21:34,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:34,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:21:34,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:21:34,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 252 [2023-08-26 21:21:34,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 145 transitions, 1587 flow. Second operand has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:34,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:34,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 252 [2023-08-26 21:21:34,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:35,499 INFO L124 PetriNetUnfolderBase]: 5491/8455 cut-off events. [2023-08-26 21:21:35,499 INFO L125 PetriNetUnfolderBase]: For 72077/75539 co-relation queries the response was YES. [2023-08-26 21:21:35,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46208 conditions, 8455 events. 5491/8455 cut-off events. For 72077/75539 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 55640 event pairs, 341 based on Foata normal form. 978/8792 useless extension candidates. Maximal degree in co-relation 46160. Up to 2633 conditions per place. [2023-08-26 21:21:35,557 INFO L140 encePairwiseOnDemand]: 244/252 looper letters, 223 selfloop transitions, 32 changer transitions 4/279 dead transitions. [2023-08-26 21:21:35,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 279 transitions, 3377 flow [2023-08-26 21:21:35,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:21:35,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:21:35,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1076 transitions. [2023-08-26 21:21:35,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47442680776014107 [2023-08-26 21:21:35,559 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1076 transitions. [2023-08-26 21:21:35,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1076 transitions. [2023-08-26 21:21:35,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:35,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1076 transitions. [2023-08-26 21:21:35,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.55555555555556) internal successors, (1076), 9 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call 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,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 252.0) internal successors, (2520), 10 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call 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,563 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 252.0) internal successors, (2520), 10 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call 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,563 INFO L175 Difference]: Start difference. First operand has 113 places, 145 transitions, 1587 flow. Second operand 9 states and 1076 transitions. [2023-08-26 21:21:35,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 279 transitions, 3377 flow [2023-08-26 21:21:36,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 279 transitions, 3265 flow, removed 35 selfloop flow, removed 6 redundant places. [2023-08-26 21:21:36,090 INFO L231 Difference]: Finished difference. Result has 112 places, 110 transitions, 1134 flow [2023-08-26 21:21:36,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=1002, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1134, PETRI_PLACES=112, PETRI_TRANSITIONS=110} [2023-08-26 21:21:36,091 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 62 predicate places. [2023-08-26 21:21:36,091 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 110 transitions, 1134 flow [2023-08-26 21:21:36,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:36,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:36,091 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] [2023-08-26 21:21:36,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:21:36,092 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:36,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:36,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1348966999, now seen corresponding path program 1 times [2023-08-26 21:21:36,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:36,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621866874] [2023-08-26 21:21:36,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:36,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:36,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:21:36,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:36,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621866874] [2023-08-26 21:21:36,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621866874] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:36,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:36,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:21:36,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574247985] [2023-08-26 21:21:36,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:36,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:21:36,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:36,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:21:36,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:21:36,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 252 [2023-08-26 21:21:36,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 110 transitions, 1134 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:36,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:36,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 252 [2023-08-26 21:21:36,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:37,060 INFO L124 PetriNetUnfolderBase]: 5385/8313 cut-off events. [2023-08-26 21:21:37,060 INFO L125 PetriNetUnfolderBase]: For 64221/66561 co-relation queries the response was YES. [2023-08-26 21:21:37,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48602 conditions, 8313 events. 5385/8313 cut-off events. For 64221/66561 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 54503 event pairs, 708 based on Foata normal form. 491/8420 useless extension candidates. Maximal degree in co-relation 48555. Up to 2934 conditions per place. [2023-08-26 21:21:37,100 INFO L140 encePairwiseOnDemand]: 243/252 looper letters, 117 selfloop transitions, 29 changer transitions 22/188 dead transitions. [2023-08-26 21:21:37,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 188 transitions, 2263 flow [2023-08-26 21:21:37,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:21:37,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:21:37,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 742 transitions. [2023-08-26 21:21:37,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49074074074074076 [2023-08-26 21:21:37,101 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 742 transitions. [2023-08-26 21:21:37,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 742 transitions. [2023-08-26 21:21:37,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:37,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 742 transitions. [2023-08-26 21:21:37,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call 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,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call 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,104 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call 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,105 INFO L175 Difference]: Start difference. First operand has 112 places, 110 transitions, 1134 flow. Second operand 6 states and 742 transitions. [2023-08-26 21:21:37,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 188 transitions, 2263 flow [2023-08-26 21:21:37,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 188 transitions, 2200 flow, removed 3 selfloop flow, removed 7 redundant places. [2023-08-26 21:21:37,606 INFO L231 Difference]: Finished difference. Result has 106 places, 96 transitions, 963 flow [2023-08-26 21:21:37,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=963, PETRI_PLACES=106, PETRI_TRANSITIONS=96} [2023-08-26 21:21:37,606 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 56 predicate places. [2023-08-26 21:21:37,607 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 96 transitions, 963 flow [2023-08-26 21:21:37,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call 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,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:37,607 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] [2023-08-26 21:21:37,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 21:21:37,607 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:37,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:37,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1012133678, now seen corresponding path program 1 times [2023-08-26 21:21:37,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:37,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305216952] [2023-08-26 21:21:37,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:37,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:37,723 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,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:37,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305216952] [2023-08-26 21:21:37,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305216952] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:37,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:37,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:21:37,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809589846] [2023-08-26 21:21:37,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:37,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:21:37,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:37,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:21:37,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:21:37,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 252 [2023-08-26 21:21:37,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 96 transitions, 963 flow. Second operand has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call 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,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:37,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 252 [2023-08-26 21:21:37,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:38,839 INFO L124 PetriNetUnfolderBase]: 8481/13031 cut-off events. [2023-08-26 21:21:38,839 INFO L125 PetriNetUnfolderBase]: For 97267/97915 co-relation queries the response was YES. [2023-08-26 21:21:38,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76445 conditions, 13031 events. 8481/13031 cut-off events. For 97267/97915 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 88688 event pairs, 1228 based on Foata normal form. 85/12758 useless extension candidates. Maximal degree in co-relation 76399. Up to 6551 conditions per place. [2023-08-26 21:21:38,904 INFO L140 encePairwiseOnDemand]: 248/252 looper letters, 105 selfloop transitions, 2 changer transitions 91/211 dead transitions. [2023-08-26 21:21:38,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 211 transitions, 2485 flow [2023-08-26 21:21:38,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:21:38,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:21:38,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2023-08-26 21:21:38,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49126984126984125 [2023-08-26 21:21:38,906 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 619 transitions. [2023-08-26 21:21:38,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 619 transitions. [2023-08-26 21:21:38,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:38,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 619 transitions. [2023-08-26 21:21:38,907 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:21:38,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:38,908 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:38,908 INFO L175 Difference]: Start difference. First operand has 106 places, 96 transitions, 963 flow. Second operand 5 states and 619 transitions. [2023-08-26 21:21:38,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 211 transitions, 2485 flow [2023-08-26 21:21:40,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 211 transitions, 2113 flow, removed 65 selfloop flow, removed 13 redundant places. [2023-08-26 21:21:40,198 INFO L231 Difference]: Finished difference. Result has 91 places, 80 transitions, 712 flow [2023-08-26 21:21:40,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=712, PETRI_PLACES=91, PETRI_TRANSITIONS=80} [2023-08-26 21:21:40,198 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 41 predicate places. [2023-08-26 21:21:40,199 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 80 transitions, 712 flow [2023-08-26 21:21:40,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call 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,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:40,199 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] [2023-08-26 21:21:40,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 21:21:40,199 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:40,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:40,199 INFO L85 PathProgramCache]: Analyzing trace with hash -2032172958, now seen corresponding path program 2 times [2023-08-26 21:21:40,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:40,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547275328] [2023-08-26 21:21:40,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:40,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:40,310 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,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:40,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547275328] [2023-08-26 21:21:40,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547275328] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:40,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:40,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:21:40,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560636932] [2023-08-26 21:21:40,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:40,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:21:40,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:40,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:21:40,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:21:40,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 252 [2023-08-26 21:21:40,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 80 transitions, 712 flow. Second operand has 7 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call 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,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:40,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 252 [2023-08-26 21:21:40,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:41,059 INFO L124 PetriNetUnfolderBase]: 4769/7697 cut-off events. [2023-08-26 21:21:41,059 INFO L125 PetriNetUnfolderBase]: For 54353/57487 co-relation queries the response was YES. [2023-08-26 21:21:41,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39636 conditions, 7697 events. 4769/7697 cut-off events. For 54353/57487 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 56097 event pairs, 227 based on Foata normal form. 751/7788 useless extension candidates. Maximal degree in co-relation 39600. Up to 2690 conditions per place. [2023-08-26 21:21:41,093 INFO L140 encePairwiseOnDemand]: 244/252 looper letters, 119 selfloop transitions, 28 changer transitions 78/232 dead transitions. [2023-08-26 21:21:41,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 232 transitions, 2639 flow [2023-08-26 21:21:41,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 21:21:41,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 21:21:41,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1271 transitions. [2023-08-26 21:21:41,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45851370851370854 [2023-08-26 21:21:41,095 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1271 transitions. [2023-08-26 21:21:41,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1271 transitions. [2023-08-26 21:21:41,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:41,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1271 transitions. [2023-08-26 21:21:41,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 115.54545454545455) internal successors, (1271), 11 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:41,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 252.0) internal successors, (3024), 12 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:41,100 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 252.0) internal successors, (3024), 12 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:41,100 INFO L175 Difference]: Start difference. First operand has 91 places, 80 transitions, 712 flow. Second operand 11 states and 1271 transitions. [2023-08-26 21:21:41,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 232 transitions, 2639 flow [2023-08-26 21:21:41,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 232 transitions, 2577 flow, removed 13 selfloop flow, removed 8 redundant places. [2023-08-26 21:21:41,526 INFO L231 Difference]: Finished difference. Result has 93 places, 66 transitions, 587 flow [2023-08-26 21:21:41,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=587, PETRI_PLACES=93, PETRI_TRANSITIONS=66} [2023-08-26 21:21:41,526 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 43 predicate places. [2023-08-26 21:21:41,526 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 66 transitions, 587 flow [2023-08-26 21:21:41,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:41,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:41,527 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] [2023-08-26 21:21:41,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 21:21:41,527 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:41,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:41,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1960501170, now seen corresponding path program 1 times [2023-08-26 21:21:41,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:41,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709381886] [2023-08-26 21:21:41,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:41,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:41,908 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:41,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:41,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709381886] [2023-08-26 21:21:41,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709381886] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:41,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:41,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:21:41,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766748052] [2023-08-26 21:21:41,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:41,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:21:41,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:41,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:21:41,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:21:41,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 252 [2023-08-26 21:21:41,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 66 transitions, 587 flow. Second operand has 6 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 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:41,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:41,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 252 [2023-08-26 21:21:41,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:42,345 INFO L124 PetriNetUnfolderBase]: 1834/2987 cut-off events. [2023-08-26 21:21:42,345 INFO L125 PetriNetUnfolderBase]: For 16588/16588 co-relation queries the response was YES. [2023-08-26 21:21:42,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16416 conditions, 2987 events. 1834/2987 cut-off events. For 16588/16588 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 16620 event pairs, 182 based on Foata normal form. 1/2905 useless extension candidates. Maximal degree in co-relation 16380. Up to 1560 conditions per place. [2023-08-26 21:21:42,357 INFO L140 encePairwiseOnDemand]: 242/252 looper letters, 50 selfloop transitions, 8 changer transitions 118/176 dead transitions. [2023-08-26 21:21:42,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 176 transitions, 1874 flow [2023-08-26 21:21:42,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:21:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:21:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 756 transitions. [2023-08-26 21:21:42,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2023-08-26 21:21:42,359 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 756 transitions. [2023-08-26 21:21:42,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 756 transitions. [2023-08-26 21:21:42,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:42,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 756 transitions. [2023-08-26 21:21:42,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:42,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:42,362 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:21:42,363 INFO L175 Difference]: Start difference. First operand has 93 places, 66 transitions, 587 flow. Second operand 7 states and 756 transitions. [2023-08-26 21:21:42,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 176 transitions, 1874 flow [2023-08-26 21:21:42,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 176 transitions, 1551 flow, removed 47 selfloop flow, removed 15 redundant places. [2023-08-26 21:21:42,410 INFO L231 Difference]: Finished difference. Result has 85 places, 44 transitions, 301 flow [2023-08-26 21:21:42,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=301, PETRI_PLACES=85, PETRI_TRANSITIONS=44} [2023-08-26 21:21:42,410 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 35 predicate places. [2023-08-26 21:21:42,410 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 44 transitions, 301 flow [2023-08-26 21:21:42,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 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:42,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:42,411 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] [2023-08-26 21:21:42,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 21:21:42,411 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:42,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:42,411 INFO L85 PathProgramCache]: Analyzing trace with hash -934092156, now seen corresponding path program 2 times [2023-08-26 21:21:42,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:42,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266853664] [2023-08-26 21:21:42,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:42,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:21:43,438 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,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:21:43,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266853664] [2023-08-26 21:21:43,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266853664] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:21:43,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:21:43,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 21:21:43,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675832260] [2023-08-26 21:21:43,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:21:43,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 21:21:43,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:21:43,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 21:21:43,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-08-26 21:21:43,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 252 [2023-08-26 21:21:43,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 44 transitions, 301 flow. Second operand has 9 states, 9 states have (on average 98.88888888888889) internal successors, (890), 9 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call 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,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:21:43,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 252 [2023-08-26 21:21:43,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:21:43,889 INFO L124 PetriNetUnfolderBase]: 261/489 cut-off events. [2023-08-26 21:21:43,890 INFO L125 PetriNetUnfolderBase]: For 1237/1237 co-relation queries the response was YES. [2023-08-26 21:21:43,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2068 conditions, 489 events. 261/489 cut-off events. For 1237/1237 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1962 event pairs, 26 based on Foata normal form. 1/490 useless extension candidates. Maximal degree in co-relation 2040. Up to 228 conditions per place. [2023-08-26 21:21:43,891 INFO L140 encePairwiseOnDemand]: 243/252 looper letters, 45 selfloop transitions, 8 changer transitions 42/95 dead transitions. [2023-08-26 21:21:43,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 95 transitions, 799 flow [2023-08-26 21:21:43,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:21:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:21:43,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 923 transitions. [2023-08-26 21:21:43,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4069664902998236 [2023-08-26 21:21:43,893 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 923 transitions. [2023-08-26 21:21:43,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 923 transitions. [2023-08-26 21:21:43,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:21:43,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 923 transitions. [2023-08-26 21:21:43,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 102.55555555555556) internal successors, (923), 9 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call 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,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 252.0) internal successors, (2520), 10 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call 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,897 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 252.0) internal successors, (2520), 10 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call 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,897 INFO L175 Difference]: Start difference. First operand has 85 places, 44 transitions, 301 flow. Second operand 9 states and 923 transitions. [2023-08-26 21:21:43,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 95 transitions, 799 flow [2023-08-26 21:21:43,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 95 transitions, 722 flow, removed 20 selfloop flow, removed 15 redundant places. [2023-08-26 21:21:43,901 INFO L231 Difference]: Finished difference. Result has 69 places, 40 transitions, 236 flow [2023-08-26 21:21:43,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=236, PETRI_PLACES=69, PETRI_TRANSITIONS=40} [2023-08-26 21:21:43,901 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 19 predicate places. [2023-08-26 21:21:43,901 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 40 transitions, 236 flow [2023-08-26 21:21:43,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 98.88888888888889) internal successors, (890), 9 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call 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,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:21:43,902 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] [2023-08-26 21:21:43,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 21:21:43,902 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:21:43,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:21:43,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1086764410, now seen corresponding path program 3 times [2023-08-26 21:21:43,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:21:43,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059249615] [2023-08-26 21:21:43,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:21:43,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:21:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:21:43,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:21:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:21:43,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:21:43,990 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:21:43,991 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-26 21:21:43,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2023-08-26 21:21:43,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-26 21:21:43,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-26 21:21:43,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-26 21:21:43,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-26 21:21:43,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-26 21:21:43,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (15 of 23 remaining) [2023-08-26 21:21:43,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-26 21:21:43,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-26 21:21:43,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-26 21:21:43,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-26 21:21:43,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-26 21:21:43,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-26 21:21:43,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 23 remaining) [2023-08-26 21:21:43,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-26 21:21:43,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-26 21:21:43,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-26 21:21:43,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-26 21:21:43,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-26 21:21:43,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (2 of 23 remaining) [2023-08-26 21:21:43,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-26 21:21:43,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-26 21:21:43,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 21:21:43,996 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:21:44,001 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:21:44,001 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:21:44,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:21:44 BasicIcfg [2023-08-26 21:21:44,069 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:21:44,069 INFO L158 Benchmark]: Toolchain (without parser) took 41974.64ms. Allocated memory was 371.2MB in the beginning and 7.9GB in the end (delta: 7.5GB). Free memory was 345.9MB in the beginning and 3.4GB in the end (delta: -3.1GB). Peak memory consumption was 4.4GB. Max. memory is 16.0GB. [2023-08-26 21:21:44,069 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 371.2MB. Free memory was 347.8MB in the beginning and 347.7MB in the end (delta: 87.1kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:21:44,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.64ms. Allocated memory is still 371.2MB. Free memory was 345.9MB in the beginning and 322.7MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:21:44,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.00ms. Allocated memory is still 371.2MB. Free memory was 322.7MB in the beginning and 320.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:21:44,070 INFO L158 Benchmark]: Boogie Preprocessor took 17.97ms. Allocated memory is still 371.2MB. Free memory was 319.6MB in the beginning and 317.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:21:44,070 INFO L158 Benchmark]: RCFGBuilder took 607.53ms. Allocated memory is still 371.2MB. Free memory was 317.8MB in the beginning and 330.5MB in the end (delta: -12.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-26 21:21:44,073 INFO L158 Benchmark]: TraceAbstraction took 40889.36ms. Allocated memory was 371.2MB in the beginning and 7.9GB in the end (delta: 7.5GB). Free memory was 330.5MB in the beginning and 3.4GB in the end (delta: -3.1GB). Peak memory consumption was 4.4GB. Max. memory is 16.0GB. [2023-08-26 21:21:44,073 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 371.2MB. Free memory was 347.8MB in the beginning and 347.7MB in the end (delta: 87.1kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 421.64ms. Allocated memory is still 371.2MB. Free memory was 345.9MB in the beginning and 322.7MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 33.00ms. Allocated memory is still 371.2MB. Free memory was 322.7MB in the beginning and 320.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 17.97ms. Allocated memory is still 371.2MB. Free memory was 319.6MB in the beginning and 317.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 607.53ms. Allocated memory is still 371.2MB. Free memory was 317.8MB in the beginning and 330.5MB in the end (delta: -12.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * TraceAbstraction took 40889.36ms. Allocated memory was 371.2MB in the beginning and 7.9GB in the end (delta: 7.5GB). Free memory was 330.5MB in the beginning and 3.4GB in the end (delta: -3.1GB). Peak memory consumption was 4.4GB. 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.3s, 144 PlacesBefore, 50 PlacesAfterwards, 134 TransitionsBefore, 38 TransitionsAfterwards, 4052 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 114 TotalNumberOfCompositions, 13504 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4363, independent: 4069, independent conditional: 0, independent unconditional: 4069, dependent: 294, dependent conditional: 0, dependent unconditional: 294, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2104, independent: 2053, independent conditional: 0, independent unconditional: 2053, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4363, independent: 2016, independent conditional: 0, independent unconditional: 2016, dependent: 243, dependent conditional: 0, dependent unconditional: 243, unknown: 2104, unknown conditional: 0, unknown unconditional: 2104] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 161, Positive conditional cache size: 0, Positive unconditional cache size: 161, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, 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_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1461; [L837] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1461, ((void *)0), P0, ((void *)0))=-2, t1461={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L838] 0 pthread_t t1462; [L839] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1462, ((void *)0), P1, ((void *)0))=-1, t1461={5:0}, t1462={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t1463; [L841] FCALL, FORK 0 pthread_create(&t1463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1463, ((void *)0), P2, ((void *)0))=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t1464; [L843] FCALL, FORK 0 pthread_create(&t1464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1464, ((void *)0), P3, ((void *)0))=1, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L821] EXPR 4 __unbuffered_cnt + 1 [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L756] EXPR 1 __unbuffered_cnt + 1 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L771] EXPR 2 __unbuffered_cnt + 1 [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L791] EXPR 3 __unbuffered_cnt + 1 [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 [L871] 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", "mix055.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 756]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 756]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 839]: 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: 837]: 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: 843]: 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: 841]: 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, 179 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: 40.7s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 32.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 976 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 976 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2481 IncrementalHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 146 mSolverCounterUnsat, 43 mSDtfsCounter, 2481 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2206occurred in iteration=9, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 313 NumberOfCodeBlocks, 313 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 269 ConstructedInterpolants, 0 QuantifiedInterpolants, 2362 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 21:21:44,086 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...