./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label24.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label24.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 2a6634174770c2d78435b26741915661650ffd8b51b8148a319e19b0e5237d4f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:49:07,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:49:07,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:49:07,893 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:49:07,894 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:49:07,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:49:07,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:49:07,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:49:07,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:49:07,915 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:49:07,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:49:07,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:49:07,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:49:07,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:49:07,917 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:49:07,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:49:07,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:49:07,917 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:49:07,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:49:07,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:49:07,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:49:07,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:49:07,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:49:07,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:49:07,918 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:49:07,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:49:07,918 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:49:07,918 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:49:07,918 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:49:07,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:49:07,919 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:49:07,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:49:07,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:49:07,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:49:07,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:49:07,919 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:49:07,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:49:07,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:49:07,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:49:07,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:49:07,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:49:07,919 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:49:07,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:49:07,920 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/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 -> 2a6634174770c2d78435b26741915661650ffd8b51b8148a319e19b0e5237d4f [2025-03-03 09:49:08,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:49:08,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:49:08,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:49:08,135 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:49:08,137 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:49:08,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label24.c [2025-03-03 09:49:09,245 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/887accf47/bbcd549c6c074b18a4d8ae6f744e7313/FLAGb81c4d6e7 [2025-03-03 09:49:09,552 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:49:09,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label24.c [2025-03-03 09:49:09,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/887accf47/bbcd549c6c074b18a4d8ae6f744e7313/FLAGb81c4d6e7 [2025-03-03 09:49:09,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/887accf47/bbcd549c6c074b18a4d8ae6f744e7313 [2025-03-03 09:49:09,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:49:09,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:49:09,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:49:09,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:49:09,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:49:09,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:49:09" (1/1) ... [2025-03-03 09:49:09,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39ad58ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:09, skipping insertion in model container [2025-03-03 09:49:09,838 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:49:09" (1/1) ... [2025-03-03 09:49:09,868 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:49:10,101 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label24.c[18375,18388] [2025-03-03 09:49:10,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:49:10,128 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:49:10,170 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label24.c[18375,18388] [2025-03-03 09:49:10,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:49:10,185 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:49:10,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:10 WrapperNode [2025-03-03 09:49:10,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:49:10,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:49:10,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:49:10,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:49:10,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:10" (1/1) ... [2025-03-03 09:49:10,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:10" (1/1) ... [2025-03-03 09:49:10,238 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666 [2025-03-03 09:49:10,238 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:49:10,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:49:10,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:49:10,239 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:49:10,251 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:10" (1/1) ... [2025-03-03 09:49:10,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:10" (1/1) ... [2025-03-03 09:49:10,254 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:10" (1/1) ... [2025-03-03 09:49:10,278 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-03-03 09:49:10,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:10" (1/1) ... [2025-03-03 09:49:10,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:10" (1/1) ... [2025-03-03 09:49:10,293 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:10" (1/1) ... [2025-03-03 09:49:10,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:10" (1/1) ... [2025-03-03 09:49:10,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:10" (1/1) ... [2025-03-03 09:49:10,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:10" (1/1) ... [2025-03-03 09:49:10,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:49:10,304 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:49:10,305 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:49:10,305 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:49:10,305 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:10" (1/1) ... [2025-03-03 09:49:10,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:49:10,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:49:10,331 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:49:10,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:49:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:49:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:49:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:49:10,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:49:10,403 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:49:10,404 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:49:11,212 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-03 09:49:11,212 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:49:11,225 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:49:11,225 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:49:11,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:49:11 BoogieIcfgContainer [2025-03-03 09:49:11,226 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:49:11,229 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:49:11,229 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:49:11,232 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:49:11,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:49:09" (1/3) ... [2025-03-03 09:49:11,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f44ec4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:49:11, skipping insertion in model container [2025-03-03 09:49:11,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:10" (2/3) ... [2025-03-03 09:49:11,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f44ec4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:49:11, skipping insertion in model container [2025-03-03 09:49:11,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:49:11" (3/3) ... [2025-03-03 09:49:11,235 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem02_label24.c [2025-03-03 09:49:11,246 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:49:11,247 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label24.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 09:49:11,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:49:11,304 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;@40a48ff3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:49:11,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:49:11,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:11,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 09:49:11,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:11,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:49:11,315 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:11,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:11,319 INFO L85 PathProgramCache]: Analyzing trace with hash 525970265, now seen corresponding path program 1 times [2025-03-03 09:49:11,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:11,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219012152] [2025-03-03 09:49:11,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:11,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:11,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 09:49:11,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 09:49:11,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:11,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:49:11,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:11,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219012152] [2025-03-03 09:49:11,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219012152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:11,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:11,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:49:11,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283862957] [2025-03-03 09:49:11,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:11,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:11,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:11,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:11,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:11,806 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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-03-03 09:49:12,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:12,414 INFO L93 Difference]: Finished difference Result 596 states and 1027 transitions. [2025-03-03 09:49:12,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:12,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2025-03-03 09:49:12,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:12,422 INFO L225 Difference]: With dead ends: 596 [2025-03-03 09:49:12,424 INFO L226 Difference]: Without dead ends: 305 [2025-03-03 09:49:12,428 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-03-03 09:49:12,432 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 130 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:12,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 89 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:49:12,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-03 09:49:12,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2025-03-03 09:49:12,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.5263157894736843) internal successors, (464), 304 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 464 transitions. [2025-03-03 09:49:12,477 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 464 transitions. Word has length 114 [2025-03-03 09:49:12,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:12,478 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 464 transitions. [2025-03-03 09:49:12,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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-03-03 09:49:12,479 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 464 transitions. [2025-03-03 09:49:12,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 09:49:12,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:12,483 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:49:12,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:49:12,483 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:12,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:12,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1695764583, now seen corresponding path program 1 times [2025-03-03 09:49:12,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:12,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403058339] [2025-03-03 09:49:12,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:12,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:12,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 09:49:12,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 09:49:12,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:12,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:49:12,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:12,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403058339] [2025-03-03 09:49:12,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403058339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:12,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:12,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:49:12,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847860634] [2025-03-03 09:49:12,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:12,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:12,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:12,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:12,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:12,610 INFO L87 Difference]: Start difference. First operand 305 states and 464 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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-03-03 09:49:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:12,975 INFO L93 Difference]: Finished difference Result 902 states and 1375 transitions. [2025-03-03 09:49:12,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:12,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-03-03 09:49:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:12,978 INFO L225 Difference]: With dead ends: 902 [2025-03-03 09:49:12,978 INFO L226 Difference]: Without dead ends: 599 [2025-03-03 09:49:12,979 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-03-03 09:49:12,979 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 193 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:12,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 71 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:49:12,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-03 09:49:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 596. [2025-03-03 09:49:12,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 1.477310924369748) internal successors, (879), 595 states have internal predecessors, (879), 0 states have call successors, (0), 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-03-03 09:49:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 879 transitions. [2025-03-03 09:49:12,999 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 879 transitions. Word has length 125 [2025-03-03 09:49:12,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:12,999 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 879 transitions. [2025-03-03 09:49:12,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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-03-03 09:49:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 879 transitions. [2025-03-03 09:49:13,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 09:49:13,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:13,002 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:49:13,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:49:13,002 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:13,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:13,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1532388508, now seen corresponding path program 1 times [2025-03-03 09:49:13,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:13,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951420293] [2025-03-03 09:49:13,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:13,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:13,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 09:49:13,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 09:49:13,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:13,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:13,108 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:49:13,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:13,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951420293] [2025-03-03 09:49:13,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951420293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:13,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:13,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:49:13,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374221189] [2025-03-03 09:49:13,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:13,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:13,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:13,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:13,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:13,109 INFO L87 Difference]: Start difference. First operand 596 states and 879 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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-03-03 09:49:13,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:13,279 INFO L93 Difference]: Finished difference Result 1040 states and 1541 transitions. [2025-03-03 09:49:13,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:13,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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 129 [2025-03-03 09:49:13,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:13,281 INFO L225 Difference]: With dead ends: 1040 [2025-03-03 09:49:13,281 INFO L226 Difference]: Without dead ends: 446 [2025-03-03 09:49:13,282 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-03-03 09:49:13,283 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 200 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:13,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 23 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:49:13,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-03-03 09:49:13,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2025-03-03 09:49:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.4247191011235956) internal successors, (634), 445 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:13,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 634 transitions. [2025-03-03 09:49:13,298 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 634 transitions. Word has length 129 [2025-03-03 09:49:13,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:13,299 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 634 transitions. [2025-03-03 09:49:13,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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-03-03 09:49:13,299 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 634 transitions. [2025-03-03 09:49:13,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 09:49:13,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:13,301 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:49:13,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:49:13,301 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:13,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:13,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1851149012, now seen corresponding path program 1 times [2025-03-03 09:49:13,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:13,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001873222] [2025-03-03 09:49:13,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:13,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:13,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 09:49:13,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 09:49:13,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:13,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:13,418 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:49:13,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:13,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001873222] [2025-03-03 09:49:13,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001873222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:13,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:13,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:49:13,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314161190] [2025-03-03 09:49:13,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:13,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:13,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:13,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:13,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:13,420 INFO L87 Difference]: Start difference. First operand 446 states and 634 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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-03-03 09:49:13,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:13,733 INFO L93 Difference]: Finished difference Result 1326 states and 1888 transitions. [2025-03-03 09:49:13,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:13,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2025-03-03 09:49:13,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:13,736 INFO L225 Difference]: With dead ends: 1326 [2025-03-03 09:49:13,737 INFO L226 Difference]: Without dead ends: 882 [2025-03-03 09:49:13,737 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-03-03 09:49:13,738 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 148 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:13,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 84 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:49:13,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2025-03-03 09:49:13,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 875. [2025-03-03 09:49:13,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 874 states have (on average 1.3729977116704806) internal successors, (1200), 874 states have internal predecessors, (1200), 0 states have call successors, (0), 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-03-03 09:49:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1200 transitions. [2025-03-03 09:49:13,772 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1200 transitions. Word has length 132 [2025-03-03 09:49:13,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:13,772 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1200 transitions. [2025-03-03 09:49:13,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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-03-03 09:49:13,773 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1200 transitions. [2025-03-03 09:49:13,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 09:49:13,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:13,775 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:49:13,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:49:13,775 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:13,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:13,775 INFO L85 PathProgramCache]: Analyzing trace with hash 454148938, now seen corresponding path program 1 times [2025-03-03 09:49:13,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:13,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495960315] [2025-03-03 09:49:13,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:13,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:13,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 09:49:13,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 09:49:13,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:13,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:13,861 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:49:13,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:13,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495960315] [2025-03-03 09:49:13,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495960315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:13,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:13,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:49:13,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092523467] [2025-03-03 09:49:13,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:13,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:13,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:13,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:13,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:13,864 INFO L87 Difference]: Start difference. First operand 875 states and 1200 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 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-03-03 09:49:14,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:14,170 INFO L93 Difference]: Finished difference Result 2591 states and 3558 transitions. [2025-03-03 09:49:14,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:14,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2025-03-03 09:49:14,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:14,176 INFO L225 Difference]: With dead ends: 2591 [2025-03-03 09:49:14,176 INFO L226 Difference]: Without dead ends: 1718 [2025-03-03 09:49:14,178 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-03-03 09:49:14,178 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 158 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:14,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 62 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:49:14,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2025-03-03 09:49:14,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1718. [2025-03-03 09:49:14,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1717 states have (on average 1.2958648806057076) internal successors, (2225), 1717 states have internal predecessors, (2225), 0 states have call successors, (0), 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-03-03 09:49:14,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2225 transitions. [2025-03-03 09:49:14,231 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2225 transitions. Word has length 136 [2025-03-03 09:49:14,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:14,231 INFO L471 AbstractCegarLoop]: Abstraction has 1718 states and 2225 transitions. [2025-03-03 09:49:14,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 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-03-03 09:49:14,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2225 transitions. [2025-03-03 09:49:14,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 09:49:14,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:14,234 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:49:14,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 09:49:14,234 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:14,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:14,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1518475575, now seen corresponding path program 1 times [2025-03-03 09:49:14,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:14,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053190485] [2025-03-03 09:49:14,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:14,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:14,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 09:49:14,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 09:49:14,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:14,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:49:14,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:14,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053190485] [2025-03-03 09:49:14,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053190485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:14,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:14,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:49:14,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656560598] [2025-03-03 09:49:14,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:14,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:14,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:14,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:14,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:14,339 INFO L87 Difference]: Start difference. First operand 1718 states and 2225 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-03-03 09:49:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:14,707 INFO L93 Difference]: Finished difference Result 4273 states and 5527 transitions. [2025-03-03 09:49:14,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:14,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2025-03-03 09:49:14,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:14,715 INFO L225 Difference]: With dead ends: 4273 [2025-03-03 09:49:14,715 INFO L226 Difference]: Without dead ends: 2557 [2025-03-03 09:49:14,718 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-03-03 09:49:14,718 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 137 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:14,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 73 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:49:14,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2025-03-03 09:49:14,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 2557. [2025-03-03 09:49:14,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2556 states have (on average 1.2253521126760563) internal successors, (3132), 2556 states have internal predecessors, (3132), 0 states have call successors, (0), 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-03-03 09:49:14,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 3132 transitions. [2025-03-03 09:49:14,769 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 3132 transitions. Word has length 136 [2025-03-03 09:49:14,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:14,770 INFO L471 AbstractCegarLoop]: Abstraction has 2557 states and 3132 transitions. [2025-03-03 09:49:14,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-03-03 09:49:14,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3132 transitions. [2025-03-03 09:49:14,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 09:49:14,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:14,774 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:49:14,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 09:49:14,775 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:14,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:14,775 INFO L85 PathProgramCache]: Analyzing trace with hash -724262393, now seen corresponding path program 1 times [2025-03-03 09:49:14,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:14,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366625923] [2025-03-03 09:49:14,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:14,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:14,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 09:49:14,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 09:49:14,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:14,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:15,086 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:49:15,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:15,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366625923] [2025-03-03 09:49:15,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366625923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:49:15,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879461720] [2025-03-03 09:49:15,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:15,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:49:15,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:49:15,091 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:49:15,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:49:15,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 09:49:15,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 09:49:15,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:15,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:15,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:49:15,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:49:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 09:49:15,295 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:49:15,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879461720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:15,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:49:15,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 09:49:15,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285271043] [2025-03-03 09:49:15,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:15,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:15,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:15,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:15,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:49:15,297 INFO L87 Difference]: Start difference. First operand 2557 states and 3132 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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-03-03 09:49:15,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:15,619 INFO L93 Difference]: Finished difference Result 5112 states and 6262 transitions. [2025-03-03 09:49:15,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:15,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 141 [2025-03-03 09:49:15,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:15,627 INFO L225 Difference]: With dead ends: 5112 [2025-03-03 09:49:15,627 INFO L226 Difference]: Without dead ends: 2557 [2025-03-03 09:49:15,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:49:15,630 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 47 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:15,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 211 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:49:15,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2025-03-03 09:49:15,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 2417. [2025-03-03 09:49:15,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2417 states, 2416 states have (on average 1.1568708609271523) internal successors, (2795), 2416 states have internal predecessors, (2795), 0 states have call successors, (0), 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-03-03 09:49:15,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2417 states and 2795 transitions. [2025-03-03 09:49:15,668 INFO L78 Accepts]: Start accepts. Automaton has 2417 states and 2795 transitions. Word has length 141 [2025-03-03 09:49:15,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:15,668 INFO L471 AbstractCegarLoop]: Abstraction has 2417 states and 2795 transitions. [2025-03-03 09:49:15,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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-03-03 09:49:15,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 2795 transitions. [2025-03-03 09:49:15,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 09:49:15,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:15,672 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:49:15,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 09:49:15,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:49:15,873 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:15,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:15,873 INFO L85 PathProgramCache]: Analyzing trace with hash 886814387, now seen corresponding path program 1 times [2025-03-03 09:49:15,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:15,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189320441] [2025-03-03 09:49:15,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:15,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:15,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 09:49:15,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 09:49:15,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:15,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:15,957 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:49:15,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:15,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189320441] [2025-03-03 09:49:15,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189320441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:15,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:15,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:49:15,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665811273] [2025-03-03 09:49:15,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:15,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:15,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:15,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:15,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:15,958 INFO L87 Difference]: Start difference. First operand 2417 states and 2795 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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-03-03 09:49:16,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:16,295 INFO L93 Difference]: Finished difference Result 5107 states and 5892 transitions. [2025-03-03 09:49:16,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:16,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2025-03-03 09:49:16,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:16,304 INFO L225 Difference]: With dead ends: 5107 [2025-03-03 09:49:16,304 INFO L226 Difference]: Without dead ends: 2128 [2025-03-03 09:49:16,306 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-03-03 09:49:16,306 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 142 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:16,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 39 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:49:16,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2025-03-03 09:49:16,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 2128. [2025-03-03 09:49:16,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2128 states, 2127 states have (on average 1.1123648330982605) internal successors, (2366), 2127 states have internal predecessors, (2366), 0 states have call successors, (0), 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-03-03 09:49:16,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 2366 transitions. [2025-03-03 09:49:16,338 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 2366 transitions. Word has length 150 [2025-03-03 09:49:16,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:16,338 INFO L471 AbstractCegarLoop]: Abstraction has 2128 states and 2366 transitions. [2025-03-03 09:49:16,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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-03-03 09:49:16,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 2366 transitions. [2025-03-03 09:49:16,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 09:49:16,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:16,342 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:49:16,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 09:49:16,342 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:16,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:16,342 INFO L85 PathProgramCache]: Analyzing trace with hash 397110717, now seen corresponding path program 1 times [2025-03-03 09:49:16,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:16,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682898722] [2025-03-03 09:49:16,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:16,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:16,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 09:49:16,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 09:49:16,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:16,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:49:16,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:16,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682898722] [2025-03-03 09:49:16,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682898722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:16,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:16,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:49:16,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313877386] [2025-03-03 09:49:16,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:16,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:16,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:16,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:16,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:16,405 INFO L87 Difference]: Start difference. First operand 2128 states and 2366 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:16,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:16,671 INFO L93 Difference]: Finished difference Result 4109 states and 4559 transitions. [2025-03-03 09:49:16,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:16,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2025-03-03 09:49:16,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:16,673 INFO L225 Difference]: With dead ends: 4109 [2025-03-03 09:49:16,673 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 09:49:16,676 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-03-03 09:49:16,676 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 126 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:16,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 210 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:49:16,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 09:49:16,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 09:49:16,677 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-03-03 09:49:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 09:49:16,677 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 154 [2025-03-03 09:49:16,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:16,677 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 09:49:16,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:16,677 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 09:49:16,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 09:49:16,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 09:49:16,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 09:49:16,682 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:49:16,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 09:49:16,790 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 09:49:16,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:49:16 BoogieIcfgContainer [2025-03-03 09:49:16,804 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 09:49:16,805 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 09:49:16,805 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 09:49:16,805 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 09:49:16,806 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:49:11" (3/4) ... [2025-03-03 09:49:16,807 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 09:49:16,824 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 09:49:16,826 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 09:49:16,826 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 09:49:16,827 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 09:49:16,922 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 09:49:16,922 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 09:49:16,923 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 09:49:16,923 INFO L158 Benchmark]: Toolchain (without parser) took 7092.98ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 105.2MB in the beginning and 174.0MB in the end (delta: -68.9MB). Peak memory consumption was 125.5MB. Max. memory is 16.1GB. [2025-03-03 09:49:16,924 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:49:16,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.93ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 79.3MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 09:49:16,924 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.15ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 74.3MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:49:16,925 INFO L158 Benchmark]: Boogie Preprocessor took 64.95ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 70.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:49:16,925 INFO L158 Benchmark]: IcfgBuilder took 921.42ms. Allocated memory is still 142.6MB. Free memory was 70.9MB in the beginning and 60.4MB in the end (delta: 10.5MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. [2025-03-03 09:49:16,925 INFO L158 Benchmark]: TraceAbstraction took 5575.28ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 59.7MB in the beginning and 186.7MB in the end (delta: -127.0MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. [2025-03-03 09:49:16,926 INFO L158 Benchmark]: Witness Printer took 117.73ms. Allocated memory is still 335.5MB. Free memory was 186.7MB in the beginning and 174.0MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 09:49:16,927 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.21ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.93ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 79.3MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.15ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 74.3MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.95ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 70.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 921.42ms. Allocated memory is still 142.6MB. Free memory was 70.9MB in the beginning and 60.4MB in the end (delta: 10.5MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5575.28ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 59.7MB in the beginning and 186.7MB in the end (delta: -127.0MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. * Witness Printer took 117.73ms. Allocated memory is still 335.5MB. Free memory was 186.7MB in the beginning and 174.0MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 524]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1281 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1281 mSDsluCounter, 862 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108 mSDsCounter, 509 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3018 IncrementalHoareTripleChecker+Invalid, 3527 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 509 mSolverCounterUnsat, 754 mSDtfsCounter, 3018 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2557occurred in iteration=6, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 150 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1358 NumberOfCodeBlocks, 1358 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1348 ConstructedInterpolants, 0 QuantifiedInterpolants, 3878 SizeOfPredicates, 0 NumberOfNonLiveVariables, 267 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 227/243 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: 616]: Location Invariant Derived location invariant: ((((((((a17 == 8) && (a28 == 10)) && (a19 == 1)) || (((a17 == 8) && (a28 <= 9)) && (a25 == 0))) || (((a17 == 8) && (a25 == 1)) && (a28 == 10))) || (((a25 == 1) && (a28 <= 9)) && (a17 <= 8))) || (((a17 == 8) && (a25 == 1)) && (a19 == 1))) || (((a28 == 10) && (a17 <= 8)) && (a25 == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-03 09:49:16,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE