/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 --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -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/safe020_power.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 10:17:30,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:17:30,858 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-27 10:17:30,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:17:30,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:17:30,882 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:17:30,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:17:30,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:17:30,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:17:30,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:17:30,884 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:17:30,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:17:30,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:17:30,885 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:17:30,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:17:30,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:17:30,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:17:30,887 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:17:30,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:17:30,887 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:17:30,887 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:17:30,888 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:17:30,888 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:17:30,888 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:17:30,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:17:30,889 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:17:30,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:17:30,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:17:30,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:17:30,890 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:17:30,890 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:17:30,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:17:30,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:17:30,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:17:30,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:17:30,891 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.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST 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-27 10:17:31,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:17:31,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:17:31,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:17:31,216 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:17:31,216 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:17:31,217 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe020_power.i [2023-08-27 10:17:32,394 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:17:32,698 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:17:32,699 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_power.i [2023-08-27 10:17:32,723 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bcfb6d14/50a59a431901475d8cde138a7bf2136b/FLAGff06bfe84 [2023-08-27 10:17:32,740 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bcfb6d14/50a59a431901475d8cde138a7bf2136b [2023-08-27 10:17:32,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:17:32,747 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:17:32,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:17:32,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:17:32,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:17:32,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:17:32" (1/1) ... [2023-08-27 10:17:32,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3793b5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:32, skipping insertion in model container [2023-08-27 10:17:32,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:17:32" (1/1) ... [2023-08-27 10:17:32,806 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:17:33,157 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:17:33,169 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:17:33,186 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 10:17:33,188 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 10:17:33,227 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:17:33,255 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:17:33,255 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:17:33,261 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:17:33,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:33 WrapperNode [2023-08-27 10:17:33,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:17:33,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:17:33,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:17:33,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:17:33,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:33" (1/1) ... [2023-08-27 10:17:33,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:33" (1/1) ... [2023-08-27 10:17:33,305 INFO L138 Inliner]: procedures = 176, calls = 78, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 185 [2023-08-27 10:17:33,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:17:33,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:17:33,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:17:33,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:17:33,313 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:33" (1/1) ... [2023-08-27 10:17:33,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:33" (1/1) ... [2023-08-27 10:17:33,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:33" (1/1) ... [2023-08-27 10:17:33,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:33" (1/1) ... [2023-08-27 10:17:33,331 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:33" (1/1) ... [2023-08-27 10:17:33,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:33" (1/1) ... [2023-08-27 10:17:33,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:33" (1/1) ... [2023-08-27 10:17:33,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:33" (1/1) ... [2023-08-27 10:17:33,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:17:33,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:17:33,351 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:17:33,351 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:17:33,352 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:33" (1/1) ... [2023-08-27 10:17:33,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:17:33,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:17:33,383 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-27 10:17:33,415 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-27 10:17:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 10:17:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:17:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:17:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:17:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:17:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:17:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 10:17:33,431 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 10:17:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 10:17:33,431 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 10:17:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 10:17:33,432 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 10:17:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:17:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:17:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:17:33,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:17:33,434 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 10:17:33,576 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:17:33,577 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:17:34,049 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:17:34,385 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:17:34,386 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 10:17:34,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:17:34 BoogieIcfgContainer [2023-08-27 10:17:34,388 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:17:34,390 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:17:34,390 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:17:34,393 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:17:34,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:17:32" (1/3) ... [2023-08-27 10:17:34,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc75126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:17:34, skipping insertion in model container [2023-08-27 10:17:34,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:33" (2/3) ... [2023-08-27 10:17:34,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc75126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:17:34, skipping insertion in model container [2023-08-27 10:17:34,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:17:34" (3/3) ... [2023-08-27 10:17:34,395 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_power.i [2023-08-27 10:17:34,410 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:17:34,411 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-27 10:17:34,411 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:17:34,493 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 10:17:34,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 134 transitions, 283 flow [2023-08-27 10:17:34,603 INFO L124 PetriNetUnfolderBase]: 3/131 cut-off events. [2023-08-27 10:17:34,603 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:17:34,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 3/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-27 10:17:34,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 134 transitions, 283 flow [2023-08-27 10:17:34,615 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 131 transitions, 271 flow [2023-08-27 10:17:34,619 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:17:34,630 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 131 transitions, 271 flow [2023-08-27 10:17:34,632 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 131 transitions, 271 flow [2023-08-27 10:17:34,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 131 transitions, 271 flow [2023-08-27 10:17:34,687 INFO L124 PetriNetUnfolderBase]: 3/131 cut-off events. [2023-08-27 10:17:34,687 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:17:34,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 3/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-27 10:17:34,690 INFO L119 LiptonReduction]: Number of co-enabled transitions 2516 [2023-08-27 10:17:42,548 INFO L134 LiptonReduction]: Checked pairs total: 8452 [2023-08-27 10:17:42,549 INFO L136 LiptonReduction]: Total number of compositions: 124 [2023-08-27 10:17:42,560 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:17:42,565 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;@30b94be, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:17:42,565 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-27 10:17:42,569 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:17:42,569 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-27 10:17:42,569 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:17:42,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:42,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 10:17:42,570 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:42,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:42,573 INFO L85 PathProgramCache]: Analyzing trace with hash 889385391, now seen corresponding path program 1 times [2023-08-27 10:17:42,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:42,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353336999] [2023-08-27 10:17:42,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:42,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:42,857 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-27 10:17:42,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:42,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353336999] [2023-08-27 10:17:42,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353336999] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:42,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:42,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:17:42,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911569189] [2023-08-27 10:17:42,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:42,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:17:42,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:42,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:17:42,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:17:42,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 258 [2023-08-27 10:17:42,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:42,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:42,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 258 [2023-08-27 10:17:42,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:43,417 INFO L124 PetriNetUnfolderBase]: 1409/2168 cut-off events. [2023-08-27 10:17:43,417 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-08-27 10:17:43,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4387 conditions, 2168 events. 1409/2168 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10396 event pairs, 473 based on Foata normal form. 0/1551 useless extension candidates. Maximal degree in co-relation 4376. Up to 1568 conditions per place. [2023-08-27 10:17:43,431 INFO L140 encePairwiseOnDemand]: 248/258 looper letters, 40 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2023-08-27 10:17:43,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 193 flow [2023-08-27 10:17:43,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:17:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:17:43,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-08-27 10:17:43,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48320413436692505 [2023-08-27 10:17:43,443 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-08-27 10:17:43,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-08-27 10:17:43,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:43,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-08-27 10:17:43,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:43,453 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-27 10:17:43,454 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-27 10:17:43,456 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 63 flow. Second operand 3 states and 374 transitions. [2023-08-27 10:17:43,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 193 flow [2023-08-27 10:17:43,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 10:17:43,460 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 96 flow [2023-08-27 10:17:43,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-08-27 10:17:43,464 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2023-08-27 10:17:43,464 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 96 flow [2023-08-27 10:17:43,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:43,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:43,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 10:17:43,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:17:43,465 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:43,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:43,466 INFO L85 PathProgramCache]: Analyzing trace with hash 889444989, now seen corresponding path program 1 times [2023-08-27 10:17:43,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:43,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963076310] [2023-08-27 10:17:43,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:43,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:43,586 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-27 10:17:43,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:43,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963076310] [2023-08-27 10:17:43,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963076310] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:43,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:43,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:17:43,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810745714] [2023-08-27 10:17:43,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:43,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:17:43,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:43,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:17:43,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:17:43,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 258 [2023-08-27 10:17:43,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:43,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:43,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 258 [2023-08-27 10:17:43,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:43,904 INFO L124 PetriNetUnfolderBase]: 1003/1622 cut-off events. [2023-08-27 10:17:43,904 INFO L125 PetriNetUnfolderBase]: For 137/154 co-relation queries the response was YES. [2023-08-27 10:17:43,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3927 conditions, 1622 events. 1003/1622 cut-off events. For 137/154 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8393 event pairs, 190 based on Foata normal form. 0/1338 useless extension candidates. Maximal degree in co-relation 3916. Up to 1242 conditions per place. [2023-08-27 10:17:43,913 INFO L140 encePairwiseOnDemand]: 255/258 looper letters, 39 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-27 10:17:43,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 224 flow [2023-08-27 10:17:43,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:17:43,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:17:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2023-08-27 10:17:43,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4819121447028424 [2023-08-27 10:17:43,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2023-08-27 10:17:43,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2023-08-27 10:17:43,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:43,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2023-08-27 10:17:43,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:43,920 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-27 10:17:43,920 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-27 10:17:43,920 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 96 flow. Second operand 3 states and 373 transitions. [2023-08-27 10:17:43,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 224 flow [2023-08-27 10:17:43,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:17:43,922 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 94 flow [2023-08-27 10:17:43,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-08-27 10:17:43,923 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2023-08-27 10:17:43,924 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 94 flow [2023-08-27 10:17:43,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:43,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:43,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:43,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:17:43,924 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:43,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:43,925 INFO L85 PathProgramCache]: Analyzing trace with hash 111527239, now seen corresponding path program 1 times [2023-08-27 10:17:43,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:43,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992228826] [2023-08-27 10:17:43,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:43,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:44,103 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-27 10:17:44,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:44,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992228826] [2023-08-27 10:17:44,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992228826] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:44,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:44,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:17:44,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096524154] [2023-08-27 10:17:44,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:44,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:17:44,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:44,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:17:44,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:17:44,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 258 [2023-08-27 10:17:44,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:44,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:44,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 258 [2023-08-27 10:17:44,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:44,441 INFO L124 PetriNetUnfolderBase]: 1170/1869 cut-off events. [2023-08-27 10:17:44,441 INFO L125 PetriNetUnfolderBase]: For 277/293 co-relation queries the response was YES. [2023-08-27 10:17:44,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4441 conditions, 1869 events. 1170/1869 cut-off events. For 277/293 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9180 event pairs, 346 based on Foata normal form. 0/1571 useless extension candidates. Maximal degree in co-relation 4429. Up to 1646 conditions per place. [2023-08-27 10:17:44,452 INFO L140 encePairwiseOnDemand]: 254/258 looper letters, 36 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2023-08-27 10:17:44,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 206 flow [2023-08-27 10:17:44,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:17:44,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:17:44,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-08-27 10:17:44,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47416020671834624 [2023-08-27 10:17:44,454 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-08-27 10:17:44,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-08-27 10:17:44,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:44,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-08-27 10:17:44,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:44,457 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-27 10:17:44,458 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-27 10:17:44,458 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 94 flow. Second operand 3 states and 367 transitions. [2023-08-27 10:17:44,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 206 flow [2023-08-27 10:17:44,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:17:44,459 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 109 flow [2023-08-27 10:17:44,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-08-27 10:17:44,460 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2023-08-27 10:17:44,460 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 109 flow [2023-08-27 10:17:44,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:44,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:44,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:44,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:17:44,461 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:44,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:44,462 INFO L85 PathProgramCache]: Analyzing trace with hash 2009584350, now seen corresponding path program 1 times [2023-08-27 10:17:44,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:44,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672664390] [2023-08-27 10:17:44,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:44,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:44,523 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-27 10:17:44,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:44,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672664390] [2023-08-27 10:17:44,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672664390] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:44,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:44,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:17:44,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808324925] [2023-08-27 10:17:44,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:44,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:17:44,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:44,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:17:44,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:17:44,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 258 [2023-08-27 10:17:44,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:44,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:44,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 258 [2023-08-27 10:17:44,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:44,889 INFO L124 PetriNetUnfolderBase]: 1048/1598 cut-off events. [2023-08-27 10:17:44,890 INFO L125 PetriNetUnfolderBase]: For 317/317 co-relation queries the response was YES. [2023-08-27 10:17:44,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3977 conditions, 1598 events. 1048/1598 cut-off events. For 317/317 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7252 event pairs, 314 based on Foata normal form. 0/1422 useless extension candidates. Maximal degree in co-relation 3964. Up to 1087 conditions per place. [2023-08-27 10:17:44,898 INFO L140 encePairwiseOnDemand]: 251/258 looper letters, 37 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2023-08-27 10:17:44,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 220 flow [2023-08-27 10:17:44,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:17:44,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:17:44,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 474 transitions. [2023-08-27 10:17:44,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45930232558139533 [2023-08-27 10:17:44,900 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 474 transitions. [2023-08-27 10:17:44,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 474 transitions. [2023-08-27 10:17:44,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:44,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 474 transitions. [2023-08-27 10:17:44,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:44,903 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-27 10:17:44,904 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-27 10:17:44,904 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 109 flow. Second operand 4 states and 474 transitions. [2023-08-27 10:17:44,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 220 flow [2023-08-27 10:17:44,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:17:44,906 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 102 flow [2023-08-27 10:17:44,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2023-08-27 10:17:44,907 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2023-08-27 10:17:44,907 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 102 flow [2023-08-27 10:17:44,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:44,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:44,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:44,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:17:44,908 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:44,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:44,908 INFO L85 PathProgramCache]: Analyzing trace with hash 101967417, now seen corresponding path program 1 times [2023-08-27 10:17:44,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:44,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712804271] [2023-08-27 10:17:44,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:44,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:44,976 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-27 10:17:44,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:44,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712804271] [2023-08-27 10:17:44,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712804271] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:44,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:44,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:17:44,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468150101] [2023-08-27 10:17:44,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:44,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:17:44,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:44,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:17:44,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:17:44,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 258 [2023-08-27 10:17:44,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:44,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:44,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 258 [2023-08-27 10:17:44,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:45,306 INFO L124 PetriNetUnfolderBase]: 837/1269 cut-off events. [2023-08-27 10:17:45,306 INFO L125 PetriNetUnfolderBase]: For 576/576 co-relation queries the response was YES. [2023-08-27 10:17:45,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3236 conditions, 1269 events. 837/1269 cut-off events. For 576/576 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5506 event pairs, 276 based on Foata normal form. 0/1228 useless extension candidates. Maximal degree in co-relation 3222. Up to 531 conditions per place. [2023-08-27 10:17:45,314 INFO L140 encePairwiseOnDemand]: 251/258 looper letters, 49 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2023-08-27 10:17:45,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 58 transitions, 296 flow [2023-08-27 10:17:45,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:17:45,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:17:45,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-08-27 10:17:45,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738372093023256 [2023-08-27 10:17:45,316 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-08-27 10:17:45,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-08-27 10:17:45,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:45,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-08-27 10:17:45,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:45,321 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-27 10:17:45,321 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-27 10:17:45,321 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 102 flow. Second operand 4 states and 489 transitions. [2023-08-27 10:17:45,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 58 transitions, 296 flow [2023-08-27 10:17:45,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 58 transitions, 291 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:17:45,325 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 141 flow [2023-08-27 10:17:45,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-08-27 10:17:45,327 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2023-08-27 10:17:45,327 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 141 flow [2023-08-27 10:17:45,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:45,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:45,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:45,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:17:45,328 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:45,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:45,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1023948892, now seen corresponding path program 1 times [2023-08-27 10:17:45,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:45,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252120088] [2023-08-27 10:17:45,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:45,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:45,577 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-27 10:17:45,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:45,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252120088] [2023-08-27 10:17:45,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252120088] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:45,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:45,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:17:45,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555788130] [2023-08-27 10:17:45,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:45,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:17:45,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:45,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:17:45,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:17:45,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 258 [2023-08-27 10:17:45,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:45,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:45,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 258 [2023-08-27 10:17:45,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:45,834 INFO L124 PetriNetUnfolderBase]: 728/1164 cut-off events. [2023-08-27 10:17:45,834 INFO L125 PetriNetUnfolderBase]: For 1052/1052 co-relation queries the response was YES. [2023-08-27 10:17:45,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3330 conditions, 1164 events. 728/1164 cut-off events. For 1052/1052 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4947 event pairs, 176 based on Foata normal form. 12/1161 useless extension candidates. Maximal degree in co-relation 3315. Up to 849 conditions per place. [2023-08-27 10:17:45,841 INFO L140 encePairwiseOnDemand]: 255/258 looper letters, 38 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-08-27 10:17:45,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 267 flow [2023-08-27 10:17:45,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:17:45,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:17:45,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-08-27 10:17:45,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4715762273901809 [2023-08-27 10:17:45,844 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-08-27 10:17:45,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-08-27 10:17:45,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:45,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-08-27 10:17:45,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:45,847 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-27 10:17:45,847 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-27 10:17:45,847 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 141 flow. Second operand 3 states and 365 transitions. [2023-08-27 10:17:45,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 267 flow [2023-08-27 10:17:45,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 245 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-27 10:17:45,851 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 135 flow [2023-08-27 10:17:45,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2023-08-27 10:17:45,853 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2023-08-27 10:17:45,856 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 135 flow [2023-08-27 10:17:45,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:45,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:45,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:45,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:17:45,857 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:45,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:45,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1677643388, now seen corresponding path program 1 times [2023-08-27 10:17:45,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:45,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319137639] [2023-08-27 10:17:45,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:45,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:47,382 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-27 10:17:47,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:47,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319137639] [2023-08-27 10:17:47,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319137639] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:47,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:47,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:17:47,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117021880] [2023-08-27 10:17:47,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:47,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:17:47,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:47,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:17:47,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:17:47,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 258 [2023-08-27 10:17:47,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:47,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:47,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 258 [2023-08-27 10:17:47,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:47,828 INFO L124 PetriNetUnfolderBase]: 830/1298 cut-off events. [2023-08-27 10:17:47,828 INFO L125 PetriNetUnfolderBase]: For 857/857 co-relation queries the response was YES. [2023-08-27 10:17:47,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3653 conditions, 1298 events. 830/1298 cut-off events. For 857/857 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5636 event pairs, 213 based on Foata normal form. 31/1313 useless extension candidates. Maximal degree in co-relation 3637. Up to 940 conditions per place. [2023-08-27 10:17:47,835 INFO L140 encePairwiseOnDemand]: 249/258 looper letters, 63 selfloop transitions, 13 changer transitions 0/78 dead transitions. [2023-08-27 10:17:47,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 78 transitions, 457 flow [2023-08-27 10:17:47,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:17:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:17:47,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 692 transitions. [2023-08-27 10:17:47,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3831672203765227 [2023-08-27 10:17:47,838 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 692 transitions. [2023-08-27 10:17:47,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 692 transitions. [2023-08-27 10:17:47,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:47,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 692 transitions. [2023-08-27 10:17:47,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:47,842 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-27 10:17:47,842 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-27 10:17:47,842 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 135 flow. Second operand 7 states and 692 transitions. [2023-08-27 10:17:47,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 78 transitions, 457 flow [2023-08-27 10:17:47,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 449 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:17:47,846 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 212 flow [2023-08-27 10:17:47,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=212, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2023-08-27 10:17:47,846 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2023-08-27 10:17:47,846 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 212 flow [2023-08-27 10:17:47,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:47,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:47,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:47,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 10:17:47,847 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:47,847 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:47,848 INFO L85 PathProgramCache]: Analyzing trace with hash 467350699, now seen corresponding path program 1 times [2023-08-27 10:17:47,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:47,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835810672] [2023-08-27 10:17:47,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:47,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:48,062 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-27 10:17:48,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:48,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835810672] [2023-08-27 10:17:48,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835810672] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:48,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:48,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:17:48,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413149211] [2023-08-27 10:17:48,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:48,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:17:48,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:48,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:17:48,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:17:48,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 258 [2023-08-27 10:17:48,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:48,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:48,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 258 [2023-08-27 10:17:48,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:48,317 INFO L124 PetriNetUnfolderBase]: 618/1024 cut-off events. [2023-08-27 10:17:48,317 INFO L125 PetriNetUnfolderBase]: For 1085/1095 co-relation queries the response was YES. [2023-08-27 10:17:48,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3544 conditions, 1024 events. 618/1024 cut-off events. For 1085/1095 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4625 event pairs, 115 based on Foata normal form. 98/1097 useless extension candidates. Maximal degree in co-relation 3525. Up to 631 conditions per place. [2023-08-27 10:17:48,324 INFO L140 encePairwiseOnDemand]: 252/258 looper letters, 82 selfloop transitions, 8 changer transitions 3/95 dead transitions. [2023-08-27 10:17:48,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 95 transitions, 655 flow [2023-08-27 10:17:48,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:17:48,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:17:48,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2023-08-27 10:17:48,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4565891472868217 [2023-08-27 10:17:48,326 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 589 transitions. [2023-08-27 10:17:48,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 589 transitions. [2023-08-27 10:17:48,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:48,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 589 transitions. [2023-08-27 10:17:48,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:48,330 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-27 10:17:48,330 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-27 10:17:48,330 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 212 flow. Second operand 5 states and 589 transitions. [2023-08-27 10:17:48,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 95 transitions, 655 flow [2023-08-27 10:17:48,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 95 transitions, 655 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:17:48,334 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 273 flow [2023-08-27 10:17:48,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=273, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2023-08-27 10:17:48,335 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2023-08-27 10:17:48,335 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 273 flow [2023-08-27 10:17:48,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:48,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:48,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:48,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 10:17:48,336 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:48,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:48,336 INFO L85 PathProgramCache]: Analyzing trace with hash -463070117, now seen corresponding path program 1 times [2023-08-27 10:17:48,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:48,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459138034] [2023-08-27 10:17:48,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:48,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:48,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-27 10:17:48,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:48,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459138034] [2023-08-27 10:17:48,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459138034] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:48,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:48,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:17:48,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232708800] [2023-08-27 10:17:48,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:48,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:17:48,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:48,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:17:48,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:17:48,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 258 [2023-08-27 10:17:48,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 273 flow. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:48,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:48,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 258 [2023-08-27 10:17:48,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:48,883 INFO L124 PetriNetUnfolderBase]: 441/774 cut-off events. [2023-08-27 10:17:48,883 INFO L125 PetriNetUnfolderBase]: For 1384/1394 co-relation queries the response was YES. [2023-08-27 10:17:48,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2989 conditions, 774 events. 441/774 cut-off events. For 1384/1394 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3510 event pairs, 65 based on Foata normal form. 53/803 useless extension candidates. Maximal degree in co-relation 2965. Up to 265 conditions per place. [2023-08-27 10:17:48,888 INFO L140 encePairwiseOnDemand]: 252/258 looper letters, 89 selfloop transitions, 15 changer transitions 3/109 dead transitions. [2023-08-27 10:17:48,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 109 transitions, 781 flow [2023-08-27 10:17:48,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:17:48,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:17:48,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 822 transitions. [2023-08-27 10:17:48,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45514950166112955 [2023-08-27 10:17:48,892 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 822 transitions. [2023-08-27 10:17:48,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 822 transitions. [2023-08-27 10:17:48,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:48,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 822 transitions. [2023-08-27 10:17:48,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.42857142857143) internal successors, (822), 7 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:48,898 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-27 10:17:48,898 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-27 10:17:48,898 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 273 flow. Second operand 7 states and 822 transitions. [2023-08-27 10:17:48,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 109 transitions, 781 flow [2023-08-27 10:17:48,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 109 transitions, 759 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-27 10:17:48,906 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 316 flow [2023-08-27 10:17:48,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=316, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2023-08-27 10:17:48,907 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 22 predicate places. [2023-08-27 10:17:48,907 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 316 flow [2023-08-27 10:17:48,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:48,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:48,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:48,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 10:17:48,908 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:48,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:48,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1996063223, now seen corresponding path program 1 times [2023-08-27 10:17:48,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:48,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775526877] [2023-08-27 10:17:48,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:48,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:48,999 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-27 10:17:48,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:48,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775526877] [2023-08-27 10:17:49,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775526877] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:49,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:49,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:17:49,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51720931] [2023-08-27 10:17:49,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:49,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:17:49,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:49,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:17:49,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:17:49,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 258 [2023-08-27 10:17:49,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:49,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:49,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 258 [2023-08-27 10:17:49,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:49,202 INFO L124 PetriNetUnfolderBase]: 411/721 cut-off events. [2023-08-27 10:17:49,203 INFO L125 PetriNetUnfolderBase]: For 1669/1682 co-relation queries the response was YES. [2023-08-27 10:17:49,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3020 conditions, 721 events. 411/721 cut-off events. For 1669/1682 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3176 event pairs, 104 based on Foata normal form. 1/718 useless extension candidates. Maximal degree in co-relation 2994. Up to 278 conditions per place. [2023-08-27 10:17:49,207 INFO L140 encePairwiseOnDemand]: 251/258 looper letters, 49 selfloop transitions, 10 changer transitions 12/73 dead transitions. [2023-08-27 10:17:49,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 578 flow [2023-08-27 10:17:49,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:17:49,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:17:49,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2023-08-27 10:17:49,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45891472868217054 [2023-08-27 10:17:49,210 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 592 transitions. [2023-08-27 10:17:49,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 592 transitions. [2023-08-27 10:17:49,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:49,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 592 transitions. [2023-08-27 10:17:49,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:49,213 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-27 10:17:49,214 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-27 10:17:49,214 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 316 flow. Second operand 5 states and 592 transitions. [2023-08-27 10:17:49,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 578 flow [2023-08-27 10:17:49,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 73 transitions, 551 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-27 10:17:49,222 INFO L231 Difference]: Finished difference. Result has 56 places, 33 transitions, 211 flow [2023-08-27 10:17:49,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=56, PETRI_TRANSITIONS=33} [2023-08-27 10:17:49,223 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2023-08-27 10:17:49,223 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 33 transitions, 211 flow [2023-08-27 10:17:49,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:49,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:49,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:49,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 10:17:49,225 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:49,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:49,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1913028154, now seen corresponding path program 1 times [2023-08-27 10:17:49,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:49,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935059965] [2023-08-27 10:17:49,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:49,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:49,498 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-27 10:17:49,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:49,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935059965] [2023-08-27 10:17:49,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935059965] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:49,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:49,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:17:49,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965687347] [2023-08-27 10:17:49,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:49,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:17:49,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:49,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:17:49,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:17:49,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 258 [2023-08-27 10:17:49,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 33 transitions, 211 flow. Second operand has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:49,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:49,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 258 [2023-08-27 10:17:49,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:49,656 INFO L124 PetriNetUnfolderBase]: 171/316 cut-off events. [2023-08-27 10:17:49,656 INFO L125 PetriNetUnfolderBase]: For 710/717 co-relation queries the response was YES. [2023-08-27 10:17:49,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 316 events. 171/316 cut-off events. For 710/717 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1135 event pairs, 48 based on Foata normal form. 13/327 useless extension candidates. Maximal degree in co-relation 1251. Up to 128 conditions per place. [2023-08-27 10:17:49,659 INFO L140 encePairwiseOnDemand]: 252/258 looper letters, 45 selfloop transitions, 10 changer transitions 11/68 dead transitions. [2023-08-27 10:17:49,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 68 transitions, 498 flow [2023-08-27 10:17:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:17:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:17:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 796 transitions. [2023-08-27 10:17:49,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4407530454042082 [2023-08-27 10:17:49,662 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 796 transitions. [2023-08-27 10:17:49,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 796 transitions. [2023-08-27 10:17:49,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:49,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 796 transitions. [2023-08-27 10:17:49,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:49,667 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-27 10:17:49,668 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-27 10:17:49,668 INFO L175 Difference]: Start difference. First operand has 56 places, 33 transitions, 211 flow. Second operand 7 states and 796 transitions. [2023-08-27 10:17:49,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 68 transitions, 498 flow [2023-08-27 10:17:49,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 68 transitions, 418 flow, removed 20 selfloop flow, removed 11 redundant places. [2023-08-27 10:17:49,670 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 173 flow [2023-08-27 10:17:49,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=173, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2023-08-27 10:17:49,672 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 11 predicate places. [2023-08-27 10:17:49,672 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 173 flow [2023-08-27 10:17:49,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:49,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:49,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:49,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 10:17:49,673 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:49,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:49,674 INFO L85 PathProgramCache]: Analyzing trace with hash -893812863, now seen corresponding path program 1 times [2023-08-27 10:17:49,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:49,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855131820] [2023-08-27 10:17:49,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:49,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:49,906 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-27 10:17:49,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:49,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855131820] [2023-08-27 10:17:49,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855131820] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:49,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:49,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:17:49,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379811371] [2023-08-27 10:17:49,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:49,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:17:49,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:49,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:17:49,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:17:49,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 258 [2023-08-27 10:17:49,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:49,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:49,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 258 [2023-08-27 10:17:49,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:50,036 INFO L124 PetriNetUnfolderBase]: 234/421 cut-off events. [2023-08-27 10:17:50,036 INFO L125 PetriNetUnfolderBase]: For 677/677 co-relation queries the response was YES. [2023-08-27 10:17:50,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1633 conditions, 421 events. 234/421 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1603 event pairs, 102 based on Foata normal form. 1/422 useless extension candidates. Maximal degree in co-relation 1612. Up to 282 conditions per place. [2023-08-27 10:17:50,043 INFO L140 encePairwiseOnDemand]: 255/258 looper letters, 37 selfloop transitions, 2 changer transitions 11/50 dead transitions. [2023-08-27 10:17:50,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 390 flow [2023-08-27 10:17:50,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:17:50,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:17:50,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-08-27 10:17:50,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2023-08-27 10:17:50,045 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-08-27 10:17:50,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-08-27 10:17:50,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:50,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-08-27 10:17:50,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:50,048 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-27 10:17:50,048 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-27 10:17:50,048 INFO L175 Difference]: Start difference. First operand has 48 places, 32 transitions, 173 flow. Second operand 3 states and 360 transitions. [2023-08-27 10:17:50,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 390 flow [2023-08-27 10:17:50,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 340 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-08-27 10:17:50,052 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 147 flow [2023-08-27 10:17:50,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-27 10:17:50,053 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2023-08-27 10:17:50,053 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 147 flow [2023-08-27 10:17:50,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:50,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:50,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:50,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 10:17:50,054 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:50,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:50,054 INFO L85 PathProgramCache]: Analyzing trace with hash 515305947, now seen corresponding path program 2 times [2023-08-27 10:17:50,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:50,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811002505] [2023-08-27 10:17:50,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:50,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:52,007 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-27 10:17:52,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:52,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811002505] [2023-08-27 10:17:52,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811002505] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:52,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:52,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 10:17:52,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991026866] [2023-08-27 10:17:52,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:52,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 10:17:52,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:52,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 10:17:52,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-27 10:17:52,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 258 [2023-08-27 10:17:52,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 147 flow. Second operand has 9 states, 9 states have (on average 93.0) internal successors, (837), 9 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:52,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:52,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 258 [2023-08-27 10:17:52,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:52,517 INFO L124 PetriNetUnfolderBase]: 149/317 cut-off events. [2023-08-27 10:17:52,517 INFO L125 PetriNetUnfolderBase]: For 391/393 co-relation queries the response was YES. [2023-08-27 10:17:52,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 317 events. 149/317 cut-off events. For 391/393 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1382 event pairs, 36 based on Foata normal form. 4/321 useless extension candidates. Maximal degree in co-relation 1211. Up to 103 conditions per place. [2023-08-27 10:17:52,519 INFO L140 encePairwiseOnDemand]: 249/258 looper letters, 69 selfloop transitions, 13 changer transitions 28/111 dead transitions. [2023-08-27 10:17:52,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 111 transitions, 803 flow [2023-08-27 10:17:52,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 10:17:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 10:17:52,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1074 transitions. [2023-08-27 10:17:52,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3784355179704017 [2023-08-27 10:17:52,523 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1074 transitions. [2023-08-27 10:17:52,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1074 transitions. [2023-08-27 10:17:52,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:52,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1074 transitions. [2023-08-27 10:17:52,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 97.63636363636364) internal successors, (1074), 11 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:52,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 258.0) internal successors, (3096), 12 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:52,530 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 258.0) internal successors, (3096), 12 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:52,530 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 147 flow. Second operand 11 states and 1074 transitions. [2023-08-27 10:17:52,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 111 transitions, 803 flow [2023-08-27 10:17:52,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 111 transitions, 762 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-08-27 10:17:52,534 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 230 flow [2023-08-27 10:17:52,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=230, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2023-08-27 10:17:52,535 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2023-08-27 10:17:52,535 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 230 flow [2023-08-27 10:17:52,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.0) internal successors, (837), 9 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:52,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:52,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:52,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 10:17:52,536 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:52,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:52,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2136054171, now seen corresponding path program 3 times [2023-08-27 10:17:52,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:52,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117002481] [2023-08-27 10:17:52,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:52,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:53,412 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-27 10:17:53,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:53,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117002481] [2023-08-27 10:17:53,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117002481] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:53,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:53,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:17:53,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774286365] [2023-08-27 10:17:53,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:53,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:17:53,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:53,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:17:53,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:17:53,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 258 [2023-08-27 10:17:53,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 38 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 102.57142857142857) internal successors, (718), 7 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:53,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:53,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 258 [2023-08-27 10:17:53,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:53,648 INFO L124 PetriNetUnfolderBase]: 127/281 cut-off events. [2023-08-27 10:17:53,648 INFO L125 PetriNetUnfolderBase]: For 658/662 co-relation queries the response was YES. [2023-08-27 10:17:53,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 281 events. 127/281 cut-off events. For 658/662 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1214 event pairs, 42 based on Foata normal form. 5/286 useless extension candidates. Maximal degree in co-relation 1224. Up to 153 conditions per place. [2023-08-27 10:17:53,650 INFO L140 encePairwiseOnDemand]: 249/258 looper letters, 41 selfloop transitions, 11 changer transitions 20/73 dead transitions. [2023-08-27 10:17:53,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 73 transitions, 576 flow [2023-08-27 10:17:53,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:17:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:17:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 747 transitions. [2023-08-27 10:17:53,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41362126245847175 [2023-08-27 10:17:53,653 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 747 transitions. [2023-08-27 10:17:53,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 747 transitions. [2023-08-27 10:17:53,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:53,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 747 transitions. [2023-08-27 10:17:53,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.71428571428571) internal successors, (747), 7 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:53,657 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-27 10:17:53,657 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-27 10:17:53,657 INFO L175 Difference]: Start difference. First operand has 56 places, 38 transitions, 230 flow. Second operand 7 states and 747 transitions. [2023-08-27 10:17:53,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 73 transitions, 576 flow [2023-08-27 10:17:53,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 555 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-27 10:17:53,660 INFO L231 Difference]: Finished difference. Result has 57 places, 36 transitions, 235 flow [2023-08-27 10:17:53,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=57, PETRI_TRANSITIONS=36} [2023-08-27 10:17:53,661 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 20 predicate places. [2023-08-27 10:17:53,661 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 36 transitions, 235 flow [2023-08-27 10:17:53,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.57142857142857) internal successors, (718), 7 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:53,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:53,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:53,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 10:17:53,662 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:53,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:53,662 INFO L85 PathProgramCache]: Analyzing trace with hash 513931353, now seen corresponding path program 4 times [2023-08-27 10:17:53,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:53,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795459237] [2023-08-27 10:17:53,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:53,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:55,616 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-27 10:17:55,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:55,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795459237] [2023-08-27 10:17:55,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795459237] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:55,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:55,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-27 10:17:55,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660056785] [2023-08-27 10:17:55,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:55,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-27 10:17:55,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:55,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-27 10:17:55,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-08-27 10:17:55,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 258 [2023-08-27 10:17:55,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 36 transitions, 235 flow. Second operand has 10 states, 10 states have (on average 93.8) internal successors, (938), 10 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:55,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:55,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 258 [2023-08-27 10:17:55,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:55,990 INFO L124 PetriNetUnfolderBase]: 156/349 cut-off events. [2023-08-27 10:17:55,991 INFO L125 PetriNetUnfolderBase]: For 1015/1019 co-relation queries the response was YES. [2023-08-27 10:17:55,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1624 conditions, 349 events. 156/349 cut-off events. For 1015/1019 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1629 event pairs, 29 based on Foata normal form. 5/354 useless extension candidates. Maximal degree in co-relation 1602. Up to 144 conditions per place. [2023-08-27 10:17:55,995 INFO L140 encePairwiseOnDemand]: 249/258 looper letters, 59 selfloop transitions, 16 changer transitions 9/85 dead transitions. [2023-08-27 10:17:55,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 85 transitions, 718 flow [2023-08-27 10:17:55,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 10:17:55,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 10:17:55,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 791 transitions. [2023-08-27 10:17:55,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38323643410852715 [2023-08-27 10:17:55,998 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 791 transitions. [2023-08-27 10:17:55,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 791 transitions. [2023-08-27 10:17:55,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:55,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 791 transitions. [2023-08-27 10:17:56,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 98.875) internal successors, (791), 8 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:56,003 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-27 10:17:56,004 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-27 10:17:56,004 INFO L175 Difference]: Start difference. First operand has 57 places, 36 transitions, 235 flow. Second operand 8 states and 791 transitions. [2023-08-27 10:17:56,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 85 transitions, 718 flow [2023-08-27 10:17:56,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 85 transitions, 638 flow, removed 28 selfloop flow, removed 8 redundant places. [2023-08-27 10:17:56,009 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 319 flow [2023-08-27 10:17:56,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=319, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2023-08-27 10:17:56,009 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2023-08-27 10:17:56,009 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 319 flow [2023-08-27 10:17:56,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 93.8) internal successors, (938), 10 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:56,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:56,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:56,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 10:17:56,010 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:56,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:56,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2060908299, now seen corresponding path program 5 times [2023-08-27 10:17:56,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:56,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543388130] [2023-08-27 10:17:56,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:56,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:58,149 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-27 10:17:58,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:58,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543388130] [2023-08-27 10:17:58,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543388130] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:58,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:58,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 10:17:58,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638118900] [2023-08-27 10:17:58,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:58,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 10:17:58,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:58,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 10:17:58,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-27 10:17:58,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 258 [2023-08-27 10:17:58,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 319 flow. Second operand has 9 states, 9 states have (on average 95.0) internal successors, (855), 9 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:58,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:58,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 258 [2023-08-27 10:17:58,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:58,503 INFO L124 PetriNetUnfolderBase]: 184/420 cut-off events. [2023-08-27 10:17:58,504 INFO L125 PetriNetUnfolderBase]: For 1278/1282 co-relation queries the response was YES. [2023-08-27 10:17:58,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1942 conditions, 420 events. 184/420 cut-off events. For 1278/1282 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2118 event pairs, 18 based on Foata normal form. 6/426 useless extension candidates. Maximal degree in co-relation 1917. Up to 170 conditions per place. [2023-08-27 10:17:58,506 INFO L140 encePairwiseOnDemand]: 250/258 looper letters, 60 selfloop transitions, 14 changer transitions 29/104 dead transitions. [2023-08-27 10:17:58,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 104 transitions, 904 flow [2023-08-27 10:17:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 10:17:58,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 10:17:58,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 807 transitions. [2023-08-27 10:17:58,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39098837209302323 [2023-08-27 10:17:58,509 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 807 transitions. [2023-08-27 10:17:58,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 807 transitions. [2023-08-27 10:17:58,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:58,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 807 transitions. [2023-08-27 10:17:58,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.875) internal successors, (807), 8 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:58,516 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-27 10:17:58,516 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-27 10:17:58,516 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 319 flow. Second operand 8 states and 807 transitions. [2023-08-27 10:17:58,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 104 transitions, 904 flow [2023-08-27 10:17:58,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 104 transitions, 868 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-27 10:17:58,522 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 356 flow [2023-08-27 10:17:58,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=356, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2023-08-27 10:17:58,523 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 26 predicate places. [2023-08-27 10:17:58,523 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 356 flow [2023-08-27 10:17:58,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 95.0) internal successors, (855), 9 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:17:58,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:58,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:58,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 10:17:58,524 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:17:58,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:58,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1942865691, now seen corresponding path program 6 times [2023-08-27 10:17:58,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:58,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132147508] [2023-08-27 10:17:58,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:58,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:17:58,637 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 10:17:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:17:58,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 10:17:58,762 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 10:17:58,763 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-27 10:17:58,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-08-27 10:17:58,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-27 10:17:58,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (14 of 18 remaining) [2023-08-27 10:17:58,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-27 10:17:58,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-08-27 10:17:58,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-27 10:17:58,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-27 10:17:58,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-27 10:17:58,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-27 10:17:58,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-27 10:17:58,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-08-27 10:17:58,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-27 10:17:58,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (4 of 18 remaining) [2023-08-27 10:17:58,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-27 10:17:58,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-08-27 10:17:58,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-27 10:17:58,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-27 10:17:58,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 10:17:58,766 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:58,771 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:17:58,771 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:17:58,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:17:58 BasicIcfg [2023-08-27 10:17:58,857 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:17:58,857 INFO L158 Benchmark]: Toolchain (without parser) took 26110.19ms. Allocated memory was 341.8MB in the beginning and 1.1GB in the end (delta: 738.2MB). Free memory was 316.2MB in the beginning and 996.6MB in the end (delta: -680.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.0GB. [2023-08-27 10:17:58,857 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 341.8MB. Free memory was 319.6MB in the beginning and 319.4MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:17:58,857 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.05ms. Allocated memory is still 341.8MB. Free memory was 316.2MB in the beginning and 291.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-27 10:17:58,858 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.72ms. Allocated memory is still 341.8MB. Free memory was 291.0MB in the beginning and 288.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:17:58,858 INFO L158 Benchmark]: Boogie Preprocessor took 44.31ms. Allocated memory is still 341.8MB. Free memory was 288.1MB in the beginning and 285.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:17:58,858 INFO L158 Benchmark]: RCFGBuilder took 1036.40ms. Allocated memory was 341.8MB in the beginning and 490.7MB in the end (delta: 148.9MB). Free memory was 285.6MB in the beginning and 429.6MB in the end (delta: -144.0MB). Peak memory consumption was 64.7MB. Max. memory is 16.0GB. [2023-08-27 10:17:58,858 INFO L158 Benchmark]: TraceAbstraction took 24466.69ms. Allocated memory was 490.7MB in the beginning and 1.1GB in the end (delta: 589.3MB). Free memory was 429.6MB in the beginning and 996.6MB in the end (delta: -567.0MB). Peak memory consumption was 21.3MB. Max. memory is 16.0GB. [2023-08-27 10:17:58,859 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 341.8MB. Free memory was 319.6MB in the beginning and 319.4MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 512.05ms. Allocated memory is still 341.8MB. Free memory was 316.2MB in the beginning and 291.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 43.72ms. Allocated memory is still 341.8MB. Free memory was 291.0MB in the beginning and 288.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 44.31ms. Allocated memory is still 341.8MB. Free memory was 288.1MB in the beginning and 285.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1036.40ms. Allocated memory was 341.8MB in the beginning and 490.7MB in the end (delta: 148.9MB). Free memory was 285.6MB in the beginning and 429.6MB in the end (delta: -144.0MB). Peak memory consumption was 64.7MB. Max. memory is 16.0GB. * TraceAbstraction took 24466.69ms. Allocated memory was 490.7MB in the beginning and 1.1GB in the end (delta: 589.3MB). Free memory was 429.6MB in the beginning and 996.6MB in the end (delta: -567.0MB). Peak memory consumption was 21.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.9s, 138 PlacesBefore, 37 PlacesAfterwards, 131 TransitionsBefore, 27 TransitionsAfterwards, 2516 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 124 TotalNumberOfCompositions, 8452 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2915, independent: 2648, independent conditional: 0, independent unconditional: 2648, dependent: 267, dependent conditional: 0, dependent unconditional: 267, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1370, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2915, independent: 1335, independent conditional: 0, independent unconditional: 1335, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 1370, unknown conditional: 0, unknown unconditional: 1370] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 105, Positive conditional cache size: 0, Positive unconditional cache size: 105, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: 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_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L859] 0 pthread_t t2257; [L860] FCALL, FORK 0 pthread_create(&t2257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2257, ((void *)0), P0, ((void *)0))=-1, t2257={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L861] 0 pthread_t t2258; [L862] FCALL, FORK 0 pthread_create(&t2258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2258, ((void *)0), P1, ((void *)0))=0, t2257={7:0}, t2258={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L863] 0 pthread_t t2259; [L864] FCALL, FORK 0 pthread_create(&t2259, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2259, ((void *)0), P2, ((void *)0))=1, t2257={7:0}, t2258={8:0}, t2259={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L789] 2 x$w_buff1 = x$w_buff0 [L790] 2 x$w_buff0 = 1 [L791] 2 x$w_buff1_used = x$w_buff0_used [L792] 2 x$w_buff0_used = (_Bool)1 [L793] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L793] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L794] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L795] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L796] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L797] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L798] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 x$flush_delayed = weak$$choice2 [L818] EXPR 3 \read(x) [L818] 3 x$mem_tmp = x [L819] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L821] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L822] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L823] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L824] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L825] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L826] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L828] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L829] EXPR 3 \read(x) [L829] 3 __unbuffered_p2_EAX = x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] 3 x = x$flush_delayed ? x$mem_tmp : x [L831] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L834] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L759] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L801] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L802] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L803] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L804] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L805] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L808] EXPR 2 __unbuffered_cnt + 1 [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 \read(x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L838] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L839] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L840] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L841] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L844] EXPR 3 __unbuffered_cnt + 1 [L844] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 3 return 0; [L782] EXPR 1 __unbuffered_cnt + 1 [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 \read(x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2257={7:0}, t2258={8:0}, t2259={5:0}, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L877] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L879] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe020_power.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 782]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 782]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 164 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.2s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 335 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 335 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1798 IncrementalHoareTripleChecker+Invalid, 1886 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 5 mSDtfsCounter, 1798 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=356occurred in iteration=16, InterpolantAutomatonStates: 88, 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.6s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 197 ConstructedInterpolants, 0 QuantifiedInterpolants, 2658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-27 10:17:58,876 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...