./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label49.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/Problem16_label49.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 4910e0bbb7a4c656d48064116d1212b3394ff1881ffffb38aebc0e1b0fb73ac8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:00:01,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:00:01,199 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 12:00:01,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:00:01,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:00:01,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:00:01,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:00:01,231 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:00:01,231 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:00:01,231 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:00:01,231 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:00:01,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:00:01,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:00:01,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:00:01,232 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:00:01,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:00:01,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:00:01,232 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:00:01,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:00:01,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:00:01,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:00:01,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:00:01,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:00:01,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:00:01,232 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:00:01,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:00:01,232 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:00:01,232 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:00:01,234 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:00:01,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:00:01,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:00:01,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:00:01,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:00:01,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:00:01,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:00:01,235 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:00:01,235 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:00:01,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:00:01,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:00:01,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:00:01,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:00:01,235 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:00:01,235 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:00:01,236 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 -> 4910e0bbb7a4c656d48064116d1212b3394ff1881ffffb38aebc0e1b0fb73ac8 [2025-02-05 12:00:01,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:00:01,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:00:01,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:00:01,483 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:00:01,483 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:00:01,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label49.c [2025-02-05 12:00:02,682 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ccb70a94/e7891a1813184addb5ef812c8afc9a58/FLAG385367d38 [2025-02-05 12:00:02,983 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:00:02,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label49.c [2025-02-05 12:00:03,006 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ccb70a94/e7891a1813184addb5ef812c8afc9a58/FLAG385367d38 [2025-02-05 12:00:03,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ccb70a94/e7891a1813184addb5ef812c8afc9a58 [2025-02-05 12:00:03,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:00:03,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:00:03,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:00:03,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:00:03,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:00:03,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:00:03" (1/1) ... [2025-02-05 12:00:03,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f03c77b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:00:03, skipping insertion in model container [2025-02-05 12:00:03,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:00:03" (1/1) ... [2025-02-05 12:00:03,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:00:03,419 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/Problem16_label49.c[6302,6315] [2025-02-05 12:00:03,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:00:03,648 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:00:03,671 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/Problem16_label49.c[6302,6315] [2025-02-05 12:00:03,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:00:03,813 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:00:03,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:00:03 WrapperNode [2025-02-05 12:00:03,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:00:03,815 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:00:03,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:00:03,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:00:03,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:00:03" (1/1) ... [2025-02-05 12:00:03,840 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:00:03" (1/1) ... [2025-02-05 12:00:03,965 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-02-05 12:00:03,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:00:03,966 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:00:03,966 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:00:03,966 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:00:03,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:00:03" (1/1) ... [2025-02-05 12:00:03,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:00:03" (1/1) ... [2025-02-05 12:00:03,998 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:00:03" (1/1) ... [2025-02-05 12:00:04,051 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-02-05 12:00:04,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:00:03" (1/1) ... [2025-02-05 12:00:04,051 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:00:03" (1/1) ... [2025-02-05 12:00:04,103 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:00:03" (1/1) ... [2025-02-05 12:00:04,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:00:03" (1/1) ... [2025-02-05 12:00:04,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:00:03" (1/1) ... [2025-02-05 12:00:04,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:00:03" (1/1) ... [2025-02-05 12:00:04,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:00:04,156 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:00:04,156 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:00:04,156 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:00:04,157 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:00:03" (1/1) ... [2025-02-05 12:00:04,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:00:04,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:00:04,186 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-02-05 12:00:04,201 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-02-05 12:00:04,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:00:04,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:00:04,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:00:04,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:00:04,281 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:00:04,283 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:00:06,118 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-02-05 12:00:06,195 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-02-05 12:00:06,195 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:00:06,210 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:00:06,210 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:00:06,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:00:06 BoogieIcfgContainer [2025-02-05 12:00:06,211 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:00:06,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:00:06,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:00:06,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:00:06,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:00:03" (1/3) ... [2025-02-05 12:00:06,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5028c0b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:00:06, skipping insertion in model container [2025-02-05 12:00:06,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:00:03" (2/3) ... [2025-02-05 12:00:06,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5028c0b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:00:06, skipping insertion in model container [2025-02-05 12:00:06,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:00:06" (3/3) ... [2025-02-05 12:00:06,218 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label49.c [2025-02-05 12:00:06,230 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:00:06,231 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label49.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:00:06,283 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:00:06,294 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;@5690e8e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:00:06,294 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:00:06,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 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-02-05 12:00:06,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 12:00:06,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:00:06,307 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, 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-02-05 12:00:06,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:00:06,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:00:06,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1973502445, now seen corresponding path program 1 times [2025-02-05 12:00:06,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:00:06,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994776295] [2025-02-05 12:00:06,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:00:06,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:00:06,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 12:00:06,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 12:00:06,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:00:06,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:00:06,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:00:06,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:00:06,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994776295] [2025-02-05 12:00:06,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994776295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:00:06,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:00:06,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:00:06,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617223187] [2025-02-05 12:00:06,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:00:06,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:00:06,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:00:06,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:00:06,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:00:06,667 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 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 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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-02-05 12:00:08,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:00:08,154 INFO L93 Difference]: Finished difference Result 1122 states and 2100 transitions. [2025-02-05 12:00:08,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:00:08,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-02-05 12:00:08,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:00:08,173 INFO L225 Difference]: With dead ends: 1122 [2025-02-05 12:00:08,173 INFO L226 Difference]: Without dead ends: 662 [2025-02-05 12:00:08,177 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-02-05 12:00:08,182 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 327 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:00:08,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 254 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:00:08,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-02-05 12:00:08,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-02-05 12:00:08,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.518910741301059) internal successors, (1004), 661 states have internal predecessors, (1004), 0 states have call successors, (0), 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-02-05 12:00:08,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1004 transitions. [2025-02-05 12:00:08,241 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1004 transitions. Word has length 60 [2025-02-05 12:00:08,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:00:08,241 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1004 transitions. [2025-02-05 12:00:08,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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-02-05 12:00:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1004 transitions. [2025-02-05 12:00:08,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 12:00:08,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:00:08,245 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, 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] [2025-02-05 12:00:08,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:00:08,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:00:08,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:00:08,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1261475193, now seen corresponding path program 1 times [2025-02-05 12:00:08,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:00:08,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694759022] [2025-02-05 12:00:08,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:00:08,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:00:08,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 12:00:08,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 12:00:08,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:00:08,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:00:08,547 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:00:08,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:00:08,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694759022] [2025-02-05 12:00:08,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694759022] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:00:08,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:00:08,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:00:08,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075099567] [2025-02-05 12:00:08,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:00:08,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:00:08,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:00:08,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:00:08,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:00:08,550 INFO L87 Difference]: Start difference. First operand 662 states and 1004 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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-02-05 12:00:10,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:00:10,186 INFO L93 Difference]: Finished difference Result 2309 states and 3414 transitions. [2025-02-05 12:00:10,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:00:10,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-02-05 12:00:10,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:00:10,192 INFO L225 Difference]: With dead ends: 2309 [2025-02-05 12:00:10,192 INFO L226 Difference]: Without dead ends: 1649 [2025-02-05 12:00:10,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:00:10,195 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1006 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:00:10,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 44 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:00:10,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2025-02-05 12:00:10,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2025-02-05 12:00:10,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1648 states have (on average 1.4010922330097086) internal successors, (2309), 1648 states have internal predecessors, (2309), 0 states have call successors, (0), 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-02-05 12:00:10,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2309 transitions. [2025-02-05 12:00:10,225 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2309 transitions. Word has length 128 [2025-02-05 12:00:10,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:00:10,226 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2309 transitions. [2025-02-05 12:00:10,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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-02-05 12:00:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2309 transitions. [2025-02-05 12:00:10,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-02-05 12:00:10,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:00:10,235 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, 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, 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] [2025-02-05 12:00:10,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:00:10,235 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:00:10,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:00:10,236 INFO L85 PathProgramCache]: Analyzing trace with hash -324911358, now seen corresponding path program 1 times [2025-02-05 12:00:10,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:00:10,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802247379] [2025-02-05 12:00:10,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:00:10,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:00:10,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-02-05 12:00:10,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-02-05 12:00:10,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:00:10,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:00:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-02-05 12:00:10,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:00:10,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802247379] [2025-02-05 12:00:10,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802247379] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:00:10,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:00:10,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:00:10,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885789867] [2025-02-05 12:00:10,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:00:10,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:00:10,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:00:10,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:00:10,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:00:10,483 INFO L87 Difference]: Start difference. First operand 1649 states and 2309 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 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-02-05 12:00:11,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:00:11,620 INFO L93 Difference]: Finished difference Result 3625 states and 5239 transitions. [2025-02-05 12:00:11,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:00:11,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 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 288 [2025-02-05 12:00:11,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:00:11,631 INFO L225 Difference]: With dead ends: 3625 [2025-02-05 12:00:11,631 INFO L226 Difference]: Without dead ends: 2307 [2025-02-05 12:00:11,634 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-02-05 12:00:11,635 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:00:11,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 77 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 12:00:11,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-02-05 12:00:11,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-02-05 12:00:11,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.3490893321769297) internal successors, (3111), 2306 states have internal predecessors, (3111), 0 states have call successors, (0), 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-02-05 12:00:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3111 transitions. [2025-02-05 12:00:11,690 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3111 transitions. Word has length 288 [2025-02-05 12:00:11,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:00:11,690 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3111 transitions. [2025-02-05 12:00:11,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 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-02-05 12:00:11,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3111 transitions. [2025-02-05 12:00:11,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-02-05 12:00:11,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:00:11,695 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, 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, 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] [2025-02-05 12:00:11,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:00:11,696 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:00:11,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:00:11,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1101093476, now seen corresponding path program 1 times [2025-02-05 12:00:11,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:00:11,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599352107] [2025-02-05 12:00:11,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:00:11,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:00:11,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-02-05 12:00:11,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-02-05 12:00:11,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:00:11,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:00:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-02-05 12:00:12,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:00:12,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599352107] [2025-02-05 12:00:12,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599352107] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:00:12,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:00:12,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:00:12,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129545040] [2025-02-05 12:00:12,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:00:12,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:00:12,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:00:12,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:00:12,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:00:12,008 INFO L87 Difference]: Start difference. First operand 2307 states and 3111 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 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-02-05 12:00:13,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:00:13,194 INFO L93 Difference]: Finished difference Result 5599 states and 7694 transitions. [2025-02-05 12:00:13,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:00:13,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 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 323 [2025-02-05 12:00:13,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:00:13,208 INFO L225 Difference]: With dead ends: 5599 [2025-02-05 12:00:13,208 INFO L226 Difference]: Without dead ends: 3623 [2025-02-05 12:00:13,211 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-02-05 12:00:13,212 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:00:13,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 12:00:13,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2025-02-05 12:00:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 3294. [2025-02-05 12:00:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3294 states, 3293 states have (on average 1.2356513817187975) internal successors, (4069), 3293 states have internal predecessors, (4069), 0 states have call successors, (0), 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-02-05 12:00:13,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 3294 states and 4069 transitions. [2025-02-05 12:00:13,271 INFO L78 Accepts]: Start accepts. Automaton has 3294 states and 4069 transitions. Word has length 323 [2025-02-05 12:00:13,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:00:13,271 INFO L471 AbstractCegarLoop]: Abstraction has 3294 states and 4069 transitions. [2025-02-05 12:00:13,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 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-02-05 12:00:13,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 4069 transitions. [2025-02-05 12:00:13,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-02-05 12:00:13,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:00:13,282 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 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] [2025-02-05 12:00:13,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:00:13,283 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:00:13,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:00:13,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1413373803, now seen corresponding path program 1 times [2025-02-05 12:00:13,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:00:13,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133439214] [2025-02-05 12:00:13,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:00:13,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:00:13,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-02-05 12:00:13,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-02-05 12:00:13,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:00:13,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:00:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 747 proven. 0 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2025-02-05 12:00:13,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:00:13,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133439214] [2025-02-05 12:00:13,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133439214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:00:13,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:00:13,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:00:13,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170011339] [2025-02-05 12:00:13,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:00:13,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:00:13,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:00:13,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:00:13,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:00:13,645 INFO L87 Difference]: Start difference. First operand 3294 states and 4069 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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-02-05 12:00:14,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:00:14,602 INFO L93 Difference]: Finished difference Result 7573 states and 9417 transitions. [2025-02-05 12:00:14,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:00:14,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 576 [2025-02-05 12:00:14,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:00:14,614 INFO L225 Difference]: With dead ends: 7573 [2025-02-05 12:00:14,614 INFO L226 Difference]: Without dead ends: 3952 [2025-02-05 12:00:14,618 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-02-05 12:00:14,619 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 286 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:00:14,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 540 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 12:00:14,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2025-02-05 12:00:14,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2025-02-05 12:00:14,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3951 states have (on average 1.072892938496583) internal successors, (4239), 3951 states have internal predecessors, (4239), 0 states have call successors, (0), 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-02-05 12:00:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4239 transitions. [2025-02-05 12:00:14,673 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 4239 transitions. Word has length 576 [2025-02-05 12:00:14,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:00:14,673 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 4239 transitions. [2025-02-05 12:00:14,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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-02-05 12:00:14,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 4239 transitions. [2025-02-05 12:00:14,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 849 [2025-02-05 12:00:14,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:00:14,687 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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] [2025-02-05 12:00:14,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:00:14,687 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:00:14,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:00:14,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1161197607, now seen corresponding path program 1 times [2025-02-05 12:00:14,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:00:14,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029249961] [2025-02-05 12:00:14,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:00:14,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:00:14,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 848 statements into 1 equivalence classes. [2025-02-05 12:00:14,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 848 of 848 statements. [2025-02-05 12:00:14,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:00:14,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:00:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1503 backedges. 1157 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2025-02-05 12:00:15,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:00:15,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029249961] [2025-02-05 12:00:15,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029249961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:00:15,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:00:15,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:00:15,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391471286] [2025-02-05 12:00:15,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:00:15,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:00:15,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:00:15,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:00:15,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:00:15,578 INFO L87 Difference]: Start difference. First operand 3952 states and 4239 transitions. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 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-02-05 12:00:16,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:00:16,271 INFO L93 Difference]: Finished difference Result 8889 states and 9584 transitions. [2025-02-05 12:00:16,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:00:16,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 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 848 [2025-02-05 12:00:16,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:00:16,286 INFO L225 Difference]: With dead ends: 8889 [2025-02-05 12:00:16,287 INFO L226 Difference]: Without dead ends: 5268 [2025-02-05 12:00:16,292 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-02-05 12:00:16,294 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 220 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:00:16,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 427 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 12:00:16,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2025-02-05 12:00:16,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 5268. [2025-02-05 12:00:16,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5268 states, 5267 states have (on average 1.0599962027719765) internal successors, (5583), 5267 states have internal predecessors, (5583), 0 states have call successors, (0), 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-02-05 12:00:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 5583 transitions. [2025-02-05 12:00:16,381 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 5583 transitions. Word has length 848 [2025-02-05 12:00:16,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:00:16,382 INFO L471 AbstractCegarLoop]: Abstraction has 5268 states and 5583 transitions. [2025-02-05 12:00:16,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 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-02-05 12:00:16,382 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 5583 transitions. [2025-02-05 12:00:16,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 912 [2025-02-05 12:00:16,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:00:16,397 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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-02-05 12:00:16,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:00:16,397 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:00:16,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:00:16,398 INFO L85 PathProgramCache]: Analyzing trace with hash 112176016, now seen corresponding path program 1 times [2025-02-05 12:00:16,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:00:16,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405427967] [2025-02-05 12:00:16,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:00:16,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:00:16,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 911 statements into 1 equivalence classes. [2025-02-05 12:00:16,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 911 of 911 statements. [2025-02-05 12:00:16,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:00:16,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:00:16,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1658 backedges. 1132 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2025-02-05 12:00:16,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:00:16,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405427967] [2025-02-05 12:00:16,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405427967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:00:16,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:00:16,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:00:16,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27697854] [2025-02-05 12:00:16,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:00:16,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:00:16,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:00:16,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:00:16,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:00:16,919 INFO L87 Difference]: Start difference. First operand 5268 states and 5583 transitions. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 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-02-05 12:00:17,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:00:17,649 INFO L93 Difference]: Finished difference Result 11850 states and 12616 transitions. [2025-02-05 12:00:17,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:00:17,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 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 911 [2025-02-05 12:00:17,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:00:17,668 INFO L225 Difference]: With dead ends: 11850 [2025-02-05 12:00:17,669 INFO L226 Difference]: Without dead ends: 6913 [2025-02-05 12:00:17,674 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-02-05 12:00:17,675 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 175 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:00:17,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 414 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 12:00:17,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6913 states. [2025-02-05 12:00:17,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6913 to 6584. [2025-02-05 12:00:17,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6584 states, 6583 states have (on average 1.0446604891386906) internal successors, (6877), 6583 states have internal predecessors, (6877), 0 states have call successors, (0), 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-02-05 12:00:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6584 states to 6584 states and 6877 transitions. [2025-02-05 12:00:17,774 INFO L78 Accepts]: Start accepts. Automaton has 6584 states and 6877 transitions. Word has length 911 [2025-02-05 12:00:17,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:00:17,782 INFO L471 AbstractCegarLoop]: Abstraction has 6584 states and 6877 transitions. [2025-02-05 12:00:17,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 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-02-05 12:00:17,782 INFO L276 IsEmpty]: Start isEmpty. Operand 6584 states and 6877 transitions. [2025-02-05 12:00:17,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1285 [2025-02-05 12:00:17,795 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:00:17,796 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 12:00:17,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 12:00:17,796 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:00:17,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:00:17,797 INFO L85 PathProgramCache]: Analyzing trace with hash 2104301086, now seen corresponding path program 1 times [2025-02-05 12:00:17,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:00:17,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102743685] [2025-02-05 12:00:17,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:00:17,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:00:17,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1284 statements into 1 equivalence classes. [2025-02-05 12:00:17,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1284 of 1284 statements. [2025-02-05 12:00:17,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:00:17,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:00:19,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3022 backedges. 1771 proven. 0 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2025-02-05 12:00:19,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:00:19,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102743685] [2025-02-05 12:00:19,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102743685] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:00:19,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:00:19,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:00:19,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459516920] [2025-02-05 12:00:19,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:00:19,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:00:19,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:00:19,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:00:19,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:00:19,078 INFO L87 Difference]: Start difference. First operand 6584 states and 6877 transitions. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 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-02-05 12:00:19,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:00:19,800 INFO L93 Difference]: Finished difference Result 13824 states and 14473 transitions. [2025-02-05 12:00:19,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:00:19,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 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 1284 [2025-02-05 12:00:19,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:00:19,825 INFO L225 Difference]: With dead ends: 13824 [2025-02-05 12:00:19,825 INFO L226 Difference]: Without dead ends: 7571 [2025-02-05 12:00:19,834 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-02-05 12:00:19,835 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:00:19,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 439 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 12:00:19,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2025-02-05 12:00:19,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 7571. [2025-02-05 12:00:19,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7571 states, 7570 states have (on average 1.0397622192866578) internal successors, (7871), 7570 states have internal predecessors, (7871), 0 states have call successors, (0), 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-02-05 12:00:19,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 7871 transitions. [2025-02-05 12:00:19,917 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 7871 transitions. Word has length 1284 [2025-02-05 12:00:19,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:00:19,918 INFO L471 AbstractCegarLoop]: Abstraction has 7571 states and 7871 transitions. [2025-02-05 12:00:19,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 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-02-05 12:00:19,919 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 7871 transitions. [2025-02-05 12:00:19,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1303 [2025-02-05 12:00:19,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:00:19,935 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2025-02-05 12:00:19,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 12:00:19,935 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:00:19,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:00:19,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1606403539, now seen corresponding path program 1 times [2025-02-05 12:00:19,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:00:19,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114329486] [2025-02-05 12:00:19,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:00:19,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:00:20,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1302 statements into 1 equivalence classes. [2025-02-05 12:00:20,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1302 of 1302 statements. [2025-02-05 12:00:20,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:00:20,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:00:21,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3052 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 2647 trivial. 0 not checked. [2025-02-05 12:00:21,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:00:21,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114329486] [2025-02-05 12:00:21,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114329486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:00:21,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:00:21,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 12:00:21,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670151182] [2025-02-05 12:00:21,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:00:21,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 12:00:21,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:00:21,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 12:00:21,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:00:21,135 INFO L87 Difference]: Start difference. First operand 7571 states and 7871 transitions. Second operand has 6 states, 6 states have (on average 59.0) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 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-02-05 12:00:21,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:00:21,565 INFO L93 Difference]: Finished difference Result 14539 states and 15123 transitions. [2025-02-05 12:00:21,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 12:00:21,569 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 59.0) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 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 1302 [2025-02-05 12:00:21,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:00:21,572 INFO L225 Difference]: With dead ends: 14539 [2025-02-05 12:00:21,572 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 12:00:21,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:00:21,579 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 33 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:00:21,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 446 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 12:00:21,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 12:00:21,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 12:00:21,580 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-02-05 12:00:21,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 12:00:21,580 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1302 [2025-02-05 12:00:21,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:00:21,580 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 12:00:21,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.0) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 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-02-05 12:00:21,580 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 12:00:21,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 12:00:21,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 12:00:21,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 12:00:21,587 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:00:21,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 12:00:21,701 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 12:00:21,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 12:00:21 BoogieIcfgContainer [2025-02-05 12:00:21,715 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 12:00:21,716 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 12:00:21,716 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 12:00:21,716 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 12:00:21,717 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:00:06" (3/4) ... [2025-02-05 12:00:21,719 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 12:00:21,747 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-05 12:00:21,748 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 12:00:21,750 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 12:00:21,751 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 12:00:21,898 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 12:00:21,898 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 12:00:21,898 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 12:00:21,899 INFO L158 Benchmark]: Toolchain (without parser) took 18662.54ms. Allocated memory was 142.6MB in the beginning and 746.6MB in the end (delta: 604.0MB). Free memory was 102.1MB in the beginning and 601.0MB in the end (delta: -498.9MB). Peak memory consumption was 101.1MB. Max. memory is 16.1GB. [2025-02-05 12:00:21,899 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 12:00:21,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.21ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 42.5MB in the end (delta: 58.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-05 12:00:21,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 150.83ms. Allocated memory is still 142.6MB. Free memory was 42.5MB in the beginning and 83.9MB in the end (delta: -41.4MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2025-02-05 12:00:21,900 INFO L158 Benchmark]: Boogie Preprocessor took 188.20ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 51.2MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-05 12:00:21,900 INFO L158 Benchmark]: IcfgBuilder took 2055.05ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 51.2MB in the beginning and 152.2MB in the end (delta: -101.0MB). Peak memory consumption was 110.2MB. Max. memory is 16.1GB. [2025-02-05 12:00:21,901 INFO L158 Benchmark]: TraceAbstraction took 15502.68ms. Allocated memory was 343.9MB in the beginning and 746.6MB in the end (delta: 402.7MB). Free memory was 151.4MB in the beginning and 625.9MB in the end (delta: -474.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 12:00:21,901 INFO L158 Benchmark]: Witness Printer took 182.33ms. Allocated memory is still 746.6MB. Free memory was 625.9MB in the beginning and 601.0MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 12:00:21,903 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.69ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 577.21ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 42.5MB in the end (delta: 58.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 150.83ms. Allocated memory is still 142.6MB. Free memory was 42.5MB in the beginning and 83.9MB in the end (delta: -41.4MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 188.20ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 51.2MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * IcfgBuilder took 2055.05ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 51.2MB in the beginning and 152.2MB in the end (delta: -101.0MB). Peak memory consumption was 110.2MB. Max. memory is 16.1GB. * TraceAbstraction took 15502.68ms. Allocated memory was 343.9MB in the beginning and 746.6MB in the end (delta: 402.7MB). Free memory was 151.4MB in the beginning and 625.9MB in the end (delta: -474.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 182.33ms. Allocated memory is still 746.6MB. Free memory was 625.9MB in the beginning and 601.0MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. 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: 197]: 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, 396 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 9, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2908 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2908 mSDsluCounter, 2796 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 2129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7636 IncrementalHoareTripleChecker+Invalid, 9765 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2129 mSolverCounterUnsat, 2735 mSDtfsCounter, 7636 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7571occurred in iteration=8, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 658 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 5720 NumberOfCodeBlocks, 5720 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 5711 ConstructedInterpolants, 0 QuantifiedInterpolants, 9168 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 11145/11145 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: 1783]: Location Invariant Derived location invariant: ((((((a12 == 6) && (a16 <= 11)) || ((a16 != 10) && (a15 <= 3))) || ((a12 == 8) && (a15 == 3))) || ((a12 <= 5) && (a16 <= 11))) || ((a16 != 10) && (a16 <= 11))) RESULT: Ultimate proved your program to be correct! [2025-02-05 12:00:21,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE