./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/Problem01_label04.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 f3d87cda29c87bf57e92aba668210746c81813e12063a67a43996181b640be8a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:57:08,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:57:08,925 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:57:08,929 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:57:08,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:57:08,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:57:08,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:57:08,952 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:57:08,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:57:08,952 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:57:08,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:57:08,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:57:08,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:57:08,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:57:08,952 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:57:08,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:57:08,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:57:08,953 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:57:08,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:57:08,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:57:08,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:57:08,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:57:08,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:57:08,954 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:57:08,954 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:57:08,954 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:57:08,954 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:57:08,954 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:57:08,954 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:57:08,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:57:08,954 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:57:08,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:57:08,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:57:08,954 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:57:08,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:57:08,954 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:57:08,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:57:08,954 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:57:08,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:57:08,955 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:57:08,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:57:08,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:57:08,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:57:08,955 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 -> f3d87cda29c87bf57e92aba668210746c81813e12063a67a43996181b640be8a [2025-03-08 00:57:09,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:57:09,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:57:09,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:57:09,194 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:57:09,194 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:57:09,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label04.c [2025-03-08 00:57:10,436 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecc612cb2/ac1b78df6b2f445baab6787397a85ff4/FLAG50a4d30f7 [2025-03-08 00:57:10,712 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:57:10,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label04.c [2025-03-08 00:57:10,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecc612cb2/ac1b78df6b2f445baab6787397a85ff4/FLAG50a4d30f7 [2025-03-08 00:57:11,012 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecc612cb2/ac1b78df6b2f445baab6787397a85ff4 [2025-03-08 00:57:11,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:57:11,015 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:57:11,016 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:57:11,016 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:57:11,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:57:11,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:57:11" (1/1) ... [2025-03-08 00:57:11,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1574222b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:11, skipping insertion in model container [2025-03-08 00:57:11,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:57:11" (1/1) ... [2025-03-08 00:57:11,050 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:57:11,267 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/Problem01_label04.c[17486,17499] [2025-03-08 00:57:11,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:57:11,304 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:57:11,342 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/Problem01_label04.c[17486,17499] [2025-03-08 00:57:11,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:57:11,363 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:57:11,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:11 WrapperNode [2025-03-08 00:57:11,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:57:11,364 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:57:11,364 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:57:11,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:57:11,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:11" (1/1) ... [2025-03-08 00:57:11,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:11" (1/1) ... [2025-03-08 00:57:11,418 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-03-08 00:57:11,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:57:11,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:57:11,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:57:11,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:57:11,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:11" (1/1) ... [2025-03-08 00:57:11,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:11" (1/1) ... [2025-03-08 00:57:11,428 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:11" (1/1) ... [2025-03-08 00:57:11,442 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-08 00:57:11,442 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:11" (1/1) ... [2025-03-08 00:57:11,442 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:11" (1/1) ... [2025-03-08 00:57:11,454 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:11" (1/1) ... [2025-03-08 00:57:11,456 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:11" (1/1) ... [2025-03-08 00:57:11,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:11" (1/1) ... [2025-03-08 00:57:11,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:11" (1/1) ... [2025-03-08 00:57:11,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:57:11,462 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:57:11,462 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:57:11,462 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:57:11,469 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:11" (1/1) ... [2025-03-08 00:57:11,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:57:11,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:57:11,492 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-08 00:57:11,496 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-08 00:57:11,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:57:11,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:57:11,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:57:11,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:57:11,563 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:57:11,565 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:57:12,285 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-08 00:57:12,285 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:57:12,297 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:57:12,298 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:57:12,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:57:12 BoogieIcfgContainer [2025-03-08 00:57:12,298 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:57:12,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:57:12,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:57:12,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:57:12,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:57:11" (1/3) ... [2025-03-08 00:57:12,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53450532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:57:12, skipping insertion in model container [2025-03-08 00:57:12,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:11" (2/3) ... [2025-03-08 00:57:12,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53450532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:57:12, skipping insertion in model container [2025-03-08 00:57:12,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:57:12" (3/3) ... [2025-03-08 00:57:12,306 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label04.c [2025-03-08 00:57:12,318 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:57:12,320 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label04.c that has 1 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 00:57:12,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:57:12,371 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7e442c32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:57:12,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:57:12,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 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-08 00:57:12,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 00:57:12,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:12,382 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] [2025-03-08 00:57:12,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:12,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:12,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1692969927, now seen corresponding path program 1 times [2025-03-08 00:57:12,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:12,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849302252] [2025-03-08 00:57:12,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:12,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:12,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 00:57:12,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 00:57:12,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:12,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:12,824 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-08 00:57:12,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:12,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849302252] [2025-03-08 00:57:12,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849302252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:12,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:12,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:57:12,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686479491] [2025-03-08 00:57:12,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:12,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:12,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:12,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:12,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:12,852 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 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 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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-08 00:57:13,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:13,465 INFO L93 Difference]: Finished difference Result 528 states and 912 transitions. [2025-03-08 00:57:13,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:13,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-08 00:57:13,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:13,474 INFO L225 Difference]: With dead ends: 528 [2025-03-08 00:57:13,474 INFO L226 Difference]: Without dead ends: 266 [2025-03-08 00:57:13,477 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-08 00:57:13,478 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 99 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:13,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 44 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:57:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-08 00:57:13,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-03-08 00:57:13,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4792452830188678) internal successors, (392), 265 states have internal predecessors, (392), 0 states have call successors, (0), 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-08 00:57:13,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 392 transitions. [2025-03-08 00:57:13,531 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 392 transitions. Word has length 96 [2025-03-08 00:57:13,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:13,532 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 392 transitions. [2025-03-08 00:57:13,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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-08 00:57:13,533 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 392 transitions. [2025-03-08 00:57:13,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 00:57:13,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:13,538 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 00:57:13,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:57:13,539 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:13,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:13,540 INFO L85 PathProgramCache]: Analyzing trace with hash -4833699, now seen corresponding path program 1 times [2025-03-08 00:57:13,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:13,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439149935] [2025-03-08 00:57:13,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:13,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:13,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 00:57:13,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 00:57:13,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:13,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:13,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:57:13,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:13,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439149935] [2025-03-08 00:57:13,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439149935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:13,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:13,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:57:13,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005976656] [2025-03-08 00:57:13,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:13,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:13,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:13,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:13,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:13,655 INFO L87 Difference]: Start difference. First operand 266 states and 392 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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-08 00:57:14,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:14,009 INFO L93 Difference]: Finished difference Result 792 states and 1171 transitions. [2025-03-08 00:57:14,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:14,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-03-08 00:57:14,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:14,012 INFO L225 Difference]: With dead ends: 792 [2025-03-08 00:57:14,012 INFO L226 Difference]: Without dead ends: 528 [2025-03-08 00:57:14,013 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-08 00:57:14,014 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 172 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:14,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 29 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:14,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-08 00:57:14,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-03-08 00:57:14,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.413662239089184) internal successors, (745), 527 states have internal predecessors, (745), 0 states have call successors, (0), 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-08 00:57:14,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 745 transitions. [2025-03-08 00:57:14,044 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 745 transitions. Word has length 101 [2025-03-08 00:57:14,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:14,044 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 745 transitions. [2025-03-08 00:57:14,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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-08 00:57:14,044 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 745 transitions. [2025-03-08 00:57:14,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 00:57:14,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:14,051 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 00:57:14,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:57:14,051 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:14,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:14,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1476961604, now seen corresponding path program 1 times [2025-03-08 00:57:14,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:14,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859364736] [2025-03-08 00:57:14,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:14,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:14,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 00:57:14,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 00:57:14,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:14,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:57:14,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:14,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859364736] [2025-03-08 00:57:14,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859364736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:14,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:14,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:57:14,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675417387] [2025-03-08 00:57:14,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:14,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:14,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:14,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:14,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:14,280 INFO L87 Difference]: Start difference. First operand 528 states and 745 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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-08 00:57:14,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:14,639 INFO L93 Difference]: Finished difference Result 1447 states and 2032 transitions. [2025-03-08 00:57:14,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:14,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-03-08 00:57:14,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:14,642 INFO L225 Difference]: With dead ends: 1447 [2025-03-08 00:57:14,642 INFO L226 Difference]: Without dead ends: 921 [2025-03-08 00:57:14,644 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-08 00:57:14,644 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 122 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:14,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 56 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2025-03-08 00:57:14,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 790. [2025-03-08 00:57:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 1.3219264892268694) internal successors, (1043), 789 states have internal predecessors, (1043), 0 states have call successors, (0), 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-08 00:57:14,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1043 transitions. [2025-03-08 00:57:14,664 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1043 transitions. Word has length 111 [2025-03-08 00:57:14,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:14,665 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1043 transitions. [2025-03-08 00:57:14,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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-08 00:57:14,665 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1043 transitions. [2025-03-08 00:57:14,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 00:57:14,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:14,667 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-08 00:57:14,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:57:14,668 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:14,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:14,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1849861016, now seen corresponding path program 1 times [2025-03-08 00:57:14,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:14,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663337147] [2025-03-08 00:57:14,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:14,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:14,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 00:57:14,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 00:57:14,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:14,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:57:14,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:14,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663337147] [2025-03-08 00:57:14,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663337147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:14,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:14,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:57:14,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859212784] [2025-03-08 00:57:14,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:14,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:14,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:14,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:14,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:14,807 INFO L87 Difference]: Start difference. First operand 790 states and 1043 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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-08 00:57:15,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:15,116 INFO L93 Difference]: Finished difference Result 1840 states and 2437 transitions. [2025-03-08 00:57:15,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:15,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 112 [2025-03-08 00:57:15,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:15,121 INFO L225 Difference]: With dead ends: 1840 [2025-03-08 00:57:15,121 INFO L226 Difference]: Without dead ends: 1052 [2025-03-08 00:57:15,122 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-08 00:57:15,123 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:15,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 72 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:15,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2025-03-08 00:57:15,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2025-03-08 00:57:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.2711703139866795) internal successors, (1336), 1051 states have internal predecessors, (1336), 0 states have call successors, (0), 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-08 00:57:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1336 transitions. [2025-03-08 00:57:15,148 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1336 transitions. Word has length 112 [2025-03-08 00:57:15,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:15,148 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1336 transitions. [2025-03-08 00:57:15,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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-08 00:57:15,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1336 transitions. [2025-03-08 00:57:15,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 00:57:15,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:15,150 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:57:15,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:57:15,150 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:15,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:15,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1762155041, now seen corresponding path program 1 times [2025-03-08 00:57:15,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:15,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690520734] [2025-03-08 00:57:15,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:15,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:15,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 00:57:15,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 00:57:15,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:15,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:15,301 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-08 00:57:15,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:15,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690520734] [2025-03-08 00:57:15,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690520734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:15,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:15,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:57:15,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328653220] [2025-03-08 00:57:15,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:15,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:57:15,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:15,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:57:15,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:57:15,304 INFO L87 Difference]: Start difference. First operand 1052 states and 1336 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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-08 00:57:15,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:15,813 INFO L93 Difference]: Finished difference Result 2888 states and 3679 transitions. [2025-03-08 00:57:15,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:57:15,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-03-08 00:57:15,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:15,819 INFO L225 Difference]: With dead ends: 2888 [2025-03-08 00:57:15,819 INFO L226 Difference]: Without dead ends: 1838 [2025-03-08 00:57:15,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:57:15,821 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 259 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:15,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 60 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:57:15,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-03-08 00:57:15,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2025-03-08 00:57:15,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.2338804220398594) internal successors, (2105), 1706 states have internal predecessors, (2105), 0 states have call successors, (0), 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-08 00:57:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2105 transitions. [2025-03-08 00:57:15,847 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2105 transitions. Word has length 115 [2025-03-08 00:57:15,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:15,848 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 2105 transitions. [2025-03-08 00:57:15,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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-08 00:57:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2105 transitions. [2025-03-08 00:57:15,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 00:57:15,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:15,850 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:57:15,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 00:57:15,850 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:15,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:15,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1550348787, now seen corresponding path program 1 times [2025-03-08 00:57:15,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:15,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504577539] [2025-03-08 00:57:15,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:15,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:15,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 00:57:15,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 00:57:15,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:15,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:15,998 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 00:57:15,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:15,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504577539] [2025-03-08 00:57:15,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504577539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:15,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:15,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:57:15,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559332136] [2025-03-08 00:57:15,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:16,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:16,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:16,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:16,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:16,002 INFO L87 Difference]: Start difference. First operand 1707 states and 2105 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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-08 00:57:16,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:16,304 INFO L93 Difference]: Finished difference Result 2102 states and 2565 transitions. [2025-03-08 00:57:16,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:16,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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 133 [2025-03-08 00:57:16,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:16,311 INFO L225 Difference]: With dead ends: 2102 [2025-03-08 00:57:16,311 INFO L226 Difference]: Without dead ends: 2100 [2025-03-08 00:57:16,312 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-08 00:57:16,313 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 58 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:16,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 31 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:16,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2025-03-08 00:57:16,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1576. [2025-03-08 00:57:16,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.2406349206349205) internal successors, (1954), 1575 states have internal predecessors, (1954), 0 states have call successors, (0), 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-08 00:57:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1954 transitions. [2025-03-08 00:57:16,343 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1954 transitions. Word has length 133 [2025-03-08 00:57:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:16,343 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 1954 transitions. [2025-03-08 00:57:16,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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-08 00:57:16,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1954 transitions. [2025-03-08 00:57:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-08 00:57:16,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:16,347 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:57:16,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 00:57:16,347 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:16,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:16,348 INFO L85 PathProgramCache]: Analyzing trace with hash -129635392, now seen corresponding path program 1 times [2025-03-08 00:57:16,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:16,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848758468] [2025-03-08 00:57:16,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:16,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:16,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-08 00:57:16,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-08 00:57:16,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:16,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-08 00:57:16,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:16,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848758468] [2025-03-08 00:57:16,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848758468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:16,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:16,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:57:16,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80006702] [2025-03-08 00:57:16,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:16,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:16,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:16,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:16,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:16,534 INFO L87 Difference]: Start difference. First operand 1576 states and 1954 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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-08 00:57:16,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:16,861 INFO L93 Difference]: Finished difference Result 3543 states and 4365 transitions. [2025-03-08 00:57:16,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:16,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 201 [2025-03-08 00:57:16,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:16,866 INFO L225 Difference]: With dead ends: 3543 [2025-03-08 00:57:16,866 INFO L226 Difference]: Without dead ends: 1969 [2025-03-08 00:57:16,868 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-08 00:57:16,869 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 93 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:16,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 55 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:16,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2025-03-08 00:57:16,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2025-03-08 00:57:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.2397420867526376) internal successors, (2115), 1706 states have internal predecessors, (2115), 0 states have call successors, (0), 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-08 00:57:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2115 transitions. [2025-03-08 00:57:16,897 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2115 transitions. Word has length 201 [2025-03-08 00:57:16,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:16,897 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 2115 transitions. [2025-03-08 00:57:16,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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-08 00:57:16,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2115 transitions. [2025-03-08 00:57:16,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-08 00:57:16,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:16,902 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2025-03-08 00:57:16,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 00:57:16,902 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:16,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:16,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1162602666, now seen corresponding path program 1 times [2025-03-08 00:57:16,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:16,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887236460] [2025-03-08 00:57:16,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:16,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:16,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-08 00:57:16,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-08 00:57:16,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:16,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:17,037 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-08 00:57:17,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:17,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887236460] [2025-03-08 00:57:17,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887236460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:17,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:17,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:57:17,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035405900] [2025-03-08 00:57:17,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:17,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:17,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:17,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:17,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:17,039 INFO L87 Difference]: Start difference. First operand 1707 states and 2115 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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-08 00:57:17,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:17,373 INFO L93 Difference]: Finished difference Result 3674 states and 4514 transitions. [2025-03-08 00:57:17,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:17,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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 244 [2025-03-08 00:57:17,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:17,379 INFO L225 Difference]: With dead ends: 3674 [2025-03-08 00:57:17,379 INFO L226 Difference]: Without dead ends: 1969 [2025-03-08 00:57:17,381 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-08 00:57:17,381 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 88 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:17,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 191 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:17,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2025-03-08 00:57:17,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2025-03-08 00:57:17,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.1965160587915078) internal successors, (2198), 1837 states have internal predecessors, (2198), 0 states have call successors, (0), 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-08 00:57:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2198 transitions. [2025-03-08 00:57:17,410 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2198 transitions. Word has length 244 [2025-03-08 00:57:17,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:17,410 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2198 transitions. [2025-03-08 00:57:17,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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-08 00:57:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2198 transitions. [2025-03-08 00:57:17,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-08 00:57:17,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:17,414 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 00:57:17,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 00:57:17,415 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:17,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:17,415 INFO L85 PathProgramCache]: Analyzing trace with hash 2028244513, now seen corresponding path program 1 times [2025-03-08 00:57:17,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:17,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586420835] [2025-03-08 00:57:17,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:17,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:17,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-08 00:57:17,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-08 00:57:17,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:17,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-08 00:57:17,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:17,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586420835] [2025-03-08 00:57:17,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586420835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:17,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:17,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:57:17,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730405932] [2025-03-08 00:57:17,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:17,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:17,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:17,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:17,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:17,531 INFO L87 Difference]: Start difference. First operand 1838 states and 2198 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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-08 00:57:17,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:17,854 INFO L93 Difference]: Finished difference Result 3674 states and 4394 transitions. [2025-03-08 00:57:17,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:17,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 257 [2025-03-08 00:57:17,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:17,860 INFO L225 Difference]: With dead ends: 3674 [2025-03-08 00:57:17,860 INFO L226 Difference]: Without dead ends: 1838 [2025-03-08 00:57:17,862 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-08 00:57:17,863 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 96 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:17,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 180 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:17,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-03-08 00:57:17,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2025-03-08 00:57:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.160587915078933) internal successors, (2132), 1837 states have internal predecessors, (2132), 0 states have call successors, (0), 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-08 00:57:17,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2132 transitions. [2025-03-08 00:57:17,891 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2132 transitions. Word has length 257 [2025-03-08 00:57:17,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:17,891 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2132 transitions. [2025-03-08 00:57:17,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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-08 00:57:17,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2132 transitions. [2025-03-08 00:57:17,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-08 00:57:17,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:17,895 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 00:57:17,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 00:57:17,895 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:17,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:17,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1708729537, now seen corresponding path program 1 times [2025-03-08 00:57:17,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:17,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321296087] [2025-03-08 00:57:17,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:17,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:17,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-08 00:57:17,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-08 00:57:17,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:17,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 256 proven. 142 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:57:18,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:18,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321296087] [2025-03-08 00:57:18,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321296087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:57:18,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757914037] [2025-03-08 00:57:18,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:18,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:57:18,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:57:18,487 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-08 00:57:18,489 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-08 00:57:18,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-08 00:57:18,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-08 00:57:18,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:18,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:18,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:57:18,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:57:18,823 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-08 00:57:18,823 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:57:18,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757914037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:18,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:57:18,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 00:57:18,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617307679] [2025-03-08 00:57:18,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:18,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:18,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:18,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:18,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:57:18,824 INFO L87 Difference]: Start difference. First operand 1838 states and 2132 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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-08 00:57:19,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:19,148 INFO L93 Difference]: Finished difference Result 3672 states and 4261 transitions. [2025-03-08 00:57:19,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:19,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 266 [2025-03-08 00:57:19,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:19,150 INFO L225 Difference]: With dead ends: 3672 [2025-03-08 00:57:19,150 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 00:57:19,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:57:19,153 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 42 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:19,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 190 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:19,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 00:57:19,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 00:57:19,154 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-08 00:57:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 00:57:19,154 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 266 [2025-03-08 00:57:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:19,154 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 00:57:19,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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-08 00:57:19,154 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 00:57:19,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 00:57:19,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 00:57:19,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 00:57:19,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 00:57:19,361 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:57:19,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 00:57:19,504 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 00:57:19,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:57:19 BoogieIcfgContainer [2025-03-08 00:57:19,519 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 00:57:19,519 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 00:57:19,520 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 00:57:19,520 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 00:57:19,520 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:57:12" (3/4) ... [2025-03-08 00:57:19,522 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 00:57:19,538 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 00:57:19,538 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 00:57:19,539 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 00:57:19,540 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 00:57:19,633 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 00:57:19,633 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 00:57:19,634 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 00:57:19,635 INFO L158 Benchmark]: Toolchain (without parser) took 8619.26ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 111.0MB in the beginning and 334.1MB in the end (delta: -223.1MB). Peak memory consumption was 120.9MB. Max. memory is 16.1GB. [2025-03-08 00:57:19,635 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:57:19,635 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.73ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 84.0MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 00:57:19,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.98ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 78.7MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:57:19,636 INFO L158 Benchmark]: Boogie Preprocessor took 41.59ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 74.7MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:57:19,636 INFO L158 Benchmark]: IcfgBuilder took 836.20ms. Allocated memory is still 142.6MB. Free memory was 74.7MB in the beginning and 59.8MB in the end (delta: 14.9MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2025-03-08 00:57:19,637 INFO L158 Benchmark]: TraceAbstraction took 7218.10ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 59.0MB in the beginning and 346.6MB in the end (delta: -287.6MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB. [2025-03-08 00:57:19,637 INFO L158 Benchmark]: Witness Printer took 114.13ms. Allocated memory is still 486.5MB. Free memory was 346.6MB in the beginning and 334.1MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:57:19,639 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.22ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.73ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 84.0MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.98ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 78.7MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.59ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 74.7MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 836.20ms. Allocated memory is still 142.6MB. Free memory was 74.7MB in the beginning and 59.8MB in the end (delta: 14.9MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7218.10ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 59.0MB in the beginning and 346.6MB in the end (delta: -287.6MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB. * Witness Printer took 114.13ms. Allocated memory is still 486.5MB. Free memory was 346.6MB in the beginning and 334.1MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. 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: 474]: 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, 198 locations, 326 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 10, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1158 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1158 mSDsluCounter, 908 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 655 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3595 IncrementalHoareTripleChecker+Invalid, 4250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 655 mSolverCounterUnsat, 851 mSDtfsCounter, 3595 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=8, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1179 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1902 NumberOfCodeBlocks, 1902 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1891 ConstructedInterpolants, 0 QuantifiedInterpolants, 4957 SizeOfPredicates, 0 NumberOfNonLiveVariables, 502 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 1773/1915 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: 593]: Location Invariant Derived location invariant: (((((a21 == 1) && (a16 <= 5)) || (((a21 == 1) && (a17 == 1)) && (a20 == 1))) || ((a21 == 1) && (15 <= a8))) || (a21 <= 0)) RESULT: Ultimate proved your program to be correct! [2025-03-08 00:57:19,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE