./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label52.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label52.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 58258448060d1dd7e4bb5d8ae4d59fa53c9505b7e75cc42e4b9e13d20eabdbf0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:43:10,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:43:10,945 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:43:10,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:43:10,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:43:10,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:43:10,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:43:10,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:43:10,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:43:10,977 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:43:10,977 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:43:10,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:43:10,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:43:10,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:43:10,978 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:43:10,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:43:10,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:43:10,978 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:43:10,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:43:10,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:43:10,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:43:10,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:43:10,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:43:10,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:43:10,979 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:43:10,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:43:10,979 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:43:10,979 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:43:10,980 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:43:10,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:43:10,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:43:10,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:43:10,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:43:10,980 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:43:10,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:43:10,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:43:10,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:43:10,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:43:10,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:43:10,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:43:10,981 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:43:10,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:43:10,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:43:10,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:43:10,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:43:10,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:43:10,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:43:10,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:43:10,982 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 58258448060d1dd7e4bb5d8ae4d59fa53c9505b7e75cc42e4b9e13d20eabdbf0 [2025-01-08 23:43:11,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:43:11,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:43:11,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:43:11,173 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:43:11,173 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:43:11,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label52.c [2025-01-08 23:43:12,287 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e861e9b41/f1118a1e1bf84924ad150697b4336641/FLAGee7f3d69a [2025-01-08 23:43:12,599 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:43:12,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label52.c [2025-01-08 23:43:12,611 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e861e9b41/f1118a1e1bf84924ad150697b4336641/FLAGee7f3d69a [2025-01-08 23:43:12,620 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e861e9b41/f1118a1e1bf84924ad150697b4336641 [2025-01-08 23:43:12,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:43:12,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:43:12,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:43:12,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:43:12,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:43:12,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:43:12" (1/1) ... [2025-01-08 23:43:12,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eab96b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:12, skipping insertion in model container [2025-01-08 23:43:12,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:43:12" (1/1) ... [2025-01-08 23:43:12,653 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:43:12,761 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label52.c[7609,7622] [2025-01-08 23:43:12,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:43:12,967 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:43:12,985 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label52.c[7609,7622] [2025-01-08 23:43:13,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:43:13,066 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:43:13,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:13 WrapperNode [2025-01-08 23:43:13,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:43:13,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:43:13,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:43:13,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:43:13,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:13" (1/1) ... [2025-01-08 23:43:13,096 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:13" (1/1) ... [2025-01-08 23:43:13,160 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-01-08 23:43:13,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:43:13,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:43:13,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:43:13,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:43:13,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:13" (1/1) ... [2025-01-08 23:43:13,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:13" (1/1) ... [2025-01-08 23:43:13,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:13" (1/1) ... [2025-01-08 23:43:13,221 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 23:43:13,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:13" (1/1) ... [2025-01-08 23:43:13,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:13" (1/1) ... [2025-01-08 23:43:13,255 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:13" (1/1) ... [2025-01-08 23:43:13,259 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:13" (1/1) ... [2025-01-08 23:43:13,269 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:13" (1/1) ... [2025-01-08 23:43:13,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:13" (1/1) ... [2025-01-08 23:43:13,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:13" (1/1) ... [2025-01-08 23:43:13,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:43:13,309 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:43:13,309 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:43:13,309 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:43:13,311 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:13" (1/1) ... [2025-01-08 23:43:13,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:43:13,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:43:13,378 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:43:13,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:43:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:43:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:43:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:43:13,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:43:13,450 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:43:13,451 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:43:14,590 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-01-08 23:43:14,590 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:43:14,599 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:43:14,599 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:43:14,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:43:14 BoogieIcfgContainer [2025-01-08 23:43:14,600 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:43:14,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:43:14,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:43:14,604 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:43:14,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:43:12" (1/3) ... [2025-01-08 23:43:14,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c70617e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:43:14, skipping insertion in model container [2025-01-08 23:43:14,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:13" (2/3) ... [2025-01-08 23:43:14,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c70617e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:43:14, skipping insertion in model container [2025-01-08 23:43:14,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:43:14" (3/3) ... [2025-01-08 23:43:14,606 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label52.c [2025-01-08 23:43:14,614 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:43:14,616 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label52.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:43:14,648 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:43:14,655 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;@76dcc4f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:43:14,655 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:43:14,658 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:14,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-08 23:43:14,662 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:14,662 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] [2025-01-08 23:43:14,662 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:14,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:14,665 INFO L85 PathProgramCache]: Analyzing trace with hash -238033406, now seen corresponding path program 1 times [2025-01-08 23:43:14,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:14,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669266378] [2025-01-08 23:43:14,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:14,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:14,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-08 23:43:14,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-08 23:43:14,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:14,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:14,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:14,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669266378] [2025-01-08 23:43:14,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669266378] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:14,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:14,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:43:14,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603686807] [2025-01-08 23:43:14,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:14,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:14,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:14,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:14,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:14,936 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:15,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:15,894 INFO L93 Difference]: Finished difference Result 769 states and 1357 transitions. [2025-01-08 23:43:15,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:15,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 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 52 [2025-01-08 23:43:15,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:15,903 INFO L225 Difference]: With dead ends: 769 [2025-01-08 23:43:15,903 INFO L226 Difference]: Without dead ends: 422 [2025-01-08 23:43:15,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:15,907 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 188 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:15,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 164 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:43:15,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-01-08 23:43:15,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 412. [2025-01-08 23:43:15,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.5231143552311435) internal successors, (626), 411 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 626 transitions. [2025-01-08 23:43:15,965 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 626 transitions. Word has length 52 [2025-01-08 23:43:15,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:15,965 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 626 transitions. [2025-01-08 23:43:15,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 626 transitions. [2025-01-08 23:43:15,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-08 23:43:15,968 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:15,968 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:15,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:43:15,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:15,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:15,969 INFO L85 PathProgramCache]: Analyzing trace with hash -21402305, now seen corresponding path program 1 times [2025-01-08 23:43:15,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:15,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460721225] [2025-01-08 23:43:15,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:15,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:16,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-08 23:43:16,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-08 23:43:16,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:16,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:16,279 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:16,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:16,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460721225] [2025-01-08 23:43:16,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460721225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:16,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:16,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:43:16,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678170158] [2025-01-08 23:43:16,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:16,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:16,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:16,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:16,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:16,281 INFO L87 Difference]: Start difference. First operand 412 states and 626 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:16,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:16,913 INFO L93 Difference]: Finished difference Result 1199 states and 1829 transitions. [2025-01-08 23:43:16,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:16,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 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 118 [2025-01-08 23:43:16,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:16,916 INFO L225 Difference]: With dead ends: 1199 [2025-01-08 23:43:16,916 INFO L226 Difference]: Without dead ends: 789 [2025-01-08 23:43:16,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:16,918 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 156 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:16,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 176 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:43:16,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-01-08 23:43:16,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2025-01-08 23:43:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2025-01-08 23:43:16,937 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 118 [2025-01-08 23:43:16,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:16,937 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2025-01-08 23:43:16,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2025-01-08 23:43:16,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-08 23:43:16,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:16,939 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:16,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:43:16,939 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:16,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:16,939 INFO L85 PathProgramCache]: Analyzing trace with hash -424026059, now seen corresponding path program 1 times [2025-01-08 23:43:16,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:16,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157582666] [2025-01-08 23:43:16,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:16,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:16,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-08 23:43:17,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-08 23:43:17,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:17,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:17,291 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:17,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:17,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157582666] [2025-01-08 23:43:17,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157582666] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:17,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:17,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:43:17,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265050934] [2025-01-08 23:43:17,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:17,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:17,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:17,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:17,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:17,293 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:17,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:17,877 INFO L93 Difference]: Finished difference Result 2314 states and 3181 transitions. [2025-01-08 23:43:17,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:17,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 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 122 [2025-01-08 23:43:17,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:17,888 INFO L225 Difference]: With dead ends: 2314 [2025-01-08 23:43:17,888 INFO L226 Difference]: Without dead ends: 1527 [2025-01-08 23:43:17,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:17,890 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:17,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 193 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:43:17,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2025-01-08 23:43:17,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1526. [2025-01-08 23:43:17,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 1.217049180327869) internal successors, (1856), 1525 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1856 transitions. [2025-01-08 23:43:17,910 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1856 transitions. Word has length 122 [2025-01-08 23:43:17,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:17,910 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 1856 transitions. [2025-01-08 23:43:17,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:17,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1856 transitions. [2025-01-08 23:43:17,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-08 23:43:17,912 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:17,912 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:17,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:43:17,913 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:17,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:17,913 INFO L85 PathProgramCache]: Analyzing trace with hash -208552654, now seen corresponding path program 1 times [2025-01-08 23:43:17,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:17,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922163300] [2025-01-08 23:43:17,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:17,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:17,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-08 23:43:17,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-08 23:43:17,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:17,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:18,139 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:18,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:18,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922163300] [2025-01-08 23:43:18,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922163300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:18,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:18,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:18,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914226437] [2025-01-08 23:43:18,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:18,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:43:18,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:18,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:43:18,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:18,142 INFO L87 Difference]: Start difference. First operand 1526 states and 1856 transitions. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:19,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:19,150 INFO L93 Difference]: Finished difference Result 4184 states and 5339 transitions. [2025-01-08 23:43:19,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:43:19,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 states have internal predecessors, (179), 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 179 [2025-01-08 23:43:19,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:19,158 INFO L225 Difference]: With dead ends: 4184 [2025-01-08 23:43:19,158 INFO L226 Difference]: Without dead ends: 2844 [2025-01-08 23:43:19,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:19,159 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 312 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:19,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 91 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:43:19,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2025-01-08 23:43:19,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 2843. [2025-01-08 23:43:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2843 states, 2842 states have (on average 1.2558057705840957) internal successors, (3569), 2842 states have internal predecessors, (3569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2843 states to 2843 states and 3569 transitions. [2025-01-08 23:43:19,194 INFO L78 Accepts]: Start accepts. Automaton has 2843 states and 3569 transitions. Word has length 179 [2025-01-08 23:43:19,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:19,195 INFO L471 AbstractCegarLoop]: Abstraction has 2843 states and 3569 transitions. [2025-01-08 23:43:19,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2843 states and 3569 transitions. [2025-01-08 23:43:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-08 23:43:19,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:19,197 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:19,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:43:19,198 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:19,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:19,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1895756017, now seen corresponding path program 1 times [2025-01-08 23:43:19,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:19,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048224554] [2025-01-08 23:43:19,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:19,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:19,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-08 23:43:19,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-08 23:43:19,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:19,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:19,388 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-01-08 23:43:19,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:19,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048224554] [2025-01-08 23:43:19,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048224554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:19,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:19,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:19,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390069010] [2025-01-08 23:43:19,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:19,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:19,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:19,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:19,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:19,390 INFO L87 Difference]: Start difference. First operand 2843 states and 3569 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:20,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:20,000 INFO L93 Difference]: Finished difference Result 6431 states and 8283 transitions. [2025-01-08 23:43:20,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:20,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 234 [2025-01-08 23:43:20,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:20,010 INFO L225 Difference]: With dead ends: 6431 [2025-01-08 23:43:20,010 INFO L226 Difference]: Without dead ends: 3958 [2025-01-08 23:43:20,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:20,013 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 145 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:20,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 392 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:43:20,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3958 states. [2025-01-08 23:43:20,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3958 to 3948. [2025-01-08 23:43:20,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3948 states, 3947 states have (on average 1.231314922726121) internal successors, (4860), 3947 states have internal predecessors, (4860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 4860 transitions. [2025-01-08 23:43:20,092 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 4860 transitions. Word has length 234 [2025-01-08 23:43:20,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:20,093 INFO L471 AbstractCegarLoop]: Abstraction has 3948 states and 4860 transitions. [2025-01-08 23:43:20,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:20,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 4860 transitions. [2025-01-08 23:43:20,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-01-08 23:43:20,095 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:20,095 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:43:20,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:43:20,096 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:20,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:20,096 INFO L85 PathProgramCache]: Analyzing trace with hash 890027618, now seen corresponding path program 1 times [2025-01-08 23:43:20,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:20,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280150744] [2025-01-08 23:43:20,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:20,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:20,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-01-08 23:43:20,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-01-08 23:43:20,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:20,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-08 23:43:20,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:20,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280150744] [2025-01-08 23:43:20,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280150744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:20,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:20,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:20,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892625306] [2025-01-08 23:43:20,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:20,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:20,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:20,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:20,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:20,256 INFO L87 Difference]: Start difference. First operand 3948 states and 4860 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:20,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:20,877 INFO L93 Difference]: Finished difference Result 9006 states and 11254 transitions. [2025-01-08 23:43:20,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:20,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 240 [2025-01-08 23:43:20,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:20,888 INFO L225 Difference]: With dead ends: 9006 [2025-01-08 23:43:20,888 INFO L226 Difference]: Without dead ends: 5244 [2025-01-08 23:43:20,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:20,892 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 144 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:20,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 391 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:43:20,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2025-01-08 23:43:20,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 5236. [2025-01-08 23:43:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5236 states, 5235 states have (on average 1.210697230181471) internal successors, (6338), 5235 states have internal predecessors, (6338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5236 states to 5236 states and 6338 transitions. [2025-01-08 23:43:20,977 INFO L78 Accepts]: Start accepts. Automaton has 5236 states and 6338 transitions. Word has length 240 [2025-01-08 23:43:20,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:20,977 INFO L471 AbstractCegarLoop]: Abstraction has 5236 states and 6338 transitions. [2025-01-08 23:43:20,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:20,978 INFO L276 IsEmpty]: Start isEmpty. Operand 5236 states and 6338 transitions. [2025-01-08 23:43:20,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-01-08 23:43:20,980 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:20,980 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:43:20,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:43:20,980 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:20,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:20,981 INFO L85 PathProgramCache]: Analyzing trace with hash 293695443, now seen corresponding path program 1 times [2025-01-08 23:43:20,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:20,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816388791] [2025-01-08 23:43:20,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:20,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:21,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-01-08 23:43:21,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-01-08 23:43:21,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:21,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-08 23:43:21,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:21,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816388791] [2025-01-08 23:43:21,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816388791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:21,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:21,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:21,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365681633] [2025-01-08 23:43:21,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:21,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:21,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:21,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:21,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:21,128 INFO L87 Difference]: Start difference. First operand 5236 states and 6338 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:21,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:21,701 INFO L93 Difference]: Finished difference Result 11235 states and 13972 transitions. [2025-01-08 23:43:21,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:21,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 246 [2025-01-08 23:43:21,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:21,718 INFO L225 Difference]: With dead ends: 11235 [2025-01-08 23:43:21,718 INFO L226 Difference]: Without dead ends: 7111 [2025-01-08 23:43:21,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:21,723 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 184 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:21,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 349 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:43:21,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7111 states. [2025-01-08 23:43:21,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7111 to 7106. [2025-01-08 23:43:21,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7106 states, 7105 states have (on average 1.2244897959183674) internal successors, (8700), 7105 states have internal predecessors, (8700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7106 states to 7106 states and 8700 transitions. [2025-01-08 23:43:21,822 INFO L78 Accepts]: Start accepts. Automaton has 7106 states and 8700 transitions. Word has length 246 [2025-01-08 23:43:21,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:21,822 INFO L471 AbstractCegarLoop]: Abstraction has 7106 states and 8700 transitions. [2025-01-08 23:43:21,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 7106 states and 8700 transitions. [2025-01-08 23:43:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-01-08 23:43:21,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:21,829 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:21,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:43:21,829 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:21,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:21,829 INFO L85 PathProgramCache]: Analyzing trace with hash 565555082, now seen corresponding path program 1 times [2025-01-08 23:43:21,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:21,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666792799] [2025-01-08 23:43:21,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:21,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:21,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-01-08 23:43:21,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-01-08 23:43:21,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:21,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-08 23:43:22,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:22,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666792799] [2025-01-08 23:43:22,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666792799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:22,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:22,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:22,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219473696] [2025-01-08 23:43:22,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:22,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:22,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:22,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:22,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:22,013 INFO L87 Difference]: Start difference. First operand 7106 states and 8700 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:22,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:22,609 INFO L93 Difference]: Finished difference Result 13864 states and 17058 transitions. [2025-01-08 23:43:22,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:22,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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 311 [2025-01-08 23:43:22,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:22,675 INFO L225 Difference]: With dead ends: 13864 [2025-01-08 23:43:22,676 INFO L226 Difference]: Without dead ends: 7128 [2025-01-08 23:43:22,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:22,680 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 137 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:22,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 343 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:43:22,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7128 states. [2025-01-08 23:43:22,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7128 to 6738. [2025-01-08 23:43:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6738 states, 6737 states have (on average 1.1850972242838058) internal successors, (7984), 6737 states have internal predecessors, (7984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:22,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6738 states to 6738 states and 7984 transitions. [2025-01-08 23:43:22,753 INFO L78 Accepts]: Start accepts. Automaton has 6738 states and 7984 transitions. Word has length 311 [2025-01-08 23:43:22,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:22,753 INFO L471 AbstractCegarLoop]: Abstraction has 6738 states and 7984 transitions. [2025-01-08 23:43:22,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:22,753 INFO L276 IsEmpty]: Start isEmpty. Operand 6738 states and 7984 transitions. [2025-01-08 23:43:22,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-01-08 23:43:22,759 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:22,760 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:22,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:43:22,760 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:22,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:22,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1963610331, now seen corresponding path program 1 times [2025-01-08 23:43:22,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:22,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986399342] [2025-01-08 23:43:22,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:22,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:22,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-08 23:43:22,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-08 23:43:22,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:22,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:22,893 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-08 23:43:22,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:22,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986399342] [2025-01-08 23:43:22,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986399342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:22,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:22,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:22,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906336564] [2025-01-08 23:43:22,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:22,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:22,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:22,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:22,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:22,895 INFO L87 Difference]: Start difference. First operand 6738 states and 7984 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:23,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:23,585 INFO L93 Difference]: Finished difference Result 12701 states and 15112 transitions. [2025-01-08 23:43:23,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:23,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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 312 [2025-01-08 23:43:23,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:23,596 INFO L225 Difference]: With dead ends: 12701 [2025-01-08 23:43:23,596 INFO L226 Difference]: Without dead ends: 6333 [2025-01-08 23:43:23,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:23,600 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 161 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:23,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 151 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:43:23,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6333 states. [2025-01-08 23:43:23,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6333 to 6145. [2025-01-08 23:43:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6145 states, 6144 states have (on average 1.1363932291666667) internal successors, (6982), 6144 states have internal predecessors, (6982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:23,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6145 states to 6145 states and 6982 transitions. [2025-01-08 23:43:23,637 INFO L78 Accepts]: Start accepts. Automaton has 6145 states and 6982 transitions. Word has length 312 [2025-01-08 23:43:23,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:23,637 INFO L471 AbstractCegarLoop]: Abstraction has 6145 states and 6982 transitions. [2025-01-08 23:43:23,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:23,638 INFO L276 IsEmpty]: Start isEmpty. Operand 6145 states and 6982 transitions. [2025-01-08 23:43:23,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-01-08 23:43:23,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:23,642 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:23,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:43:23,642 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:23,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:23,643 INFO L85 PathProgramCache]: Analyzing trace with hash 935211109, now seen corresponding path program 1 times [2025-01-08 23:43:23,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:23,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147705991] [2025-01-08 23:43:23,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:23,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:23,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-01-08 23:43:23,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-01-08 23:43:23,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:23,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2025-01-08 23:43:23,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:23,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147705991] [2025-01-08 23:43:23,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147705991] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:23,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:23,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:23,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479210013] [2025-01-08 23:43:23,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:23,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:23,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:23,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:23,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:23,793 INFO L87 Difference]: Start difference. First operand 6145 states and 6982 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:24,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:24,280 INFO L93 Difference]: Finished difference Result 12651 states and 14397 transitions. [2025-01-08 23:43:24,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:24,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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 317 [2025-01-08 23:43:24,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:24,288 INFO L225 Difference]: With dead ends: 12651 [2025-01-08 23:43:24,289 INFO L226 Difference]: Without dead ends: 7616 [2025-01-08 23:43:24,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:24,292 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 170 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:24,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 146 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:43:24,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7616 states. [2025-01-08 23:43:24,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7616 to 4480. [2025-01-08 23:43:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4480 states, 4479 states have (on average 1.1431123018530922) internal successors, (5120), 4479 states have internal predecessors, (5120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:24,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4480 states to 4480 states and 5120 transitions. [2025-01-08 23:43:24,331 INFO L78 Accepts]: Start accepts. Automaton has 4480 states and 5120 transitions. Word has length 317 [2025-01-08 23:43:24,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:24,331 INFO L471 AbstractCegarLoop]: Abstraction has 4480 states and 5120 transitions. [2025-01-08 23:43:24,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:24,332 INFO L276 IsEmpty]: Start isEmpty. Operand 4480 states and 5120 transitions. [2025-01-08 23:43:24,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-01-08 23:43:24,337 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:24,337 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:43:24,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:43:24,337 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:24,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:24,338 INFO L85 PathProgramCache]: Analyzing trace with hash 102096229, now seen corresponding path program 1 times [2025-01-08 23:43:24,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:24,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843762552] [2025-01-08 23:43:24,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:24,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:24,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-01-08 23:43:24,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-01-08 23:43:24,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:24,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:24,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:24,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843762552] [2025-01-08 23:43:24,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843762552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:24,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:24,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:43:24,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989842819] [2025-01-08 23:43:24,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:24,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:43:24,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:24,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:43:24,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:24,677 INFO L87 Difference]: Start difference. First operand 4480 states and 5120 transitions. Second operand has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:25,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:25,632 INFO L93 Difference]: Finished difference Result 13016 states and 14895 transitions. [2025-01-08 23:43:25,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:43:25,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 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 357 [2025-01-08 23:43:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:25,643 INFO L225 Difference]: With dead ends: 13016 [2025-01-08 23:43:25,643 INFO L226 Difference]: Without dead ends: 8538 [2025-01-08 23:43:25,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:25,647 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 238 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:25,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 64 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:43:25,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8538 states. [2025-01-08 23:43:25,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8538 to 7799. [2025-01-08 23:43:25,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7799 states, 7798 states have (on average 1.1193895870736086) internal successors, (8729), 7798 states have internal predecessors, (8729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7799 states to 7799 states and 8729 transitions. [2025-01-08 23:43:25,700 INFO L78 Accepts]: Start accepts. Automaton has 7799 states and 8729 transitions. Word has length 357 [2025-01-08 23:43:25,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:25,701 INFO L471 AbstractCegarLoop]: Abstraction has 7799 states and 8729 transitions. [2025-01-08 23:43:25,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 7799 states and 8729 transitions. [2025-01-08 23:43:25,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-01-08 23:43:25,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:25,706 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:25,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:43:25,707 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:25,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:25,707 INFO L85 PathProgramCache]: Analyzing trace with hash -749186478, now seen corresponding path program 1 times [2025-01-08 23:43:25,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:25,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099435650] [2025-01-08 23:43:25,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:25,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:25,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-01-08 23:43:25,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-01-08 23:43:25,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:25,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:25,982 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-08 23:43:25,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:25,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099435650] [2025-01-08 23:43:25,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099435650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:25,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:25,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:43:25,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328696980] [2025-01-08 23:43:25,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:25,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:43:25,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:25,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:43:25,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:25,984 INFO L87 Difference]: Start difference. First operand 7799 states and 8729 transitions. Second operand has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:26,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:26,949 INFO L93 Difference]: Finished difference Result 17807 states and 19927 transitions. [2025-01-08 23:43:26,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:43:26,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 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 431 [2025-01-08 23:43:26,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:26,964 INFO L225 Difference]: With dead ends: 17807 [2025-01-08 23:43:26,964 INFO L226 Difference]: Without dead ends: 10010 [2025-01-08 23:43:26,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:26,969 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 238 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:26,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 64 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:43:26,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10010 states. [2025-01-08 23:43:27,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10010 to 7799. [2025-01-08 23:43:27,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7799 states, 7798 states have (on average 1.1193895870736086) internal successors, (8729), 7798 states have internal predecessors, (8729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:27,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7799 states to 7799 states and 8729 transitions. [2025-01-08 23:43:27,060 INFO L78 Accepts]: Start accepts. Automaton has 7799 states and 8729 transitions. Word has length 431 [2025-01-08 23:43:27,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:27,061 INFO L471 AbstractCegarLoop]: Abstraction has 7799 states and 8729 transitions. [2025-01-08 23:43:27,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:27,061 INFO L276 IsEmpty]: Start isEmpty. Operand 7799 states and 8729 transitions. [2025-01-08 23:43:27,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 751 [2025-01-08 23:43:27,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:27,074 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:27,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:43:27,074 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:27,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:27,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1314431452, now seen corresponding path program 1 times [2025-01-08 23:43:27,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:27,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822186632] [2025-01-08 23:43:27,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:27,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:27,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 750 statements into 1 equivalence classes. [2025-01-08 23:43:27,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 750 of 750 statements. [2025-01-08 23:43:27,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:27,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 1003 proven. 0 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2025-01-08 23:43:27,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:27,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822186632] [2025-01-08 23:43:27,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822186632] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:27,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:27,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:27,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266568281] [2025-01-08 23:43:27,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:27,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:27,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:27,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:27,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:27,355 INFO L87 Difference]: Start difference. First operand 7799 states and 8729 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:27,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:27,928 INFO L93 Difference]: Finished difference Result 17436 states and 19554 transitions. [2025-01-08 23:43:27,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:27,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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 750 [2025-01-08 23:43:27,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:27,939 INFO L225 Difference]: With dead ends: 17436 [2025-01-08 23:43:27,939 INFO L226 Difference]: Without dead ends: 8717 [2025-01-08 23:43:27,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:27,947 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 196 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:27,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 363 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:43:27,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8717 states. [2025-01-08 23:43:28,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8717 to 8717. [2025-01-08 23:43:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8717 states, 8716 states have (on average 1.1006195502524094) internal successors, (9593), 8716 states have internal predecessors, (9593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8717 states to 8717 states and 9593 transitions. [2025-01-08 23:43:28,018 INFO L78 Accepts]: Start accepts. Automaton has 8717 states and 9593 transitions. Word has length 750 [2025-01-08 23:43:28,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:28,018 INFO L471 AbstractCegarLoop]: Abstraction has 8717 states and 9593 transitions. [2025-01-08 23:43:28,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:28,018 INFO L276 IsEmpty]: Start isEmpty. Operand 8717 states and 9593 transitions. [2025-01-08 23:43:28,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2025-01-08 23:43:28,029 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:28,029 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2025-01-08 23:43:28,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:43:28,029 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:28,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:28,030 INFO L85 PathProgramCache]: Analyzing trace with hash -495814045, now seen corresponding path program 1 times [2025-01-08 23:43:28,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:28,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162751834] [2025-01-08 23:43:28,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:28,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:28,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 850 statements into 1 equivalence classes. [2025-01-08 23:43:28,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 850 of 850 statements. [2025-01-08 23:43:28,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:28,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 1501 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2025-01-08 23:43:28,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:28,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162751834] [2025-01-08 23:43:28,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162751834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:28,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:28,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:28,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319896684] [2025-01-08 23:43:28,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:28,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:28,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:28,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:28,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:28,331 INFO L87 Difference]: Start difference. First operand 8717 states and 9593 transitions. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:28,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:28,871 INFO L93 Difference]: Finished difference Result 18165 states and 19959 transitions. [2025-01-08 23:43:28,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:28,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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 850 [2025-01-08 23:43:28,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:28,872 INFO L225 Difference]: With dead ends: 18165 [2025-01-08 23:43:28,872 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:43:28,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:28,881 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 64 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:28,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 324 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:43:28,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:43:28,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:43:28,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:28,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:43:28,882 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 850 [2025-01-08 23:43:28,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:28,882 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:43:28,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:28,882 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:43:28,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:43:28,885 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:43:28,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:43:28,887 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:28,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:43:29,713 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:43:29,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:43:29 BoogieIcfgContainer [2025-01-08 23:43:29,730 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:43:29,730 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:43:29,730 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:43:29,730 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:43:29,731 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:43:14" (3/4) ... [2025-01-08 23:43:29,732 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:43:29,750 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:43:29,752 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:43:29,753 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:43:29,754 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:43:29,853 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:43:29,854 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:43:29,854 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:43:29,854 INFO L158 Benchmark]: Toolchain (without parser) took 17231.53ms. Allocated memory was 167.8MB in the beginning and 637.5MB in the end (delta: 469.8MB). Free memory was 126.4MB in the beginning and 327.2MB in the end (delta: -200.8MB). Peak memory consumption was 266.9MB. Max. memory is 16.1GB. [2025-01-08 23:43:29,855 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:43:29,855 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.28ms. Allocated memory is still 167.8MB. Free memory was 126.1MB in the beginning and 83.2MB in the end (delta: 42.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-08 23:43:29,855 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.84ms. Allocated memory is still 167.8MB. Free memory was 83.2MB in the beginning and 66.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:43:29,855 INFO L158 Benchmark]: Boogie Preprocessor took 146.87ms. Allocated memory is still 167.8MB. Free memory was 66.4MB in the beginning and 42.1MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 23:43:29,856 INFO L158 Benchmark]: RCFGBuilder took 1290.91ms. Allocated memory is still 167.8MB. Free memory was 42.1MB in the beginning and 99.1MB in the end (delta: -57.0MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2025-01-08 23:43:29,856 INFO L158 Benchmark]: TraceAbstraction took 15128.64ms. Allocated memory was 167.8MB in the beginning and 637.5MB in the end (delta: 469.8MB). Free memory was 97.9MB in the beginning and 344.0MB in the end (delta: -246.1MB). Peak memory consumption was 363.9MB. Max. memory is 16.1GB. [2025-01-08 23:43:29,856 INFO L158 Benchmark]: Witness Printer took 123.54ms. Allocated memory is still 637.5MB. Free memory was 344.0MB in the beginning and 327.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:43:29,857 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.17ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 444.28ms. Allocated memory is still 167.8MB. Free memory was 126.1MB in the beginning and 83.2MB in the end (delta: 42.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.84ms. Allocated memory is still 167.8MB. Free memory was 83.2MB in the beginning and 66.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 146.87ms. Allocated memory is still 167.8MB. Free memory was 66.4MB in the beginning and 42.1MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1290.91ms. Allocated memory is still 167.8MB. Free memory was 42.1MB in the beginning and 99.1MB in the end (delta: -57.0MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15128.64ms. Allocated memory was 167.8MB in the beginning and 637.5MB in the end (delta: 469.8MB). Free memory was 97.9MB in the beginning and 344.0MB in the end (delta: -246.1MB). Peak memory consumption was 363.9MB. Max. memory is 16.1GB. * Witness Printer took 123.54ms. Allocated memory is still 637.5MB. Free memory was 344.0MB in the beginning and 327.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 172]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.3s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2452 SdHoareTripleChecker+Valid, 9.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2452 mSDsluCounter, 3211 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 377 mSDsCounter, 1712 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9182 IncrementalHoareTripleChecker+Invalid, 10894 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1712 mSolverCounterUnsat, 2834 mSDtfsCounter, 9182 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8717occurred in iteration=13, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 6699 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 4519 NumberOfCodeBlocks, 4519 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4505 ConstructedInterpolants, 0 QuantifiedInterpolants, 7919 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 6259/6259 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((a25 <= 10) && (a23 <= 138)) && (a4 == 1)) && (0 <= ((long long) a23 + 42))) || ((((a4 == 0) && (a25 == 11)) && (a29 <= 599998)) && (a23 <= 312))) || (((a25 == 13) && (a29 <= 599998)) && (a4 == 1))) || ((((a25 == 13) && (a4 == 0)) && (((long long) a29 + 22) <= 0)) && (a23 <= 138))) || (((a25 == 11) && (a29 <= 599999)) && (a4 == 1))) || (((a25 == 12) && (a4 == 1)) && (a29 <= 130))) || ((((a25 == 13) && (a29 <= 599999)) && (((long long) a23 + 599772) <= 0)) && (a4 == 1))) || ((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a4 == 0)) && (a29 <= 599998))) || (((a4 == 0) && (((long long) a29 + 22) <= 0)) && (a25 <= 10))) || (((a25 == 12) && (a4 == 0)) && (a29 <= 599998))) || (((a25 <= 10) && (a29 <= 599999)) && (a4 == 1))) || ((((a4 == 0) && (a25 <= 10)) && (a29 <= 599998)) && (a23 <= 138))) || ((((a25 == 12) && (307 <= a23)) && (a29 <= 599998)) && (a4 == 1))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:43:29,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE