/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/mix038_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:17:40,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:17:40,434 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:17:40,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:17:40,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:17:40,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:17:40,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:17:40,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:17:40,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:17:40,460 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:17:40,460 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:17:40,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:17:40,461 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:17:40,461 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:17:40,461 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:17:40,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:17:40,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:17:40,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:17:40,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:17:40,463 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:17:40,463 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:17:40,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:17:40,466 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:17:40,466 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:17:40,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:17:40,467 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:17:40,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:17:40,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:17:40,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:17:40,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:17:40,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:17:40,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:17:40,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:17:40,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:17:40,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:17:40,470 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:17:40,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:17:40,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:17:40,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:17:40,837 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:17:40,839 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:17:40,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2023-08-26 21:17:42,052 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:17:42,332 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:17:42,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2023-08-26 21:17:42,357 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92cbd0359/cb756c243538455d955c2c5aea6ff21a/FLAG429064692 [2023-08-26 21:17:42,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92cbd0359/cb756c243538455d955c2c5aea6ff21a [2023-08-26 21:17:42,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:17:42,372 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:17:42,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:17:42,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:17:42,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:17:42,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:17:42" (1/1) ... [2023-08-26 21:17:42,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fac9e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:42, skipping insertion in model container [2023-08-26 21:17:42,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:17:42" (1/1) ... [2023-08-26 21:17:42,429 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:17:42,821 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:17:42,836 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:17:42,868 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:17:42,870 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:17:42,904 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:17:42,941 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:17:42,941 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:17:42,947 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:17:42,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:42 WrapperNode [2023-08-26 21:17:42,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:17:42,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:17:42,951 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:17:42,951 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:17:42,957 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:17:42" (1/1) ... [2023-08-26 21:17:42,987 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:17:42" (1/1) ... [2023-08-26 21:17:43,014 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 155 [2023-08-26 21:17:43,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:17:43,015 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:17:43,016 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:17:43,016 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:17:43,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:42" (1/1) ... [2023-08-26 21:17:43,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:42" (1/1) ... [2023-08-26 21:17:43,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:42" (1/1) ... [2023-08-26 21:17:43,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:42" (1/1) ... [2023-08-26 21:17:43,044 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:42" (1/1) ... [2023-08-26 21:17:43,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:42" (1/1) ... [2023-08-26 21:17:43,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:42" (1/1) ... [2023-08-26 21:17:43,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:42" (1/1) ... [2023-08-26 21:17:43,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:17:43,069 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:17:43,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:17:43,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:17:43,069 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:42" (1/1) ... [2023-08-26 21:17:43,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:17:43,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:17:43,113 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:17:43,133 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:17:43,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:17:43,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:17:43,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:17:43,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:17:43,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:17:43,156 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:17:43,156 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:17:43,156 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:17:43,156 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:17:43,156 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:17:43,156 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:17:43,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:17:43,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:17:43,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:17:43,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:17:43,159 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:17:43,322 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:17:43,324 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:17:43,576 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:17:43,729 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:17:43,729 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:17:43,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:17:43 BoogieIcfgContainer [2023-08-26 21:17:43,731 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:17:43,736 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:17:43,736 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:17:43,741 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:17:43,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:17:42" (1/3) ... [2023-08-26 21:17:43,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444b254a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:17:43, skipping insertion in model container [2023-08-26 21:17:43,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:42" (2/3) ... [2023-08-26 21:17:43,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444b254a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:17:43, skipping insertion in model container [2023-08-26 21:17:43,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:17:43" (3/3) ... [2023-08-26 21:17:43,744 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2023-08-26 21:17:43,757 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:17:43,757 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 21:17:43,757 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:17:43,837 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:17:43,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 122 transitions, 259 flow [2023-08-26 21:17:43,944 INFO L124 PetriNetUnfolderBase]: 3/119 cut-off events. [2023-08-26 21:17:43,945 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:17:43,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 3/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 90 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-08-26 21:17:43,951 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 122 transitions, 259 flow [2023-08-26 21:17:43,955 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 119 transitions, 247 flow [2023-08-26 21:17:43,959 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:17:43,975 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 119 transitions, 247 flow [2023-08-26 21:17:43,978 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 119 transitions, 247 flow [2023-08-26 21:17:43,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 119 transitions, 247 flow [2023-08-26 21:17:44,013 INFO L124 PetriNetUnfolderBase]: 3/119 cut-off events. [2023-08-26 21:17:44,013 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:17:44,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 3/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-08-26 21:17:44,017 INFO L119 LiptonReduction]: Number of co-enabled transitions 2970 [2023-08-26 21:17:47,771 INFO L134 LiptonReduction]: Checked pairs total: 10794 [2023-08-26 21:17:47,771 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-08-26 21:17:47,785 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:17:47,790 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;@3b274ebb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:17:47,790 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-26 21:17:47,793 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:17:47,793 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-08-26 21:17:47,793 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:17:47,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:47,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:17:47,794 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:17:47,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:47,799 INFO L85 PathProgramCache]: Analyzing trace with hash 525561384, now seen corresponding path program 1 times [2023-08-26 21:17:47,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:47,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414853762] [2023-08-26 21:17:47,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:47,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:48,229 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:17:48,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:48,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414853762] [2023-08-26 21:17:48,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414853762] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:48,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:48,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:17:48,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980100352] [2023-08-26 21:17:48,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:48,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:17:48,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:48,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:17:48,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:17:48,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 226 [2023-08-26 21:17:48,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:48,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:48,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 226 [2023-08-26 21:17:48,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:48,722 INFO L124 PetriNetUnfolderBase]: 2129/3434 cut-off events. [2023-08-26 21:17:48,723 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-26 21:17:48,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6591 conditions, 3434 events. 2129/3434 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 19809 event pairs, 551 based on Foata normal form. 0/2746 useless extension candidates. Maximal degree in co-relation 6580. Up to 2609 conditions per place. [2023-08-26 21:17:48,754 INFO L140 encePairwiseOnDemand]: 222/226 looper letters, 38 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-08-26 21:17:48,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 184 flow [2023-08-26 21:17:48,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:17:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:17:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-08-26 21:17:48,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5103244837758112 [2023-08-26 21:17:48,772 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-08-26 21:17:48,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-08-26 21:17:48,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:48,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-08-26 21:17:48,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:48,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:48,787 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:48,789 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 3 states and 346 transitions. [2023-08-26 21:17:48,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 184 flow [2023-08-26 21:17:48,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 46 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 21:17:48,794 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 70 flow [2023-08-26 21:17:48,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2023-08-26 21:17:48,801 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-08-26 21:17:48,801 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 70 flow [2023-08-26 21:17:48,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:48,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:48,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 21:17:48,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:17:48,803 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:17:48,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:48,805 INFO L85 PathProgramCache]: Analyzing trace with hash -888959717, now seen corresponding path program 1 times [2023-08-26 21:17:48,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:48,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927506456] [2023-08-26 21:17:48,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:48,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:48,905 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:17:48,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:48,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927506456] [2023-08-26 21:17:48,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927506456] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:48,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:48,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:17:48,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533873313] [2023-08-26 21:17:48,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:48,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:17:48,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:48,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:17:48,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:17:48,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 226 [2023-08-26 21:17:48,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:48,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:48,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 226 [2023-08-26 21:17:48,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:49,209 INFO L124 PetriNetUnfolderBase]: 1689/2589 cut-off events. [2023-08-26 21:17:49,209 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2023-08-26 21:17:49,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5361 conditions, 2589 events. 1689/2589 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13100 event pairs, 557 based on Foata normal form. 0/2008 useless extension candidates. Maximal degree in co-relation 5351. Up to 1883 conditions per place. [2023-08-26 21:17:49,227 INFO L140 encePairwiseOnDemand]: 216/226 looper letters, 42 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2023-08-26 21:17:49,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 206 flow [2023-08-26 21:17:49,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:17:49,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:17:49,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2023-08-26 21:17:49,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5058997050147492 [2023-08-26 21:17:49,232 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2023-08-26 21:17:49,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2023-08-26 21:17:49,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:49,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2023-08-26 21:17:49,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:49,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:49,237 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:49,237 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 70 flow. Second operand 3 states and 343 transitions. [2023-08-26 21:17:49,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 206 flow [2023-08-26 21:17:49,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:17:49,241 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 102 flow [2023-08-26 21:17:49,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-08-26 21:17:49,242 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-08-26 21:17:49,243 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 102 flow [2023-08-26 21:17:49,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:49,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:49,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:49,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:17:49,244 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:17:49,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:49,244 INFO L85 PathProgramCache]: Analyzing trace with hash -771036373, now seen corresponding path program 1 times [2023-08-26 21:17:49,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:49,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608337816] [2023-08-26 21:17:49,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:49,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:49,778 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:17:49,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:49,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608337816] [2023-08-26 21:17:49,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608337816] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:49,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:49,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:17:49,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995776158] [2023-08-26 21:17:49,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:49,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:17:49,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:49,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:17:49,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:17:49,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-08-26 21:17:49,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:49,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:49,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-08-26 21:17:49,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:50,297 INFO L124 PetriNetUnfolderBase]: 2717/4105 cut-off events. [2023-08-26 21:17:50,298 INFO L125 PetriNetUnfolderBase]: For 442/535 co-relation queries the response was YES. [2023-08-26 21:17:50,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9603 conditions, 4105 events. 2717/4105 cut-off events. For 442/535 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 20023 event pairs, 628 based on Foata normal form. 0/3657 useless extension candidates. Maximal degree in co-relation 9592. Up to 2105 conditions per place. [2023-08-26 21:17:50,327 INFO L140 encePairwiseOnDemand]: 221/226 looper letters, 73 selfloop transitions, 5 changer transitions 0/81 dead transitions. [2023-08-26 21:17:50,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 81 transitions, 403 flow [2023-08-26 21:17:50,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:17:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:17:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 490 transitions. [2023-08-26 21:17:50,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4336283185840708 [2023-08-26 21:17:50,329 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 490 transitions. [2023-08-26 21:17:50,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 490 transitions. [2023-08-26 21:17:50,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:50,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 490 transitions. [2023-08-26 21:17:50,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:50,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:50,334 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:50,334 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 102 flow. Second operand 5 states and 490 transitions. [2023-08-26 21:17:50,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 81 transitions, 403 flow [2023-08-26 21:17:50,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 81 transitions, 392 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:17:50,338 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 132 flow [2023-08-26 21:17:50,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2023-08-26 21:17:50,339 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2023-08-26 21:17:50,339 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 132 flow [2023-08-26 21:17:50,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:50,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:50,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:50,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:17:50,344 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:17:50,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:50,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1542923981, now seen corresponding path program 1 times [2023-08-26 21:17:50,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:50,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820099653] [2023-08-26 21:17:50,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:50,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:50,436 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:17:50,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:50,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820099653] [2023-08-26 21:17:50,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820099653] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:50,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:50,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:17:50,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370093319] [2023-08-26 21:17:50,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:50,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:17:50,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:50,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:17:50,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:17:50,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 226 [2023-08-26 21:17:50,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:50,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:50,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 226 [2023-08-26 21:17:50,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:50,737 INFO L124 PetriNetUnfolderBase]: 1408/2155 cut-off events. [2023-08-26 21:17:50,737 INFO L125 PetriNetUnfolderBase]: For 983/983 co-relation queries the response was YES. [2023-08-26 21:17:50,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5661 conditions, 2155 events. 1408/2155 cut-off events. For 983/983 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10815 event pairs, 456 based on Foata normal form. 0/1940 useless extension candidates. Maximal degree in co-relation 5645. Up to 1448 conditions per place. [2023-08-26 21:17:50,751 INFO L140 encePairwiseOnDemand]: 219/226 looper letters, 45 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2023-08-26 21:17:50,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 284 flow [2023-08-26 21:17:50,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:17:50,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:17:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2023-08-26 21:17:50,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48008849557522126 [2023-08-26 21:17:50,753 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 434 transitions. [2023-08-26 21:17:50,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 434 transitions. [2023-08-26 21:17:50,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:50,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 434 transitions. [2023-08-26 21:17:50,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:50,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:50,757 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:50,757 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 132 flow. Second operand 4 states and 434 transitions. [2023-08-26 21:17:50,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 52 transitions, 284 flow [2023-08-26 21:17:50,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 52 transitions, 284 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:17:50,762 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 128 flow [2023-08-26 21:17:50,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2023-08-26 21:17:50,763 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2023-08-26 21:17:50,763 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 128 flow [2023-08-26 21:17:50,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:50,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:50,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:50,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:17:50,764 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:17:50,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:50,764 INFO L85 PathProgramCache]: Analyzing trace with hash 744099202, now seen corresponding path program 1 times [2023-08-26 21:17:50,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:50,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628010730] [2023-08-26 21:17:50,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:50,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:50,814 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:17:50,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:50,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628010730] [2023-08-26 21:17:50,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628010730] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:50,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:50,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:17:50,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874798804] [2023-08-26 21:17:50,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:50,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:17:50,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:50,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:17:50,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:17:50,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 226 [2023-08-26 21:17:50,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:50,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:50,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 226 [2023-08-26 21:17:50,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:51,077 INFO L124 PetriNetUnfolderBase]: 1121/1711 cut-off events. [2023-08-26 21:17:51,077 INFO L125 PetriNetUnfolderBase]: For 1195/1195 co-relation queries the response was YES. [2023-08-26 21:17:51,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4626 conditions, 1711 events. 1121/1711 cut-off events. For 1195/1195 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8306 event pairs, 407 based on Foata normal form. 0/1674 useless extension candidates. Maximal degree in co-relation 4608. Up to 699 conditions per place. [2023-08-26 21:17:51,089 INFO L140 encePairwiseOnDemand]: 219/226 looper letters, 62 selfloop transitions, 7 changer transitions 0/72 dead transitions. [2023-08-26 21:17:51,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 404 flow [2023-08-26 21:17:51,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:17:51,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:17:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 451 transitions. [2023-08-26 21:17:51,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49889380530973454 [2023-08-26 21:17:51,091 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 451 transitions. [2023-08-26 21:17:51,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 451 transitions. [2023-08-26 21:17:51,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:51,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 451 transitions. [2023-08-26 21:17:51,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:51,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:51,095 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:51,095 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 128 flow. Second operand 4 states and 451 transitions. [2023-08-26 21:17:51,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 404 flow [2023-08-26 21:17:51,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 72 transitions, 399 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:17:51,101 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 167 flow [2023-08-26 21:17:51,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2023-08-26 21:17:51,102 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2023-08-26 21:17:51,102 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 167 flow [2023-08-26 21:17:51,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:51,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:51,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:51,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:17:51,103 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:17:51,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:51,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1162874373, now seen corresponding path program 1 times [2023-08-26 21:17:51,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:51,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911130230] [2023-08-26 21:17:51,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:51,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:17:51,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:51,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911130230] [2023-08-26 21:17:51,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911130230] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:51,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:51,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:17:51,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013674254] [2023-08-26 21:17:51,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:51,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:17:51,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:51,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:17:51,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:17:51,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 226 [2023-08-26 21:17:51,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 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:17:51,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:51,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 226 [2023-08-26 21:17:51,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:52,042 INFO L124 PetriNetUnfolderBase]: 1744/2675 cut-off events. [2023-08-26 21:17:52,042 INFO L125 PetriNetUnfolderBase]: For 3034/3034 co-relation queries the response was YES. [2023-08-26 21:17:52,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7911 conditions, 2675 events. 1744/2675 cut-off events. For 3034/3034 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13397 event pairs, 499 based on Foata normal form. 63/2707 useless extension candidates. Maximal degree in co-relation 7892. Up to 1570 conditions per place. [2023-08-26 21:17:52,067 INFO L140 encePairwiseOnDemand]: 220/226 looper letters, 68 selfloop transitions, 9 changer transitions 3/82 dead transitions. [2023-08-26 21:17:52,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 82 transitions, 522 flow [2023-08-26 21:17:52,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:17:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:17:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2023-08-26 21:17:52,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45486725663716815 [2023-08-26 21:17:52,070 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 514 transitions. [2023-08-26 21:17:52,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 514 transitions. [2023-08-26 21:17:52,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:52,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 514 transitions. [2023-08-26 21:17:52,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.8) internal successors, (514), 5 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:17:52,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:52,074 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:52,074 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 167 flow. Second operand 5 states and 514 transitions. [2023-08-26 21:17:52,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 82 transitions, 522 flow [2023-08-26 21:17:52,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 82 transitions, 494 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-26 21:17:52,082 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 237 flow [2023-08-26 21:17:52,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2023-08-26 21:17:52,084 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2023-08-26 21:17:52,084 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 237 flow [2023-08-26 21:17:52,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 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:17:52,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:52,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:52,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:17:52,085 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:17:52,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:52,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1689345192, now seen corresponding path program 1 times [2023-08-26 21:17:52,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:52,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339414206] [2023-08-26 21:17:52,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:52,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:52,734 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:17:52,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:52,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339414206] [2023-08-26 21:17:52,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339414206] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:52,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:52,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:17:52,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900453172] [2023-08-26 21:17:52,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:52,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:17:52,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:52,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:17:52,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:17:52,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 226 [2023-08-26 21:17:52,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:52,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:52,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 226 [2023-08-26 21:17:52,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:53,229 INFO L124 PetriNetUnfolderBase]: 2061/3148 cut-off events. [2023-08-26 21:17:53,229 INFO L125 PetriNetUnfolderBase]: For 6091/6091 co-relation queries the response was YES. [2023-08-26 21:17:53,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10749 conditions, 3148 events. 2061/3148 cut-off events. For 6091/6091 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 15947 event pairs, 519 based on Foata normal form. 48/3158 useless extension candidates. Maximal degree in co-relation 10726. Up to 1576 conditions per place. [2023-08-26 21:17:53,252 INFO L140 encePairwiseOnDemand]: 218/226 looper letters, 87 selfloop transitions, 20 changer transitions 3/112 dead transitions. [2023-08-26 21:17:53,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 112 transitions, 774 flow [2023-08-26 21:17:53,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:17:53,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:17:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 717 transitions. [2023-08-26 21:17:53,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4532237673830594 [2023-08-26 21:17:53,255 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 717 transitions. [2023-08-26 21:17:53,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 717 transitions. [2023-08-26 21:17:53,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:53,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 717 transitions. [2023-08-26 21:17:53,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 102.42857142857143) internal successors, (717), 7 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:53,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:53,260 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:53,260 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 237 flow. Second operand 7 states and 717 transitions. [2023-08-26 21:17:53,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 112 transitions, 774 flow [2023-08-26 21:17:53,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 112 transitions, 774 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:17:53,270 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 451 flow [2023-08-26 21:17:53,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=451, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2023-08-26 21:17:53,271 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2023-08-26 21:17:53,271 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 451 flow [2023-08-26 21:17:53,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:53,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:53,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:53,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:17:53,272 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:17:53,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:53,272 INFO L85 PathProgramCache]: Analyzing trace with hash 953876902, now seen corresponding path program 1 times [2023-08-26 21:17:53,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:53,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637904314] [2023-08-26 21:17:53,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:53,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:53,528 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:17:53,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:53,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637904314] [2023-08-26 21:17:53,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637904314] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:53,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:53,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:17:53,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397885021] [2023-08-26 21:17:53,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:53,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:17:53,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:53,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:17:53,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:17:53,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 226 [2023-08-26 21:17:53,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 451 flow. Second operand has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:53,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:53,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 226 [2023-08-26 21:17:53,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:54,174 INFO L124 PetriNetUnfolderBase]: 2318/3598 cut-off events. [2023-08-26 21:17:54,174 INFO L125 PetriNetUnfolderBase]: For 13674/13693 co-relation queries the response was YES. [2023-08-26 21:17:54,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14478 conditions, 3598 events. 2318/3598 cut-off events. For 13674/13693 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 19198 event pairs, 320 based on Foata normal form. 55/3607 useless extension candidates. Maximal degree in co-relation 14447. Up to 1992 conditions per place. [2023-08-26 21:17:54,205 INFO L140 encePairwiseOnDemand]: 217/226 looper letters, 109 selfloop transitions, 40 changer transitions 3/154 dead transitions. [2023-08-26 21:17:54,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 154 transitions, 1294 flow [2023-08-26 21:17:54,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:17:54,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:17:54,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 744 transitions. [2023-08-26 21:17:54,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47029077117572693 [2023-08-26 21:17:54,208 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 744 transitions. [2023-08-26 21:17:54,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 744 transitions. [2023-08-26 21:17:54,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:54,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 744 transitions. [2023-08-26 21:17:54,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.28571428571429) internal successors, (744), 7 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:54,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:54,213 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:54,213 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 451 flow. Second operand 7 states and 744 transitions. [2023-08-26 21:17:54,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 154 transitions, 1294 flow [2023-08-26 21:17:54,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 154 transitions, 1278 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-08-26 21:17:54,248 INFO L231 Difference]: Finished difference. Result has 79 places, 88 transitions, 825 flow [2023-08-26 21:17:54,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=825, PETRI_PLACES=79, PETRI_TRANSITIONS=88} [2023-08-26 21:17:54,249 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 38 predicate places. [2023-08-26 21:17:54,249 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 88 transitions, 825 flow [2023-08-26 21:17:54,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:54,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:54,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:54,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:17:54,250 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:17:54,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:54,250 INFO L85 PathProgramCache]: Analyzing trace with hash 920664742, now seen corresponding path program 2 times [2023-08-26 21:17:54,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:54,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139222034] [2023-08-26 21:17:54,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:54,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:54,548 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:17:54,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:54,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139222034] [2023-08-26 21:17:54,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139222034] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:54,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:54,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:17:54,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152059642] [2023-08-26 21:17:54,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:54,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:17:54,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:54,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:17:54,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:17:54,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 226 [2023-08-26 21:17:54,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 88 transitions, 825 flow. Second operand has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:54,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:54,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 226 [2023-08-26 21:17:54,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:55,224 INFO L124 PetriNetUnfolderBase]: 2453/3817 cut-off events. [2023-08-26 21:17:55,224 INFO L125 PetriNetUnfolderBase]: For 26110/26142 co-relation queries the response was YES. [2023-08-26 21:17:55,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18382 conditions, 3817 events. 2453/3817 cut-off events. For 26110/26142 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 20839 event pairs, 275 based on Foata normal form. 61/3828 useless extension candidates. Maximal degree in co-relation 18343. Up to 1959 conditions per place. [2023-08-26 21:17:55,261 INFO L140 encePairwiseOnDemand]: 220/226 looper letters, 117 selfloop transitions, 38 changer transitions 3/160 dead transitions. [2023-08-26 21:17:55,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 160 transitions, 1596 flow [2023-08-26 21:17:55,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:17:55,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:17:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 727 transitions. [2023-08-26 21:17:55,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595448798988622 [2023-08-26 21:17:55,264 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 727 transitions. [2023-08-26 21:17:55,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 727 transitions. [2023-08-26 21:17:55,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:55,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 727 transitions. [2023-08-26 21:17:55,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.85714285714286) internal successors, (727), 7 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:55,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:55,270 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:55,270 INFO L175 Difference]: Start difference. First operand has 79 places, 88 transitions, 825 flow. Second operand 7 states and 727 transitions. [2023-08-26 21:17:55,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 160 transitions, 1596 flow [2023-08-26 21:17:55,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 160 transitions, 1576 flow, removed 10 selfloop flow, removed 0 redundant places. [2023-08-26 21:17:55,360 INFO L231 Difference]: Finished difference. Result has 89 places, 96 transitions, 1056 flow [2023-08-26 21:17:55,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1056, PETRI_PLACES=89, PETRI_TRANSITIONS=96} [2023-08-26 21:17:55,362 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 48 predicate places. [2023-08-26 21:17:55,362 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 96 transitions, 1056 flow [2023-08-26 21:17:55,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:55,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:55,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:55,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:17:55,364 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:17:55,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:55,364 INFO L85 PathProgramCache]: Analyzing trace with hash -494609113, now seen corresponding path program 1 times [2023-08-26 21:17:55,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:55,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312355268] [2023-08-26 21:17:55,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:55,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:55,701 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:17:55,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:55,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312355268] [2023-08-26 21:17:55,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312355268] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:55,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:55,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:17:55,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987806712] [2023-08-26 21:17:55,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:55,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:17:55,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:55,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:17:55,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:17:55,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 226 [2023-08-26 21:17:55,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 96 transitions, 1056 flow. Second operand has 6 states, 6 states have (on average 96.5) internal successors, (579), 6 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:55,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:55,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 226 [2023-08-26 21:17:55,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:56,582 INFO L124 PetriNetUnfolderBase]: 2976/4580 cut-off events. [2023-08-26 21:17:56,582 INFO L125 PetriNetUnfolderBase]: For 44784/44833 co-relation queries the response was YES. [2023-08-26 21:17:56,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24024 conditions, 4580 events. 2976/4580 cut-off events. For 44784/44833 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 25393 event pairs, 1040 based on Foata normal form. 44/4551 useless extension candidates. Maximal degree in co-relation 23979. Up to 2741 conditions per place. [2023-08-26 21:17:56,628 INFO L140 encePairwiseOnDemand]: 216/226 looper letters, 106 selfloop transitions, 74 changer transitions 3/185 dead transitions. [2023-08-26 21:17:56,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 185 transitions, 2145 flow [2023-08-26 21:17:56,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 21:17:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 21:17:56,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 838 transitions. [2023-08-26 21:17:56,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46349557522123896 [2023-08-26 21:17:56,631 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 838 transitions. [2023-08-26 21:17:56,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 838 transitions. [2023-08-26 21:17:56,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:56,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 838 transitions. [2023-08-26 21:17:56,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 104.75) internal successors, (838), 8 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:56,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 226.0) internal successors, (2034), 9 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:56,637 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 226.0) internal successors, (2034), 9 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:56,637 INFO L175 Difference]: Start difference. First operand has 89 places, 96 transitions, 1056 flow. Second operand 8 states and 838 transitions. [2023-08-26 21:17:56,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 185 transitions, 2145 flow [2023-08-26 21:17:56,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 185 transitions, 2115 flow, removed 15 selfloop flow, removed 0 redundant places. [2023-08-26 21:17:56,737 INFO L231 Difference]: Finished difference. Result has 100 places, 134 transitions, 1751 flow [2023-08-26 21:17:56,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1751, PETRI_PLACES=100, PETRI_TRANSITIONS=134} [2023-08-26 21:17:56,738 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2023-08-26 21:17:56,738 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 134 transitions, 1751 flow [2023-08-26 21:17:56,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.5) internal successors, (579), 6 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:56,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:56,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:56,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:17:56,739 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:17:56,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:56,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1522975213, now seen corresponding path program 2 times [2023-08-26 21:17:56,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:56,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079297178] [2023-08-26 21:17:56,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:56,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:57,610 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:17:57,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:57,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079297178] [2023-08-26 21:17:57,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079297178] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:57,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:57,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:17:57,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28747698] [2023-08-26 21:17:57,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:57,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 21:17:57,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:57,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 21:17:57,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-26 21:17:57,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-08-26 21:17:57,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 134 transitions, 1751 flow. Second operand has 8 states, 8 states have (on average 85.875) internal successors, (687), 8 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:57,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:57,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-08-26 21:17:57,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:59,581 INFO L124 PetriNetUnfolderBase]: 6568/9536 cut-off events. [2023-08-26 21:17:59,581 INFO L125 PetriNetUnfolderBase]: For 132173/132173 co-relation queries the response was YES. [2023-08-26 21:17:59,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56165 conditions, 9536 events. 6568/9536 cut-off events. For 132173/132173 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 51769 event pairs, 727 based on Foata normal form. 71/9538 useless extension candidates. Maximal degree in co-relation 56114. Up to 3814 conditions per place. [2023-08-26 21:17:59,690 INFO L140 encePairwiseOnDemand]: 214/226 looper letters, 225 selfloop transitions, 110 changer transitions 3/338 dead transitions. [2023-08-26 21:17:59,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 338 transitions, 4263 flow [2023-08-26 21:17:59,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-26 21:17:59,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-26 21:17:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1331 transitions. [2023-08-26 21:17:59,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4206700379266751 [2023-08-26 21:17:59,694 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1331 transitions. [2023-08-26 21:17:59,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1331 transitions. [2023-08-26 21:17:59,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:59,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1331 transitions. [2023-08-26 21:17:59,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 95.07142857142857) internal successors, (1331), 14 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:59,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 226.0) internal successors, (3390), 15 states have internal predecessors, (3390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:59,703 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 226.0) internal successors, (3390), 15 states have internal predecessors, (3390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:59,703 INFO L175 Difference]: Start difference. First operand has 100 places, 134 transitions, 1751 flow. Second operand 14 states and 1331 transitions. [2023-08-26 21:17:59,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 338 transitions, 4263 flow [2023-08-26 21:18:00,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 338 transitions, 3998 flow, removed 109 selfloop flow, removed 2 redundant places. [2023-08-26 21:18:00,543 INFO L231 Difference]: Finished difference. Result has 120 places, 205 transitions, 2892 flow [2023-08-26 21:18:00,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=1647, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2892, PETRI_PLACES=120, PETRI_TRANSITIONS=205} [2023-08-26 21:18:00,544 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 79 predicate places. [2023-08-26 21:18:00,544 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 205 transitions, 2892 flow [2023-08-26 21:18:00,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 85.875) internal successors, (687), 8 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:00,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:18:00,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:18:00,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:18:00,545 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:18:00,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:18:00,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1511238137, now seen corresponding path program 3 times [2023-08-26 21:18:00,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:18:00,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357830770] [2023-08-26 21:18:00,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:18:00,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:18:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:18:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:18:00,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:18:00,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357830770] [2023-08-26 21:18:00,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357830770] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:18:00,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:18:00,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:18:00,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605340283] [2023-08-26 21:18:00,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:18:00,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:18:00,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:18:00,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:18:00,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:18:00,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 226 [2023-08-26 21:18:00,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 205 transitions, 2892 flow. Second operand has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:00,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:18:00,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 226 [2023-08-26 21:18:00,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:18:02,467 INFO L124 PetriNetUnfolderBase]: 4893/7511 cut-off events. [2023-08-26 21:18:02,467 INFO L125 PetriNetUnfolderBase]: For 127106/127212 co-relation queries the response was YES. [2023-08-26 21:18:02,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52081 conditions, 7511 events. 4893/7511 cut-off events. For 127106/127212 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 45574 event pairs, 528 based on Foata normal form. 110/7446 useless extension candidates. Maximal degree in co-relation 52021. Up to 3584 conditions per place. [2023-08-26 21:18:02,563 INFO L140 encePairwiseOnDemand]: 216/226 looper letters, 185 selfloop transitions, 109 changer transitions 3/301 dead transitions. [2023-08-26 21:18:02,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 301 transitions, 4261 flow [2023-08-26 21:18:02,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 21:18:02,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 21:18:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1035 transitions. [2023-08-26 21:18:02,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4579646017699115 [2023-08-26 21:18:02,568 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1035 transitions. [2023-08-26 21:18:02,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1035 transitions. [2023-08-26 21:18:02,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:18:02,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1035 transitions. [2023-08-26 21:18:02,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 103.5) internal successors, (1035), 10 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:02,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 226.0) internal successors, (2486), 11 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:02,575 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 226.0) internal successors, (2486), 11 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:02,575 INFO L175 Difference]: Start difference. First operand has 120 places, 205 transitions, 2892 flow. Second operand 10 states and 1035 transitions. [2023-08-26 21:18:02,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 301 transitions, 4261 flow [2023-08-26 21:18:03,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 301 transitions, 4167 flow, removed 47 selfloop flow, removed 0 redundant places. [2023-08-26 21:18:03,035 INFO L231 Difference]: Finished difference. Result has 132 places, 209 transitions, 3242 flow [2023-08-26 21:18:03,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=2810, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3242, PETRI_PLACES=132, PETRI_TRANSITIONS=209} [2023-08-26 21:18:03,035 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 91 predicate places. [2023-08-26 21:18:03,036 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 209 transitions, 3242 flow [2023-08-26 21:18:03,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:03,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:18:03,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:18:03,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:18:03,036 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:18:03,037 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:18:03,037 INFO L85 PathProgramCache]: Analyzing trace with hash 642273107, now seen corresponding path program 4 times [2023-08-26 21:18:03,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:18:03,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110123850] [2023-08-26 21:18:03,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:18:03,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:18:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:18:03,360 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:18:03,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:18:03,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110123850] [2023-08-26 21:18:03,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110123850] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:18:03,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:18:03,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:18:03,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211629639] [2023-08-26 21:18:03,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:18:03,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:18:03,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:18:03,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:18:03,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:18:03,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 226 [2023-08-26 21:18:03,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 209 transitions, 3242 flow. Second operand has 7 states, 7 states have (on average 94.14285714285714) internal successors, (659), 7 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:03,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:18:03,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 226 [2023-08-26 21:18:03,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:18:05,131 INFO L124 PetriNetUnfolderBase]: 5471/8418 cut-off events. [2023-08-26 21:18:05,131 INFO L125 PetriNetUnfolderBase]: For 181312/181414 co-relation queries the response was YES. [2023-08-26 21:18:05,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62990 conditions, 8418 events. 5471/8418 cut-off events. For 181312/181414 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 52133 event pairs, 532 based on Foata normal form. 122/8345 useless extension candidates. Maximal degree in co-relation 62925. Up to 3424 conditions per place. [2023-08-26 21:18:05,217 INFO L140 encePairwiseOnDemand]: 217/226 looper letters, 198 selfloop transitions, 159 changer transitions 3/364 dead transitions. [2023-08-26 21:18:05,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 364 transitions, 5792 flow [2023-08-26 21:18:05,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 21:18:05,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 21:18:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1028 transitions. [2023-08-26 21:18:05,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45486725663716815 [2023-08-26 21:18:05,220 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1028 transitions. [2023-08-26 21:18:05,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1028 transitions. [2023-08-26 21:18:05,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:18:05,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1028 transitions. [2023-08-26 21:18:05,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 102.8) internal successors, (1028), 10 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:05,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 226.0) internal successors, (2486), 11 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:05,227 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 226.0) internal successors, (2486), 11 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:05,227 INFO L175 Difference]: Start difference. First operand has 132 places, 209 transitions, 3242 flow. Second operand 10 states and 1028 transitions. [2023-08-26 21:18:05,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 364 transitions, 5792 flow [2023-08-26 21:18:05,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 364 transitions, 5591 flow, removed 16 selfloop flow, removed 7 redundant places. [2023-08-26 21:18:05,975 INFO L231 Difference]: Finished difference. Result has 141 places, 258 transitions, 4454 flow [2023-08-26 21:18:05,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=3075, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4454, PETRI_PLACES=141, PETRI_TRANSITIONS=258} [2023-08-26 21:18:05,976 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 100 predicate places. [2023-08-26 21:18:05,976 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 258 transitions, 4454 flow [2023-08-26 21:18:05,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.14285714285714) internal successors, (659), 7 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:05,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:18:05,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:18:05,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:18:05,977 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:18:05,977 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:18:05,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1950525569, now seen corresponding path program 1 times [2023-08-26 21:18:05,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:18:05,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514630814] [2023-08-26 21:18:05,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:18:05,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:18:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:18:06,105 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:18:06,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:18:06,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514630814] [2023-08-26 21:18:06,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514630814] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:18:06,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:18:06,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:18:06,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385520470] [2023-08-26 21:18:06,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:18:06,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:18:06,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:18:06,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:18:06,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:18:06,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 226 [2023-08-26 21:18:06,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 258 transitions, 4454 flow. Second operand has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:06,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:18:06,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 226 [2023-08-26 21:18:06,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:18:08,747 INFO L124 PetriNetUnfolderBase]: 9986/15086 cut-off events. [2023-08-26 21:18:08,748 INFO L125 PetriNetUnfolderBase]: For 437802/438615 co-relation queries the response was YES. [2023-08-26 21:18:08,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129912 conditions, 15086 events. 9986/15086 cut-off events. For 437802/438615 co-relation queries the response was YES. Maximal size of possible extension queue 940. Compared 99985 event pairs, 712 based on Foata normal form. 592/15420 useless extension candidates. Maximal degree in co-relation 129842. Up to 4394 conditions per place. [2023-08-26 21:18:08,910 INFO L140 encePairwiseOnDemand]: 221/226 looper letters, 487 selfloop transitions, 139 changer transitions 6/649 dead transitions. [2023-08-26 21:18:08,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 649 transitions, 11959 flow [2023-08-26 21:18:08,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:18:08,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:18:08,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 744 transitions. [2023-08-26 21:18:08,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47029077117572693 [2023-08-26 21:18:08,914 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 744 transitions. [2023-08-26 21:18:08,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 744 transitions. [2023-08-26 21:18:08,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:18:08,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 744 transitions. [2023-08-26 21:18:08,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.28571428571429) internal successors, (744), 7 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:08,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:08,919 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:08,919 INFO L175 Difference]: Start difference. First operand has 141 places, 258 transitions, 4454 flow. Second operand 7 states and 744 transitions. [2023-08-26 21:18:08,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 649 transitions, 11959 flow [2023-08-26 21:18:10,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 649 transitions, 11721 flow, removed 88 selfloop flow, removed 2 redundant places. [2023-08-26 21:18:10,538 INFO L231 Difference]: Finished difference. Result has 149 places, 363 transitions, 7633 flow [2023-08-26 21:18:10,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=4356, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7633, PETRI_PLACES=149, PETRI_TRANSITIONS=363} [2023-08-26 21:18:10,539 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 108 predicate places. [2023-08-26 21:18:10,539 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 363 transitions, 7633 flow [2023-08-26 21:18:10,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:10,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:18:10,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:18:10,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 21:18:10,540 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:18:10,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:18:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash -62358071, now seen corresponding path program 2 times [2023-08-26 21:18:10,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:18:10,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321362621] [2023-08-26 21:18:10,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:18:10,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:18:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:18:10,688 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:18:10,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:18:10,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321362621] [2023-08-26 21:18:10,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321362621] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:18:10,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:18:10,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:18:10,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21579964] [2023-08-26 21:18:10,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:18:10,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:18:10,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:18:10,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:18:10,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:18:10,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 226 [2023-08-26 21:18:10,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 363 transitions, 7633 flow. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:10,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:18:10,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 226 [2023-08-26 21:18:10,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:18:11,609 INFO L124 PetriNetUnfolderBase]: 2600/4344 cut-off events. [2023-08-26 21:18:11,612 INFO L125 PetriNetUnfolderBase]: For 141680/142050 co-relation queries the response was YES. [2023-08-26 21:18:11,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37175 conditions, 4344 events. 2600/4344 cut-off events. For 141680/142050 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 27213 event pairs, 337 based on Foata normal form. 527/4707 useless extension candidates. Maximal degree in co-relation 37102. Up to 3255 conditions per place. [2023-08-26 21:18:11,653 INFO L140 encePairwiseOnDemand]: 220/226 looper letters, 276 selfloop transitions, 8 changer transitions 3/301 dead transitions. [2023-08-26 21:18:11,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 301 transitions, 5931 flow [2023-08-26 21:18:11,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:18:11,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:18:11,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 539 transitions. [2023-08-26 21:18:11,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47699115044247786 [2023-08-26 21:18:11,656 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 539 transitions. [2023-08-26 21:18:11,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 539 transitions. [2023-08-26 21:18:11,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:18:11,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 539 transitions. [2023-08-26 21:18:11,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:11,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:11,661 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:11,661 INFO L175 Difference]: Start difference. First operand has 149 places, 363 transitions, 7633 flow. Second operand 5 states and 539 transitions. [2023-08-26 21:18:11,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 301 transitions, 5931 flow [2023-08-26 21:18:12,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 301 transitions, 5679 flow, removed 31 selfloop flow, removed 8 redundant places. [2023-08-26 21:18:12,006 INFO L231 Difference]: Finished difference. Result has 144 places, 224 transitions, 4183 flow [2023-08-26 21:18:12,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=4110, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4183, PETRI_PLACES=144, PETRI_TRANSITIONS=224} [2023-08-26 21:18:12,007 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 103 predicate places. [2023-08-26 21:18:12,007 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 224 transitions, 4183 flow [2023-08-26 21:18:12,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:12,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:18:12,007 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:18:12,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 21:18:12,008 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:18:12,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:18:12,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1419548605, now seen corresponding path program 1 times [2023-08-26 21:18:12,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:18:12,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995351927] [2023-08-26 21:18:12,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:18:12,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:18:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:18:12,193 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:18:12,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:18:12,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995351927] [2023-08-26 21:18:12,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995351927] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:18:12,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:18:12,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:18:12,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971330372] [2023-08-26 21:18:12,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:18:12,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:18:12,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:18:12,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:18:12,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:18:12,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 226 [2023-08-26 21:18:12,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 224 transitions, 4183 flow. Second operand has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:12,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:18:12,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 226 [2023-08-26 21:18:12,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:18:12,604 INFO L124 PetriNetUnfolderBase]: 1093/1921 cut-off events. [2023-08-26 21:18:12,605 INFO L125 PetriNetUnfolderBase]: For 38209/38515 co-relation queries the response was YES. [2023-08-26 21:18:12,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13332 conditions, 1921 events. 1093/1921 cut-off events. For 38209/38515 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10960 event pairs, 118 based on Foata normal form. 368/2200 useless extension candidates. Maximal degree in co-relation 13259. Up to 595 conditions per place. [2023-08-26 21:18:12,619 INFO L140 encePairwiseOnDemand]: 220/226 looper letters, 179 selfloop transitions, 15 changer transitions 3/209 dead transitions. [2023-08-26 21:18:12,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 209 transitions, 3410 flow [2023-08-26 21:18:12,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:18:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:18:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 752 transitions. [2023-08-26 21:18:12,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47534766118836913 [2023-08-26 21:18:12,622 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 752 transitions. [2023-08-26 21:18:12,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 752 transitions. [2023-08-26 21:18:12,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:18:12,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 752 transitions. [2023-08-26 21:18:12,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.42857142857143) internal successors, (752), 7 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:12,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:12,627 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:12,627 INFO L175 Difference]: Start difference. First operand has 144 places, 224 transitions, 4183 flow. Second operand 7 states and 752 transitions. [2023-08-26 21:18:12,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 209 transitions, 3410 flow [2023-08-26 21:18:12,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 209 transitions, 2977 flow, removed 45 selfloop flow, removed 20 redundant places. [2023-08-26 21:18:12,704 INFO L231 Difference]: Finished difference. Result has 128 places, 115 transitions, 1585 flow [2023-08-26 21:18:12,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=1508, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1585, PETRI_PLACES=128, PETRI_TRANSITIONS=115} [2023-08-26 21:18:12,705 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 87 predicate places. [2023-08-26 21:18:12,705 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 115 transitions, 1585 flow [2023-08-26 21:18:12,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:12,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:18:12,706 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:18:12,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 21:18:12,706 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:18:12,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:18:12,706 INFO L85 PathProgramCache]: Analyzing trace with hash -774491334, now seen corresponding path program 1 times [2023-08-26 21:18:12,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:18:12,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984789926] [2023-08-26 21:18:12,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:18:12,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:18:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:18:12,759 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:18:12,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:18:12,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984789926] [2023-08-26 21:18:12,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984789926] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:18:12,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:18:12,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:18:12,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076577252] [2023-08-26 21:18:12,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:18:12,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:18:12,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:18:12,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:18:12,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:18:12,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 226 [2023-08-26 21:18:12,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 115 transitions, 1585 flow. Second operand has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:12,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:18:12,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 226 [2023-08-26 21:18:12,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:18:13,081 INFO L124 PetriNetUnfolderBase]: 1052/1859 cut-off events. [2023-08-26 21:18:13,082 INFO L125 PetriNetUnfolderBase]: For 24714/24925 co-relation queries the response was YES. [2023-08-26 21:18:13,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12423 conditions, 1859 events. 1052/1859 cut-off events. For 24714/24925 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10555 event pairs, 228 based on Foata normal form. 158/1984 useless extension candidates. Maximal degree in co-relation 12361. Up to 698 conditions per place. [2023-08-26 21:18:13,092 INFO L140 encePairwiseOnDemand]: 219/226 looper letters, 77 selfloop transitions, 10 changer transitions 65/162 dead transitions. [2023-08-26 21:18:13,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 162 transitions, 2639 flow [2023-08-26 21:18:13,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:18:13,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:18:13,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 542 transitions. [2023-08-26 21:18:13,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.479646017699115 [2023-08-26 21:18:13,094 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 542 transitions. [2023-08-26 21:18:13,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 542 transitions. [2023-08-26 21:18:13,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:18:13,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 542 transitions. [2023-08-26 21:18:13,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:13,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:13,098 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:13,098 INFO L175 Difference]: Start difference. First operand has 128 places, 115 transitions, 1585 flow. Second operand 5 states and 542 transitions. [2023-08-26 21:18:13,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 162 transitions, 2639 flow [2023-08-26 21:18:13,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 162 transitions, 2612 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-26 21:18:13,144 INFO L231 Difference]: Finished difference. Result has 125 places, 62 transitions, 703 flow [2023-08-26 21:18:13,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=1540, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=703, PETRI_PLACES=125, PETRI_TRANSITIONS=62} [2023-08-26 21:18:13,145 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 84 predicate places. [2023-08-26 21:18:13,145 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 62 transitions, 703 flow [2023-08-26 21:18:13,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:13,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:18:13,146 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:18:13,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 21:18:13,146 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:18:13,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:18:13,146 INFO L85 PathProgramCache]: Analyzing trace with hash -924001043, now seen corresponding path program 1 times [2023-08-26 21:18:13,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:18:13,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744368033] [2023-08-26 21:18:13,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:18:13,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:18:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:18:13,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:18:13,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:18:13,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744368033] [2023-08-26 21:18:13,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744368033] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:18:13,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:18:13,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:18:13,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336681071] [2023-08-26 21:18:13,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:18:13,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:18:13,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:18:13,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:18:13,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:18:13,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 226 [2023-08-26 21:18:13,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 62 transitions, 703 flow. Second operand has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:13,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:18:13,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 226 [2023-08-26 21:18:13,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:18:13,662 INFO L124 PetriNetUnfolderBase]: 728/1240 cut-off events. [2023-08-26 21:18:13,662 INFO L125 PetriNetUnfolderBase]: For 15080/15267 co-relation queries the response was YES. [2023-08-26 21:18:13,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7601 conditions, 1240 events. 728/1240 cut-off events. For 15080/15267 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6714 event pairs, 78 based on Foata normal form. 173/1386 useless extension candidates. Maximal degree in co-relation 7542. Up to 423 conditions per place. [2023-08-26 21:18:13,672 INFO L140 encePairwiseOnDemand]: 220/226 looper letters, 55 selfloop transitions, 10 changer transitions 80/151 dead transitions. [2023-08-26 21:18:13,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 151 transitions, 1989 flow [2023-08-26 21:18:13,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:18:13,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:18:13,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 930 transitions. [2023-08-26 21:18:13,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45722713864306785 [2023-08-26 21:18:13,675 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 930 transitions. [2023-08-26 21:18:13,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 930 transitions. [2023-08-26 21:18:13,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:18:13,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 930 transitions. [2023-08-26 21:18:13,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 103.33333333333333) internal successors, (930), 9 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:13,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 226.0) internal successors, (2260), 10 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:13,694 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 226.0) internal successors, (2260), 10 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:13,694 INFO L175 Difference]: Start difference. First operand has 125 places, 62 transitions, 703 flow. Second operand 9 states and 930 transitions. [2023-08-26 21:18:13,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 151 transitions, 1989 flow [2023-08-26 21:18:13,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 151 transitions, 1414 flow, removed 94 selfloop flow, removed 33 redundant places. [2023-08-26 21:18:13,741 INFO L231 Difference]: Finished difference. Result has 82 places, 46 transitions, 360 flow [2023-08-26 21:18:13,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=360, PETRI_PLACES=82, PETRI_TRANSITIONS=46} [2023-08-26 21:18:13,742 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 41 predicate places. [2023-08-26 21:18:13,742 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 46 transitions, 360 flow [2023-08-26 21:18:13,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:13,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:18:13,742 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] [2023-08-26 21:18:13,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 21:18:13,742 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:18:13,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:18:13,743 INFO L85 PathProgramCache]: Analyzing trace with hash -851731371, now seen corresponding path program 1 times [2023-08-26 21:18:13,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:18:13,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839018793] [2023-08-26 21:18:13,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:18:13,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:18:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:18:14,096 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:18:14,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:18:14,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839018793] [2023-08-26 21:18:14,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839018793] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:18:14,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:18:14,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:18:14,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055500293] [2023-08-26 21:18:14,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:18:14,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:18:14,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:18:14,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:18:14,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:18:14,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 226 [2023-08-26 21:18:14,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 46 transitions, 360 flow. Second operand has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:14,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:18:14,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 226 [2023-08-26 21:18:14,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:18:14,368 INFO L124 PetriNetUnfolderBase]: 373/673 cut-off events. [2023-08-26 21:18:14,368 INFO L125 PetriNetUnfolderBase]: For 2987/2987 co-relation queries the response was YES. [2023-08-26 21:18:14,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3434 conditions, 673 events. 373/673 cut-off events. For 2987/2987 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2786 event pairs, 82 based on Foata normal form. 1/674 useless extension candidates. Maximal degree in co-relation 3401. Up to 434 conditions per place. [2023-08-26 21:18:14,372 INFO L140 encePairwiseOnDemand]: 218/226 looper letters, 42 selfloop transitions, 3 changer transitions 58/103 dead transitions. [2023-08-26 21:18:14,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 103 transitions, 975 flow [2023-08-26 21:18:14,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:18:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:18:14,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 635 transitions. [2023-08-26 21:18:14,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40139064475347663 [2023-08-26 21:18:14,374 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 635 transitions. [2023-08-26 21:18:14,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 635 transitions. [2023-08-26 21:18:14,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:18:14,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 635 transitions. [2023-08-26 21:18:14,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 90.71428571428571) internal successors, (635), 7 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:14,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:14,377 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:14,377 INFO L175 Difference]: Start difference. First operand has 82 places, 46 transitions, 360 flow. Second operand 7 states and 635 transitions. [2023-08-26 21:18:14,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 103 transitions, 975 flow [2023-08-26 21:18:14,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 103 transitions, 829 flow, removed 35 selfloop flow, removed 15 redundant places. [2023-08-26 21:18:14,386 INFO L231 Difference]: Finished difference. Result has 69 places, 35 transitions, 212 flow [2023-08-26 21:18:14,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=212, PETRI_PLACES=69, PETRI_TRANSITIONS=35} [2023-08-26 21:18:14,386 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2023-08-26 21:18:14,386 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 35 transitions, 212 flow [2023-08-26 21:18:14,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:14,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:18:14,387 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] [2023-08-26 21:18:14,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 21:18:14,387 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:18:14,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:18:14,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1080023413, now seen corresponding path program 2 times [2023-08-26 21:18:14,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:18:14,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060061759] [2023-08-26 21:18:14,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:18:14,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:18:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:18:14,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:18:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:18:14,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:18:14,479 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:18:14,480 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-26 21:18:14,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-08-26 21:18:14,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-26 21:18:14,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (14 of 18 remaining) [2023-08-26 21:18:14,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-26 21:18:14,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-08-26 21:18:14,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-26 21:18:14,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-26 21:18:14,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-26 21:18:14,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-26 21:18:14,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-26 21:18:14,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-08-26 21:18:14,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-26 21:18:14,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (4 of 18 remaining) [2023-08-26 21:18:14,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-26 21:18:14,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-08-26 21:18:14,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-26 21:18:14,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-26 21:18:14,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 21:18:14,484 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:18:14,489 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:18:14,489 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:18:14,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:18:14 BasicIcfg [2023-08-26 21:18:14,564 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:18:14,564 INFO L158 Benchmark]: Toolchain (without parser) took 32192.41ms. Allocated memory was 392.2MB in the beginning and 6.7GB in the end (delta: 6.3GB). Free memory was 366.7MB in the beginning and 6.0GB in the end (delta: -5.6GB). Peak memory consumption was 713.8MB. Max. memory is 16.0GB. [2023-08-26 21:18:14,565 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 392.2MB. Free memory was 369.9MB in the beginning and 369.7MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:18:14,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 572.39ms. Allocated memory is still 392.2MB. Free memory was 366.7MB in the beginning and 343.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:18:14,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.23ms. Allocated memory is still 392.2MB. Free memory was 343.6MB in the beginning and 340.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:18:14,565 INFO L158 Benchmark]: Boogie Preprocessor took 52.64ms. Allocated memory is still 392.2MB. Free memory was 340.8MB in the beginning and 338.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:18:14,565 INFO L158 Benchmark]: RCFGBuilder took 665.52ms. Allocated memory is still 392.2MB. Free memory was 338.7MB in the beginning and 298.9MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-08-26 21:18:14,566 INFO L158 Benchmark]: TraceAbstraction took 30827.95ms. Allocated memory was 392.2MB in the beginning and 6.7GB in the end (delta: 6.3GB). Free memory was 298.2MB in the beginning and 6.0GB in the end (delta: -5.7GB). Peak memory consumption was 646.7MB. Max. memory is 16.0GB. [2023-08-26 21:18:14,567 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.23ms. Allocated memory is still 392.2MB. Free memory was 369.9MB in the beginning and 369.7MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 572.39ms. Allocated memory is still 392.2MB. Free memory was 366.7MB in the beginning and 343.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 64.23ms. Allocated memory is still 392.2MB. Free memory was 343.6MB in the beginning and 340.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 52.64ms. Allocated memory is still 392.2MB. Free memory was 340.8MB in the beginning and 338.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 665.52ms. Allocated memory is still 392.2MB. Free memory was 338.7MB in the beginning and 298.9MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * TraceAbstraction took 30827.95ms. Allocated memory was 392.2MB in the beginning and 6.7GB in the end (delta: 6.3GB). Free memory was 298.2MB in the beginning and 6.0GB in the end (delta: -5.7GB). Peak memory consumption was 646.7MB. 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.8s, 126 PlacesBefore, 41 PlacesAfterwards, 119 TransitionsBefore, 32 TransitionsAfterwards, 2970 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 104 TotalNumberOfCompositions, 10794 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3936, independent: 3646, independent conditional: 0, independent unconditional: 3646, dependent: 290, dependent conditional: 0, dependent unconditional: 290, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1639, independent: 1596, independent conditional: 0, independent unconditional: 1596, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3936, independent: 2050, independent conditional: 0, independent unconditional: 2050, dependent: 247, dependent conditional: 0, dependent unconditional: 247, unknown: 1639, unknown conditional: 0, unknown unconditional: 1639] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 168, Positive conditional cache size: 0, Positive unconditional cache size: 168, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L830] 0 pthread_t t1019; [L831] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1019, ((void *)0), P0, ((void *)0))=-3, t1019={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L832] 0 pthread_t t1020; [L833] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1020, ((void *)0), P1, ((void *)0))=-2, t1019={5:0}, t1020={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L834] 0 pthread_t t1021; [L835] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1021, ((void *)0), P2, ((void *)0))=-1, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 2 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L776] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L799] 3 z = 1 [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L782] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L783] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L784] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L785] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L786] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L753] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L760] EXPR 1 __unbuffered_cnt + 1 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L789] EXPR 2 __unbuffered_cnt + 1 [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L815] EXPR 3 __unbuffered_cnt + 1 [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L839] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L839] RET 0 assume_abort_if_not(main$tmp_guard0) [L841] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L848] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L849] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L850] 0 x$flush_delayed = weak$$choice2 [L851] 0 x$mem_tmp = x [L852] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L853] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L854] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L855] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L856] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L858] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] 0 x = x$flush_delayed ? x$mem_tmp : x [L861] 0 x$flush_delayed = (_Bool)0 [L863] 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", "mix038_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 760]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 760]: 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: 789]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 789]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 831]: 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: 835]: 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: 833]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 156 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 30.6s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 874 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 874 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2717 IncrementalHoareTripleChecker+Invalid, 2837 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 45 mSDtfsCounter, 2717 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7633occurred in iteration=14, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 288 NumberOfCodeBlocks, 288 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 246 ConstructedInterpolants, 0 QuantifiedInterpolants, 2190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 21:18:14,588 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...