/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/mix037.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:17:24,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:17:24,186 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:24,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:17:24,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:17:24,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:17:24,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:17:24,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:17:24,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:17:24,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:17:24,223 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:17:24,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:17:24,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:17:24,224 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:17:24,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:17:24,224 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:17:24,224 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:17:24,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:17:24,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:17:24,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:17:24,225 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:17:24,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:17:24,225 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:17:24,226 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:17:24,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:17:24,226 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:17:24,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:17:24,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:17:24,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:17:24,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:17:24,227 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:17:24,227 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:17:24,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:17:24,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:17:24,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:17:24,228 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:24,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:17:24,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:17:24,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:17:24,511 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:17:24,511 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:17:24,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037.opt.i [2023-08-26 21:17:25,609 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:17:25,853 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:17:25,854 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037.opt.i [2023-08-26 21:17:25,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/738286421/2d01d03ec7384673b25a95152a4feb89/FLAG45d2dbd91 [2023-08-26 21:17:25,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/738286421/2d01d03ec7384673b25a95152a4feb89 [2023-08-26 21:17:25,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:17:25,876 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:17:25,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:17:25,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:17:25,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:17:25,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:17:25" (1/1) ... [2023-08-26 21:17:25,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c0f8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:25, skipping insertion in model container [2023-08-26 21:17:25,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:17:25" (1/1) ... [2023-08-26 21:17:25,913 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:17:26,141 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:17:26,156 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:17:26,181 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:17:26,183 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:17:26,219 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:17:26,248 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:17:26,249 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:17:26,253 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:17:26,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:26 WrapperNode [2023-08-26 21:17:26,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:17:26,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:17:26,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:17:26,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:17:26,260 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:26" (1/1) ... [2023-08-26 21:17:26,285 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:26" (1/1) ... [2023-08-26 21:17:26,320 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 160 [2023-08-26 21:17:26,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:17:26,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:17:26,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:17:26,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:17:26,328 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:26" (1/1) ... [2023-08-26 21:17:26,328 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:26" (1/1) ... [2023-08-26 21:17:26,340 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:26" (1/1) ... [2023-08-26 21:17:26,340 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:26" (1/1) ... [2023-08-26 21:17:26,355 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:26" (1/1) ... [2023-08-26 21:17:26,358 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:26" (1/1) ... [2023-08-26 21:17:26,359 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:26" (1/1) ... [2023-08-26 21:17:26,365 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:26" (1/1) ... [2023-08-26 21:17:26,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:17:26,367 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:17:26,367 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:17:26,368 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:17:26,368 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:26" (1/1) ... [2023-08-26 21:17:26,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:17:26,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:17:26,427 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:26,475 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:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:17:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:17:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:17:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:17:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:17:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:17:26,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:17:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:17:26,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:17:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:17:26,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:17:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 21:17:26,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 21:17:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:17:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:17:26,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:17:26,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:17:26,490 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:26,586 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:17:26,588 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:17:26,804 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:17:26,874 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:17:26,874 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:17:26,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:17:26 BoogieIcfgContainer [2023-08-26 21:17:26,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:17:26,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:17:26,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:17:26,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:17:26,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:17:25" (1/3) ... [2023-08-26 21:17:26,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d8e3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:17:26, skipping insertion in model container [2023-08-26 21:17:26,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:26" (2/3) ... [2023-08-26 21:17:26,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d8e3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:17:26, skipping insertion in model container [2023-08-26 21:17:26,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:17:26" (3/3) ... [2023-08-26 21:17:26,881 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037.opt.i [2023-08-26 21:17:26,895 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:17:26,895 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 21:17:26,896 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:17:26,935 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:17:26,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 142 transitions, 304 flow [2023-08-26 21:17:27,014 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-26 21:17:27,015 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:17:27,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 103 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-26 21:17:27,019 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 142 transitions, 304 flow [2023-08-26 21:17:27,026 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 138 transitions, 288 flow [2023-08-26 21:17:27,028 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:17:27,038 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-26 21:17:27,039 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-26 21:17:27,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 138 transitions, 288 flow [2023-08-26 21:17:27,060 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-26 21:17:27,061 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:17:27,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 105 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-26 21:17:27,065 INFO L119 LiptonReduction]: Number of co-enabled transitions 4152 [2023-08-26 21:17:30,130 INFO L134 LiptonReduction]: Checked pairs total: 14308 [2023-08-26 21:17:30,131 INFO L136 LiptonReduction]: Total number of compositions: 124 [2023-08-26 21:17:30,144 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:17:30,148 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;@1865be4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:17:30,148 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-26 21:17:30,165 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:17:30,165 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-26 21:17:30,165 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:17:30,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:30,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:17:30,166 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:30,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:30,169 INFO L85 PathProgramCache]: Analyzing trace with hash 578444082, now seen corresponding path program 1 times [2023-08-26 21:17:30,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:30,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872226881] [2023-08-26 21:17:30,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:30,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:30,347 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:30,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:30,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872226881] [2023-08-26 21:17:30,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872226881] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:30,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:30,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:17:30,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506718687] [2023-08-26 21:17:30,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:30,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:17:30,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:30,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:17:30,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:17:30,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-26 21:17:30,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call 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:30,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:30,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-26 21:17:30,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:31,348 INFO L124 PetriNetUnfolderBase]: 8703/11870 cut-off events. [2023-08-26 21:17:31,349 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-08-26 21:17:31,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23782 conditions, 11870 events. 8703/11870 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 65529 event pairs, 8703 based on Foata normal form. 0/8335 useless extension candidates. Maximal degree in co-relation 23770. Up to 11704 conditions per place. [2023-08-26 21:17:31,432 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 27 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-08-26 21:17:31,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 31 transitions, 130 flow [2023-08-26 21:17:31,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:17:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:17:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-08-26 21:17:31,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2023-08-26 21:17:31,445 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-08-26 21:17:31,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-08-26 21:17:31,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:31,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-08-26 21:17:31,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call 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:31,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call 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:31,455 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call 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:31,456 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 3 states and 378 transitions. [2023-08-26 21:17:31,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 31 transitions, 130 flow [2023-08-26 21:17:31,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 21:17:31,460 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 72 flow [2023-08-26 21:17:31,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-08-26 21:17:31,463 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places. [2023-08-26 21:17:31,463 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 72 flow [2023-08-26 21:17:31,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call 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:31,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:31,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:17:31,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:17:31,464 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:31,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:31,465 INFO L85 PathProgramCache]: Analyzing trace with hash 578444083, now seen corresponding path program 1 times [2023-08-26 21:17:31,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:31,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297487355] [2023-08-26 21:17:31,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:31,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:31,519 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:31,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:31,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297487355] [2023-08-26 21:17:31,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297487355] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:31,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:31,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:17:31,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49100608] [2023-08-26 21:17:31,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:31,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:17:31,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:31,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:17:31,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:17:31,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-26 21:17:31,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call 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:31,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:31,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-26 21:17:31,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:32,066 INFO L124 PetriNetUnfolderBase]: 5573/7762 cut-off events. [2023-08-26 21:17:32,066 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:17:32,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15642 conditions, 7762 events. 5573/7762 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 40541 event pairs, 1315 based on Foata normal form. 0/5823 useless extension candidates. Maximal degree in co-relation 15636. Up to 6667 conditions per place. [2023-08-26 21:17:32,108 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 45 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2023-08-26 21:17:32,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 53 transitions, 222 flow [2023-08-26 21:17:32,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:17:32,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:17:32,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2023-08-26 21:17:32,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-26 21:17:32,110 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2023-08-26 21:17:32,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2023-08-26 21:17:32,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:32,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2023-08-26 21:17:32,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call 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:32,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call 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:32,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call 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:32,113 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 72 flow. Second operand 3 states and 399 transitions. [2023-08-26 21:17:32,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 53 transitions, 222 flow [2023-08-26 21:17:32,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 221 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:17:32,115 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 110 flow [2023-08-26 21:17:32,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2023-08-26 21:17:32,115 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2023-08-26 21:17:32,116 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 110 flow [2023-08-26 21:17:32,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call 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:32,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:32,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:32,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:17:32,116 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P3Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:32,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:32,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1036328526, now seen corresponding path program 1 times [2023-08-26 21:17:32,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:32,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740662481] [2023-08-26 21:17:32,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:32,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:32,267 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:32,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:32,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740662481] [2023-08-26 21:17:32,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740662481] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:32,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:32,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:17:32,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817587076] [2023-08-26 21:17:32,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:32,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:17:32,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:32,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:17:32,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:17:32,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 266 [2023-08-26 21:17:32,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:32,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:32,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 266 [2023-08-26 21:17:32,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:32,795 INFO L124 PetriNetUnfolderBase]: 4789/6955 cut-off events. [2023-08-26 21:17:32,795 INFO L125 PetriNetUnfolderBase]: For 786/786 co-relation queries the response was YES. [2023-08-26 21:17:32,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16867 conditions, 6955 events. 4789/6955 cut-off events. For 786/786 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 40329 event pairs, 727 based on Foata normal form. 0/5478 useless extension candidates. Maximal degree in co-relation 16859. Up to 5489 conditions per place. [2023-08-26 21:17:32,870 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 46 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-08-26 21:17:32,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 259 flow [2023-08-26 21:17:32,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:17:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:17:32,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-08-26 21:17:32,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5037593984962406 [2023-08-26 21:17:32,872 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-08-26 21:17:32,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-08-26 21:17:32,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:32,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-08-26 21:17:32,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:32,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call 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:32,875 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call 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:32,875 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 110 flow. Second operand 3 states and 402 transitions. [2023-08-26 21:17:32,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 259 flow [2023-08-26 21:17:32,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 251 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:17:32,877 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 107 flow [2023-08-26 21:17:32,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-26 21:17:32,878 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2023-08-26 21:17:32,879 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 107 flow [2023-08-26 21:17:32,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:32,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:32,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:32,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:17:32,895 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:32,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:32,895 INFO L85 PathProgramCache]: Analyzing trace with hash -250424772, now seen corresponding path program 1 times [2023-08-26 21:17:32,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:32,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641194392] [2023-08-26 21:17:32,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:32,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:32,980 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:32,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:32,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641194392] [2023-08-26 21:17:32,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641194392] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:32,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:32,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:17:32,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281668828] [2023-08-26 21:17:32,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:32,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:17:32,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:32,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:17:32,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:17:32,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-26 21:17:32,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call 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:32,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:32,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-26 21:17:32,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:33,356 INFO L124 PetriNetUnfolderBase]: 2967/4213 cut-off events. [2023-08-26 21:17:33,356 INFO L125 PetriNetUnfolderBase]: For 573/573 co-relation queries the response was YES. [2023-08-26 21:17:33,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10100 conditions, 4213 events. 2967/4213 cut-off events. For 573/573 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 20034 event pairs, 638 based on Foata normal form. 0/3724 useless extension candidates. Maximal degree in co-relation 10091. Up to 1818 conditions per place. [2023-08-26 21:17:33,373 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 58 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2023-08-26 21:17:33,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 335 flow [2023-08-26 21:17:33,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:17:33,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:17:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 531 transitions. [2023-08-26 21:17:33,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49906015037593987 [2023-08-26 21:17:33,375 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 531 transitions. [2023-08-26 21:17:33,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 531 transitions. [2023-08-26 21:17:33,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:33,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 531 transitions. [2023-08-26 21:17:33,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call 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:33,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call 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:33,378 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call 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:33,378 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 107 flow. Second operand 4 states and 531 transitions. [2023-08-26 21:17:33,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 335 flow [2023-08-26 21:17:33,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 327 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:17:33,381 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 161 flow [2023-08-26 21:17:33,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-08-26 21:17:33,381 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2023-08-26 21:17:33,381 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 161 flow [2023-08-26 21:17:33,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call 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:33,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:33,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:33,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:17:33,382 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:33,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:33,383 INFO L85 PathProgramCache]: Analyzing trace with hash 520768043, now seen corresponding path program 1 times [2023-08-26 21:17:33,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:33,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441121385] [2023-08-26 21:17:33,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:33,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:33,544 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:33,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:33,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441121385] [2023-08-26 21:17:33,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441121385] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:33,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:33,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:17:33,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546445046] [2023-08-26 21:17:33,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:33,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:17:33,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:33,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:17:33,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:17:33,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 266 [2023-08-26 21:17:33,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:33,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:33,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 266 [2023-08-26 21:17:33,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:34,337 INFO L124 PetriNetUnfolderBase]: 9391/13144 cut-off events. [2023-08-26 21:17:34,338 INFO L125 PetriNetUnfolderBase]: For 10125/10125 co-relation queries the response was YES. [2023-08-26 21:17:34,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35594 conditions, 13144 events. 9391/13144 cut-off events. For 10125/10125 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 68400 event pairs, 3137 based on Foata normal form. 0/12156 useless extension candidates. Maximal degree in co-relation 35584. Up to 8725 conditions per place. [2023-08-26 21:17:34,403 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 63 selfloop transitions, 8 changer transitions 0/71 dead transitions. [2023-08-26 21:17:34,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 445 flow [2023-08-26 21:17:34,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:17:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:17:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2023-08-26 21:17:34,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48370927318295737 [2023-08-26 21:17:34,405 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2023-08-26 21:17:34,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2023-08-26 21:17:34,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:34,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2023-08-26 21:17:34,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:34,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call 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:34,407 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call 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:34,408 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 161 flow. Second operand 3 states and 386 transitions. [2023-08-26 21:17:34,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 445 flow [2023-08-26 21:17:34,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 71 transitions, 411 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-26 21:17:34,414 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 205 flow [2023-08-26 21:17:34,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2023-08-26 21:17:34,414 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2023-08-26 21:17:34,415 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 205 flow [2023-08-26 21:17:34,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:34,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:34,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:34,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:17:34,415 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:34,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:34,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1036062263, now seen corresponding path program 1 times [2023-08-26 21:17:34,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:34,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452672376] [2023-08-26 21:17:34,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:34,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:34,512 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:34,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:34,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452672376] [2023-08-26 21:17:34,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452672376] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:34,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:34,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:17:34,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287250744] [2023-08-26 21:17:34,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:34,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:17:34,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:34,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:17:34,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:17:34,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 266 [2023-08-26 21:17:34,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call 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:34,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:34,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 266 [2023-08-26 21:17:34,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:35,277 INFO L124 PetriNetUnfolderBase]: 8909/12482 cut-off events. [2023-08-26 21:17:35,277 INFO L125 PetriNetUnfolderBase]: For 9675/9675 co-relation queries the response was YES. [2023-08-26 21:17:35,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38469 conditions, 12482 events. 8909/12482 cut-off events. For 9675/9675 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 63425 event pairs, 2093 based on Foata normal form. 118/12044 useless extension candidates. Maximal degree in co-relation 38457. Up to 6100 conditions per place. [2023-08-26 21:17:35,321 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 83 selfloop transitions, 9 changer transitions 0/92 dead transitions. [2023-08-26 21:17:35,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 92 transitions, 611 flow [2023-08-26 21:17:35,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:17:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:17:35,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 505 transitions. [2023-08-26 21:17:35,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47462406015037595 [2023-08-26 21:17:35,323 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 505 transitions. [2023-08-26 21:17:35,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 505 transitions. [2023-08-26 21:17:35,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:35,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 505 transitions. [2023-08-26 21:17:35,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call 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:35,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call 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:35,326 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call 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:35,326 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 205 flow. Second operand 4 states and 505 transitions. [2023-08-26 21:17:35,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 92 transitions, 611 flow [2023-08-26 21:17:35,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 92 transitions, 585 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:17:35,349 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 257 flow [2023-08-26 21:17:35,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=257, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2023-08-26 21:17:35,350 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2023-08-26 21:17:35,350 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 257 flow [2023-08-26 21:17:35,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call 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:35,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:35,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:35,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:17:35,351 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:35,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:35,351 INFO L85 PathProgramCache]: Analyzing trace with hash -2101543255, now seen corresponding path program 1 times [2023-08-26 21:17:35,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:35,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491859276] [2023-08-26 21:17:35,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:35,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:35,453 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:35,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:35,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491859276] [2023-08-26 21:17:35,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491859276] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:35,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:35,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:17:35,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162725281] [2023-08-26 21:17:35,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:35,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:17:35,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:35,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:17:35,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:17:35,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 266 [2023-08-26 21:17:35,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 257 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:35,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:35,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 266 [2023-08-26 21:17:35,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:36,382 INFO L124 PetriNetUnfolderBase]: 8730/12236 cut-off events. [2023-08-26 21:17:36,382 INFO L125 PetriNetUnfolderBase]: For 12994/12994 co-relation queries the response was YES. [2023-08-26 21:17:36,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40006 conditions, 12236 events. 8730/12236 cut-off events. For 12994/12994 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 62973 event pairs, 1749 based on Foata normal form. 32/11715 useless extension candidates. Maximal degree in co-relation 39991. Up to 7549 conditions per place. [2023-08-26 21:17:36,424 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 89 selfloop transitions, 19 changer transitions 0/108 dead transitions. [2023-08-26 21:17:36,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 108 transitions, 735 flow [2023-08-26 21:17:36,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:17:36,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:17:36,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2023-08-26 21:17:36,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4849624060150376 [2023-08-26 21:17:36,426 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 516 transitions. [2023-08-26 21:17:36,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 516 transitions. [2023-08-26 21:17:36,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:36,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 516 transitions. [2023-08-26 21:17:36,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call 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:36,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call 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:36,428 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call 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:36,428 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 257 flow. Second operand 4 states and 516 transitions. [2023-08-26 21:17:36,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 108 transitions, 735 flow [2023-08-26 21:17:36,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 108 transitions, 730 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:17:36,445 INFO L231 Difference]: Finished difference. Result has 57 places, 62 transitions, 427 flow [2023-08-26 21:17:36,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=427, PETRI_PLACES=57, PETRI_TRANSITIONS=62} [2023-08-26 21:17:36,445 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2023-08-26 21:17:36,446 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 62 transitions, 427 flow [2023-08-26 21:17:36,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:36,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:36,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:36,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:17:36,446 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:36,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:36,446 INFO L85 PathProgramCache]: Analyzing trace with hash -723327367, now seen corresponding path program 1 times [2023-08-26 21:17:36,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:36,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13457985] [2023-08-26 21:17:36,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:36,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:36,566 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:36,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:36,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13457985] [2023-08-26 21:17:36,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13457985] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:36,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:36,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:17:36,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926479965] [2023-08-26 21:17:36,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:36,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:17:36,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:36,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:17:36,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:17:36,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 266 [2023-08-26 21:17:36,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 62 transitions, 427 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call 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:36,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:36,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 266 [2023-08-26 21:17:36,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:37,318 INFO L124 PetriNetUnfolderBase]: 6023/9026 cut-off events. [2023-08-26 21:17:37,318 INFO L125 PetriNetUnfolderBase]: For 17719/18827 co-relation queries the response was YES. [2023-08-26 21:17:37,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32103 conditions, 9026 events. 6023/9026 cut-off events. For 17719/18827 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 54393 event pairs, 1198 based on Foata normal form. 1045/9041 useless extension candidates. Maximal degree in co-relation 32084. Up to 6544 conditions per place. [2023-08-26 21:17:37,371 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 107 selfloop transitions, 10 changer transitions 0/129 dead transitions. [2023-08-26 21:17:37,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 129 transitions, 1079 flow [2023-08-26 21:17:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:17:37,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:17:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2023-08-26 21:17:37,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47969924812030074 [2023-08-26 21:17:37,372 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 638 transitions. [2023-08-26 21:17:37,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 638 transitions. [2023-08-26 21:17:37,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:37,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 638 transitions. [2023-08-26 21:17:37,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:37,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call 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:37,376 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call 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:37,376 INFO L175 Difference]: Start difference. First operand has 57 places, 62 transitions, 427 flow. Second operand 5 states and 638 transitions. [2023-08-26 21:17:37,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 129 transitions, 1079 flow [2023-08-26 21:17:37,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 129 transitions, 1079 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:17:37,406 INFO L231 Difference]: Finished difference. Result has 64 places, 67 transitions, 494 flow [2023-08-26 21:17:37,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=494, PETRI_PLACES=64, PETRI_TRANSITIONS=67} [2023-08-26 21:17:37,407 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2023-08-26 21:17:37,407 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 67 transitions, 494 flow [2023-08-26 21:17:37,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call 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:37,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:37,407 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:37,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:17:37,407 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:37,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:37,408 INFO L85 PathProgramCache]: Analyzing trace with hash 436004841, now seen corresponding path program 1 times [2023-08-26 21:17:37,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:37,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549908157] [2023-08-26 21:17:37,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:37,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:37,451 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:37,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:37,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549908157] [2023-08-26 21:17:37,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549908157] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:37,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:37,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:17:37,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434347920] [2023-08-26 21:17:37,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:37,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:17:37,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:37,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:17:37,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:17:37,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-26 21:17:37,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 67 transitions, 494 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call 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:37,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:37,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-26 21:17:37,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:38,120 INFO L124 PetriNetUnfolderBase]: 5127/7606 cut-off events. [2023-08-26 21:17:38,120 INFO L125 PetriNetUnfolderBase]: For 18840/19906 co-relation queries the response was YES. [2023-08-26 21:17:38,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28719 conditions, 7606 events. 5127/7606 cut-off events. For 18840/19906 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 44807 event pairs, 510 based on Foata normal form. 515/7725 useless extension candidates. Maximal degree in co-relation 28695. Up to 3080 conditions per place. [2023-08-26 21:17:38,156 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 106 selfloop transitions, 17 changer transitions 0/135 dead transitions. [2023-08-26 21:17:38,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 135 transitions, 1165 flow [2023-08-26 21:17:38,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:17:38,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:17:38,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2023-08-26 21:17:38,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49624060150375937 [2023-08-26 21:17:38,159 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 660 transitions. [2023-08-26 21:17:38,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 660 transitions. [2023-08-26 21:17:38,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:38,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 660 transitions. [2023-08-26 21:17:38,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:38,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call 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:38,163 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call 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:38,163 INFO L175 Difference]: Start difference. First operand has 64 places, 67 transitions, 494 flow. Second operand 5 states and 660 transitions. [2023-08-26 21:17:38,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 135 transitions, 1165 flow [2023-08-26 21:17:38,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 135 transitions, 1151 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:17:38,191 INFO L231 Difference]: Finished difference. Result has 67 places, 71 transitions, 562 flow [2023-08-26 21:17:38,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=562, PETRI_PLACES=67, PETRI_TRANSITIONS=71} [2023-08-26 21:17:38,192 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2023-08-26 21:17:38,192 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 71 transitions, 562 flow [2023-08-26 21:17:38,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call 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:38,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:38,193 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:17:38,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:17:38,193 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:38,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:38,193 INFO L85 PathProgramCache]: Analyzing trace with hash -963711394, now seen corresponding path program 1 times [2023-08-26 21:17:38,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:38,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230551014] [2023-08-26 21:17:38,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:38,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:38,282 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:38,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:38,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230551014] [2023-08-26 21:17:38,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230551014] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:38,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:38,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:17:38,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844778997] [2023-08-26 21:17:38,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:38,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:17:38,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:38,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:17:38,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:17:38,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 266 [2023-08-26 21:17:38,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 562 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:38,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:38,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 266 [2023-08-26 21:17:38,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:39,253 INFO L124 PetriNetUnfolderBase]: 8040/11747 cut-off events. [2023-08-26 21:17:39,253 INFO L125 PetriNetUnfolderBase]: For 38001/38001 co-relation queries the response was YES. [2023-08-26 21:17:39,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49078 conditions, 11747 events. 8040/11747 cut-off events. For 38001/38001 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 65699 event pairs, 1993 based on Foata normal form. 105/11776 useless extension candidates. Maximal degree in co-relation 49053. Up to 5847 conditions per place. [2023-08-26 21:17:39,329 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 114 selfloop transitions, 26 changer transitions 4/144 dead transitions. [2023-08-26 21:17:39,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 144 transitions, 1360 flow [2023-08-26 21:17:39,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:17:39,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:17:39,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 519 transitions. [2023-08-26 21:17:39,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48778195488721804 [2023-08-26 21:17:39,331 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 519 transitions. [2023-08-26 21:17:39,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 519 transitions. [2023-08-26 21:17:39,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:39,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 519 transitions. [2023-08-26 21:17:39,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:39,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call 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:39,334 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call 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:39,334 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 562 flow. Second operand 4 states and 519 transitions. [2023-08-26 21:17:39,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 144 transitions, 1360 flow [2023-08-26 21:17:39,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 144 transitions, 1254 flow, removed 24 selfloop flow, removed 3 redundant places. [2023-08-26 21:17:39,520 INFO L231 Difference]: Finished difference. Result has 70 places, 79 transitions, 731 flow [2023-08-26 21:17:39,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=731, PETRI_PLACES=70, PETRI_TRANSITIONS=79} [2023-08-26 21:17:39,520 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2023-08-26 21:17:39,520 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 79 transitions, 731 flow [2023-08-26 21:17:39,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:39,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:39,521 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:17:39,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:17:39,521 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:39,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:39,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1566561635, now seen corresponding path program 1 times [2023-08-26 21:17:39,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:39,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311745387] [2023-08-26 21:17:39,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:39,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:39,653 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:39,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:39,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311745387] [2023-08-26 21:17:39,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311745387] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:39,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:39,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:17:39,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701909747] [2023-08-26 21:17:39,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:39,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:17:39,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:39,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:17:39,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:17:39,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 266 [2023-08-26 21:17:39,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 79 transitions, 731 flow. Second operand has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call 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:39,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:39,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 266 [2023-08-26 21:17:39,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:40,466 INFO L124 PetriNetUnfolderBase]: 4492/7061 cut-off events. [2023-08-26 21:17:40,467 INFO L125 PetriNetUnfolderBase]: For 23244/24080 co-relation queries the response was YES. [2023-08-26 21:17:40,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28235 conditions, 7061 events. 4492/7061 cut-off events. For 23244/24080 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 44699 event pairs, 406 based on Foata normal form. 792/7500 useless extension candidates. Maximal degree in co-relation 28207. Up to 2582 conditions per place. [2023-08-26 21:17:40,521 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 134 selfloop transitions, 19 changer transitions 4/171 dead transitions. [2023-08-26 21:17:40,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 171 transitions, 1712 flow [2023-08-26 21:17:40,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:17:40,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:17:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 891 transitions. [2023-08-26 21:17:40,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47851772287862515 [2023-08-26 21:17:40,524 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 891 transitions. [2023-08-26 21:17:40,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 891 transitions. [2023-08-26 21:17:40,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:40,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 891 transitions. [2023-08-26 21:17:40,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call 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:40,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call 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:40,529 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call 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:40,529 INFO L175 Difference]: Start difference. First operand has 70 places, 79 transitions, 731 flow. Second operand 7 states and 891 transitions. [2023-08-26 21:17:40,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 171 transitions, 1712 flow [2023-08-26 21:17:40,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 171 transitions, 1696 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-08-26 21:17:40,664 INFO L231 Difference]: Finished difference. Result has 79 places, 81 transitions, 779 flow [2023-08-26 21:17:40,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=779, PETRI_PLACES=79, PETRI_TRANSITIONS=81} [2023-08-26 21:17:40,666 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 31 predicate places. [2023-08-26 21:17:40,666 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 81 transitions, 779 flow [2023-08-26 21:17:40,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call 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:40,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:40,667 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:17:40,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:17:40,667 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:40,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:40,668 INFO L85 PathProgramCache]: Analyzing trace with hash 263288524, now seen corresponding path program 1 times [2023-08-26 21:17:40,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:40,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063258784] [2023-08-26 21:17:40,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:40,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:40,837 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:40,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:40,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063258784] [2023-08-26 21:17:40,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063258784] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:40,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:40,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:17:40,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519073654] [2023-08-26 21:17:40,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:40,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:17:40,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:40,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:17:40,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:17:40,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 266 [2023-08-26 21:17:40,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 779 flow. Second operand has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call 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:40,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:40,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 266 [2023-08-26 21:17:40,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:41,506 INFO L124 PetriNetUnfolderBase]: 3769/5960 cut-off events. [2023-08-26 21:17:41,506 INFO L125 PetriNetUnfolderBase]: For 25129/26000 co-relation queries the response was YES. [2023-08-26 21:17:41,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26777 conditions, 5960 events. 3769/5960 cut-off events. For 25129/26000 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 37477 event pairs, 267 based on Foata normal form. 546/6187 useless extension candidates. Maximal degree in co-relation 26744. Up to 1526 conditions per place. [2023-08-26 21:17:41,554 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 145 selfloop transitions, 28 changer transitions 4/190 dead transitions. [2023-08-26 21:17:41,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 190 transitions, 1896 flow [2023-08-26 21:17:41,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:17:41,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:17:41,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1142 transitions. [2023-08-26 21:17:41,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47702589807852963 [2023-08-26 21:17:41,557 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1142 transitions. [2023-08-26 21:17:41,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1142 transitions. [2023-08-26 21:17:41,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:41,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1142 transitions. [2023-08-26 21:17:41,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 126.88888888888889) internal successors, (1142), 9 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call 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:41,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call 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:41,562 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call 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:41,562 INFO L175 Difference]: Start difference. First operand has 79 places, 81 transitions, 779 flow. Second operand 9 states and 1142 transitions. [2023-08-26 21:17:41,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 190 transitions, 1896 flow [2023-08-26 21:17:41,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 190 transitions, 1802 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-26 21:17:41,785 INFO L231 Difference]: Finished difference. Result has 85 places, 82 transitions, 770 flow [2023-08-26 21:17:41,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=770, PETRI_PLACES=85, PETRI_TRANSITIONS=82} [2023-08-26 21:17:41,785 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 37 predicate places. [2023-08-26 21:17:41,785 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 82 transitions, 770 flow [2023-08-26 21:17:41,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call 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:41,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:41,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:41,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:17:41,786 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:41,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:41,786 INFO L85 PathProgramCache]: Analyzing trace with hash -549448203, now seen corresponding path program 1 times [2023-08-26 21:17:41,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:41,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388530487] [2023-08-26 21:17:41,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:41,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:41,844 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:41,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:41,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388530487] [2023-08-26 21:17:41,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388530487] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:41,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:41,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:17:41,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778101249] [2023-08-26 21:17:41,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:41,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:17:41,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:41,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:17:41,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:17:41,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-26 21:17:41,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 82 transitions, 770 flow. Second operand has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call 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:41,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:41,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-26 21:17:41,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:42,392 INFO L124 PetriNetUnfolderBase]: 3669/5790 cut-off events. [2023-08-26 21:17:42,392 INFO L125 PetriNetUnfolderBase]: For 23894/24510 co-relation queries the response was YES. [2023-08-26 21:17:42,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27707 conditions, 5790 events. 3669/5790 cut-off events. For 23894/24510 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 36292 event pairs, 461 based on Foata normal form. 241/5804 useless extension candidates. Maximal degree in co-relation 27672. Up to 2047 conditions per place. [2023-08-26 21:17:42,427 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 77 selfloop transitions, 23 changer transitions 22/132 dead transitions. [2023-08-26 21:17:42,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 132 transitions, 1337 flow [2023-08-26 21:17:42,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:17:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:17:42,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions. [2023-08-26 21:17:42,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4818295739348371 [2023-08-26 21:17:42,429 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 769 transitions. [2023-08-26 21:17:42,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions. [2023-08-26 21:17:42,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:42,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions. [2023-08-26 21:17:42,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call 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:42,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call 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:42,433 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call 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:42,433 INFO L175 Difference]: Start difference. First operand has 85 places, 82 transitions, 770 flow. Second operand 6 states and 769 transitions. [2023-08-26 21:17:42,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 132 transitions, 1337 flow [2023-08-26 21:17:42,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 132 transitions, 1283 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-26 21:17:42,782 INFO L231 Difference]: Finished difference. Result has 80 places, 62 transitions, 550 flow [2023-08-26 21:17:42,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=550, PETRI_PLACES=80, PETRI_TRANSITIONS=62} [2023-08-26 21:17:42,782 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 32 predicate places. [2023-08-26 21:17:42,782 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 62 transitions, 550 flow [2023-08-26 21:17:42,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call 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:42,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:42,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:42,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:17:42,783 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:42,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:42,783 INFO L85 PathProgramCache]: Analyzing trace with hash 2134913337, now seen corresponding path program 1 times [2023-08-26 21:17:42,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:42,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40186871] [2023-08-26 21:17:42,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:42,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:42,884 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:42,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:42,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40186871] [2023-08-26 21:17:42,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40186871] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:42,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:42,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:17:42,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848299962] [2023-08-26 21:17:42,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:42,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:17:42,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:42,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:17:42,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:17:42,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-26 21:17:42,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 62 transitions, 550 flow. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 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:17:42,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:42,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-26 21:17:42,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:43,411 INFO L124 PetriNetUnfolderBase]: 4156/6684 cut-off events. [2023-08-26 21:17:43,411 INFO L125 PetriNetUnfolderBase]: For 26576/26843 co-relation queries the response was YES. [2023-08-26 21:17:43,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30141 conditions, 6684 events. 4156/6684 cut-off events. For 26576/26843 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 43729 event pairs, 506 based on Foata normal form. 130/6721 useless extension candidates. Maximal degree in co-relation 30106. Up to 3400 conditions per place. [2023-08-26 21:17:43,436 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 74 selfloop transitions, 2 changer transitions 51/134 dead transitions. [2023-08-26 21:17:43,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 134 transitions, 1413 flow [2023-08-26 21:17:43,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:17:43,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:17:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2023-08-26 21:17:43,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48402255639097747 [2023-08-26 21:17:43,461 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 515 transitions. [2023-08-26 21:17:43,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 515 transitions. [2023-08-26 21:17:43,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:43,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 515 transitions. [2023-08-26 21:17:43,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.75) internal successors, (515), 4 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:17:43,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call 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:43,463 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call 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:43,463 INFO L175 Difference]: Start difference. First operand has 80 places, 62 transitions, 550 flow. Second operand 4 states and 515 transitions. [2023-08-26 21:17:43,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 134 transitions, 1413 flow [2023-08-26 21:17:43,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 134 transitions, 1076 flow, removed 45 selfloop flow, removed 13 redundant places. [2023-08-26 21:17:43,685 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 358 flow [2023-08-26 21:17:43,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=358, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2023-08-26 21:17:43,686 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2023-08-26 21:17:43,686 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 358 flow [2023-08-26 21:17:43,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 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:17:43,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:43,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:43,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 21:17:43,687 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:43,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:43,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1124202009, now seen corresponding path program 2 times [2023-08-26 21:17:43,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:43,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583529961] [2023-08-26 21:17:43,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:43,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:43,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:17:43,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:43,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583529961] [2023-08-26 21:17:43,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583529961] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:43,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:43,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:17:43,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032840095] [2023-08-26 21:17:43,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:43,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:17:43,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:43,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:17:43,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:17:43,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 266 [2023-08-26 21:17:43,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 358 flow. Second operand has 7 states, 7 states have (on average 115.85714285714286) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call 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:43,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:43,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 266 [2023-08-26 21:17:43,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:44,401 INFO L124 PetriNetUnfolderBase]: 3265/5367 cut-off events. [2023-08-26 21:17:44,401 INFO L125 PetriNetUnfolderBase]: For 9887/10351 co-relation queries the response was YES. [2023-08-26 21:17:44,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19958 conditions, 5367 events. 3265/5367 cut-off events. For 9887/10351 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 35962 event pairs, 264 based on Foata normal form. 296/5455 useless extension candidates. Maximal degree in co-relation 19931. Up to 1459 conditions per place. [2023-08-26 21:17:44,416 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 76 selfloop transitions, 21 changer transitions 60/162 dead transitions. [2023-08-26 21:17:44,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 162 transitions, 1261 flow [2023-08-26 21:17:44,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 21:17:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 21:17:44,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1350 transitions. [2023-08-26 21:17:44,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4613807245386193 [2023-08-26 21:17:44,419 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1350 transitions. [2023-08-26 21:17:44,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1350 transitions. [2023-08-26 21:17:44,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:44,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1350 transitions. [2023-08-26 21:17:44,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 122.72727272727273) internal successors, (1350), 11 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call 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:44,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 266.0) internal successors, (3192), 12 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states have call 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:44,424 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 266.0) internal successors, (3192), 12 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states have call 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:44,424 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 358 flow. Second operand 11 states and 1350 transitions. [2023-08-26 21:17:44,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 162 transitions, 1261 flow [2023-08-26 21:17:44,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 162 transitions, 1226 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-26 21:17:44,534 INFO L231 Difference]: Finished difference. Result has 78 places, 47 transitions, 320 flow [2023-08-26 21:17:44,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=320, PETRI_PLACES=78, PETRI_TRANSITIONS=47} [2023-08-26 21:17:44,535 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 30 predicate places. [2023-08-26 21:17:44,535 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 47 transitions, 320 flow [2023-08-26 21:17:44,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.85714285714286) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call 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:44,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:44,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:44,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 21:17:44,536 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:44,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:44,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1913995216, now seen corresponding path program 1 times [2023-08-26 21:17:44,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:44,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396110835] [2023-08-26 21:17:44,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:44,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:44,680 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:44,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:44,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396110835] [2023-08-26 21:17:44,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396110835] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:44,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:44,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:17:44,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067068767] [2023-08-26 21:17:44,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:44,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:17:44,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:44,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:17:44,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:17:44,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 266 [2023-08-26 21:17:44,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 47 transitions, 320 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:44,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:44,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 266 [2023-08-26 21:17:44,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:44,876 INFO L124 PetriNetUnfolderBase]: 1252/2092 cut-off events. [2023-08-26 21:17:44,876 INFO L125 PetriNetUnfolderBase]: For 5743/5743 co-relation queries the response was YES. [2023-08-26 21:17:44,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8795 conditions, 2092 events. 1252/2092 cut-off events. For 5743/5743 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10923 event pairs, 215 based on Foata normal form. 1/2093 useless extension candidates. Maximal degree in co-relation 8770. Up to 1254 conditions per place. [2023-08-26 21:17:44,882 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 62 selfloop transitions, 13 changer transitions 27/102 dead transitions. [2023-08-26 21:17:44,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 102 transitions, 859 flow [2023-08-26 21:17:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:17:44,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:17:44,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2023-08-26 21:17:44,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45338345864661656 [2023-08-26 21:17:44,883 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 603 transitions. [2023-08-26 21:17:44,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 603 transitions. [2023-08-26 21:17:44,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:44,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 603 transitions. [2023-08-26 21:17:44,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call 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:44,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call 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:44,887 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call 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:44,887 INFO L175 Difference]: Start difference. First operand has 78 places, 47 transitions, 320 flow. Second operand 5 states and 603 transitions. [2023-08-26 21:17:44,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 102 transitions, 859 flow [2023-08-26 21:17:44,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 102 transitions, 731 flow, removed 7 selfloop flow, removed 13 redundant places. [2023-08-26 21:17:44,902 INFO L231 Difference]: Finished difference. Result has 68 places, 50 transitions, 318 flow [2023-08-26 21:17:44,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=318, PETRI_PLACES=68, PETRI_TRANSITIONS=50} [2023-08-26 21:17:44,903 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 20 predicate places. [2023-08-26 21:17:44,903 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 50 transitions, 318 flow [2023-08-26 21:17:44,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:44,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:44,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:44,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 21:17:44,903 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:44,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:44,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1547792108, now seen corresponding path program 2 times [2023-08-26 21:17:44,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:44,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254818689] [2023-08-26 21:17:44,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:44,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:45,126 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:45,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:45,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254818689] [2023-08-26 21:17:45,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254818689] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:45,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:45,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:17:45,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139940459] [2023-08-26 21:17:45,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:45,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:17:45,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:45,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:17:45,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:17:45,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-26 21:17:45,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 50 transitions, 318 flow. Second operand has 7 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call 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:45,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:45,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-26 21:17:45,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:45,319 INFO L124 PetriNetUnfolderBase]: 1060/1772 cut-off events. [2023-08-26 21:17:45,319 INFO L125 PetriNetUnfolderBase]: For 4405/4486 co-relation queries the response was YES. [2023-08-26 21:17:45,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7173 conditions, 1772 events. 1060/1772 cut-off events. For 4405/4486 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9150 event pairs, 258 based on Foata normal form. 56/1805 useless extension candidates. Maximal degree in co-relation 7150. Up to 891 conditions per place. [2023-08-26 21:17:45,324 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 58 selfloop transitions, 7 changer transitions 73/143 dead transitions. [2023-08-26 21:17:45,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 143 transitions, 1206 flow [2023-08-26 21:17:45,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:17:45,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:17:45,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 864 transitions. [2023-08-26 21:17:45,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4640171858216971 [2023-08-26 21:17:45,325 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 864 transitions. [2023-08-26 21:17:45,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 864 transitions. [2023-08-26 21:17:45,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:45,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 864 transitions. [2023-08-26 21:17:45,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.42857142857143) internal successors, (864), 7 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call 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:45,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call 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:45,329 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call 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:45,329 INFO L175 Difference]: Start difference. First operand has 68 places, 50 transitions, 318 flow. Second operand 7 states and 864 transitions. [2023-08-26 21:17:45,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 143 transitions, 1206 flow [2023-08-26 21:17:45,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 143 transitions, 1188 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-26 21:17:45,341 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 383 flow [2023-08-26 21:17:45,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=383, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2023-08-26 21:17:45,341 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2023-08-26 21:17:45,341 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 383 flow [2023-08-26 21:17:45,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call 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:45,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:45,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:45,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 21:17:45,342 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:45,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:45,342 INFO L85 PathProgramCache]: Analyzing trace with hash -99114364, now seen corresponding path program 3 times [2023-08-26 21:17:45,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:45,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011775235] [2023-08-26 21:17:45,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:45,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:45,475 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:45,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:45,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011775235] [2023-08-26 21:17:45,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011775235] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:45,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:45,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:17:45,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885363633] [2023-08-26 21:17:45,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:45,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:17:45,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:45,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:17:45,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:17:45,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 266 [2023-08-26 21:17:45,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 383 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call 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:45,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:45,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 266 [2023-08-26 21:17:45,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:45,674 INFO L124 PetriNetUnfolderBase]: 891/1499 cut-off events. [2023-08-26 21:17:45,674 INFO L125 PetriNetUnfolderBase]: For 3983/3983 co-relation queries the response was YES. [2023-08-26 21:17:45,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6520 conditions, 1499 events. 891/1499 cut-off events. For 3983/3983 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7178 event pairs, 154 based on Foata normal form. 1/1500 useless extension candidates. Maximal degree in co-relation 6495. Up to 679 conditions per place. [2023-08-26 21:17:45,678 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 41 selfloop transitions, 6 changer transitions 69/116 dead transitions. [2023-08-26 21:17:45,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 116 transitions, 947 flow [2023-08-26 21:17:45,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:17:45,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:17:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 716 transitions. [2023-08-26 21:17:45,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44862155388471175 [2023-08-26 21:17:45,679 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 716 transitions. [2023-08-26 21:17:45,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 716 transitions. [2023-08-26 21:17:45,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:45,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 716 transitions. [2023-08-26 21:17:45,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call 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:45,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call 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:45,683 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call 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:45,683 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 383 flow. Second operand 6 states and 716 transitions. [2023-08-26 21:17:45,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 116 transitions, 947 flow [2023-08-26 21:17:45,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 116 transitions, 941 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-26 21:17:45,693 INFO L231 Difference]: Finished difference. Result has 70 places, 41 transitions, 255 flow [2023-08-26 21:17:45,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=255, PETRI_PLACES=70, PETRI_TRANSITIONS=41} [2023-08-26 21:17:45,694 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2023-08-26 21:17:45,694 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 41 transitions, 255 flow [2023-08-26 21:17:45,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call 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:45,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:45,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:45,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 21:17:45,694 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:45,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:45,694 INFO L85 PathProgramCache]: Analyzing trace with hash 876638892, now seen corresponding path program 4 times [2023-08-26 21:17:45,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:45,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876793787] [2023-08-26 21:17:45,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:45,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:45,978 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:45,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:45,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876793787] [2023-08-26 21:17:45,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876793787] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:45,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:45,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:17:45,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389935632] [2023-08-26 21:17:45,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:45,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:17:45,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:45,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:17:45,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:17:45,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 266 [2023-08-26 21:17:45,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 41 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call 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:45,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:45,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 266 [2023-08-26 21:17:45,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:46,113 INFO L124 PetriNetUnfolderBase]: 241/459 cut-off events. [2023-08-26 21:17:46,113 INFO L125 PetriNetUnfolderBase]: For 1709/1709 co-relation queries the response was YES. [2023-08-26 21:17:46,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2132 conditions, 459 events. 241/459 cut-off events. For 1709/1709 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1886 event pairs, 16 based on Foata normal form. 1/460 useless extension candidates. Maximal degree in co-relation 2109. Up to 130 conditions per place. [2023-08-26 21:17:46,114 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 36 selfloop transitions, 6 changer transitions 56/98 dead transitions. [2023-08-26 21:17:46,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 98 transitions, 824 flow [2023-08-26 21:17:46,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:17:46,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:17:46,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 800 transitions. [2023-08-26 21:17:46,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4296455424274973 [2023-08-26 21:17:46,116 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 800 transitions. [2023-08-26 21:17:46,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 800 transitions. [2023-08-26 21:17:46,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:46,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 800 transitions. [2023-08-26 21:17:46,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call 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:46,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call 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:46,119 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call 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:46,119 INFO L175 Difference]: Start difference. First operand has 70 places, 41 transitions, 255 flow. Second operand 7 states and 800 transitions. [2023-08-26 21:17:46,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 98 transitions, 824 flow [2023-08-26 21:17:46,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 98 transitions, 728 flow, removed 2 selfloop flow, removed 16 redundant places. [2023-08-26 21:17:46,122 INFO L231 Difference]: Finished difference. Result has 61 places, 37 transitions, 205 flow [2023-08-26 21:17:46,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=205, PETRI_PLACES=61, PETRI_TRANSITIONS=37} [2023-08-26 21:17:46,122 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2023-08-26 21:17:46,123 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 37 transitions, 205 flow [2023-08-26 21:17:46,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call 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:46,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:46,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:46,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 21:17:46,123 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:46,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:46,123 INFO L85 PathProgramCache]: Analyzing trace with hash -43506648, now seen corresponding path program 5 times [2023-08-26 21:17:46,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:46,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224490603] [2023-08-26 21:17:46,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:46,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:17:46,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:17:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:17:46,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:17:46,187 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:17:46,188 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-26 21:17:46,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2023-08-26 21:17:46,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-26 21:17:46,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-26 21:17:46,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-26 21:17:46,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-26 21:17:46,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-26 21:17:46,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (15 of 23 remaining) [2023-08-26 21:17:46,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-26 21:17:46,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-26 21:17:46,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-26 21:17:46,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-26 21:17:46,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-26 21:17:46,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-26 21:17:46,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 23 remaining) [2023-08-26 21:17:46,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-26 21:17:46,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-26 21:17:46,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-26 21:17:46,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-26 21:17:46,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-26 21:17:46,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (2 of 23 remaining) [2023-08-26 21:17:46,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-26 21:17:46,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-26 21:17:46,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 21:17:46,194 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:46,197 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:17:46,197 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:17:46,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:17:46 BasicIcfg [2023-08-26 21:17:46,260 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:17:46,260 INFO L158 Benchmark]: Toolchain (without parser) took 20383.62ms. Allocated memory was 339.7MB in the beginning and 2.4GB in the end (delta: 2.0GB). Free memory was 315.0MB in the beginning and 1.1GB in the end (delta: -754.4MB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. [2023-08-26 21:17:46,260 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 339.7MB. Free memory is still 316.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:17:46,260 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.14ms. Allocated memory is still 339.7MB. Free memory was 314.6MB in the beginning and 291.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:17:46,260 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.57ms. Allocated memory is still 339.7MB. Free memory was 291.5MB in the beginning and 289.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:17:46,265 INFO L158 Benchmark]: Boogie Preprocessor took 45.99ms. Allocated memory is still 339.7MB. Free memory was 289.0MB in the beginning and 287.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:17:46,265 INFO L158 Benchmark]: RCFGBuilder took 508.59ms. Allocated memory is still 339.7MB. Free memory was 286.9MB in the beginning and 293.0MB in the end (delta: -6.1MB). Peak memory consumption was 18.5MB. Max. memory is 16.0GB. [2023-08-26 21:17:46,265 INFO L158 Benchmark]: TraceAbstraction took 19382.37ms. Allocated memory was 339.7MB in the beginning and 2.4GB in the end (delta: 2.0GB). Free memory was 292.7MB in the beginning and 1.1GB in the end (delta: -776.7MB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-08-26 21:17:46,266 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 339.7MB. Free memory is still 316.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 377.14ms. Allocated memory is still 339.7MB. Free memory was 314.6MB in the beginning and 291.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 65.57ms. Allocated memory is still 339.7MB. Free memory was 291.5MB in the beginning and 289.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 45.99ms. Allocated memory is still 339.7MB. Free memory was 289.0MB in the beginning and 287.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 508.59ms. Allocated memory is still 339.7MB. Free memory was 286.9MB in the beginning and 293.0MB in the end (delta: -6.1MB). Peak memory consumption was 18.5MB. Max. memory is 16.0GB. * TraceAbstraction took 19382.37ms. Allocated memory was 339.7MB in the beginning and 2.4GB in the end (delta: 2.0GB). Free memory was 292.7MB in the beginning and 1.1GB in the end (delta: -776.7MB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 148 PlacesBefore, 48 PlacesAfterwards, 138 TransitionsBefore, 36 TransitionsAfterwards, 4152 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 2 ChoiceCompositions, 124 TotalNumberOfCompositions, 14308 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5511, independent: 5182, independent conditional: 0, independent unconditional: 5182, dependent: 329, dependent conditional: 0, dependent unconditional: 329, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2395, independent: 2320, independent conditional: 0, independent unconditional: 2320, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5511, independent: 2862, independent conditional: 0, independent unconditional: 2862, dependent: 254, dependent conditional: 0, dependent unconditional: 254, unknown: 2395, unknown conditional: 0, unknown unconditional: 2395] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 213, Positive conditional cache size: 0, Positive unconditional cache size: 213, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L856] 0 pthread_t t973; [L857] FCALL, FORK 0 pthread_create(&t973, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t973, ((void *)0), P0, ((void *)0))=-2, t973={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t974; [L859] FCALL, FORK 0 pthread_create(&t974, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t974, ((void *)0), P1, ((void *)0))=-1, t973={5:0}, t974={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t975; [L861] FCALL, FORK 0 pthread_create(&t975, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t975, ((void *)0), P2, ((void *)0))=0, t973={5:0}, t974={6:0}, t975={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t976; [L863] FCALL, FORK 0 pthread_create(&t976, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t976, ((void *)0), P3, ((void *)0))=1, t973={5:0}, t974={6:0}, t975={7:0}, t976={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] EXPR 1 __unbuffered_cnt + 1 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] EXPR 2 __unbuffered_cnt + 1 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L805] EXPR 3 __unbuffered_cnt + 1 [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L841] EXPR 4 __unbuffered_cnt + 1 [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, t976={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 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", "mix037.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 762]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 805]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 805]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 861]: 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: 863]: 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: 859]: 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: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 184 locations, 23 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.2s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 710 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 710 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1863 IncrementalHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 35 mSDtfsCounter, 1863 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=779occurred in iteration=11, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 336 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 1595 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:17:46,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...