./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label21.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label21.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 09d063705287b401285699bfa86431b1230e05d127a376405f72545cb8e31896 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:41:31,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:41:31,477 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:41:31,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:41:31,484 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:41:31,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:41:31,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:41:31,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:41:31,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:41:31,508 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:41:31,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:41:31,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:41:31,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:41:31,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:41:31,509 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:41:31,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:41:31,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:41:31,509 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:41:31,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:41:31,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:41:31,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:41:31,509 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:41:31,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:41:31,510 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:41:31,510 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:41:31,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:41:31,510 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:41:31,510 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:41:31,510 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:41:31,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:41:31,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:41:31,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:41:31,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:41:31,510 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:41:31,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:41:31,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:41:31,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:41:31,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:41:31,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:41:31,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:41:31,511 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:41:31,512 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:41:31,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:41:31,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:41:31,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:41:31,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:41:31,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:41:31,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:41:31,512 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 09d063705287b401285699bfa86431b1230e05d127a376405f72545cb8e31896 [2025-01-08 23:41:31,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:41:31,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:41:31,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:41:31,736 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:41:31,736 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:41:31,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label21.c [2025-01-08 23:41:32,853 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e9e8b3af/97efbfbd4bbf4062abfce965262c0d2c/FLAG23dc2a5ef [2025-01-08 23:41:33,160 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:41:33,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label21.c [2025-01-08 23:41:33,171 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e9e8b3af/97efbfbd4bbf4062abfce965262c0d2c/FLAG23dc2a5ef [2025-01-08 23:41:33,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e9e8b3af/97efbfbd4bbf4062abfce965262c0d2c [2025-01-08 23:41:33,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:41:33,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:41:33,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:41:33,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:41:33,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:41:33,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:41:33" (1/1) ... [2025-01-08 23:41:33,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a947389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:33, skipping insertion in model container [2025-01-08 23:41:33,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:41:33" (1/1) ... [2025-01-08 23:41:33,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:41:33,362 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label21.c[3545,3558] [2025-01-08 23:41:33,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:41:33,566 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:41:33,584 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label21.c[3545,3558] [2025-01-08 23:41:33,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:41:33,687 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:41:33,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:33 WrapperNode [2025-01-08 23:41:33,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:41:33,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:41:33,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:41:33,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:41:33,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:33" (1/1) ... [2025-01-08 23:41:33,710 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:33" (1/1) ... [2025-01-08 23:41:33,773 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-01-08 23:41:33,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:41:33,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:41:33,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:41:33,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:41:33,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:33" (1/1) ... [2025-01-08 23:41:33,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:33" (1/1) ... [2025-01-08 23:41:33,792 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:33" (1/1) ... [2025-01-08 23:41:33,895 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 23:41:33,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:33" (1/1) ... [2025-01-08 23:41:33,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:33" (1/1) ... [2025-01-08 23:41:33,950 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:33" (1/1) ... [2025-01-08 23:41:33,957 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:33" (1/1) ... [2025-01-08 23:41:33,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:33" (1/1) ... [2025-01-08 23:41:33,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:33" (1/1) ... [2025-01-08 23:41:33,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:33" (1/1) ... [2025-01-08 23:41:33,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:41:33,996 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:41:33,996 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:41:33,996 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:41:33,997 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:33" (1/1) ... [2025-01-08 23:41:34,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:41:34,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:41:34,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:41:34,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:41:34,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:41:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:41:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:41:34,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:41:34,085 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:41:34,087 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:41:35,295 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-01-08 23:41:35,295 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:41:35,305 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:41:35,306 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:41:35,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:41:35 BoogieIcfgContainer [2025-01-08 23:41:35,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:41:35,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:41:35,308 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:41:35,311 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:41:35,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:41:33" (1/3) ... [2025-01-08 23:41:35,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e10daf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:41:35, skipping insertion in model container [2025-01-08 23:41:35,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:33" (2/3) ... [2025-01-08 23:41:35,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e10daf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:41:35, skipping insertion in model container [2025-01-08 23:41:35,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:41:35" (3/3) ... [2025-01-08 23:41:35,313 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label21.c [2025-01-08 23:41:35,323 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:41:35,324 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label21.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:41:35,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:41:35,371 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@f32a145, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:41:35,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:41:35,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:35,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-08 23:41:35,379 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:35,379 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:35,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:35,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:35,383 INFO L85 PathProgramCache]: Analyzing trace with hash -85339630, now seen corresponding path program 1 times [2025-01-08 23:41:35,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:35,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070935152] [2025-01-08 23:41:35,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:35,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:35,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-08 23:41:35,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-08 23:41:35,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:35,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:35,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:35,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:35,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070935152] [2025-01-08 23:41:35,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070935152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:35,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:35,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:41:35,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580255301] [2025-01-08 23:41:35,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:35,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:35,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:35,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:35,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:35,570 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:36,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:36,396 INFO L93 Difference]: Finished difference Result 769 states and 1357 transitions. [2025-01-08 23:41:36,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:36,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-01-08 23:41:36,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:36,405 INFO L225 Difference]: With dead ends: 769 [2025-01-08 23:41:36,405 INFO L226 Difference]: Without dead ends: 422 [2025-01-08 23:41:36,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:36,414 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 216 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:36,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 164 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:41:36,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-01-08 23:41:36,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 412. [2025-01-08 23:41:36,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.5231143552311435) internal successors, (626), 411 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 626 transitions. [2025-01-08 23:41:36,461 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 626 transitions. Word has length 24 [2025-01-08 23:41:36,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:36,462 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 626 transitions. [2025-01-08 23:41:36,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:36,462 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 626 transitions. [2025-01-08 23:41:36,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-08 23:41:36,464 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:36,464 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:36,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:41:36,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:36,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:36,465 INFO L85 PathProgramCache]: Analyzing trace with hash 119771279, now seen corresponding path program 1 times [2025-01-08 23:41:36,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:36,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780848067] [2025-01-08 23:41:36,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:36,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:36,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-08 23:41:36,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-08 23:41:36,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:36,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:36,711 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:36,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:36,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780848067] [2025-01-08 23:41:36,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780848067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:36,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:36,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:41:36,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132084920] [2025-01-08 23:41:36,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:36,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:36,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:36,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:36,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:36,714 INFO L87 Difference]: Start difference. First operand 412 states and 626 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:37,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:37,445 INFO L93 Difference]: Finished difference Result 1199 states and 1829 transitions. [2025-01-08 23:41:37,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:37,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-08 23:41:37,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:37,448 INFO L225 Difference]: With dead ends: 1199 [2025-01-08 23:41:37,448 INFO L226 Difference]: Without dead ends: 789 [2025-01-08 23:41:37,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:37,450 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 156 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:37,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 176 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:41:37,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-01-08 23:41:37,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2025-01-08 23:41:37,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:37,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2025-01-08 23:41:37,467 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 90 [2025-01-08 23:41:37,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:37,468 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2025-01-08 23:41:37,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:37,468 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2025-01-08 23:41:37,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-08 23:41:37,469 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:37,469 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:37,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:41:37,469 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:37,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:37,470 INFO L85 PathProgramCache]: Analyzing trace with hash 378015877, now seen corresponding path program 1 times [2025-01-08 23:41:37,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:37,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452939083] [2025-01-08 23:41:37,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:37,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:37,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-08 23:41:37,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-08 23:41:37,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:37,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:37,677 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:37,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:37,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452939083] [2025-01-08 23:41:37,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452939083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:37,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:37,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:41:37,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901573509] [2025-01-08 23:41:37,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:37,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:37,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:37,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:37,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:37,680 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:38,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:38,304 INFO L93 Difference]: Finished difference Result 2316 states and 3182 transitions. [2025-01-08 23:41:38,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:38,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-08 23:41:38,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:38,313 INFO L225 Difference]: With dead ends: 2316 [2025-01-08 23:41:38,313 INFO L226 Difference]: Without dead ends: 1529 [2025-01-08 23:41:38,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:38,315 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 121 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:38,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 194 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:41:38,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2025-01-08 23:41:38,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1526. [2025-01-08 23:41:38,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 1.2177049180327868) internal successors, (1857), 1525 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:38,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1857 transitions. [2025-01-08 23:41:38,339 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1857 transitions. Word has length 94 [2025-01-08 23:41:38,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:38,339 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 1857 transitions. [2025-01-08 23:41:38,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:38,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1857 transitions. [2025-01-08 23:41:38,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-08 23:41:38,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:38,342 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:38,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:41:38,343 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:38,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:38,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1671708798, now seen corresponding path program 1 times [2025-01-08 23:41:38,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:38,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894526433] [2025-01-08 23:41:38,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:38,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:38,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-08 23:41:38,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-08 23:41:38,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:38,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:38,528 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:38,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:38,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894526433] [2025-01-08 23:41:38,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894526433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:38,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:38,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:38,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491301696] [2025-01-08 23:41:38,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:38,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:38,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:38,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:38,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:38,530 INFO L87 Difference]: Start difference. First operand 1526 states and 1857 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:39,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:39,104 INFO L93 Difference]: Finished difference Result 3614 states and 4472 transitions. [2025-01-08 23:41:39,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:39,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2025-01-08 23:41:39,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:39,110 INFO L225 Difference]: With dead ends: 3614 [2025-01-08 23:41:39,110 INFO L226 Difference]: Without dead ends: 2274 [2025-01-08 23:41:39,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:39,112 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 181 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:39,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 336 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:41:39,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2025-01-08 23:41:39,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 1897. [2025-01-08 23:41:39,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1896 states have (on average 1.2162447257383966) internal successors, (2306), 1896 states have internal predecessors, (2306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:39,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2306 transitions. [2025-01-08 23:41:39,142 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2306 transitions. Word has length 151 [2025-01-08 23:41:39,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:39,143 INFO L471 AbstractCegarLoop]: Abstraction has 1897 states and 2306 transitions. [2025-01-08 23:41:39,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:39,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2306 transitions. [2025-01-08 23:41:39,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-08 23:41:39,146 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:39,146 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:39,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:41:39,146 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:39,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:39,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1658659583, now seen corresponding path program 1 times [2025-01-08 23:41:39,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:39,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782579011] [2025-01-08 23:41:39,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:39,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:39,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-08 23:41:39,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-08 23:41:39,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:39,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-01-08 23:41:39,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:39,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782579011] [2025-01-08 23:41:39,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782579011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:39,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:39,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:39,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041228395] [2025-01-08 23:41:39,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:39,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:39,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:39,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:39,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:39,408 INFO L87 Difference]: Start difference. First operand 1897 states and 2306 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:40,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:40,016 INFO L93 Difference]: Finished difference Result 4897 states and 6070 transitions. [2025-01-08 23:41:40,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:40,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-01-08 23:41:40,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:40,025 INFO L225 Difference]: With dead ends: 4897 [2025-01-08 23:41:40,025 INFO L226 Difference]: Without dead ends: 3002 [2025-01-08 23:41:40,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:40,028 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 188 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:40,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 337 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:41:40,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3002 states. [2025-01-08 23:41:40,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3002 to 3002. [2025-01-08 23:41:40,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3002 states, 3001 states have (on average 1.1922692435854716) internal successors, (3578), 3001 states have internal predecessors, (3578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 3578 transitions. [2025-01-08 23:41:40,067 INFO L78 Accepts]: Start accepts. Automaton has 3002 states and 3578 transitions. Word has length 206 [2025-01-08 23:41:40,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:40,068 INFO L471 AbstractCegarLoop]: Abstraction has 3002 states and 3578 transitions. [2025-01-08 23:41:40,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:40,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 3578 transitions. [2025-01-08 23:41:40,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-08 23:41:40,071 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:40,071 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:40,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:41:40,072 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:40,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:40,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1803834146, now seen corresponding path program 1 times [2025-01-08 23:41:40,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:40,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109093821] [2025-01-08 23:41:40,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:40,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:40,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-08 23:41:40,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-08 23:41:40,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:40,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:40,256 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-01-08 23:41:40,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:40,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109093821] [2025-01-08 23:41:40,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109093821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:40,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:40,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:40,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273302631] [2025-01-08 23:41:40,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:40,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:40,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:40,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:40,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:40,261 INFO L87 Difference]: Start difference. First operand 3002 states and 3578 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:40,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:40,894 INFO L93 Difference]: Finished difference Result 6558 states and 7938 transitions. [2025-01-08 23:41:40,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:40,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2025-01-08 23:41:40,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:40,903 INFO L225 Difference]: With dead ends: 6558 [2025-01-08 23:41:40,904 INFO L226 Difference]: Without dead ends: 3558 [2025-01-08 23:41:40,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:40,906 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 173 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:40,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 384 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:41:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2025-01-08 23:41:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3553. [2025-01-08 23:41:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3553 states, 3552 states have (on average 1.1905968468468469) internal successors, (4229), 3552 states have internal predecessors, (4229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3553 states to 3553 states and 4229 transitions. [2025-01-08 23:41:40,944 INFO L78 Accepts]: Start accepts. Automaton has 3553 states and 4229 transitions. Word has length 254 [2025-01-08 23:41:40,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:40,944 INFO L471 AbstractCegarLoop]: Abstraction has 3553 states and 4229 transitions. [2025-01-08 23:41:40,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:40,944 INFO L276 IsEmpty]: Start isEmpty. Operand 3553 states and 4229 transitions. [2025-01-08 23:41:40,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-01-08 23:41:40,947 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:40,948 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:40,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:41:40,948 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:40,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:40,948 INFO L85 PathProgramCache]: Analyzing trace with hash -548245552, now seen corresponding path program 1 times [2025-01-08 23:41:40,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:40,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441909125] [2025-01-08 23:41:40,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:40,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:40,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-01-08 23:41:40,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-01-08 23:41:40,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:40,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:41,065 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-08 23:41:41,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:41,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441909125] [2025-01-08 23:41:41,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441909125] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:41,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:41,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:41,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491838047] [2025-01-08 23:41:41,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:41,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:41,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:41,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:41,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:41,066 INFO L87 Difference]: Start difference. First operand 3553 states and 4229 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:41,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:41,629 INFO L93 Difference]: Finished difference Result 8574 states and 10383 transitions. [2025-01-08 23:41:41,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:41,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 286 [2025-01-08 23:41:41,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:41,639 INFO L225 Difference]: With dead ends: 8574 [2025-01-08 23:41:41,640 INFO L226 Difference]: Without dead ends: 5023 [2025-01-08 23:41:41,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:41,643 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 159 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:41,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 154 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:41:41,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2025-01-08 23:41:41,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 5021. [2025-01-08 23:41:41,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5021 states, 5020 states have (on average 1.1741035856573705) internal successors, (5894), 5020 states have internal predecessors, (5894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5021 states to 5021 states and 5894 transitions. [2025-01-08 23:41:41,694 INFO L78 Accepts]: Start accepts. Automaton has 5021 states and 5894 transitions. Word has length 286 [2025-01-08 23:41:41,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:41,695 INFO L471 AbstractCegarLoop]: Abstraction has 5021 states and 5894 transitions. [2025-01-08 23:41:41,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:41,695 INFO L276 IsEmpty]: Start isEmpty. Operand 5021 states and 5894 transitions. [2025-01-08 23:41:41,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-01-08 23:41:41,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:41,700 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:41,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:41:41,700 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:41,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:41,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1118805021, now seen corresponding path program 1 times [2025-01-08 23:41:41,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:41,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365199788] [2025-01-08 23:41:41,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:41,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:41,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-01-08 23:41:41,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-01-08 23:41:41,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:41,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-01-08 23:41:41,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:41,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365199788] [2025-01-08 23:41:41,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365199788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:41,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:41,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:41,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486738617] [2025-01-08 23:41:41,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:41,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:41,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:41,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:41,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:41,881 INFO L87 Difference]: Start difference. First operand 5021 states and 5894 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:42,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:42,536 INFO L93 Difference]: Finished difference Result 11695 states and 13850 transitions. [2025-01-08 23:41:42,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:42,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 344 [2025-01-08 23:41:42,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:42,550 INFO L225 Difference]: With dead ends: 11695 [2025-01-08 23:41:42,550 INFO L226 Difference]: Without dead ends: 6492 [2025-01-08 23:41:42,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:42,555 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 176 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:42,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 364 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:41:42,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6492 states. [2025-01-08 23:41:42,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6492 to 6308. [2025-01-08 23:41:42,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6308 states, 6307 states have (on average 1.1636277152370382) internal successors, (7339), 6307 states have internal predecessors, (7339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:42,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6308 states to 6308 states and 7339 transitions. [2025-01-08 23:41:42,623 INFO L78 Accepts]: Start accepts. Automaton has 6308 states and 7339 transitions. Word has length 344 [2025-01-08 23:41:42,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:42,623 INFO L471 AbstractCegarLoop]: Abstraction has 6308 states and 7339 transitions. [2025-01-08 23:41:42,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:42,624 INFO L276 IsEmpty]: Start isEmpty. Operand 6308 states and 7339 transitions. [2025-01-08 23:41:42,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-01-08 23:41:42,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:42,630 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:42,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:41:42,630 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:42,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:42,630 INFO L85 PathProgramCache]: Analyzing trace with hash -123505751, now seen corresponding path program 1 times [2025-01-08 23:41:42,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:42,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625496505] [2025-01-08 23:41:42,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:42,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:42,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-01-08 23:41:42,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-01-08 23:41:42,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:42,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:42,792 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-01-08 23:41:42,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:42,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625496505] [2025-01-08 23:41:42,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625496505] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:42,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:42,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:42,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255406458] [2025-01-08 23:41:42,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:42,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:42,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:42,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:42,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:42,795 INFO L87 Difference]: Start difference. First operand 6308 states and 7339 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:43,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:43,372 INFO L93 Difference]: Finished difference Result 14270 states and 16603 transitions. [2025-01-08 23:41:43,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:43,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 349 [2025-01-08 23:41:43,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:43,393 INFO L225 Difference]: With dead ends: 14270 [2025-01-08 23:41:43,395 INFO L226 Difference]: Without dead ends: 7964 [2025-01-08 23:41:43,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:43,400 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 196 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:43,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 306 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:41:43,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7964 states. [2025-01-08 23:41:43,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7964 to 7044. [2025-01-08 23:41:43,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7044 states, 7043 states have (on average 1.1601590231435468) internal successors, (8171), 7043 states have internal predecessors, (8171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:43,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7044 states to 7044 states and 8171 transitions. [2025-01-08 23:41:43,476 INFO L78 Accepts]: Start accepts. Automaton has 7044 states and 8171 transitions. Word has length 349 [2025-01-08 23:41:43,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:43,476 INFO L471 AbstractCegarLoop]: Abstraction has 7044 states and 8171 transitions. [2025-01-08 23:41:43,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:43,481 INFO L276 IsEmpty]: Start isEmpty. Operand 7044 states and 8171 transitions. [2025-01-08 23:41:43,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-01-08 23:41:43,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:43,488 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:43,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:41:43,489 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:43,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:43,490 INFO L85 PathProgramCache]: Analyzing trace with hash 640043896, now seen corresponding path program 1 times [2025-01-08 23:41:43,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:43,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452314171] [2025-01-08 23:41:43,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:43,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:43,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-01-08 23:41:43,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-01-08 23:41:43,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:43,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-01-08 23:41:43,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:43,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452314171] [2025-01-08 23:41:43,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452314171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:43,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:43,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:43,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353322031] [2025-01-08 23:41:43,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:43,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:43,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:43,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:43,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:43,659 INFO L87 Difference]: Start difference. First operand 7044 states and 8171 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:44,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:44,181 INFO L93 Difference]: Finished difference Result 14084 states and 16338 transitions. [2025-01-08 23:41:44,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:44,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 383 [2025-01-08 23:41:44,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:44,197 INFO L225 Difference]: With dead ends: 14084 [2025-01-08 23:41:44,197 INFO L226 Difference]: Without dead ends: 7042 [2025-01-08 23:41:44,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:44,203 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 209 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:44,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 300 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:41:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7042 states. [2025-01-08 23:41:44,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7042 to 7042. [2025-01-08 23:41:44,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7042 states, 7041 states have (on average 1.14017895185343) internal successors, (8028), 7041 states have internal predecessors, (8028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7042 states to 7042 states and 8028 transitions. [2025-01-08 23:41:44,262 INFO L78 Accepts]: Start accepts. Automaton has 7042 states and 8028 transitions. Word has length 383 [2025-01-08 23:41:44,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:44,263 INFO L471 AbstractCegarLoop]: Abstraction has 7042 states and 8028 transitions. [2025-01-08 23:41:44,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:44,263 INFO L276 IsEmpty]: Start isEmpty. Operand 7042 states and 8028 transitions. [2025-01-08 23:41:44,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2025-01-08 23:41:44,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:44,271 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:44,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:41:44,271 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:44,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:44,272 INFO L85 PathProgramCache]: Analyzing trace with hash -610228456, now seen corresponding path program 1 times [2025-01-08 23:41:44,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:44,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897466174] [2025-01-08 23:41:44,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:44,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:44,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-01-08 23:41:44,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-01-08 23:41:44,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:44,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-01-08 23:41:44,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:44,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897466174] [2025-01-08 23:41:44,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897466174] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:44,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:44,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:44,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952134754] [2025-01-08 23:41:44,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:44,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:41:44,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:44,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:41:44,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:41:44,539 INFO L87 Difference]: Start difference. First operand 7042 states and 8028 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:45,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:45,484 INFO L93 Difference]: Finished difference Result 19442 states and 22157 transitions. [2025-01-08 23:41:45,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:41:45,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 396 [2025-01-08 23:41:45,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:45,502 INFO L225 Difference]: With dead ends: 19442 [2025-01-08 23:41:45,502 INFO L226 Difference]: Without dead ends: 12402 [2025-01-08 23:41:45,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:41:45,509 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 225 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:45,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 83 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:41:45,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12402 states. [2025-01-08 23:41:45,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12402 to 12032. [2025-01-08 23:41:45,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12032 states, 12031 states have (on average 1.1413847560468788) internal successors, (13732), 12031 states have internal predecessors, (13732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:45,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12032 states to 12032 states and 13732 transitions. [2025-01-08 23:41:45,654 INFO L78 Accepts]: Start accepts. Automaton has 12032 states and 13732 transitions. Word has length 396 [2025-01-08 23:41:45,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:45,655 INFO L471 AbstractCegarLoop]: Abstraction has 12032 states and 13732 transitions. [2025-01-08 23:41:45,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:45,655 INFO L276 IsEmpty]: Start isEmpty. Operand 12032 states and 13732 transitions. [2025-01-08 23:41:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-08 23:41:45,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:45,672 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:45,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:41:45,672 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:45,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:45,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2133052393, now seen corresponding path program 1 times [2025-01-08 23:41:45,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:45,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121052600] [2025-01-08 23:41:45,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:45,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:45,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-08 23:41:45,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-08 23:41:45,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:45,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:46,285 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 388 proven. 24 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-01-08 23:41:46,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:46,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121052600] [2025-01-08 23:41:46,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121052600] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:41:46,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231621419] [2025-01-08 23:41:46,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:46,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:41:46,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:41:46,292 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:41:46,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:41:46,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-08 23:41:46,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-08 23:41:46,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:46,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:46,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:41:46,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:41:46,646 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-01-08 23:41:46,649 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:41:46,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231621419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:46,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:41:46,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:41:46,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527980914] [2025-01-08 23:41:46,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:46,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:46,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:46,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:46,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:41:46,651 INFO L87 Difference]: Start difference. First operand 12032 states and 13732 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:47,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:47,243 INFO L93 Difference]: Finished difference Result 25179 states and 28793 transitions. [2025-01-08 23:41:47,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:47,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 483 [2025-01-08 23:41:47,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:47,263 INFO L225 Difference]: With dead ends: 25179 [2025-01-08 23:41:47,263 INFO L226 Difference]: Without dead ends: 14073 [2025-01-08 23:41:47,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:41:47,272 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 89 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:47,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 82 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:41:47,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14073 states. [2025-01-08 23:41:47,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14073 to 12216. [2025-01-08 23:41:47,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12216 states, 12215 states have (on average 1.1421203438395415) internal successors, (13951), 12215 states have internal predecessors, (13951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12216 states to 12216 states and 13951 transitions. [2025-01-08 23:41:47,373 INFO L78 Accepts]: Start accepts. Automaton has 12216 states and 13951 transitions. Word has length 483 [2025-01-08 23:41:47,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:47,374 INFO L471 AbstractCegarLoop]: Abstraction has 12216 states and 13951 transitions. [2025-01-08 23:41:47,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:47,374 INFO L276 IsEmpty]: Start isEmpty. Operand 12216 states and 13951 transitions. [2025-01-08 23:41:47,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-01-08 23:41:47,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:47,385 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:47,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 23:41:47,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-08 23:41:47,587 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:47,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:47,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1055699525, now seen corresponding path program 1 times [2025-01-08 23:41:47,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:47,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396723627] [2025-01-08 23:41:47,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:47,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:47,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-01-08 23:41:47,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-01-08 23:41:47,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:47,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:47,837 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 510 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2025-01-08 23:41:47,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:47,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396723627] [2025-01-08 23:41:47,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396723627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:47,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:47,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:47,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388434196] [2025-01-08 23:41:47,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:47,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:47,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:47,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:47,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:47,839 INFO L87 Difference]: Start difference. First operand 12216 states and 13951 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:48,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:48,420 INFO L93 Difference]: Finished difference Result 27577 states and 31571 transitions. [2025-01-08 23:41:48,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:48,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2025-01-08 23:41:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:48,439 INFO L225 Difference]: With dead ends: 27577 [2025-01-08 23:41:48,439 INFO L226 Difference]: Without dead ends: 16287 [2025-01-08 23:41:48,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:48,448 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 141 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:48,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 131 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:41:48,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16287 states. [2025-01-08 23:41:48,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16287 to 15917. [2025-01-08 23:41:48,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15917 states, 15916 states have (on average 1.128361397336014) internal successors, (17959), 15916 states have internal predecessors, (17959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:48,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15917 states to 15917 states and 17959 transitions. [2025-01-08 23:41:48,660 INFO L78 Accepts]: Start accepts. Automaton has 15917 states and 17959 transitions. Word has length 484 [2025-01-08 23:41:48,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:48,660 INFO L471 AbstractCegarLoop]: Abstraction has 15917 states and 17959 transitions. [2025-01-08 23:41:48,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 15917 states and 17959 transitions. [2025-01-08 23:41:48,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-01-08 23:41:48,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:48,677 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:48,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:41:48,677 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:48,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:48,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1483774174, now seen corresponding path program 1 times [2025-01-08 23:41:48,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:48,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337715235] [2025-01-08 23:41:48,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:48,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:48,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-08 23:41:48,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-08 23:41:48,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:48,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:49,425 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 168 proven. 406 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-01-08 23:41:49,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:49,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337715235] [2025-01-08 23:41:49,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337715235] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:41:49,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968282296] [2025-01-08 23:41:49,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:49,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:41:49,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:41:49,433 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:41:49,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:41:49,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-08 23:41:49,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-08 23:41:49,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:49,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:49,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:41:49,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:41:49,688 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2025-01-08 23:41:49,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:41:49,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968282296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:49,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:41:49,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:41:49,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491393898] [2025-01-08 23:41:49,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:49,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:49,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:49,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:49,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:41:49,691 INFO L87 Difference]: Start difference. First operand 15917 states and 17959 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:50,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:50,242 INFO L93 Difference]: Finished difference Result 18309 states and 20621 transitions. [2025-01-08 23:41:50,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:50,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 494 [2025-01-08 23:41:50,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:50,243 INFO L225 Difference]: With dead ends: 18309 [2025-01-08 23:41:50,244 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:41:50,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:41:50,250 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 197 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:50,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 146 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:41:50,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:41:50,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:41:50,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:41:50,251 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 494 [2025-01-08 23:41:50,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:50,251 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:41:50,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:50,251 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:41:50,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:41:50,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:41:50,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 23:41:50,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:41:50,456 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:50,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:41:51,666 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:41:51,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:41:51 BoogieIcfgContainer [2025-01-08 23:41:51,678 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:41:51,679 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:41:51,679 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:41:51,679 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:41:51,679 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:41:35" (3/4) ... [2025-01-08 23:41:51,681 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:41:51,700 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:41:51,701 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:41:51,702 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:41:51,702 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:41:51,818 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:41:51,818 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:41:51,818 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:41:51,819 INFO L158 Benchmark]: Toolchain (without parser) took 18629.51ms. Allocated memory was 142.6MB in the beginning and 738.2MB in the end (delta: 595.6MB). Free memory was 103.5MB in the beginning and 640.0MB in the end (delta: -536.5MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. [2025-01-08 23:41:51,819 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:41:51,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.24ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 59.5MB in the end (delta: 43.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-08 23:41:51,819 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.44ms. Allocated memory is still 142.6MB. Free memory was 58.6MB in the beginning and 41.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:41:51,819 INFO L158 Benchmark]: Boogie Preprocessor took 221.69ms. Allocated memory is still 142.6MB. Free memory was 41.8MB in the beginning and 80.4MB in the end (delta: -38.6MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2025-01-08 23:41:51,819 INFO L158 Benchmark]: RCFGBuilder took 1310.11ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 80.4MB in the beginning and 310.6MB in the end (delta: -230.3MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. [2025-01-08 23:41:51,820 INFO L158 Benchmark]: TraceAbstraction took 16370.54ms. Allocated memory was 360.7MB in the beginning and 738.2MB in the end (delta: 377.5MB). Free memory was 309.6MB in the beginning and 656.4MB in the end (delta: -346.8MB). Peak memory consumption was 475.6MB. Max. memory is 16.1GB. [2025-01-08 23:41:51,820 INFO L158 Benchmark]: Witness Printer took 139.40ms. Allocated memory is still 738.2MB. Free memory was 656.4MB in the beginning and 640.0MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:41:51,821 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.19ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.24ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 59.5MB in the end (delta: 43.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.44ms. Allocated memory is still 142.6MB. Free memory was 58.6MB in the beginning and 41.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 221.69ms. Allocated memory is still 142.6MB. Free memory was 41.8MB in the beginning and 80.4MB in the end (delta: -38.6MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1310.11ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 80.4MB in the beginning and 310.6MB in the end (delta: -230.3MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. * TraceAbstraction took 16370.54ms. Allocated memory was 360.7MB in the beginning and 738.2MB in the end (delta: 377.5MB). Free memory was 309.6MB in the beginning and 656.4MB in the end (delta: -346.8MB). Peak memory consumption was 475.6MB. Max. memory is 16.1GB. * Witness Printer took 139.40ms. Allocated memory is still 738.2MB. Free memory was 656.4MB in the beginning and 640.0MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 88]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2427 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2427 mSDsluCounter, 3157 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 313 mSDsCounter, 1614 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8063 IncrementalHoareTripleChecker+Invalid, 9677 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1614 mSolverCounterUnsat, 2844 mSDtfsCounter, 8063 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1018 GetRequests, 995 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15917occurred in iteration=13, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 4098 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 5015 NumberOfCodeBlocks, 5015 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4999 ConstructedInterpolants, 0 QuantifiedInterpolants, 13809 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1305 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 5076/5506 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((10 <= a25) && (a23 <= 312)) && (246 <= a29)) || ((a25 == 12) && (a4 != 1))) || (((139 <= a23) && (a4 == 1)) && (a23 <= 312))) || ((141 <= a29) && (a4 == 1))) || ((((long long) a23 + 43) <= 0) && (a4 != 1))) || ((a29 <= 220) && (a25 == 10))) || (((a25 <= 10) && (a4 == 1)) && (a23 <= 312))) || ((a25 == 12) && (a29 <= 130))) || (((a25 == 13) && (a4 != 1)) && (a23 <= 312))) || ((a25 == 13) && (((long long) a23 + 43) <= 0))) || (((a25 == 13) && (a4 == 1)) && (312 <= a23))) || (((a29 <= 220) && (a4 != 1)) && (a23 <= 312))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:41:51,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE