/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/mix017_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:13:24,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:13:24,184 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:13:24,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:13:24,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:13:24,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:13:24,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:13:24,230 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:13:24,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:13:24,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:13:24,232 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:13:24,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:13:24,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:13:24,233 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:13:24,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:13:24,233 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:13:24,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:13:24,234 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:13:24,234 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:13:24,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:13:24,235 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:13:24,239 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:13:24,239 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:13:24,240 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:13:24,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:13:24,243 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:13:24,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:13:24,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:13:24,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:13:24,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:13:24,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:13:24,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:13:24,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:13:24,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:13:24,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:13:24,247 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:13:24,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:13:24,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:13:24,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:13:24,610 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:13:24,611 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:13:24,613 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2023-08-26 21:13:25,774 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:13:25,994 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:13:25,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2023-08-26 21:13:26,010 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/755d0ff9a/2f3025aeacc84e2687d4249ef8780ced/FLAGb2c08ed1a [2023-08-26 21:13:26,023 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/755d0ff9a/2f3025aeacc84e2687d4249ef8780ced [2023-08-26 21:13:26,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:13:26,027 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:13:26,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:13:26,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:13:26,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:13:26,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:13:26" (1/1) ... [2023-08-26 21:13:26,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@536bc7c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:26, skipping insertion in model container [2023-08-26 21:13:26,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:13:26" (1/1) ... [2023-08-26 21:13:26,077 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:13:26,338 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:13:26,346 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:13:26,364 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:13:26,366 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:13:26,425 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:13:26,464 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:13:26,464 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:13:26,470 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:13:26,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:26 WrapperNode [2023-08-26 21:13:26,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:13:26,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:13:26,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:13:26,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:13:26,478 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:13:26" (1/1) ... [2023-08-26 21:13:26,509 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:13:26" (1/1) ... [2023-08-26 21:13:26,550 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 154 [2023-08-26 21:13:26,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:13:26,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:13:26,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:13:26,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:13:26,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:26" (1/1) ... [2023-08-26 21:13:26,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:26" (1/1) ... [2023-08-26 21:13:26,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:26" (1/1) ... [2023-08-26 21:13:26,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:26" (1/1) ... [2023-08-26 21:13:26,578 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:26" (1/1) ... [2023-08-26 21:13:26,580 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:26" (1/1) ... [2023-08-26 21:13:26,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:26" (1/1) ... [2023-08-26 21:13:26,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:26" (1/1) ... [2023-08-26 21:13:26,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:13:26,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:13:26,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:13:26,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:13:26,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:26" (1/1) ... [2023-08-26 21:13:26,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:13:26,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:13:26,669 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:13:26,671 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:13:26,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:13:26,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:13:26,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:13:26,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:13:26,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:13:26,704 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:13:26,705 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:13:26,705 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:13:26,705 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:13:26,705 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:13:26,705 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:13:26,705 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 21:13:26,705 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 21:13:26,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:13:26,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:13:26,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:13:26,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:13:26,709 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:13:26,866 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:13:26,868 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:13:27,136 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:13:27,283 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:13:27,283 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:13:27,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:13:27 BoogieIcfgContainer [2023-08-26 21:13:27,287 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:13:27,291 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:13:27,291 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:13:27,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:13:27,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:13:26" (1/3) ... [2023-08-26 21:13:27,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bb9bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:13:27, skipping insertion in model container [2023-08-26 21:13:27,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:26" (2/3) ... [2023-08-26 21:13:27,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bb9bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:13:27, skipping insertion in model container [2023-08-26 21:13:27,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:13:27" (3/3) ... [2023-08-26 21:13:27,296 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_power.opt_rmo.opt.i [2023-08-26 21:13:27,311 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:13:27,312 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 21:13:27,313 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:13:27,387 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:13:27,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 142 transitions, 304 flow [2023-08-26 21:13:27,500 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-26 21:13:27,500 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:13:27,505 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 107 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:13:27,505 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 142 transitions, 304 flow [2023-08-26 21:13:27,512 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 138 transitions, 288 flow [2023-08-26 21:13:27,515 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:13:27,531 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-26 21:13:27,533 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-26 21:13:27,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 138 transitions, 288 flow [2023-08-26 21:13:27,575 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-26 21:13:27,575 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:13:27,576 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 107 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:13:27,578 INFO L119 LiptonReduction]: Number of co-enabled transitions 4188 [2023-08-26 21:13:31,472 INFO L134 LiptonReduction]: Checked pairs total: 14988 [2023-08-26 21:13:31,473 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-26 21:13:31,486 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:13:31,493 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;@215bbab3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:13:31,493 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-26 21:13:31,496 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:13:31,496 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-26 21:13:31,496 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:13:31,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:31,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:13:31,497 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:13:31,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:31,502 INFO L85 PathProgramCache]: Analyzing trace with hash 580328827, now seen corresponding path program 1 times [2023-08-26 21:13:31,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:31,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134874378] [2023-08-26 21:13:31,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:31,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:31,804 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:13:31,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:31,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134874378] [2023-08-26 21:13:31,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134874378] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:31,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:31,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:13:31,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714733653] [2023-08-26 21:13:31,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:31,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:13:31,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:31,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:13:31,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:13:31,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 258 [2023-08-26 21:13:31,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:31,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:31,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 258 [2023-08-26 21:13:31,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:33,598 INFO L124 PetriNetUnfolderBase]: 11501/15563 cut-off events. [2023-08-26 21:13:33,599 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2023-08-26 21:13:33,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31249 conditions, 15563 events. 11501/15563 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 787. Compared 85241 event pairs, 11501 based on Foata normal form. 0/10954 useless extension candidates. Maximal degree in co-relation 31237. Up to 15390 conditions per place. [2023-08-26 21:13:33,729 INFO L140 encePairwiseOnDemand]: 252/258 looper letters, 28 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-08-26 21:13:33,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 33 transitions, 136 flow [2023-08-26 21:13:33,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:13:33,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:13:33,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-08-26 21:13:33,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48578811369509045 [2023-08-26 21:13:33,741 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-08-26 21:13:33,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-08-26 21:13:33,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:33,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-08-26 21:13:33,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:33,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:33,754 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:33,756 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 3 states and 376 transitions. [2023-08-26 21:13:33,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 33 transitions, 136 flow [2023-08-26 21:13:33,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 21:13:33,765 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 76 flow [2023-08-26 21:13:33,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2023-08-26 21:13:33,770 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2023-08-26 21:13:33,771 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 76 flow [2023-08-26 21:13:33,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:33,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:33,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:13:33,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:13:33,772 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:13:33,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:33,773 INFO L85 PathProgramCache]: Analyzing trace with hash 580328828, now seen corresponding path program 1 times [2023-08-26 21:13:33,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:33,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127504197] [2023-08-26 21:13:33,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:33,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:33,859 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:13:33,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:33,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127504197] [2023-08-26 21:13:33,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127504197] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:33,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:33,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:13:33,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78433891] [2023-08-26 21:13:33,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:33,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:13:33,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:33,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:13:33,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:13:33,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 258 [2023-08-26 21:13:33,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:33,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:33,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 258 [2023-08-26 21:13:33,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:34,983 INFO L124 PetriNetUnfolderBase]: 7395/10245 cut-off events. [2023-08-26 21:13:34,984 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:13:35,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20643 conditions, 10245 events. 7395/10245 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 55522 event pairs, 1851 based on Foata normal form. 0/7772 useless extension candidates. Maximal degree in co-relation 20637. Up to 8541 conditions per place. [2023-08-26 21:13:35,044 INFO L140 encePairwiseOnDemand]: 249/258 looper letters, 47 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2023-08-26 21:13:35,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 232 flow [2023-08-26 21:13:35,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:13:35,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:13:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-08-26 21:13:35,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142118863049095 [2023-08-26 21:13:35,050 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-08-26 21:13:35,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-08-26 21:13:35,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:35,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-08-26 21:13:35,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:35,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:35,056 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:35,056 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 76 flow. Second operand 3 states and 398 transitions. [2023-08-26 21:13:35,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 232 flow [2023-08-26 21:13:35,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 231 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:13:35,058 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 114 flow [2023-08-26 21:13:35,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2023-08-26 21:13:35,059 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-26 21:13:35,059 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 114 flow [2023-08-26 21:13:35,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:35,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:35,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:35,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:13:35,060 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:35,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:35,061 INFO L85 PathProgramCache]: Analyzing trace with hash -610579647, now seen corresponding path program 1 times [2023-08-26 21:13:35,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:35,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411014747] [2023-08-26 21:13:35,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:35,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:35,186 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:13:35,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:35,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411014747] [2023-08-26 21:13:35,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411014747] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:35,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:35,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:13:35,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202716703] [2023-08-26 21:13:35,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:35,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:13:35,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:35,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:13:35,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:13:35,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 258 [2023-08-26 21:13:35,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:35,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:35,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 258 [2023-08-26 21:13:35,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:35,929 INFO L124 PetriNetUnfolderBase]: 6109/8713 cut-off events. [2023-08-26 21:13:35,930 INFO L125 PetriNetUnfolderBase]: For 635/635 co-relation queries the response was YES. [2023-08-26 21:13:35,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21143 conditions, 8713 events. 6109/8713 cut-off events. For 635/635 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 48729 event pairs, 1443 based on Foata normal form. 0/6952 useless extension candidates. Maximal degree in co-relation 21135. Up to 7093 conditions per place. [2023-08-26 21:13:35,995 INFO L140 encePairwiseOnDemand]: 255/258 looper letters, 51 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-26 21:13:35,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 283 flow [2023-08-26 21:13:35,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:13:35,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:13:35,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2023-08-26 21:13:35,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5219638242894057 [2023-08-26 21:13:35,997 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2023-08-26 21:13:35,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2023-08-26 21:13:35,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:35,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2023-08-26 21:13:35,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:36,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:36,000 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:36,000 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 114 flow. Second operand 3 states and 404 transitions. [2023-08-26 21:13:36,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 283 flow [2023-08-26 21:13:36,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:13:36,004 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 111 flow [2023-08-26 21:13:36,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-26 21:13:36,005 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-26 21:13:36,006 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 111 flow [2023-08-26 21:13:36,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:36,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:36,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:36,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:13:36,009 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:13:36,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:36,010 INFO L85 PathProgramCache]: Analyzing trace with hash -149504027, now seen corresponding path program 1 times [2023-08-26 21:13:36,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:36,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806160379] [2023-08-26 21:13:36,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:36,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:36,116 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:13:36,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:36,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806160379] [2023-08-26 21:13:36,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806160379] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:36,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:36,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:13:36,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405027120] [2023-08-26 21:13:36,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:36,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:13:36,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:36,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:13:36,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:13:36,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 258 [2023-08-26 21:13:36,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:36,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:36,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 258 [2023-08-26 21:13:36,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:36,669 INFO L124 PetriNetUnfolderBase]: 3870/5456 cut-off events. [2023-08-26 21:13:36,670 INFO L125 PetriNetUnfolderBase]: For 836/836 co-relation queries the response was YES. [2023-08-26 21:13:36,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13056 conditions, 5456 events. 3870/5456 cut-off events. For 836/836 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 27670 event pairs, 905 based on Foata normal form. 0/4859 useless extension candidates. Maximal degree in co-relation 13047. Up to 2223 conditions per place. [2023-08-26 21:13:36,711 INFO L140 encePairwiseOnDemand]: 249/258 looper letters, 61 selfloop transitions, 9 changer transitions 0/74 dead transitions. [2023-08-26 21:13:36,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 74 transitions, 349 flow [2023-08-26 21:13:36,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:13:36,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:13:36,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2023-08-26 21:13:36,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135658914728682 [2023-08-26 21:13:36,714 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2023-08-26 21:13:36,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2023-08-26 21:13:36,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:36,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2023-08-26 21:13:36,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:36,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:36,719 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:36,719 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 111 flow. Second operand 4 states and 530 transitions. [2023-08-26 21:13:36,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 74 transitions, 349 flow [2023-08-26 21:13:36,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 74 transitions, 341 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:13:36,722 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 165 flow [2023-08-26 21:13:36,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-26 21:13:36,723 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-26 21:13:36,723 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 165 flow [2023-08-26 21:13:36,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:36,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:36,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:36,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:13:36,724 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:13:36,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:36,725 INFO L85 PathProgramCache]: Analyzing trace with hash 753850472, now seen corresponding path program 1 times [2023-08-26 21:13:36,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:36,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893499386] [2023-08-26 21:13:36,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:36,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:36,876 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:13:36,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:36,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893499386] [2023-08-26 21:13:36,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893499386] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:36,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:36,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:13:36,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400556000] [2023-08-26 21:13:36,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:36,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:13:36,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:36,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:13:36,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:13:36,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 258 [2023-08-26 21:13:36,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 165 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:36,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:36,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 258 [2023-08-26 21:13:36,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:37,468 INFO L124 PetriNetUnfolderBase]: 4935/7080 cut-off events. [2023-08-26 21:13:37,469 INFO L125 PetriNetUnfolderBase]: For 5781/5781 co-relation queries the response was YES. [2023-08-26 21:13:37,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19030 conditions, 7080 events. 4935/7080 cut-off events. For 5781/5781 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 37742 event pairs, 1148 based on Foata normal form. 0/6526 useless extension candidates. Maximal degree in co-relation 19020. Up to 3310 conditions per place. [2023-08-26 21:13:37,517 INFO L140 encePairwiseOnDemand]: 253/258 looper letters, 95 selfloop transitions, 5 changer transitions 0/103 dead transitions. [2023-08-26 21:13:37,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 103 transitions, 671 flow [2023-08-26 21:13:37,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:13:37,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:13:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 639 transitions. [2023-08-26 21:13:37,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49534883720930234 [2023-08-26 21:13:37,520 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 639 transitions. [2023-08-26 21:13:37,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 639 transitions. [2023-08-26 21:13:37,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:37,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 639 transitions. [2023-08-26 21:13:37,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:37,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:37,525 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:37,525 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 165 flow. Second operand 5 states and 639 transitions. [2023-08-26 21:13:37,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 103 transitions, 671 flow [2023-08-26 21:13:37,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 103 transitions, 613 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-08-26 21:13:37,532 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 181 flow [2023-08-26 21:13:37,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-26 21:13:37,533 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-08-26 21:13:37,533 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 181 flow [2023-08-26 21:13:37,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:37,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:37,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:37,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:13:37,534 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:13:37,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:37,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1279874477, now seen corresponding path program 1 times [2023-08-26 21:13:37,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:37,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020215026] [2023-08-26 21:13:37,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:37,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:37,697 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:13:37,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:37,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020215026] [2023-08-26 21:13:37,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020215026] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:37,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:37,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:13:37,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025554354] [2023-08-26 21:13:37,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:37,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:13:37,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:37,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:13:37,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:13:37,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 258 [2023-08-26 21:13:37,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:37,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:37,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 258 [2023-08-26 21:13:37,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:38,214 INFO L124 PetriNetUnfolderBase]: 3537/5276 cut-off events. [2023-08-26 21:13:38,214 INFO L125 PetriNetUnfolderBase]: For 2475/2476 co-relation queries the response was YES. [2023-08-26 21:13:38,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14457 conditions, 5276 events. 3537/5276 cut-off events. For 2475/2476 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 28955 event pairs, 776 based on Foata normal form. 236/5054 useless extension candidates. Maximal degree in co-relation 14443. Up to 4209 conditions per place. [2023-08-26 21:13:38,246 INFO L140 encePairwiseOnDemand]: 251/258 looper letters, 72 selfloop transitions, 10 changer transitions 0/87 dead transitions. [2023-08-26 21:13:38,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 87 transitions, 495 flow [2023-08-26 21:13:38,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:13:38,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:13:38,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2023-08-26 21:13:38,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49147286821705427 [2023-08-26 21:13:38,249 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2023-08-26 21:13:38,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2023-08-26 21:13:38,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:38,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2023-08-26 21:13:38,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:38,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:38,253 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:38,253 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 181 flow. Second operand 5 states and 634 transitions. [2023-08-26 21:13:38,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 87 transitions, 495 flow [2023-08-26 21:13:38,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 87 transitions, 495 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:13:38,272 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 248 flow [2023-08-26 21:13:38,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=248, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2023-08-26 21:13:38,273 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2023-08-26 21:13:38,273 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 248 flow [2023-08-26 21:13:38,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:38,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:38,274 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:13:38,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:13:38,274 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:38,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:38,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1316259411, now seen corresponding path program 1 times [2023-08-26 21:13:38,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:38,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685201129] [2023-08-26 21:13:38,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:38,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:38,341 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:13:38,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:38,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685201129] [2023-08-26 21:13:38,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685201129] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:38,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:38,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:13:38,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067335972] [2023-08-26 21:13:38,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:38,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:13:38,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:38,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:13:38,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:13:38,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 258 [2023-08-26 21:13:38,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 248 flow. Second operand has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:38,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:38,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 258 [2023-08-26 21:13:38,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:38,825 INFO L124 PetriNetUnfolderBase]: 2991/4399 cut-off events. [2023-08-26 21:13:38,825 INFO L125 PetriNetUnfolderBase]: For 3107/3108 co-relation queries the response was YES. [2023-08-26 21:13:38,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12519 conditions, 4399 events. 2991/4399 cut-off events. For 3107/3108 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 23499 event pairs, 299 based on Foata normal form. 1/4287 useless extension candidates. Maximal degree in co-relation 12500. Up to 1919 conditions per place. [2023-08-26 21:13:38,847 INFO L140 encePairwiseOnDemand]: 249/258 looper letters, 77 selfloop transitions, 17 changer transitions 0/99 dead transitions. [2023-08-26 21:13:38,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 99 transitions, 610 flow [2023-08-26 21:13:38,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:13:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:13:38,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 658 transitions. [2023-08-26 21:13:38,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5100775193798449 [2023-08-26 21:13:38,850 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 658 transitions. [2023-08-26 21:13:38,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 658 transitions. [2023-08-26 21:13:38,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:38,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 658 transitions. [2023-08-26 21:13:38,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:38,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:38,855 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:38,855 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 248 flow. Second operand 5 states and 658 transitions. [2023-08-26 21:13:38,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 99 transitions, 610 flow [2023-08-26 21:13:38,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 99 transitions, 596 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:13:38,871 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 316 flow [2023-08-26 21:13:38,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2023-08-26 21:13:38,872 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2023-08-26 21:13:38,873 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 316 flow [2023-08-26 21:13:38,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:38,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:38,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:38,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:13:38,873 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:13:38,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:38,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1602015276, now seen corresponding path program 1 times [2023-08-26 21:13:38,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:38,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459303534] [2023-08-26 21:13:38,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:38,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:38,993 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:13:38,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:38,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459303534] [2023-08-26 21:13:38,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459303534] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:38,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:38,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:13:38,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456837569] [2023-08-26 21:13:38,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:38,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:13:38,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:38,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:13:38,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:13:38,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 258 [2023-08-26 21:13:38,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:38,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:38,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 258 [2023-08-26 21:13:38,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:39,372 INFO L124 PetriNetUnfolderBase]: 1895/2953 cut-off events. [2023-08-26 21:13:39,372 INFO L125 PetriNetUnfolderBase]: For 4044/4044 co-relation queries the response was YES. [2023-08-26 21:13:39,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9662 conditions, 2953 events. 1895/2953 cut-off events. For 4044/4044 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 15553 event pairs, 246 based on Foata normal form. 142/3022 useless extension candidates. Maximal degree in co-relation 9642. Up to 1175 conditions per place. [2023-08-26 21:13:39,387 INFO L140 encePairwiseOnDemand]: 251/258 looper letters, 86 selfloop transitions, 19 changer transitions 4/114 dead transitions. [2023-08-26 21:13:39,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 114 transitions, 766 flow [2023-08-26 21:13:39,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:13:39,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:13:39,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 885 transitions. [2023-08-26 21:13:39,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4900332225913621 [2023-08-26 21:13:39,391 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 885 transitions. [2023-08-26 21:13:39,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 885 transitions. [2023-08-26 21:13:39,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:39,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 885 transitions. [2023-08-26 21:13:39,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.42857142857143) internal successors, (885), 7 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:39,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:39,397 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:39,397 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 316 flow. Second operand 7 states and 885 transitions. [2023-08-26 21:13:39,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 114 transitions, 766 flow [2023-08-26 21:13:39,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 114 transitions, 700 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-26 21:13:39,426 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 368 flow [2023-08-26 21:13:39,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=368, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2023-08-26 21:13:39,427 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 20 predicate places. [2023-08-26 21:13:39,427 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 368 flow [2023-08-26 21:13:39,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:39,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:39,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:39,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:13:39,428 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:39,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:39,428 INFO L85 PathProgramCache]: Analyzing trace with hash -486084750, now seen corresponding path program 1 times [2023-08-26 21:13:39,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:39,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654572407] [2023-08-26 21:13:39,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:39,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:39,589 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:13:39,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:39,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654572407] [2023-08-26 21:13:39,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654572407] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:39,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:39,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:13:39,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278064505] [2023-08-26 21:13:39,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:39,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:13:39,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:39,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:13:39,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:13:39,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 258 [2023-08-26 21:13:39,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 368 flow. Second operand has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:39,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:39,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 258 [2023-08-26 21:13:39,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:40,320 INFO L124 PetriNetUnfolderBase]: 3482/5397 cut-off events. [2023-08-26 21:13:40,321 INFO L125 PetriNetUnfolderBase]: For 10038/10039 co-relation queries the response was YES. [2023-08-26 21:13:40,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18092 conditions, 5397 events. 3482/5397 cut-off events. For 10038/10039 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 32180 event pairs, 426 based on Foata normal form. 37/5292 useless extension candidates. Maximal degree in co-relation 18069. Up to 2719 conditions per place. [2023-08-26 21:13:40,354 INFO L140 encePairwiseOnDemand]: 253/258 looper letters, 161 selfloop transitions, 12 changer transitions 8/185 dead transitions. [2023-08-26 21:13:40,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 185 transitions, 1491 flow [2023-08-26 21:13:40,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:13:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:13:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 886 transitions. [2023-08-26 21:13:40,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49058693244739754 [2023-08-26 21:13:40,358 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 886 transitions. [2023-08-26 21:13:40,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 886 transitions. [2023-08-26 21:13:40,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:40,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 886 transitions. [2023-08-26 21:13:40,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.57142857142857) internal successors, (886), 7 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:40,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:40,364 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:40,364 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 368 flow. Second operand 7 states and 886 transitions. [2023-08-26 21:13:40,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 185 transitions, 1491 flow [2023-08-26 21:13:40,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 185 transitions, 1400 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-26 21:13:40,448 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 436 flow [2023-08-26 21:13:40,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=436, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2023-08-26 21:13:40,449 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 26 predicate places. [2023-08-26 21:13:40,449 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 436 flow [2023-08-26 21:13:40,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:40,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:40,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:40,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:13:40,450 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:13:40,450 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:40,450 INFO L85 PathProgramCache]: Analyzing trace with hash 127582268, now seen corresponding path program 2 times [2023-08-26 21:13:40,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:40,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312621414] [2023-08-26 21:13:40,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:40,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:40,604 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:13:40,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:40,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312621414] [2023-08-26 21:13:40,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312621414] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:40,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:40,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:13:40,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545383423] [2023-08-26 21:13:40,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:40,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:13:40,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:40,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:13:40,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:13:40,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 258 [2023-08-26 21:13:40,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 436 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:40,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:40,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 258 [2023-08-26 21:13:40,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:41,101 INFO L124 PetriNetUnfolderBase]: 2249/3572 cut-off events. [2023-08-26 21:13:41,101 INFO L125 PetriNetUnfolderBase]: For 5736/5736 co-relation queries the response was YES. [2023-08-26 21:13:41,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12153 conditions, 3572 events. 2249/3572 cut-off events. For 5736/5736 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 20338 event pairs, 259 based on Foata normal form. 104/3495 useless extension candidates. Maximal degree in co-relation 12127. Up to 676 conditions per place. [2023-08-26 21:13:41,118 INFO L140 encePairwiseOnDemand]: 251/258 looper letters, 101 selfloop transitions, 28 changer transitions 4/140 dead transitions. [2023-08-26 21:13:41,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 140 transitions, 929 flow [2023-08-26 21:13:41,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:13:41,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:13:41,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1134 transitions. [2023-08-26 21:13:41,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883720930232558 [2023-08-26 21:13:41,122 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1134 transitions. [2023-08-26 21:13:41,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1134 transitions. [2023-08-26 21:13:41,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:41,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1134 transitions. [2023-08-26 21:13:41,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 126.0) internal successors, (1134), 9 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:41,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 258.0) internal successors, (2580), 10 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:41,129 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 258.0) internal successors, (2580), 10 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:41,129 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 436 flow. Second operand 9 states and 1134 transitions. [2023-08-26 21:13:41,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 140 transitions, 929 flow [2023-08-26 21:13:41,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 140 transitions, 929 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:13:41,222 INFO L231 Difference]: Finished difference. Result has 87 places, 71 transitions, 528 flow [2023-08-26 21:13:41,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=528, PETRI_PLACES=87, PETRI_TRANSITIONS=71} [2023-08-26 21:13:41,222 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 37 predicate places. [2023-08-26 21:13:41,223 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 71 transitions, 528 flow [2023-08-26 21:13:41,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:41,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:41,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:41,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:13:41,223 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:41,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:41,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1479021551, now seen corresponding path program 1 times [2023-08-26 21:13:41,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:41,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862528592] [2023-08-26 21:13:41,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:41,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:41,312 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:13:41,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:41,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862528592] [2023-08-26 21:13:41,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862528592] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:41,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:41,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:13:41,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888769946] [2023-08-26 21:13:41,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:41,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:13:41,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:41,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:13:41,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:13:41,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 258 [2023-08-26 21:13:41,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 71 transitions, 528 flow. Second operand has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:41,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:41,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 258 [2023-08-26 21:13:41,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:41,686 INFO L124 PetriNetUnfolderBase]: 2209/3460 cut-off events. [2023-08-26 21:13:41,686 INFO L125 PetriNetUnfolderBase]: For 7606/7606 co-relation queries the response was YES. [2023-08-26 21:13:41,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13338 conditions, 3460 events. 2209/3460 cut-off events. For 7606/7606 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 19466 event pairs, 389 based on Foata normal form. 0/3311 useless extension candidates. Maximal degree in co-relation 13307. Up to 1260 conditions per place. [2023-08-26 21:13:41,702 INFO L140 encePairwiseOnDemand]: 249/258 looper letters, 55 selfloop transitions, 17 changer transitions 33/110 dead transitions. [2023-08-26 21:13:41,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 110 transitions, 875 flow [2023-08-26 21:13:41,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:13:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:13:41,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 765 transitions. [2023-08-26 21:13:41,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4941860465116279 [2023-08-26 21:13:41,704 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 765 transitions. [2023-08-26 21:13:41,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 765 transitions. [2023-08-26 21:13:41,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:41,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 765 transitions. [2023-08-26 21:13:41,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:41,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 258.0) internal successors, (1806), 7 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:41,709 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 258.0) internal successors, (1806), 7 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:41,709 INFO L175 Difference]: Start difference. First operand has 87 places, 71 transitions, 528 flow. Second operand 6 states and 765 transitions. [2023-08-26 21:13:41,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 110 transitions, 875 flow [2023-08-26 21:13:41,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 110 transitions, 821 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-26 21:13:41,844 INFO L231 Difference]: Finished difference. Result has 82 places, 40 transitions, 257 flow [2023-08-26 21:13:41,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=257, PETRI_PLACES=82, PETRI_TRANSITIONS=40} [2023-08-26 21:13:41,844 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 32 predicate places. [2023-08-26 21:13:41,844 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 40 transitions, 257 flow [2023-08-26 21:13:41,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:41,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:41,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:41,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:13:41,845 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:13:41,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:41,846 INFO L85 PathProgramCache]: Analyzing trace with hash 717072653, now seen corresponding path program 1 times [2023-08-26 21:13:41,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:41,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353771561] [2023-08-26 21:13:41,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:41,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:42,044 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:13:42,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:42,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353771561] [2023-08-26 21:13:42,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353771561] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:42,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:42,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:13:42,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446674795] [2023-08-26 21:13:42,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:42,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:13:42,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:42,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:13:42,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:13:42,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 258 [2023-08-26 21:13:42,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 40 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:42,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:42,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 258 [2023-08-26 21:13:42,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:42,494 INFO L124 PetriNetUnfolderBase]: 2519/3880 cut-off events. [2023-08-26 21:13:42,494 INFO L125 PetriNetUnfolderBase]: For 10799/10799 co-relation queries the response was YES. [2023-08-26 21:13:42,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14236 conditions, 3880 events. 2519/3880 cut-off events. For 10799/10799 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 19181 event pairs, 567 based on Foata normal form. 18/3898 useless extension candidates. Maximal degree in co-relation 14205. Up to 2641 conditions per place. [2023-08-26 21:13:42,510 INFO L140 encePairwiseOnDemand]: 249/258 looper letters, 99 selfloop transitions, 11 changer transitions 20/130 dead transitions. [2023-08-26 21:13:42,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 130 transitions, 1040 flow [2023-08-26 21:13:42,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:13:42,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:13:42,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 828 transitions. [2023-08-26 21:13:42,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4584717607973422 [2023-08-26 21:13:42,513 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 828 transitions. [2023-08-26 21:13:42,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 828 transitions. [2023-08-26 21:13:42,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:42,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 828 transitions. [2023-08-26 21:13:42,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:42,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:42,518 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:42,518 INFO L175 Difference]: Start difference. First operand has 82 places, 40 transitions, 257 flow. Second operand 7 states and 828 transitions. [2023-08-26 21:13:42,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 130 transitions, 1040 flow [2023-08-26 21:13:42,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 130 transitions, 744 flow, removed 74 selfloop flow, removed 21 redundant places. [2023-08-26 21:13:42,560 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 250 flow [2023-08-26 21:13:42,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=250, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-08-26 21:13:42,560 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2023-08-26 21:13:42,561 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 250 flow [2023-08-26 21:13:42,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:42,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:42,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:42,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:13:42,561 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:13:42,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:42,562 INFO L85 PathProgramCache]: Analyzing trace with hash -983850431, now seen corresponding path program 2 times [2023-08-26 21:13:42,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:42,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874772030] [2023-08-26 21:13:42,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:42,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:42,755 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:13:42,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:42,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874772030] [2023-08-26 21:13:42,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874772030] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:42,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:42,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:13:42,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422200226] [2023-08-26 21:13:42,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:42,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:13:42,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:42,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:13:42,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:13:42,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 258 [2023-08-26 21:13:42,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 250 flow. Second operand has 6 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:42,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:42,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 258 [2023-08-26 21:13:42,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:43,251 INFO L124 PetriNetUnfolderBase]: 2885/4512 cut-off events. [2023-08-26 21:13:43,252 INFO L125 PetriNetUnfolderBase]: For 7698/7698 co-relation queries the response was YES. [2023-08-26 21:13:43,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16117 conditions, 4512 events. 2885/4512 cut-off events. For 7698/7698 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 23536 event pairs, 611 based on Foata normal form. 14/4526 useless extension candidates. Maximal degree in co-relation 16098. Up to 2366 conditions per place. [2023-08-26 21:13:43,272 INFO L140 encePairwiseOnDemand]: 249/258 looper letters, 83 selfloop transitions, 10 changer transitions 41/134 dead transitions. [2023-08-26 21:13:43,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 134 transitions, 906 flow [2023-08-26 21:13:43,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:13:43,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:13:43,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 828 transitions. [2023-08-26 21:13:43,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4584717607973422 [2023-08-26 21:13:43,274 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 828 transitions. [2023-08-26 21:13:43,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 828 transitions. [2023-08-26 21:13:43,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:43,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 828 transitions. [2023-08-26 21:13:43,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:43,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:43,280 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:43,280 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 250 flow. Second operand 7 states and 828 transitions. [2023-08-26 21:13:43,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 134 transitions, 906 flow [2023-08-26 21:13:43,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 134 transitions, 900 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-26 21:13:43,322 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 267 flow [2023-08-26 21:13:43,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=267, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2023-08-26 21:13:43,323 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2023-08-26 21:13:43,323 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 267 flow [2023-08-26 21:13:43,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:43,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:43,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:43,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:13:43,324 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:13:43,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:43,324 INFO L85 PathProgramCache]: Analyzing trace with hash -596806753, now seen corresponding path program 3 times [2023-08-26 21:13:43,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:43,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764627462] [2023-08-26 21:13:43,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:43,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:43,507 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:13:43,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:43,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764627462] [2023-08-26 21:13:43,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764627462] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:43,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:43,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:13:43,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105352149] [2023-08-26 21:13:43,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:43,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:13:43,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:43,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:13:43,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:13:43,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 258 [2023-08-26 21:13:43,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 48 transitions, 267 flow. Second operand has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:43,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:43,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 258 [2023-08-26 21:13:43,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:43,901 INFO L124 PetriNetUnfolderBase]: 1656/2735 cut-off events. [2023-08-26 21:13:43,901 INFO L125 PetriNetUnfolderBase]: For 4324/4435 co-relation queries the response was YES. [2023-08-26 21:13:43,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9395 conditions, 2735 events. 1656/2735 cut-off events. For 4324/4435 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 15569 event pairs, 298 based on Foata normal form. 75/2696 useless extension candidates. Maximal degree in co-relation 9375. Up to 1022 conditions per place. [2023-08-26 21:13:43,912 INFO L140 encePairwiseOnDemand]: 251/258 looper letters, 39 selfloop transitions, 18 changer transitions 30/93 dead transitions. [2023-08-26 21:13:43,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 93 transitions, 595 flow [2023-08-26 21:13:43,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 21:13:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 21:13:43,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 978 transitions. [2023-08-26 21:13:43,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738372093023256 [2023-08-26 21:13:43,915 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 978 transitions. [2023-08-26 21:13:43,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 978 transitions. [2023-08-26 21:13:43,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:43,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 978 transitions. [2023-08-26 21:13:43,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.25) internal successors, (978), 8 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:43,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:43,921 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:43,921 INFO L175 Difference]: Start difference. First operand has 65 places, 48 transitions, 267 flow. Second operand 8 states and 978 transitions. [2023-08-26 21:13:43,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 93 transitions, 595 flow [2023-08-26 21:13:43,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 93 transitions, 554 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-08-26 21:13:43,963 INFO L231 Difference]: Finished difference. Result has 67 places, 42 transitions, 247 flow [2023-08-26 21:13:43,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=247, PETRI_PLACES=67, PETRI_TRANSITIONS=42} [2023-08-26 21:13:43,964 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 17 predicate places. [2023-08-26 21:13:43,964 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 42 transitions, 247 flow [2023-08-26 21:13:43,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:43,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:43,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:43,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 21:13:43,964 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:13:43,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:43,965 INFO L85 PathProgramCache]: Analyzing trace with hash -299260109, now seen corresponding path program 1 times [2023-08-26 21:13:43,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:43,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471435648] [2023-08-26 21:13:43,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:43,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:44,367 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:13:44,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:44,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471435648] [2023-08-26 21:13:44,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471435648] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:44,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:44,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:13:44,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163151987] [2023-08-26 21:13:44,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:44,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:13:44,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:44,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:13:44,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:13:44,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 258 [2023-08-26 21:13:44,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 42 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:44,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:44,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 258 [2023-08-26 21:13:44,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:44,668 INFO L124 PetriNetUnfolderBase]: 1141/1979 cut-off events. [2023-08-26 21:13:44,668 INFO L125 PetriNetUnfolderBase]: For 4721/4745 co-relation queries the response was YES. [2023-08-26 21:13:44,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7710 conditions, 1979 events. 1141/1979 cut-off events. For 4721/4745 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11002 event pairs, 203 based on Foata normal form. 2/1905 useless extension candidates. Maximal degree in co-relation 7688. Up to 854 conditions per place. [2023-08-26 21:13:44,675 INFO L140 encePairwiseOnDemand]: 251/258 looper letters, 71 selfloop transitions, 6 changer transitions 48/131 dead transitions. [2023-08-26 21:13:44,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 131 transitions, 1107 flow [2023-08-26 21:13:44,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:13:44,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:13:44,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 838 transitions. [2023-08-26 21:13:44,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4640088593576966 [2023-08-26 21:13:44,678 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 838 transitions. [2023-08-26 21:13:44,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 838 transitions. [2023-08-26 21:13:44,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:44,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 838 transitions. [2023-08-26 21:13:44,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:44,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:44,683 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:44,683 INFO L175 Difference]: Start difference. First operand has 67 places, 42 transitions, 247 flow. Second operand 7 states and 838 transitions. [2023-08-26 21:13:44,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 131 transitions, 1107 flow [2023-08-26 21:13:44,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 131 transitions, 905 flow, removed 27 selfloop flow, removed 8 redundant places. [2023-08-26 21:13:44,708 INFO L231 Difference]: Finished difference. Result has 66 places, 47 transitions, 248 flow [2023-08-26 21:13:44,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=66, PETRI_TRANSITIONS=47} [2023-08-26 21:13:44,709 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2023-08-26 21:13:44,709 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 47 transitions, 248 flow [2023-08-26 21:13:44,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:44,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:44,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:44,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 21:13:44,710 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:13:44,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:44,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1954255949, now seen corresponding path program 2 times [2023-08-26 21:13:44,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:44,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179691744] [2023-08-26 21:13:44,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:44,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:44,904 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:13:44,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:44,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179691744] [2023-08-26 21:13:44,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179691744] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:44,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:44,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:13:44,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758431853] [2023-08-26 21:13:44,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:44,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:13:44,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:44,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:13:44,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:13:44,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 258 [2023-08-26 21:13:44,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 47 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:44,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:44,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 258 [2023-08-26 21:13:44,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:45,230 INFO L124 PetriNetUnfolderBase]: 1555/2569 cut-off events. [2023-08-26 21:13:45,230 INFO L125 PetriNetUnfolderBase]: For 4693/4693 co-relation queries the response was YES. [2023-08-26 21:13:45,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9544 conditions, 2569 events. 1555/2569 cut-off events. For 4693/4693 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 13603 event pairs, 314 based on Foata normal form. 1/2570 useless extension candidates. Maximal degree in co-relation 9523. Up to 1092 conditions per place. [2023-08-26 21:13:45,236 INFO L140 encePairwiseOnDemand]: 252/258 looper letters, 44 selfloop transitions, 3 changer transitions 56/103 dead transitions. [2023-08-26 21:13:45,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 103 transitions, 763 flow [2023-08-26 21:13:45,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:13:45,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:13:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 790 transitions. [2023-08-26 21:13:45,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4374307862679956 [2023-08-26 21:13:45,238 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 790 transitions. [2023-08-26 21:13:45,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 790 transitions. [2023-08-26 21:13:45,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:45,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 790 transitions. [2023-08-26 21:13:45,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.85714285714286) internal successors, (790), 7 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:45,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:45,244 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:45,244 INFO L175 Difference]: Start difference. First operand has 66 places, 47 transitions, 248 flow. Second operand 7 states and 790 transitions. [2023-08-26 21:13:45,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 103 transitions, 763 flow [2023-08-26 21:13:45,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 103 transitions, 753 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-26 21:13:45,270 INFO L231 Difference]: Finished difference. Result has 68 places, 43 transitions, 228 flow [2023-08-26 21:13:45,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=228, PETRI_PLACES=68, PETRI_TRANSITIONS=43} [2023-08-26 21:13:45,270 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 18 predicate places. [2023-08-26 21:13:45,271 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 228 flow [2023-08-26 21:13:45,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:45,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:45,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:45,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 21:13:45,271 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:13:45,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:45,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1314878739, now seen corresponding path program 3 times [2023-08-26 21:13:45,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:45,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439677121] [2023-08-26 21:13:45,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:45,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:13:45,820 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:13:45,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:13:45,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439677121] [2023-08-26 21:13:45,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439677121] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:13:45,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:13:45,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:13:45,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335524276] [2023-08-26 21:13:45,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:13:45,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 21:13:45,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:13:45,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 21:13:45,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-26 21:13:45,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 258 [2023-08-26 21:13:45,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 43 transitions, 228 flow. Second operand has 8 states, 8 states have (on average 108.875) internal successors, (871), 8 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:45,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:13:45,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 258 [2023-08-26 21:13:45,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:13:46,108 INFO L124 PetriNetUnfolderBase]: 552/946 cut-off events. [2023-08-26 21:13:46,109 INFO L125 PetriNetUnfolderBase]: For 1584/1603 co-relation queries the response was YES. [2023-08-26 21:13:46,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3437 conditions, 946 events. 552/946 cut-off events. For 1584/1603 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4166 event pairs, 84 based on Foata normal form. 15/938 useless extension candidates. Maximal degree in co-relation 3416. Up to 590 conditions per place. [2023-08-26 21:13:46,113 INFO L140 encePairwiseOnDemand]: 251/258 looper letters, 45 selfloop transitions, 4 changer transitions 29/82 dead transitions. [2023-08-26 21:13:46,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 82 transitions, 594 flow [2023-08-26 21:13:46,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 21:13:46,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 21:13:46,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 893 transitions. [2023-08-26 21:13:46,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4326550387596899 [2023-08-26 21:13:46,115 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 893 transitions. [2023-08-26 21:13:46,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 893 transitions. [2023-08-26 21:13:46,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:13:46,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 893 transitions. [2023-08-26 21:13:46,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.625) internal successors, (893), 8 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:46,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:46,121 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:46,121 INFO L175 Difference]: Start difference. First operand has 68 places, 43 transitions, 228 flow. Second operand 8 states and 893 transitions. [2023-08-26 21:13:46,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 82 transitions, 594 flow [2023-08-26 21:13:46,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 82 transitions, 576 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-08-26 21:13:46,129 INFO L231 Difference]: Finished difference. Result has 69 places, 41 transitions, 221 flow [2023-08-26 21:13:46,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=221, PETRI_PLACES=69, PETRI_TRANSITIONS=41} [2023-08-26 21:13:46,130 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 19 predicate places. [2023-08-26 21:13:46,130 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 41 transitions, 221 flow [2023-08-26 21:13:46,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.875) internal successors, (871), 8 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:13:46,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:13:46,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:46,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 21:13:46,131 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:13:46,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:13:46,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1646231965, now seen corresponding path program 4 times [2023-08-26 21:13:46,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:13:46,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605506474] [2023-08-26 21:13:46,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:13:46,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:13:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:13:46,166 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:13:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:13:46,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:13:46,227 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:13:46,228 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-26 21:13:46,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2023-08-26 21:13:46,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-26 21:13:46,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-26 21:13:46,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-26 21:13:46,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (17 of 23 remaining) [2023-08-26 21:13:46,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-26 21:13:46,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-26 21:13:46,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-26 21:13:46,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-26 21:13:46,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-26 21:13:46,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-26 21:13:46,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-26 21:13:46,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-26 21:13:46,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 23 remaining) [2023-08-26 21:13:46,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-26 21:13:46,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-26 21:13:46,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-26 21:13:46,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (4 of 23 remaining) [2023-08-26 21:13:46,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-26 21:13:46,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-26 21:13:46,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-26 21:13:46,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-26 21:13:46,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 21:13:46,234 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:13:46,239 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:13:46,239 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:13:46,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:13:46 BasicIcfg [2023-08-26 21:13:46,304 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:13:46,304 INFO L158 Benchmark]: Toolchain (without parser) took 20277.56ms. Allocated memory was 371.2MB in the beginning and 1.2GB in the end (delta: 792.7MB). Free memory was 326.5MB in the beginning and 662.5MB in the end (delta: -336.0MB). Peak memory consumption was 458.5MB. Max. memory is 16.0GB. [2023-08-26 21:13:46,304 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 371.2MB. Free memory was 349.2MB in the beginning and 349.0MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:13:46,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.65ms. Allocated memory is still 371.2MB. Free memory was 326.5MB in the beginning and 303.1MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:13:46,305 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.51ms. Allocated memory is still 371.2MB. Free memory was 303.1MB in the beginning and 300.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 21:13:46,305 INFO L158 Benchmark]: Boogie Preprocessor took 34.99ms. Allocated memory is still 371.2MB. Free memory was 300.0MB in the beginning and 297.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:13:46,305 INFO L158 Benchmark]: RCFGBuilder took 700.14ms. Allocated memory is still 371.2MB. Free memory was 297.9MB in the beginning and 259.1MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-26 21:13:46,305 INFO L158 Benchmark]: TraceAbstraction took 19013.07ms. Allocated memory was 371.2MB in the beginning and 1.2GB in the end (delta: 792.7MB). Free memory was 258.0MB in the beginning and 662.5MB in the end (delta: -404.5MB). Peak memory consumption was 389.3MB. Max. memory is 16.0GB. [2023-08-26 21:13:46,307 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.15ms. Allocated memory is still 371.2MB. Free memory was 349.2MB in the beginning and 349.0MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 443.65ms. Allocated memory is still 371.2MB. Free memory was 326.5MB in the beginning and 303.1MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 78.51ms. Allocated memory is still 371.2MB. Free memory was 303.1MB in the beginning and 300.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.99ms. Allocated memory is still 371.2MB. Free memory was 300.0MB in the beginning and 297.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 700.14ms. Allocated memory is still 371.2MB. Free memory was 297.9MB in the beginning and 259.1MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 19013.07ms. Allocated memory was 371.2MB in the beginning and 1.2GB in the end (delta: 792.7MB). Free memory was 258.0MB in the beginning and 662.5MB in the end (delta: -404.5MB). Peak memory consumption was 389.3MB. 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.9s, 148 PlacesBefore, 50 PlacesAfterwards, 138 TransitionsBefore, 38 TransitionsAfterwards, 4188 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 116 TotalNumberOfCompositions, 14988 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5129, independent: 4792, independent conditional: 0, independent unconditional: 4792, dependent: 337, dependent conditional: 0, dependent unconditional: 337, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2229, independent: 2176, independent conditional: 0, independent unconditional: 2176, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5129, independent: 2616, independent conditional: 0, independent unconditional: 2616, dependent: 284, dependent conditional: 0, dependent unconditional: 284, unknown: 2229, unknown conditional: 0, unknown unconditional: 2229] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 211, Positive conditional cache size: 0, Positive unconditional cache size: 211, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L729] 0 _Bool y$flush_delayed; [L730] 0 int y$mem_tmp; [L731] 0 _Bool y$r_buff0_thd0; [L732] 0 _Bool y$r_buff0_thd1; [L733] 0 _Bool y$r_buff0_thd2; [L734] 0 _Bool y$r_buff0_thd3; [L735] 0 _Bool y$r_buff0_thd4; [L736] 0 _Bool y$r_buff1_thd0; [L737] 0 _Bool y$r_buff1_thd1; [L738] 0 _Bool y$r_buff1_thd2; [L739] 0 _Bool y$r_buff1_thd3; [L740] 0 _Bool y$r_buff1_thd4; [L741] 0 _Bool y$read_delayed; [L742] 0 int *y$read_delayed_var; [L743] 0 int y$w_buff0; [L744] 0 _Bool y$w_buff0_used; [L745] 0 int y$w_buff1; [L746] 0 _Bool y$w_buff1_used; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t437; [L859] FCALL, FORK 0 pthread_create(&t437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t437, ((void *)0), P0, ((void *)0))=-3, t437={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t438; [L861] FCALL, FORK 0 pthread_create(&t438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t438, ((void *)0), P1, ((void *)0))=-2, t437={5:0}, t438={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t439; [L863] FCALL, FORK 0 pthread_create(&t439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t439, ((void *)0), P2, ((void *)0))=-1, t437={5:0}, t438={6:0}, t439={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t440; [L865] FCALL, FORK 0 pthread_create(&t440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t440, ((void *)0), P3, ((void *)0))=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L797] 3 y$w_buff1 = y$w_buff0 [L798] 3 y$w_buff0 = 1 [L799] 3 y$w_buff1_used = y$w_buff0_used [L800] 3 y$w_buff0_used = (_Bool)1 [L801] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L801] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L802] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L803] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L804] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L805] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L806] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L807] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L820] EXPR 3 __unbuffered_cnt + 1 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L762] EXPR 1 __unbuffered_cnt + 1 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L836] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L837] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L838] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L839] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L840] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L790] EXPR 2 __unbuffered_cnt + 1 [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 2 return 0; [L843] EXPR 4 __unbuffered_cnt + 1 [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L872] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L873] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L874] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L875] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=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}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] 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", "mix017_power.opt_rmo.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_p0_EAX=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}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, 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: 790]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 790]: 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: 820]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 843]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 843]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 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. - 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: 18.8s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 796 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 796 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2235 IncrementalHoareTripleChecker+Invalid, 2314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 27 mSDtfsCounter, 2235 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=528occurred in iteration=10, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 326 NumberOfCodeBlocks, 326 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 1438 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 21:13:46,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...