./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label49.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label49.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6eed2c2d5e428bcec2beb9a0ebe7c478639dba36839dc4adf5520912920088de --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:02:13,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:02:13,813 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:02:13,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:02:13,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:02:13,839 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:02:13,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:02:13,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:02:13,839 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:02:13,839 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:02:13,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:02:13,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:02:13,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:02:13,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:02:13,840 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:02:13,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:02:13,840 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:02:13,840 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:02:13,840 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:02:13,840 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:02:13,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:02:13,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:02:13,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:02:13,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:02:13,842 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:02:13,842 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:02:13,842 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:02:13,842 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:02:13,842 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:02:13,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:02:13,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:02:13,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:02:13,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:02:13,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:02:13,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:02:13,843 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:02:13,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:02:13,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:02:13,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:02:13,843 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:02:13,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:02:13,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:02:13,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:02:13,843 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6eed2c2d5e428bcec2beb9a0ebe7c478639dba36839dc4adf5520912920088de [2025-03-08 02:02:14,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:02:14,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:02:14,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:02:14,066 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:02:14,067 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:02:14,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label49.c [2025-03-08 02:02:15,252 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c56f139/b62b6893986a44a585dd79ba3f63c666/FLAG913313a03 [2025-03-08 02:02:15,564 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:02:15,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label49.c [2025-03-08 02:02:15,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c56f139/b62b6893986a44a585dd79ba3f63c666/FLAG913313a03 [2025-03-08 02:02:15,813 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c56f139/b62b6893986a44a585dd79ba3f63c666 [2025-03-08 02:02:15,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:02:15,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:02:15,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:02:15,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:02:15,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:02:15,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:02:15" (1/1) ... [2025-03-08 02:02:15,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6afb79a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:15, skipping insertion in model container [2025-03-08 02:02:15,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:02:15" (1/1) ... [2025-03-08 02:02:15,866 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:02:16,017 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label49.c[6430,6443] [2025-03-08 02:02:16,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:02:16,304 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:02:16,318 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label49.c[6430,6443] [2025-03-08 02:02:16,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:02:16,473 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:02:16,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:16 WrapperNode [2025-03-08 02:02:16,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:02:16,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:02:16,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:02:16,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:02:16,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:16" (1/1) ... [2025-03-08 02:02:16,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:16" (1/1) ... [2025-03-08 02:02:16,614 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-03-08 02:02:16,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:02:16,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:02:16,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:02:16,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:02:16,622 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:16" (1/1) ... [2025-03-08 02:02:16,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:16" (1/1) ... [2025-03-08 02:02:16,639 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:16" (1/1) ... [2025-03-08 02:02:16,727 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 02:02:16,728 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:16" (1/1) ... [2025-03-08 02:02:16,728 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:16" (1/1) ... [2025-03-08 02:02:16,773 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:16" (1/1) ... [2025-03-08 02:02:16,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:16" (1/1) ... [2025-03-08 02:02:16,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:16" (1/1) ... [2025-03-08 02:02:16,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:16" (1/1) ... [2025-03-08 02:02:16,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:02:16,844 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:02:16,844 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:02:16,845 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:02:16,845 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:16" (1/1) ... [2025-03-08 02:02:16,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:02:16,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:02:16,869 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 02:02:16,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 02:02:16,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:02:16,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:02:16,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:02:16,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:02:16,941 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:02:16,942 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:02:18,915 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-03-08 02:02:18,990 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-03-08 02:02:18,990 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:02:19,012 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:02:19,012 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:02:19,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:02:19 BoogieIcfgContainer [2025-03-08 02:02:19,014 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:02:19,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:02:19,017 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:02:19,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:02:19,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:02:15" (1/3) ... [2025-03-08 02:02:19,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25442904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:02:19, skipping insertion in model container [2025-03-08 02:02:19,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:16" (2/3) ... [2025-03-08 02:02:19,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25442904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:02:19, skipping insertion in model container [2025-03-08 02:02:19,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:02:19" (3/3) ... [2025-03-08 02:02:19,022 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label49.c [2025-03-08 02:02:19,031 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:02:19,036 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label49.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:02:19,082 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:02:19,093 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;@1a5e1bb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:02:19,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:02:19,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:19,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 02:02:19,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:19,105 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-03-08 02:02:19,105 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:19,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:19,110 INFO L85 PathProgramCache]: Analyzing trace with hash 232000185, now seen corresponding path program 1 times [2025-03-08 02:02:19,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:19,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392602244] [2025-03-08 02:02:19,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:19,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:19,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 02:02:19,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 02:02:19,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:19,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:19,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:02:19,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:19,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392602244] [2025-03-08 02:02:19,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392602244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:19,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:19,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:02:19,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774146653] [2025-03-08 02:02:19,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:19,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:19,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:19,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:19,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:19,457 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 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-03-08 02:02:21,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:21,014 INFO L93 Difference]: Finished difference Result 1154 states and 2103 transitions. [2025-03-08 02:02:21,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:21,016 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-03-08 02:02:21,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:21,025 INFO L225 Difference]: With dead ends: 1154 [2025-03-08 02:02:21,025 INFO L226 Difference]: Without dead ends: 665 [2025-03-08 02:02:21,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:21,032 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 269 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:21,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 385 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:02:21,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-08 02:02:21,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2025-03-08 02:02:21,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.4818731117824773) internal successors, (981), 662 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:21,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 981 transitions. [2025-03-08 02:02:21,092 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 981 transitions. Word has length 52 [2025-03-08 02:02:21,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:21,093 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 981 transitions. [2025-03-08 02:02:21,093 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-03-08 02:02:21,093 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 981 transitions. [2025-03-08 02:02:21,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 02:02:21,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:21,095 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] [2025-03-08 02:02:21,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:02:21,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:21,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:21,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1597327363, now seen corresponding path program 1 times [2025-03-08 02:02:21,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:21,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674150154] [2025-03-08 02:02:21,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:21,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:21,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 02:02:21,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 02:02:21,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:21,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:21,412 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:02:21,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:21,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674150154] [2025-03-08 02:02:21,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674150154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:21,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:21,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:02:21,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638410600] [2025-03-08 02:02:21,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:21,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:21,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:21,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:21,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:21,414 INFO L87 Difference]: Start difference. First operand 663 states and 981 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:22,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:22,489 INFO L93 Difference]: Finished difference Result 1624 states and 2315 transitions. [2025-03-08 02:02:22,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:22,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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 117 [2025-03-08 02:02:22,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:22,493 INFO L225 Difference]: With dead ends: 1624 [2025-03-08 02:02:22,493 INFO L226 Difference]: Without dead ends: 963 [2025-03-08 02:02:22,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:22,496 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:22,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 337 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:02:22,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-08 02:02:22,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2025-03-08 02:02:22,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.362785862785863) internal successors, (1311), 962 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:22,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1311 transitions. [2025-03-08 02:02:22,530 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1311 transitions. Word has length 117 [2025-03-08 02:02:22,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:22,530 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1311 transitions. [2025-03-08 02:02:22,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:22,530 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1311 transitions. [2025-03-08 02:02:22,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 02:02:22,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:22,532 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-03-08 02:02:22,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:02:22,533 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:22,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:22,533 INFO L85 PathProgramCache]: Analyzing trace with hash 970582866, now seen corresponding path program 1 times [2025-03-08 02:02:22,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:22,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563319] [2025-03-08 02:02:22,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:22,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:22,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 02:02:22,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 02:02:22,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:22,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:02:22,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:22,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563319] [2025-03-08 02:02:22,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:22,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:22,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:02:22,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400059851] [2025-03-08 02:02:22,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:22,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 02:02:22,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:22,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 02:02:22,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:02:22,783 INFO L87 Difference]: Start difference. First operand 963 states and 1311 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 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-03-08 02:02:24,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:24,268 INFO L93 Difference]: Finished difference Result 2240 states and 3197 transitions. [2025-03-08 02:02:24,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:02:24,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 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-03-08 02:02:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:24,275 INFO L225 Difference]: With dead ends: 2240 [2025-03-08 02:02:24,275 INFO L226 Difference]: Without dead ends: 1578 [2025-03-08 02:02:24,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:02:24,280 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 933 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 1856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:24,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 327 Invalid, 1856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:02:24,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2025-03-08 02:02:24,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1266. [2025-03-08 02:02:24,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.3043478260869565) internal successors, (1650), 1265 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:24,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1650 transitions. [2025-03-08 02:02:24,303 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1650 transitions. Word has length 122 [2025-03-08 02:02:24,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:24,304 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1650 transitions. [2025-03-08 02:02:24,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 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-03-08 02:02:24,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1650 transitions. [2025-03-08 02:02:24,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-08 02:02:24,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:24,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:24,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:02:24,306 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:24,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:24,307 INFO L85 PathProgramCache]: Analyzing trace with hash 2127206502, now seen corresponding path program 1 times [2025-03-08 02:02:24,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:24,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641753786] [2025-03-08 02:02:24,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:24,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:24,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-08 02:02:24,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 02:02:24,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:24,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:02:24,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:24,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641753786] [2025-03-08 02:02:24,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641753786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:24,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:24,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:02:24,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645439500] [2025-03-08 02:02:24,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:24,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:02:24,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:24,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:02:24,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:02:24,531 INFO L87 Difference]: Start difference. First operand 1266 states and 1650 transitions. Second operand has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:26,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:26,620 INFO L93 Difference]: Finished difference Result 4668 states and 6169 transitions. [2025-03-08 02:02:26,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:02:26,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 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 218 [2025-03-08 02:02:26,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:26,630 INFO L225 Difference]: With dead ends: 4668 [2025-03-08 02:02:26,630 INFO L226 Difference]: Without dead ends: 3404 [2025-03-08 02:02:26,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:02:26,635 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 484 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 2546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:26,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 375 Invalid, 2546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 02:02:26,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2025-03-08 02:02:26,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3381. [2025-03-08 02:02:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.2363905325443787) internal successors, (4179), 3380 states have internal predecessors, (4179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:26,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4179 transitions. [2025-03-08 02:02:26,679 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4179 transitions. Word has length 218 [2025-03-08 02:02:26,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:26,680 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 4179 transitions. [2025-03-08 02:02:26,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:26,680 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4179 transitions. [2025-03-08 02:02:26,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-08 02:02:26,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:26,684 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:26,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:02:26,684 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:26,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:26,685 INFO L85 PathProgramCache]: Analyzing trace with hash 727427804, now seen corresponding path program 1 times [2025-03-08 02:02:26,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:26,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420251267] [2025-03-08 02:02:26,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:26,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:26,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-08 02:02:26,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-08 02:02:26,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:26,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:26,852 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-08 02:02:26,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:26,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420251267] [2025-03-08 02:02:26,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420251267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:26,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:26,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:02:26,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959378249] [2025-03-08 02:02:26,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:26,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:26,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:26,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:26,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:26,854 INFO L87 Difference]: Start difference. First operand 3381 states and 4179 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:27,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:27,952 INFO L93 Difference]: Finished difference Result 8563 states and 10751 transitions. [2025-03-08 02:02:27,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:27,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 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 222 [2025-03-08 02:02:27,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:27,964 INFO L225 Difference]: With dead ends: 8563 [2025-03-08 02:02:27,965 INFO L226 Difference]: Without dead ends: 5483 [2025-03-08 02:02:27,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:27,968 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:27,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 340 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:02:27,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2025-03-08 02:02:28,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478. [2025-03-08 02:02:28,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1683403322987036) internal successors, (6399), 5477 states have internal predecessors, (6399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6399 transitions. [2025-03-08 02:02:28,037 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6399 transitions. Word has length 222 [2025-03-08 02:02:28,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:28,037 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6399 transitions. [2025-03-08 02:02:28,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:28,038 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6399 transitions. [2025-03-08 02:02:28,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-08 02:02:28,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:28,041 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:28,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:02:28,041 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:28,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:28,042 INFO L85 PathProgramCache]: Analyzing trace with hash -58174344, now seen corresponding path program 1 times [2025-03-08 02:02:28,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:28,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791875600] [2025-03-08 02:02:28,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:28,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:28,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-08 02:02:28,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-08 02:02:28,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:28,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:28,554 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 02:02:28,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:28,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791875600] [2025-03-08 02:02:28,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791875600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:28,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:28,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:02:28,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788729395] [2025-03-08 02:02:28,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:28,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:28,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:28,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:28,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:28,558 INFO L87 Difference]: Start difference. First operand 5478 states and 6399 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:29,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:29,551 INFO L93 Difference]: Finished difference Result 10655 states and 12485 transitions. [2025-03-08 02:02:29,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:29,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 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 324 [2025-03-08 02:02:29,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:29,566 INFO L225 Difference]: With dead ends: 10655 [2025-03-08 02:02:29,566 INFO L226 Difference]: Without dead ends: 5478 [2025-03-08 02:02:29,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:29,575 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:29,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:02:29,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2025-03-08 02:02:29,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478. [2025-03-08 02:02:29,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1672448420668249) internal successors, (6393), 5477 states have internal predecessors, (6393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:29,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6393 transitions. [2025-03-08 02:02:29,646 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6393 transitions. Word has length 324 [2025-03-08 02:02:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:29,646 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6393 transitions. [2025-03-08 02:02:29,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:29,647 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6393 transitions. [2025-03-08 02:02:29,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-08 02:02:29,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:29,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:29,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:02:29,651 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:29,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:29,651 INFO L85 PathProgramCache]: Analyzing trace with hash 653756905, now seen corresponding path program 1 times [2025-03-08 02:02:29,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:29,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444331573] [2025-03-08 02:02:29,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:29,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:29,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-08 02:02:29,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-08 02:02:29,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:29,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:29,832 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 02:02:29,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:29,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444331573] [2025-03-08 02:02:29,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444331573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:29,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:29,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:02:29,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226446393] [2025-03-08 02:02:29,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:29,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:29,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:29,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:29,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:29,833 INFO L87 Difference]: Start difference. First operand 5478 states and 6393 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:31,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:31,237 INFO L93 Difference]: Finished difference Result 11851 states and 14145 transitions. [2025-03-08 02:02:31,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:31,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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 339 [2025-03-08 02:02:31,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:31,249 INFO L225 Difference]: With dead ends: 11851 [2025-03-08 02:02:31,249 INFO L226 Difference]: Without dead ends: 6674 [2025-03-08 02:02:31,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:31,253 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 263 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:31,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 324 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:02:31,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6674 states. [2025-03-08 02:02:31,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6674 to 4577. [2025-03-08 02:02:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4577 states, 4576 states have (on average 1.1840034965034965) internal successors, (5418), 4576 states have internal predecessors, (5418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:31,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4577 states to 4577 states and 5418 transitions. [2025-03-08 02:02:31,301 INFO L78 Accepts]: Start accepts. Automaton has 4577 states and 5418 transitions. Word has length 339 [2025-03-08 02:02:31,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:31,302 INFO L471 AbstractCegarLoop]: Abstraction has 4577 states and 5418 transitions. [2025-03-08 02:02:31,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:31,302 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 5418 transitions. [2025-03-08 02:02:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-03-08 02:02:31,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:31,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:31,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:02:31,306 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:31,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:31,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1695267404, now seen corresponding path program 1 times [2025-03-08 02:02:31,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:31,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984081620] [2025-03-08 02:02:31,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:31,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:31,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 398 statements into 1 equivalence classes. [2025-03-08 02:02:31,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 398 of 398 statements. [2025-03-08 02:02:31,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:31,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:31,625 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-08 02:02:31,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:31,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984081620] [2025-03-08 02:02:31,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984081620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:31,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:31,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:02:31,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244964737] [2025-03-08 02:02:31,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:31,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:31,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:31,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:31,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:31,627 INFO L87 Difference]: Start difference. First operand 4577 states and 5418 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:32,810 INFO L93 Difference]: Finished difference Result 10955 states and 13233 transitions. [2025-03-08 02:02:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:32,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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 398 [2025-03-08 02:02:32,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:32,826 INFO L225 Difference]: With dead ends: 10955 [2025-03-08 02:02:32,826 INFO L226 Difference]: Without dead ends: 6679 [2025-03-08 02:02:32,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:32,830 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 276 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:32,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 636 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:02:32,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6679 states. [2025-03-08 02:02:32,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6679 to 6081. [2025-03-08 02:02:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6081 states, 6080 states have (on average 1.1572368421052632) internal successors, (7036), 6080 states have internal predecessors, (7036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:32,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6081 states to 6081 states and 7036 transitions. [2025-03-08 02:02:32,888 INFO L78 Accepts]: Start accepts. Automaton has 6081 states and 7036 transitions. Word has length 398 [2025-03-08 02:02:32,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:32,889 INFO L471 AbstractCegarLoop]: Abstraction has 6081 states and 7036 transitions. [2025-03-08 02:02:32,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 6081 states and 7036 transitions. [2025-03-08 02:02:32,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-03-08 02:02:32,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:32,893 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:32,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:02:32,893 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:32,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:32,894 INFO L85 PathProgramCache]: Analyzing trace with hash -420139310, now seen corresponding path program 1 times [2025-03-08 02:02:32,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:32,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896583244] [2025-03-08 02:02:32,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:32,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:32,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-08 02:02:32,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-08 02:02:32,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:32,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:02:33,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:33,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896583244] [2025-03-08 02:02:33,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896583244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:33,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:33,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:02:33,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379781865] [2025-03-08 02:02:33,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:33,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:33,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:33,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:33,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:33,156 INFO L87 Difference]: Start difference. First operand 6081 states and 7036 transitions. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:34,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:34,143 INFO L93 Difference]: Finished difference Result 13965 states and 16476 transitions. [2025-03-08 02:02:34,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:34,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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 404 [2025-03-08 02:02:34,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:34,159 INFO L225 Difference]: With dead ends: 13965 [2025-03-08 02:02:34,159 INFO L226 Difference]: Without dead ends: 8185 [2025-03-08 02:02:34,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:34,165 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 248 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:34,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 604 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:02:34,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8185 states. [2025-03-08 02:02:34,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8185 to 7584. [2025-03-08 02:02:34,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7584 states, 7583 states have (on average 1.1422919688777529) internal successors, (8662), 7583 states have internal predecessors, (8662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:34,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7584 states to 7584 states and 8662 transitions. [2025-03-08 02:02:34,261 INFO L78 Accepts]: Start accepts. Automaton has 7584 states and 8662 transitions. Word has length 404 [2025-03-08 02:02:34,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:34,261 INFO L471 AbstractCegarLoop]: Abstraction has 7584 states and 8662 transitions. [2025-03-08 02:02:34,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:34,262 INFO L276 IsEmpty]: Start isEmpty. Operand 7584 states and 8662 transitions. [2025-03-08 02:02:34,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2025-03-08 02:02:34,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:34,267 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:34,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:02:34,267 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:34,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:34,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1261353945, now seen corresponding path program 1 times [2025-03-08 02:02:34,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:34,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171933054] [2025-03-08 02:02:34,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:34,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:34,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 421 statements into 1 equivalence classes. [2025-03-08 02:02:34,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 421 of 421 statements. [2025-03-08 02:02:34,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:34,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:34,470 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 02:02:34,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:34,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171933054] [2025-03-08 02:02:34,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171933054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:34,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:34,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:02:34,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304471739] [2025-03-08 02:02:34,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:34,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:34,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:34,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:34,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:34,471 INFO L87 Difference]: Start difference. First operand 7584 states and 8662 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:35,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:35,624 INFO L93 Difference]: Finished difference Result 16661 states and 19392 transitions. [2025-03-08 02:02:35,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:35,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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 421 [2025-03-08 02:02:35,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:35,638 INFO L225 Difference]: With dead ends: 16661 [2025-03-08 02:02:35,638 INFO L226 Difference]: Without dead ends: 9378 [2025-03-08 02:02:35,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:35,644 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 248 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:35,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 617 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:02:35,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9378 states. [2025-03-08 02:02:35,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9378 to 9374. [2025-03-08 02:02:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9374 states, 9373 states have (on average 1.1297343433265763) internal successors, (10589), 9373 states have internal predecessors, (10589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9374 states to 9374 states and 10589 transitions. [2025-03-08 02:02:35,721 INFO L78 Accepts]: Start accepts. Automaton has 9374 states and 10589 transitions. Word has length 421 [2025-03-08 02:02:35,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:35,722 INFO L471 AbstractCegarLoop]: Abstraction has 9374 states and 10589 transitions. [2025-03-08 02:02:35,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:35,723 INFO L276 IsEmpty]: Start isEmpty. Operand 9374 states and 10589 transitions. [2025-03-08 02:02:35,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-08 02:02:35,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:35,725 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:35,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:02:35,725 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:35,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:35,726 INFO L85 PathProgramCache]: Analyzing trace with hash 875452064, now seen corresponding path program 1 times [2025-03-08 02:02:35,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:35,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245439180] [2025-03-08 02:02:35,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:35,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:35,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-08 02:02:35,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-08 02:02:35,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:35,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 50 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:02:36,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:36,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245439180] [2025-03-08 02:02:36,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245439180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:02:36,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651174598] [2025-03-08 02:02:36,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:36,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:02:36,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:02:36,141 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:02:36,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 02:02:36,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-08 02:02:36,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-08 02:02:36,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:36,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:36,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:02:36,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:02:36,508 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-08 02:02:36,508 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:02:36,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651174598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:36,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:02:36,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-08 02:02:36,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388060658] [2025-03-08 02:02:36,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:36,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:36,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:36,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:36,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:02:36,510 INFO L87 Difference]: Start difference. First operand 9374 states and 10589 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:37,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:37,994 INFO L93 Difference]: Finished difference Result 21504 states and 24713 transitions. [2025-03-08 02:02:37,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:37,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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 429 [2025-03-08 02:02:37,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:38,012 INFO L225 Difference]: With dead ends: 21504 [2025-03-08 02:02:38,013 INFO L226 Difference]: Without dead ends: 12431 [2025-03-08 02:02:38,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:02:38,021 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 363 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:38,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 636 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:02:38,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12431 states. [2025-03-08 02:02:38,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12431 to 12425. [2025-03-08 02:02:38,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12425 states, 12424 states have (on average 1.1450418544752092) internal successors, (14226), 12424 states have internal predecessors, (14226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12425 states to 12425 states and 14226 transitions. [2025-03-08 02:02:38,126 INFO L78 Accepts]: Start accepts. Automaton has 12425 states and 14226 transitions. Word has length 429 [2025-03-08 02:02:38,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:38,127 INFO L471 AbstractCegarLoop]: Abstraction has 12425 states and 14226 transitions. [2025-03-08 02:02:38,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:38,127 INFO L276 IsEmpty]: Start isEmpty. Operand 12425 states and 14226 transitions. [2025-03-08 02:02:38,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-03-08 02:02:38,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:38,131 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:38,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 02:02:38,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 02:02:38,332 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:38,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:38,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1043196820, now seen corresponding path program 1 times [2025-03-08 02:02:38,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:38,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624610017] [2025-03-08 02:02:38,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:38,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:38,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-03-08 02:02:38,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-03-08 02:02:38,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:38,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:38,725 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2025-03-08 02:02:38,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:38,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624610017] [2025-03-08 02:02:38,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624610017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:38,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:38,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:02:38,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901219625] [2025-03-08 02:02:38,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:38,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:38,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:38,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:38,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:38,728 INFO L87 Difference]: Start difference. First operand 12425 states and 14226 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:39,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:39,984 INFO L93 Difference]: Finished difference Result 32330 states and 37074 transitions. [2025-03-08 02:02:39,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:39,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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 501 [2025-03-08 02:02:39,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:40,002 INFO L225 Difference]: With dead ends: 32330 [2025-03-08 02:02:40,003 INFO L226 Difference]: Without dead ends: 16618 [2025-03-08 02:02:40,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-03-08 02:02:40,014 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 301 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:40,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 590 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:02:40,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16618 states. [2025-03-08 02:02:40,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16618 to 16020. [2025-03-08 02:02:40,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16020 states, 16019 states have (on average 1.0850864598289531) internal successors, (17382), 16019 states have internal predecessors, (17382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:40,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16020 states to 16020 states and 17382 transitions. [2025-03-08 02:02:40,192 INFO L78 Accepts]: Start accepts. Automaton has 16020 states and 17382 transitions. Word has length 501 [2025-03-08 02:02:40,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:40,194 INFO L471 AbstractCegarLoop]: Abstraction has 16020 states and 17382 transitions. [2025-03-08 02:02:40,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:40,194 INFO L276 IsEmpty]: Start isEmpty. Operand 16020 states and 17382 transitions. [2025-03-08 02:02:40,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-08 02:02:40,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:40,198 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:40,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 02:02:40,198 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:40,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:40,199 INFO L85 PathProgramCache]: Analyzing trace with hash -979161711, now seen corresponding path program 1 times [2025-03-08 02:02:40,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:40,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484284531] [2025-03-08 02:02:40,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:40,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:40,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-08 02:02:40,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-08 02:02:40,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:40,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:41,322 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 251 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:02:41,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:41,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484284531] [2025-03-08 02:02:41,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484284531] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:02:41,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074028964] [2025-03-08 02:02:41,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:41,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:02:41,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:02:41,326 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:02:41,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 02:02:41,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-08 02:02:41,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-08 02:02:41,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:41,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:41,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 02:02:41,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:02:42,039 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 399 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:02:42,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:02:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 399 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:02:43,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074028964] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:02:43,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:02:43,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2025-03-08 02:02:43,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825564181] [2025-03-08 02:02:43,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:02:43,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 02:02:43,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:43,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 02:02:43,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-08 02:02:43,194 INFO L87 Difference]: Start difference. First operand 16020 states and 17382 transitions. Second operand has 10 states, 10 states have (on average 135.1) internal successors, (1351), 10 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:48,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:48,953 INFO L93 Difference]: Finished difference Result 53478 states and 58794 transitions. [2025-03-08 02:02:48,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 02:02:48,953 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 135.1) internal successors, (1351), 10 states have internal predecessors, (1351), 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 574 [2025-03-08 02:02:48,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:48,980 INFO L225 Difference]: With dead ends: 53478 [2025-03-08 02:02:48,981 INFO L226 Difference]: Without dead ends: 37759 [2025-03-08 02:02:48,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1188 GetRequests, 1162 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 02:02:48,989 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 6337 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 8392 mSolverCounterSat, 2104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6337 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 10496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2104 IncrementalHoareTripleChecker+Valid, 8392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:48,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6337 Valid, 309 Invalid, 10496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2104 Valid, 8392 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-03-08 02:02:49,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37759 states. [2025-03-08 02:02:49,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37759 to 30395. [2025-03-08 02:02:49,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30395 states, 30394 states have (on average 1.0743238797131012) internal successors, (32653), 30394 states have internal predecessors, (32653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:49,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30395 states to 30395 states and 32653 transitions. [2025-03-08 02:02:49,378 INFO L78 Accepts]: Start accepts. Automaton has 30395 states and 32653 transitions. Word has length 574 [2025-03-08 02:02:49,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:49,379 INFO L471 AbstractCegarLoop]: Abstraction has 30395 states and 32653 transitions. [2025-03-08 02:02:49,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 135.1) internal successors, (1351), 10 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 30395 states and 32653 transitions. [2025-03-08 02:02:49,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2025-03-08 02:02:49,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:49,392 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:49,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 02:02:49,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 02:02:49,593 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:49,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:49,593 INFO L85 PathProgramCache]: Analyzing trace with hash -713384665, now seen corresponding path program 1 times [2025-03-08 02:02:49,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:49,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522029771] [2025-03-08 02:02:49,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:49,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:49,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 701 statements into 1 equivalence classes. [2025-03-08 02:02:49,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 701 of 701 statements. [2025-03-08 02:02:49,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:49,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:50,068 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-08 02:02:50,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:50,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522029771] [2025-03-08 02:02:50,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522029771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:50,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:50,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:02:50,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41453497] [2025-03-08 02:02:50,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:50,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:50,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:50,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:50,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:50,071 INFO L87 Difference]: Start difference. First operand 30395 states and 32653 transitions. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:50,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:50,959 INFO L93 Difference]: Finished difference Result 67661 states and 72610 transitions. [2025-03-08 02:02:50,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:50,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 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 701 [2025-03-08 02:02:50,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:50,993 INFO L225 Difference]: With dead ends: 67661 [2025-03-08 02:02:50,993 INFO L226 Difference]: Without dead ends: 37567 [2025-03-08 02:02:51,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:51,013 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 218 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:51,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 574 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:02:51,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37567 states. [2025-03-08 02:02:51,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37567 to 36068. [2025-03-08 02:02:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36068 states, 36067 states have (on average 1.06645964455042) internal successors, (38464), 36067 states have internal predecessors, (38464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:51,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36068 states to 36068 states and 38464 transitions. [2025-03-08 02:02:51,338 INFO L78 Accepts]: Start accepts. Automaton has 36068 states and 38464 transitions. Word has length 701 [2025-03-08 02:02:51,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:51,339 INFO L471 AbstractCegarLoop]: Abstraction has 36068 states and 38464 transitions. [2025-03-08 02:02:51,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:51,339 INFO L276 IsEmpty]: Start isEmpty. Operand 36068 states and 38464 transitions. [2025-03-08 02:02:51,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2025-03-08 02:02:51,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:51,348 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:51,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 02:02:51,348 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:51,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:51,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2121176314, now seen corresponding path program 1 times [2025-03-08 02:02:51,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:51,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75955271] [2025-03-08 02:02:51,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:51,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:51,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 749 statements into 1 equivalence classes. [2025-03-08 02:02:51,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 749 of 749 statements. [2025-03-08 02:02:51,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:51,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:52,279 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 504 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2025-03-08 02:02:52,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:52,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75955271] [2025-03-08 02:02:52,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75955271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:52,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:52,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:02:52,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600949279] [2025-03-08 02:02:52,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:52,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:02:52,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:52,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:02:52,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:02:52,282 INFO L87 Difference]: Start difference. First operand 36068 states and 38464 transitions. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:53,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:53,949 INFO L93 Difference]: Finished difference Result 80844 states and 86028 transitions. [2025-03-08 02:02:53,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:02:53,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 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 749 [2025-03-08 02:02:53,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:53,985 INFO L225 Difference]: With dead ends: 80844 [2025-03-08 02:02:53,986 INFO L226 Difference]: Without dead ends: 45077 [2025-03-08 02:02:53,998 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-03-08 02:02:53,998 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 523 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:53,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 99 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:02:54,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45077 states. [2025-03-08 02:02:54,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45077 to 39359. [2025-03-08 02:02:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39359 states, 39358 states have (on average 1.0657299659535546) internal successors, (41945), 39358 states have internal predecessors, (41945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39359 states to 39359 states and 41945 transitions. [2025-03-08 02:02:54,319 INFO L78 Accepts]: Start accepts. Automaton has 39359 states and 41945 transitions. Word has length 749 [2025-03-08 02:02:54,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:54,320 INFO L471 AbstractCegarLoop]: Abstraction has 39359 states and 41945 transitions. [2025-03-08 02:02:54,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:54,320 INFO L276 IsEmpty]: Start isEmpty. Operand 39359 states and 41945 transitions. [2025-03-08 02:02:54,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 854 [2025-03-08 02:02:54,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:54,335 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:54,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 02:02:54,335 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:54,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:54,336 INFO L85 PathProgramCache]: Analyzing trace with hash 749047735, now seen corresponding path program 1 times [2025-03-08 02:02:54,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:54,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695308831] [2025-03-08 02:02:54,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:54,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:54,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 853 statements into 1 equivalence classes. [2025-03-08 02:02:54,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 853 of 853 statements. [2025-03-08 02:02:54,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:54,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 710 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2025-03-08 02:02:54,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:54,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695308831] [2025-03-08 02:02:54,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695308831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:54,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:54,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:02:54,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678225326] [2025-03-08 02:02:54,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:54,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:54,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:54,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:54,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:54,999 INFO L87 Difference]: Start difference. First operand 39359 states and 41945 transitions. Second operand has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:55,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:55,764 INFO L93 Difference]: Finished difference Result 78715 states and 83888 transitions. [2025-03-08 02:02:55,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:55,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 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 853 [2025-03-08 02:02:55,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:55,802 INFO L225 Difference]: With dead ends: 78715 [2025-03-08 02:02:55,803 INFO L226 Difference]: Without dead ends: 39657 [2025-03-08 02:02:55,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:55,826 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 243 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:55,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 121 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:02:55,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39657 states. [2025-03-08 02:02:56,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39657 to 39358. [2025-03-08 02:02:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39358 states, 39357 states have (on average 1.0601925959803846) internal successors, (41726), 39357 states have internal predecessors, (41726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:56,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39358 states to 39358 states and 41726 transitions. [2025-03-08 02:02:56,232 INFO L78 Accepts]: Start accepts. Automaton has 39358 states and 41726 transitions. Word has length 853 [2025-03-08 02:02:56,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:56,232 INFO L471 AbstractCegarLoop]: Abstraction has 39358 states and 41726 transitions. [2025-03-08 02:02:56,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:56,232 INFO L276 IsEmpty]: Start isEmpty. Operand 39358 states and 41726 transitions. [2025-03-08 02:02:56,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 913 [2025-03-08 02:02:56,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:56,250 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:56,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 02:02:56,250 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:56,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:56,251 INFO L85 PathProgramCache]: Analyzing trace with hash 979776832, now seen corresponding path program 1 times [2025-03-08 02:02:56,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:56,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815408489] [2025-03-08 02:02:56,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:56,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:56,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 912 statements into 1 equivalence classes. [2025-03-08 02:02:56,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 912 of 912 statements. [2025-03-08 02:02:56,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:56,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1769 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 996 trivial. 0 not checked. [2025-03-08 02:02:56,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:56,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815408489] [2025-03-08 02:02:56,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815408489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:56,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:56,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:02:56,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139625819] [2025-03-08 02:02:56,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:56,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:56,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:56,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:56,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:56,517 INFO L87 Difference]: Start difference. First operand 39358 states and 41726 transitions. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:57,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:57,548 INFO L93 Difference]: Finished difference Result 84989 states and 90300 transitions. [2025-03-08 02:02:57,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:57,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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 912 [2025-03-08 02:02:57,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:57,595 INFO L225 Difference]: With dead ends: 84989 [2025-03-08 02:02:57,596 INFO L226 Difference]: Without dead ends: 45932 [2025-03-08 02:02:57,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:57,618 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 235 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:57,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 212 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:02:57,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45932 states. [2025-03-08 02:02:57,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45932 to 42942. [2025-03-08 02:02:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42942 states, 42941 states have (on average 1.0574742087981184) internal successors, (45409), 42941 states have internal predecessors, (45409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42942 states to 42942 states and 45409 transitions. [2025-03-08 02:02:57,976 INFO L78 Accepts]: Start accepts. Automaton has 42942 states and 45409 transitions. Word has length 912 [2025-03-08 02:02:57,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:57,977 INFO L471 AbstractCegarLoop]: Abstraction has 42942 states and 45409 transitions. [2025-03-08 02:02:57,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:57,977 INFO L276 IsEmpty]: Start isEmpty. Operand 42942 states and 45409 transitions. [2025-03-08 02:02:57,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 951 [2025-03-08 02:02:57,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:57,995 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, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:57,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 02:02:57,996 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:57,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:57,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1496933140, now seen corresponding path program 1 times [2025-03-08 02:02:57,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:57,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795457929] [2025-03-08 02:02:57,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:57,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:58,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 950 statements into 1 equivalence classes. [2025-03-08 02:02:58,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 950 of 950 statements. [2025-03-08 02:02:58,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:58,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:58,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2025-03-08 02:02:58,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:58,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795457929] [2025-03-08 02:02:58,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795457929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:58,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:58,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:02:58,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887568351] [2025-03-08 02:02:58,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:58,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:02:58,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:58,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:02:58,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:02:58,429 INFO L87 Difference]: Start difference. First operand 42942 states and 45409 transitions. Second operand has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:59,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:59,881 INFO L93 Difference]: Finished difference Result 94555 states and 99987 transitions. [2025-03-08 02:02:59,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:02:59,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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 950 [2025-03-08 02:02:59,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:59,935 INFO L225 Difference]: With dead ends: 94555 [2025-03-08 02:02:59,935 INFO L226 Difference]: Without dead ends: 46532 [2025-03-08 02:02:59,963 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-03-08 02:02:59,964 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 653 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1844 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 2097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:59,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 454 Invalid, 2097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1844 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:02:59,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46532 states. [2025-03-08 02:03:00,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46532 to 37528. [2025-03-08 02:03:00,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37528 states, 37527 states have (on average 1.0371465877901245) internal successors, (38921), 37527 states have internal predecessors, (38921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37528 states to 37528 states and 38921 transitions. [2025-03-08 02:03:00,464 INFO L78 Accepts]: Start accepts. Automaton has 37528 states and 38921 transitions. Word has length 950 [2025-03-08 02:03:00,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:00,465 INFO L471 AbstractCegarLoop]: Abstraction has 37528 states and 38921 transitions. [2025-03-08 02:03:00,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:00,465 INFO L276 IsEmpty]: Start isEmpty. Operand 37528 states and 38921 transitions. [2025-03-08 02:03:00,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 981 [2025-03-08 02:03:00,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:00,492 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:03:00,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 02:03:00,493 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:00,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:00,493 INFO L85 PathProgramCache]: Analyzing trace with hash 207603676, now seen corresponding path program 1 times [2025-03-08 02:03:00,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:00,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84139510] [2025-03-08 02:03:00,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:00,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:00,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 980 statements into 1 equivalence classes. [2025-03-08 02:03:00,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 980 of 980 statements. [2025-03-08 02:03:00,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:00,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:02,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 1057 proven. 263 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2025-03-08 02:03:02,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:02,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84139510] [2025-03-08 02:03:02,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84139510] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:03:02,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517608883] [2025-03-08 02:03:02,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:02,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:03:02,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:03:02,009 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:03:02,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 02:03:02,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 980 statements into 1 equivalence classes. [2025-03-08 02:03:02,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 980 of 980 statements. [2025-03-08 02:03:02,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:02,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:02,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 1138 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 02:03:02,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:03:03,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 930 proven. 416 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-03-08 02:03:03,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:03:04,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 892 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2025-03-08 02:03:04,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517608883] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:03:04,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:03:04,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 6] total 12 [2025-03-08 02:03:04,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241306589] [2025-03-08 02:03:04,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:04,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:03:04,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:04,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:03:04,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-08 02:03:04,054 INFO L87 Difference]: Start difference. First operand 37528 states and 38921 transitions. Second operand has 4 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:05,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:05,319 INFO L93 Difference]: Finished difference Result 82249 states and 85305 transitions. [2025-03-08 02:03:05,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:03:05,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 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 980 [2025-03-08 02:03:05,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:05,363 INFO L225 Difference]: With dead ends: 82249 [2025-03-08 02:03:05,364 INFO L226 Difference]: Without dead ends: 44723 [2025-03-08 02:03:05,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1964 GetRequests, 1954 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-08 02:03:05,389 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 355 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:05,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 69 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:03:05,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44723 states. [2025-03-08 02:03:05,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44723 to 36916. [2025-03-08 02:03:05,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36916 states, 36915 states have (on average 1.0347013409183259) internal successors, (38196), 36915 states have internal predecessors, (38196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:05,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36916 states to 36916 states and 38196 transitions. [2025-03-08 02:03:05,766 INFO L78 Accepts]: Start accepts. Automaton has 36916 states and 38196 transitions. Word has length 980 [2025-03-08 02:03:05,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:05,767 INFO L471 AbstractCegarLoop]: Abstraction has 36916 states and 38196 transitions. [2025-03-08 02:03:05,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:05,767 INFO L276 IsEmpty]: Start isEmpty. Operand 36916 states and 38196 transitions. [2025-03-08 02:03:05,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1021 [2025-03-08 02:03:05,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:05,787 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:03:05,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 02:03:05,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:03:05,988 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:05,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:05,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2037131464, now seen corresponding path program 1 times [2025-03-08 02:03:05,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:05,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469430938] [2025-03-08 02:03:05,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:05,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:06,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1020 statements into 1 equivalence classes. [2025-03-08 02:03:06,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1020 of 1020 statements. [2025-03-08 02:03:06,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:06,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:06,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2057 backedges. 1279 proven. 0 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2025-03-08 02:03:06,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:06,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469430938] [2025-03-08 02:03:06,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469430938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:06,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:06,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:03:06,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636360351] [2025-03-08 02:03:06,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:06,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:06,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:06,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:06,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:06,420 INFO L87 Difference]: Start difference. First operand 36916 states and 38196 transitions. Second operand has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:07,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:07,315 INFO L93 Difference]: Finished difference Result 75621 states and 78235 transitions. [2025-03-08 02:03:07,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:07,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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 1020 [2025-03-08 02:03:07,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:07,317 INFO L225 Difference]: With dead ends: 75621 [2025-03-08 02:03:07,317 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 02:03:07,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:07,339 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 225 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:07,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 437 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:03:07,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 02:03:07,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 02:03:07,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:07,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 02:03:07,340 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1020 [2025-03-08 02:03:07,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:07,340 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 02:03:07,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:07,340 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 02:03:07,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 02:03:07,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 02:03:07,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 02:03:07,346 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:03:07,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 02:03:12,764 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 02:03:12,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:03:12 BoogieIcfgContainer [2025-03-08 02:03:12,794 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 02:03:12,795 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 02:03:12,795 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 02:03:12,795 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 02:03:12,796 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:02:19" (3/4) ... [2025-03-08 02:03:12,797 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 02:03:12,817 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-08 02:03:12,819 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 02:03:12,820 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 02:03:12,821 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 02:03:12,944 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 02:03:12,944 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 02:03:12,944 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 02:03:12,945 INFO L158 Benchmark]: Toolchain (without parser) took 57128.97ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 108.0MB in the beginning and 604.4MB in the end (delta: -496.4MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-03-08 02:03:12,945 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:03:12,945 INFO L158 Benchmark]: CACSL2BoogieTranslator took 657.72ms. Allocated memory is still 142.6MB. Free memory was 107.5MB in the beginning and 94.6MB in the end (delta: 13.0MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. [2025-03-08 02:03:12,945 INFO L158 Benchmark]: Boogie Procedure Inliner took 140.06ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 57.4MB in the end (delta: 37.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 02:03:12,945 INFO L158 Benchmark]: Boogie Preprocessor took 227.63ms. Allocated memory is still 142.6MB. Free memory was 57.4MB in the beginning and 82.4MB in the end (delta: -25.0MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. [2025-03-08 02:03:12,946 INFO L158 Benchmark]: IcfgBuilder took 2170.15ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 82.4MB in the beginning and 69.8MB in the end (delta: 12.6MB). Peak memory consumption was 141.8MB. Max. memory is 16.1GB. [2025-03-08 02:03:12,946 INFO L158 Benchmark]: TraceAbstraction took 53778.01ms. Allocated memory was 251.7MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 69.8MB in the beginning and 629.5MB in the end (delta: -559.7MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-03-08 02:03:12,946 INFO L158 Benchmark]: Witness Printer took 149.06ms. Allocated memory is still 1.9GB. Free memory was 629.5MB in the beginning and 604.4MB in the end (delta: 25.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 02:03:12,947 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.20ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 657.72ms. Allocated memory is still 142.6MB. Free memory was 107.5MB in the beginning and 94.6MB in the end (delta: 13.0MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 140.06ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 57.4MB in the end (delta: 37.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 227.63ms. Allocated memory is still 142.6MB. Free memory was 57.4MB in the beginning and 82.4MB in the end (delta: -25.0MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. * IcfgBuilder took 2170.15ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 82.4MB in the beginning and 69.8MB in the end (delta: 12.6MB). Peak memory consumption was 141.8MB. Max. memory is 16.1GB. * TraceAbstraction took 53778.01ms. Allocated memory was 251.7MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 69.8MB in the beginning and 629.5MB in the end (delta: -559.7MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 149.06ms. Allocated memory is still 1.9GB. Free memory was 629.5MB in the beginning and 604.4MB in the end (delta: 25.1MB). 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: 173]: 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, 424 locations, 749 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.3s, OverallIterations: 20, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 30.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12773 SdHoareTripleChecker+Valid, 26.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12773 mSDsluCounter, 7805 SdHoareTripleChecker+Invalid, 22.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1048 mSDsCounter, 6079 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28991 IncrementalHoareTripleChecker+Invalid, 35070 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6079 mSolverCounterUnsat, 6757 mSDtfsCounter, 28991 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3637 GetRequests, 3575 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42942occurred in iteration=17, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 38927 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 12269 NumberOfCodeBlocks, 12269 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 13798 ConstructedInterpolants, 0 QuantifiedInterpolants, 41529 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2353 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 25 InterpolantComputations, 19 PerfectInterpolantSequences, 15950/17253 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: 1776]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((((((((((0 <= ((long long) a29 + 127)) && (a29 <= 599998)) && (a2 == 4)) && (0 <= ((long long) a4 + 73))) || (((2 == a2) && (0 <= ((long long) a4 + 85))) && (((long long) a29 + 144) <= 0))) || (((((3 != a2) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (a2 != 4)) && (3 <= a2))) || (((0 <= ((long long) 97 + a0)) && (a2 == 4)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 190395))) || ((((((long long) 107 + a0) <= 0) && (2 == a2)) && (0 <= ((long long) a29 + 127))) && (a29 <= 599998))) || ((((((long long) 107 + a0) <= 0) && (134656 <= a29)) && (0 <= ((long long) a4 + 85))) && (a29 <= 599998))) || (((((long long) 107 + a0) <= 0) && (a2 == 4)) && (((long long) a29 + 16) <= 0))) || ((a2 == 1) && (((long long) a29 + 127) <= 0))) || ((((43 < a29) && (0 <= ((long long) 97 + a0))) && (((long long) 89 + a4) <= 0)) && (a29 <= 599998))) || ((((0 <= ((long long) 97 + a0)) && (0 <= ((long long) a29 + 127))) && (((long long) a29 + 16) <= 0)) && (((long long) a0 + 61) <= 0))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (((long long) a29 + 107481) <= 0))) || (((((long long) a0 + 147) <= 0) && (a2 == 1)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 190395))) || (((2 == a2) && (0 <= ((long long) a0 + 60))) && (((long long) a29 + 107481) <= 0))) || (((((((134656 <= a29) && (3 != a2)) && (0 <= ((long long) a4 + 85))) && (a2 != 4)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 190395)) && (3 <= a2)) && (((long long) a0 + 61) <= 0))) || (((((long long) 89 + a4) <= 0) && (a2 == 4)) && (((long long) a29 + 16) <= 0))) || ((((3 != a2) && (0 <= ((long long) a29 + 127))) && (a2 != 4)) && (((long long) a29 + 16) <= 0))) || ((((((3 != a2) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 127))) && (a29 <= 599998)) && (a2 != 4)) && ((2 != a2) || (a29 < 44)))) || (((0 <= ((long long) a29 + 15)) && (0 <= ((long long) a0 + 60))) && (a29 <= 599998))) || (((((long long) 107 + a0) <= 0) && (((long long) a29 + 16) <= 0)) && (3 == a2))) || ((((0 <= ((long long) a4 + 85)) && (((long long) a0 + 147) <= 0)) && (a2 == 4)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 190395))) || ((((long long) a0 + 99) <= 0) && (((long long) 89 + a4) <= 0))) || ((((0 <= ((long long) a29 + 127)) && (((long long) a0 + 147) <= 0)) && (a29 <= 599998)) && (a2 != 4))) || (((2 == a2) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0))) || ((((((long long) a0 + 99) <= 0) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 190395)) && (0 <= ((long long) a4 + 73))) && (3 == a2))) || ((((((long long) 107 + a0) <= 0) && (0 <= ((long long) a4 + 85))) && (a29 <= 599998)) && (3 == a2))) || (((((0 <= ((long long) 97 + a0)) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 15))) && (a29 <= 599998)) && (3 == a2))) || (((((long long) 107 + a0) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) a29 + 16) <= 0))) || (((((long long) 89 + a4) <= 0) && (3 == a2)) && (((long long) a29 + 127) <= 0))) || ((((3 != a2) && (0 <= ((long long) a29 + 127))) && (((long long) 89 + a4) <= 0)) && (a29 <= 599998))) || (((((3 != a2) && (0 <= ((long long) 97 + a0))) && (0 <= ((long long) a4 + 85))) && (((long long) a29 + 16) <= 0)) && (((long long) a0 + 61) <= 0))) || ((((0 <= ((long long) a29 + 127)) && (((long long) a0 + 99) <= 0)) && (a29 <= 599998)) && (0 <= ((long long) a4 + 73)))) RESULT: Ultimate proved your program to be correct! [2025-03-08 02:03:12,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE