./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label59.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 744695bd97e773bc45009ad8c308621dee61f75b749d2d70fc4d697e39202153 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:57:17,620 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:57:17,671 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:57:17,677 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:57:17,680 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:57:17,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:57:17,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:57:17,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:57:17,702 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:57:17,702 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:57:17,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:57:17,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:57:17,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:57:17,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:57:17,703 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:57:17,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:57:17,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:57:17,703 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:57:17,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:57:17,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:57:17,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:57:17,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:57:17,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:57:17,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:57:17,704 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:57:17,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:57:17,704 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:57:17,704 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:57:17,705 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:57:17,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:57:17,705 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:57:17,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:57:17,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:57:17,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:57:17,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:57:17,706 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:57:17,706 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:57:17,706 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:57:17,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:57:17,706 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:57:17,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:57:17,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:57:17,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:57:17,706 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 -> 744695bd97e773bc45009ad8c308621dee61f75b749d2d70fc4d697e39202153 [2025-03-03 10:57:17,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:57:17,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:57:17,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:57:17,923 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:57:17,924 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:57:17,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label59.c [2025-03-03 10:57:19,048 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df89b63b/5e4d3f734ec84d3dbc74ce0d01cf88a2/FLAG6086a84a6 [2025-03-03 10:57:19,392 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:57:19,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label59.c [2025-03-03 10:57:19,407 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df89b63b/5e4d3f734ec84d3dbc74ce0d01cf88a2/FLAG6086a84a6 [2025-03-03 10:57:19,418 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df89b63b/5e4d3f734ec84d3dbc74ce0d01cf88a2 [2025-03-03 10:57:19,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:57:19,421 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:57:19,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:57:19,422 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:57:19,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:57:19,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:57:19" (1/1) ... [2025-03-03 10:57:19,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24bab302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:19, skipping insertion in model container [2025-03-03 10:57:19,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:57:19" (1/1) ... [2025-03-03 10:57:19,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:57:19,616 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/Problem16_label59.c[4713,4726] [2025-03-03 10:57:19,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:57:19,868 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:57:19,884 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/Problem16_label59.c[4713,4726] [2025-03-03 10:57:20,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:57:20,013 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:57:20,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:20 WrapperNode [2025-03-03 10:57:20,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:57:20,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:57:20,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:57:20,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:57:20,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:20" (1/1) ... [2025-03-03 10:57:20,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:20" (1/1) ... [2025-03-03 10:57:20,138 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-03 10:57:20,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:57:20,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:57:20,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:57:20,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:57:20,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:20" (1/1) ... [2025-03-03 10:57:20,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:20" (1/1) ... [2025-03-03 10:57:20,161 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:20" (1/1) ... [2025-03-03 10:57:20,203 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:57:20,203 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:20" (1/1) ... [2025-03-03 10:57:20,204 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:20" (1/1) ... [2025-03-03 10:57:20,237 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:20" (1/1) ... [2025-03-03 10:57:20,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:20" (1/1) ... [2025-03-03 10:57:20,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:20" (1/1) ... [2025-03-03 10:57:20,258 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:20" (1/1) ... [2025-03-03 10:57:20,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:57:20,269 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:57:20,270 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:57:20,270 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:57:20,270 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:20" (1/1) ... [2025-03-03 10:57:20,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:57:20,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:57:20,297 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:57:20,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:57:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:57:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:57:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:57:20,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:57:20,365 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:57:20,367 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:57:21,934 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-03 10:57:22,003 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-03 10:57:22,004 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:57:22,024 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:57:22,025 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:57:22,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:57:22 BoogieIcfgContainer [2025-03-03 10:57:22,026 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:57:22,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:57:22,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:57:22,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:57:22,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:57:19" (1/3) ... [2025-03-03 10:57:22,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2779d2b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:57:22, skipping insertion in model container [2025-03-03 10:57:22,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:20" (2/3) ... [2025-03-03 10:57:22,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2779d2b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:57:22, skipping insertion in model container [2025-03-03 10:57:22,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:57:22" (3/3) ... [2025-03-03 10:57:22,034 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label59.c [2025-03-03 10:57:22,045 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:57:22,046 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label59.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:57:22,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:57:22,108 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;@28c65052, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:57:22,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:57:22,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:22,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 10:57:22,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:22,120 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] [2025-03-03 10:57:22,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:22,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:22,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1564653317, now seen corresponding path program 1 times [2025-03-03 10:57:22,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:22,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603318514] [2025-03-03 10:57:22,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:22,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:22,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 10:57:22,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 10:57:22,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:22,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:57:22,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:22,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603318514] [2025-03-03 10:57:22,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603318514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:22,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:22,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:57:22,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452175534] [2025-03-03 10:57:22,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:22,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:22,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:22,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:22,437 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:23,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:23,740 INFO L93 Difference]: Finished difference Result 1137 states and 2115 transitions. [2025-03-03 10:57:23,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:23,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-03-03 10:57:23,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:23,752 INFO L225 Difference]: With dead ends: 1137 [2025-03-03 10:57:23,752 INFO L226 Difference]: Without dead ends: 662 [2025-03-03 10:57:23,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:23,756 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 342 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:23,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 60 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:57:23,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-03 10:57:23,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-03-03 10:57:23,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.7639939485627836) internal successors, (1166), 661 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1166 transitions. [2025-03-03 10:57:23,801 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1166 transitions. Word has length 44 [2025-03-03 10:57:23,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:23,801 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1166 transitions. [2025-03-03 10:57:23,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1166 transitions. [2025-03-03 10:57:23,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 10:57:23,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:23,803 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:57:23,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:57:23,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:23,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:23,804 INFO L85 PathProgramCache]: Analyzing trace with hash 59047448, now seen corresponding path program 1 times [2025-03-03 10:57:23,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:23,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266396746] [2025-03-03 10:57:23,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:23,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:23,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 10:57:23,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 10:57:23,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:23,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:23,961 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:57:23,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:23,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266396746] [2025-03-03 10:57:23,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266396746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:23,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:23,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:57:23,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896596082] [2025-03-03 10:57:23,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:23,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:23,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:23,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:23,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:23,966 INFO L87 Difference]: Start difference. First operand 662 states and 1166 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:24,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:24,975 INFO L93 Difference]: Finished difference Result 1980 states and 3493 transitions. [2025-03-03 10:57:24,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:24,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-03 10:57:24,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:24,981 INFO L225 Difference]: With dead ends: 1980 [2025-03-03 10:57:24,981 INFO L226 Difference]: Without dead ends: 1320 [2025-03-03 10:57:24,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:24,983 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 344 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:24,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 77 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:57:24,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-03-03 10:57:25,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2025-03-03 10:57:25,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.6656557998483699) internal successors, (2197), 1319 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:25,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 2197 transitions. [2025-03-03 10:57:25,018 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 2197 transitions. Word has length 109 [2025-03-03 10:57:25,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:25,018 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 2197 transitions. [2025-03-03 10:57:25,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:25,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 2197 transitions. [2025-03-03 10:57:25,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 10:57:25,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:25,020 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:57:25,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:57:25,020 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:25,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:25,021 INFO L85 PathProgramCache]: Analyzing trace with hash -718462063, now seen corresponding path program 1 times [2025-03-03 10:57:25,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:25,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204843213] [2025-03-03 10:57:25,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:25,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:25,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 10:57:25,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 10:57:25,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:25,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:25,275 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:57:25,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:25,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204843213] [2025-03-03 10:57:25,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204843213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:25,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:25,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:57:25,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218170538] [2025-03-03 10:57:25,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:25,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:57:25,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:25,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:57:25,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:57:25,278 INFO L87 Difference]: Start difference. First operand 1320 states and 2197 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:26,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:26,982 INFO L93 Difference]: Finished difference Result 3625 states and 5926 transitions. [2025-03-03 10:57:26,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:57:26,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 10:57:26,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:26,992 INFO L225 Difference]: With dead ends: 3625 [2025-03-03 10:57:26,993 INFO L226 Difference]: Without dead ends: 2307 [2025-03-03 10:57:26,997 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-03 10:57:26,998 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1005 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 2019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:26,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 41 Invalid, 2019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 10:57:27,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-03-03 10:57:27,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-03-03 10:57:27,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.5034692107545533) internal successors, (3467), 2306 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:27,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3467 transitions. [2025-03-03 10:57:27,058 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3467 transitions. Word has length 112 [2025-03-03 10:57:27,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:27,059 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3467 transitions. [2025-03-03 10:57:27,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:27,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3467 transitions. [2025-03-03 10:57:27,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 10:57:27,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:27,063 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:57:27,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:57:27,063 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:27,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:27,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1726597407, now seen corresponding path program 1 times [2025-03-03 10:57:27,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:27,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100442833] [2025-03-03 10:57:27,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:27,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:27,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 10:57:27,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 10:57:27,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:27,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:57:27,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:27,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100442833] [2025-03-03 10:57:27,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100442833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:27,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:27,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:57:27,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87198615] [2025-03-03 10:57:27,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:27,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:27,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:27,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:27,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:27,192 INFO L87 Difference]: Start difference. First operand 2307 states and 3467 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:28,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:28,140 INFO L93 Difference]: Finished difference Result 4941 states and 7580 transitions. [2025-03-03 10:57:28,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:28,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2025-03-03 10:57:28,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:28,149 INFO L225 Difference]: With dead ends: 4941 [2025-03-03 10:57:28,150 INFO L226 Difference]: Without dead ends: 2965 [2025-03-03 10:57:28,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:28,153 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 340 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:28,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 540 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:57:28,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2025-03-03 10:57:28,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2965. [2025-03-03 10:57:28,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2964 states have (on average 1.4321862348178138) internal successors, (4245), 2964 states have internal predecessors, (4245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:28,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 4245 transitions. [2025-03-03 10:57:28,195 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 4245 transitions. Word has length 131 [2025-03-03 10:57:28,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:28,195 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 4245 transitions. [2025-03-03 10:57:28,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:28,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 4245 transitions. [2025-03-03 10:57:28,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-03 10:57:28,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:28,197 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:57:28,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:57:28,198 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:28,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:28,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1566024034, now seen corresponding path program 1 times [2025-03-03 10:57:28,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:28,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567198790] [2025-03-03 10:57:28,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:28,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:28,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-03 10:57:28,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-03 10:57:28,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:28,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:28,354 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-03 10:57:28,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:28,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567198790] [2025-03-03 10:57:28,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567198790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:28,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:28,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:57:28,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302169083] [2025-03-03 10:57:28,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:28,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:28,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:28,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:28,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:28,357 INFO L87 Difference]: Start difference. First operand 2965 states and 4245 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:29,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:29,274 INFO L93 Difference]: Finished difference Result 7573 states and 10945 transitions. [2025-03-03 10:57:29,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:29,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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 232 [2025-03-03 10:57:29,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:29,286 INFO L225 Difference]: With dead ends: 7573 [2025-03-03 10:57:29,287 INFO L226 Difference]: Without dead ends: 4281 [2025-03-03 10:57:29,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:29,292 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 345 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:29,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:57:29,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2025-03-03 10:57:29,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 3623. [2025-03-03 10:57:29,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3623 states, 3622 states have (on average 1.1035339591385975) internal successors, (3997), 3622 states have internal predecessors, (3997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:29,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 3997 transitions. [2025-03-03 10:57:29,359 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 3997 transitions. Word has length 232 [2025-03-03 10:57:29,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:29,359 INFO L471 AbstractCegarLoop]: Abstraction has 3623 states and 3997 transitions. [2025-03-03 10:57:29,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:29,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 3997 transitions. [2025-03-03 10:57:29,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-03-03 10:57:29,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:29,362 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:57:29,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:57:29,362 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:29,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:29,363 INFO L85 PathProgramCache]: Analyzing trace with hash 2016024565, now seen corresponding path program 1 times [2025-03-03 10:57:29,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:29,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868670509] [2025-03-03 10:57:29,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:29,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:29,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-03 10:57:29,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-03 10:57:29,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:29,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-03 10:57:29,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:29,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868670509] [2025-03-03 10:57:29,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868670509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:29,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:29,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:57:29,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293674085] [2025-03-03 10:57:29,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:29,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:29,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:29,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:29,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:29,734 INFO L87 Difference]: Start difference. First operand 3623 states and 3997 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 2 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:30,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:30,445 INFO L93 Difference]: Finished difference Result 8889 states and 9851 transitions. [2025-03-03 10:57:30,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:30,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 2 states have internal predecessors, (281), 0 states have call successors, (0), 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 375 [2025-03-03 10:57:30,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:30,458 INFO L225 Difference]: With dead ends: 8889 [2025-03-03 10:57:30,459 INFO L226 Difference]: Without dead ends: 5597 [2025-03-03 10:57:30,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:30,463 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 99 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:30,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 34 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:57:30,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2025-03-03 10:57:30,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 5597. [2025-03-03 10:57:30,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5597 states, 5596 states have (on average 1.0986418870621872) internal successors, (6148), 5596 states have internal predecessors, (6148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:30,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 6148 transitions. [2025-03-03 10:57:30,529 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 6148 transitions. Word has length 375 [2025-03-03 10:57:30,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:30,530 INFO L471 AbstractCegarLoop]: Abstraction has 5597 states and 6148 transitions. [2025-03-03 10:57:30,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 2 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:30,530 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 6148 transitions. [2025-03-03 10:57:30,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-03-03 10:57:30,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:30,533 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:57:30,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:57:30,533 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:30,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:30,534 INFO L85 PathProgramCache]: Analyzing trace with hash 912661473, now seen corresponding path program 1 times [2025-03-03 10:57:30,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:30,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608120524] [2025-03-03 10:57:30,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:30,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:30,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-03 10:57:30,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-03 10:57:30,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:30,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:30,784 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-03 10:57:30,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:30,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608120524] [2025-03-03 10:57:30,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608120524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:30,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:30,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:57:30,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873278375] [2025-03-03 10:57:30,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:30,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:30,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:30,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:30,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:30,786 INFO L87 Difference]: Start difference. First operand 5597 states and 6148 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:31,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:31,525 INFO L93 Difference]: Finished difference Result 14153 states and 15562 transitions. [2025-03-03 10:57:31,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:31,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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 383 [2025-03-03 10:57:31,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:31,546 INFO L225 Difference]: With dead ends: 14153 [2025-03-03 10:57:31,546 INFO L226 Difference]: Without dead ends: 9216 [2025-03-03 10:57:31,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:31,554 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 288 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:31,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 421 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:57:31,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2025-03-03 10:57:31,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 9216. [2025-03-03 10:57:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9216 states, 9215 states have (on average 1.0810634834508952) internal successors, (9962), 9215 states have internal predecessors, (9962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:31,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 9962 transitions. [2025-03-03 10:57:31,682 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 9962 transitions. Word has length 383 [2025-03-03 10:57:31,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:31,683 INFO L471 AbstractCegarLoop]: Abstraction has 9216 states and 9962 transitions. [2025-03-03 10:57:31,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:31,683 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 9962 transitions. [2025-03-03 10:57:31,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2025-03-03 10:57:31,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:31,691 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:57:31,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:57:31,692 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:31,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:31,693 INFO L85 PathProgramCache]: Analyzing trace with hash -186787607, now seen corresponding path program 1 times [2025-03-03 10:57:31,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:31,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569628009] [2025-03-03 10:57:31,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:31,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:31,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 493 statements into 1 equivalence classes. [2025-03-03 10:57:31,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 493 of 493 statements. [2025-03-03 10:57:31,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:31,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-03-03 10:57:32,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:32,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569628009] [2025-03-03 10:57:32,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569628009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:32,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:32,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:57:32,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41695311] [2025-03-03 10:57:32,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:32,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:32,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:32,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:32,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:32,100 INFO L87 Difference]: Start difference. First operand 9216 states and 9962 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:32,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:32,718 INFO L93 Difference]: Finished difference Result 17772 states and 19252 transitions. [2025-03-03 10:57:32,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:32,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 493 [2025-03-03 10:57:32,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:32,734 INFO L225 Difference]: With dead ends: 17772 [2025-03-03 10:57:32,735 INFO L226 Difference]: Without dead ends: 9216 [2025-03-03 10:57:32,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:32,743 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 255 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:32,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 419 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:57:32,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2025-03-03 10:57:32,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 8558. [2025-03-03 10:57:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8558 states, 8557 states have (on average 1.07654551828912) internal successors, (9212), 8557 states have internal predecessors, (9212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:32,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8558 states to 8558 states and 9212 transitions. [2025-03-03 10:57:32,849 INFO L78 Accepts]: Start accepts. Automaton has 8558 states and 9212 transitions. Word has length 493 [2025-03-03 10:57:32,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:32,849 INFO L471 AbstractCegarLoop]: Abstraction has 8558 states and 9212 transitions. [2025-03-03 10:57:32,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:32,851 INFO L276 IsEmpty]: Start isEmpty. Operand 8558 states and 9212 transitions. [2025-03-03 10:57:32,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2025-03-03 10:57:32,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:32,860 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:57:32,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:57:32,861 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:32,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:32,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2133803135, now seen corresponding path program 1 times [2025-03-03 10:57:32,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:32,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109184590] [2025-03-03 10:57:32,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:32,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:32,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 621 statements into 1 equivalence classes. [2025-03-03 10:57:32,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 621 of 621 statements. [2025-03-03 10:57:32,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:32,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:33,201 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 663 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-03-03 10:57:33,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:33,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109184590] [2025-03-03 10:57:33,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109184590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:33,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:33,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:57:33,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617797406] [2025-03-03 10:57:33,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:33,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:33,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:33,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:33,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:33,202 INFO L87 Difference]: Start difference. First operand 8558 states and 9212 transitions. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:33,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:33,873 INFO L93 Difference]: Finished difference Result 19417 states and 20837 transitions. [2025-03-03 10:57:33,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:33,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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 621 [2025-03-03 10:57:33,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:33,890 INFO L225 Difference]: With dead ends: 19417 [2025-03-03 10:57:33,890 INFO L226 Difference]: Without dead ends: 11519 [2025-03-03 10:57:33,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:33,898 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 219 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:33,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 429 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:57:33,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11519 states. [2025-03-03 10:57:33,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11519 to 11190. [2025-03-03 10:57:33,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11190 states, 11189 states have (on average 1.0623826972919832) internal successors, (11887), 11189 states have internal predecessors, (11887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11190 states to 11190 states and 11887 transitions. [2025-03-03 10:57:33,997 INFO L78 Accepts]: Start accepts. Automaton has 11190 states and 11887 transitions. Word has length 621 [2025-03-03 10:57:33,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:33,997 INFO L471 AbstractCegarLoop]: Abstraction has 11190 states and 11887 transitions. [2025-03-03 10:57:33,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:33,998 INFO L276 IsEmpty]: Start isEmpty. Operand 11190 states and 11887 transitions. [2025-03-03 10:57:34,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2025-03-03 10:57:34,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:34,008 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:57:34,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:57:34,008 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:34,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:34,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1862324696, now seen corresponding path program 1 times [2025-03-03 10:57:34,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:34,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419338316] [2025-03-03 10:57:34,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:34,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:34,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 684 statements into 1 equivalence classes. [2025-03-03 10:57:34,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 684 of 684 statements. [2025-03-03 10:57:34,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:34,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:34,380 INFO L134 CoverageAnalysis]: Checked inductivity of 921 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-03 10:57:34,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:34,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419338316] [2025-03-03 10:57:34,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419338316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:34,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:34,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:57:34,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744821459] [2025-03-03 10:57:34,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:34,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:34,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:34,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:34,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:34,383 INFO L87 Difference]: Start difference. First operand 11190 states and 11887 transitions. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:35,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:35,042 INFO L93 Difference]: Finished difference Result 25339 states and 27122 transitions. [2025-03-03 10:57:35,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:35,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 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 684 [2025-03-03 10:57:35,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:35,062 INFO L225 Difference]: With dead ends: 25339 [2025-03-03 10:57:35,062 INFO L226 Difference]: Without dead ends: 14480 [2025-03-03 10:57:35,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:35,072 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 171 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:35,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 432 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:57:35,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2025-03-03 10:57:35,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 13822. [2025-03-03 10:57:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13822 states, 13821 states have (on average 1.0549164315172563) internal successors, (14580), 13821 states have internal predecessors, (14580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14580 transitions. [2025-03-03 10:57:35,203 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14580 transitions. Word has length 684 [2025-03-03 10:57:35,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:35,204 INFO L471 AbstractCegarLoop]: Abstraction has 13822 states and 14580 transitions. [2025-03-03 10:57:35,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:35,204 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14580 transitions. [2025-03-03 10:57:35,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2025-03-03 10:57:35,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:35,211 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:57:35,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:57:35,212 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:35,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:35,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1867373917, now seen corresponding path program 1 times [2025-03-03 10:57:35,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:35,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523788112] [2025-03-03 10:57:35,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:35,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:35,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-03-03 10:57:35,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-03-03 10:57:35,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:35,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:35,551 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2025-03-03 10:57:35,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:35,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523788112] [2025-03-03 10:57:35,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523788112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:35,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:35,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:57:35,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336620789] [2025-03-03 10:57:35,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:35,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:35,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:35,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:35,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:35,553 INFO L87 Difference]: Start difference. First operand 13822 states and 14580 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:36,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:36,192 INFO L93 Difference]: Finished difference Result 28629 states and 30174 transitions. [2025-03-03 10:57:36,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:36,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 709 [2025-03-03 10:57:36,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:36,211 INFO L225 Difference]: With dead ends: 28629 [2025-03-03 10:57:36,211 INFO L226 Difference]: Without dead ends: 13164 [2025-03-03 10:57:36,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:36,222 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 299 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:36,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 412 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:57:36,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2025-03-03 10:57:36,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 12506. [2025-03-03 10:57:36,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12506 states, 12505 states have (on average 1.0444622151139544) internal successors, (13061), 12505 states have internal predecessors, (13061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:36,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 13061 transitions. [2025-03-03 10:57:36,332 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 13061 transitions. Word has length 709 [2025-03-03 10:57:36,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:36,333 INFO L471 AbstractCegarLoop]: Abstraction has 12506 states and 13061 transitions. [2025-03-03 10:57:36,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 13061 transitions. [2025-03-03 10:57:36,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2025-03-03 10:57:36,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:36,345 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:57:36,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:57:36,345 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:36,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:36,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1219861384, now seen corresponding path program 1 times [2025-03-03 10:57:36,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:36,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860202150] [2025-03-03 10:57:36,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:36,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:36,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 863 statements into 1 equivalence classes. [2025-03-03 10:57:36,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 863 of 863 statements. [2025-03-03 10:57:36,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:36,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:36,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1503 backedges. 747 proven. 0 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2025-03-03 10:57:36,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:36,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860202150] [2025-03-03 10:57:36,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860202150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:36,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:36,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:57:36,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152890413] [2025-03-03 10:57:36,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:36,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:36,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:36,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:36,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:36,825 INFO L87 Difference]: Start difference. First operand 12506 states and 13061 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-03 10:57:37,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:37,488 INFO L93 Difference]: Finished difference Result 24681 states and 25789 transitions. [2025-03-03 10:57:37,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:37,488 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 863 [2025-03-03 10:57:37,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:37,504 INFO L225 Difference]: With dead ends: 24681 [2025-03-03 10:57:37,505 INFO L226 Difference]: Without dead ends: 12506 [2025-03-03 10:57:37,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:37,510 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 190 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:37,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 70 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:57:37,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12506 states. [2025-03-03 10:57:37,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12506 to 12177. [2025-03-03 10:57:37,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12177 states, 12176 states have (on average 1.0280059132720105) internal successors, (12517), 12176 states have internal predecessors, (12517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:37,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12517 transitions. [2025-03-03 10:57:37,606 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12517 transitions. Word has length 863 [2025-03-03 10:57:37,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:37,606 INFO L471 AbstractCegarLoop]: Abstraction has 12177 states and 12517 transitions. [2025-03-03 10:57:37,606 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-03 10:57:37,606 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12517 transitions. [2025-03-03 10:57:37,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1464 [2025-03-03 10:57:37,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:37,624 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:57:37,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:57:37,624 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:37,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:37,625 INFO L85 PathProgramCache]: Analyzing trace with hash -481426667, now seen corresponding path program 1 times [2025-03-03 10:57:37,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:37,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571669989] [2025-03-03 10:57:37,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:37,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:37,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1463 statements into 1 equivalence classes. [2025-03-03 10:57:37,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1463 of 1463 statements. [2025-03-03 10:57:37,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:37,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:38,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3692 backedges. 2655 proven. 0 refuted. 0 times theorem prover too weak. 1037 trivial. 0 not checked. [2025-03-03 10:57:38,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:38,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571669989] [2025-03-03 10:57:38,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571669989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:38,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:38,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:57:38,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385534238] [2025-03-03 10:57:38,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:38,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:38,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:38,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:38,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:38,661 INFO L87 Difference]: Start difference. First operand 12177 states and 12517 transitions. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:39,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:39,275 INFO L93 Difference]: Finished difference Result 24023 states and 24701 transitions. [2025-03-03 10:57:39,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:39,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 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 1463 [2025-03-03 10:57:39,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:39,292 INFO L225 Difference]: With dead ends: 24023 [2025-03-03 10:57:39,293 INFO L226 Difference]: Without dead ends: 12177 [2025-03-03 10:57:39,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:39,301 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 62 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:39,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 426 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:57:39,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12177 states. [2025-03-03 10:57:39,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12177 to 12177. [2025-03-03 10:57:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12177 states, 12176 states have (on average 1.0276773981603153) internal successors, (12513), 12176 states have internal predecessors, (12513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:39,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12513 transitions. [2025-03-03 10:57:39,440 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12513 transitions. Word has length 1463 [2025-03-03 10:57:39,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:39,441 INFO L471 AbstractCegarLoop]: Abstraction has 12177 states and 12513 transitions. [2025-03-03 10:57:39,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:39,442 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12513 transitions. [2025-03-03 10:57:39,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1522 [2025-03-03 10:57:39,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:39,473 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:57:39,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:57:39,473 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:39,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:39,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1035026269, now seen corresponding path program 1 times [2025-03-03 10:57:39,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:39,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323265580] [2025-03-03 10:57:39,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:39,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:39,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1521 statements into 1 equivalence classes. [2025-03-03 10:57:39,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1521 of 1521 statements. [2025-03-03 10:57:39,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:39,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:40,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4040 backedges. 2694 proven. 0 refuted. 0 times theorem prover too weak. 1346 trivial. 0 not checked. [2025-03-03 10:57:40,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:40,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323265580] [2025-03-03 10:57:40,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323265580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:40,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:40,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:57:40,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155270043] [2025-03-03 10:57:40,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:40,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:40,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:40,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:40,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:40,119 INFO L87 Difference]: Start difference. First operand 12177 states and 12513 transitions. Second operand has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:40,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:40,718 INFO L93 Difference]: Finished difference Result 26655 states and 27413 transitions. [2025-03-03 10:57:40,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:40,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1521 [2025-03-03 10:57:40,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:40,737 INFO L225 Difference]: With dead ends: 26655 [2025-03-03 10:57:40,737 INFO L226 Difference]: Without dead ends: 14809 [2025-03-03 10:57:40,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:40,746 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 192 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:40,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 426 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:57:40,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14809 states. [2025-03-03 10:57:40,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14809 to 14480. [2025-03-03 10:57:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14480 states, 14479 states have (on average 1.0261758408729884) internal successors, (14858), 14479 states have internal predecessors, (14858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 14858 transitions. [2025-03-03 10:57:40,888 INFO L78 Accepts]: Start accepts. Automaton has 14480 states and 14858 transitions. Word has length 1521 [2025-03-03 10:57:40,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:40,888 INFO L471 AbstractCegarLoop]: Abstraction has 14480 states and 14858 transitions. [2025-03-03 10:57:40,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 14480 states and 14858 transitions. [2025-03-03 10:57:40,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1547 [2025-03-03 10:57:40,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:40,906 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:57:40,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:57:40,906 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:40,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:40,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1906661362, now seen corresponding path program 1 times [2025-03-03 10:57:40,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:40,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146794695] [2025-03-03 10:57:40,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:40,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:40,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1546 statements into 1 equivalence classes. [2025-03-03 10:57:41,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1546 of 1546 statements. [2025-03-03 10:57:41,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:41,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:42,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4215 backedges. 2623 proven. 0 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2025-03-03 10:57:42,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:42,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146794695] [2025-03-03 10:57:42,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146794695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:42,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:42,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:57:42,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132471653] [2025-03-03 10:57:42,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:42,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:42,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:42,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:42,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:42,107 INFO L87 Difference]: Start difference. First operand 14480 states and 14858 transitions. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:42,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:42,702 INFO L93 Difference]: Finished difference Result 29287 states and 30058 transitions. [2025-03-03 10:57:42,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:42,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 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 1546 [2025-03-03 10:57:42,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:42,723 INFO L225 Difference]: With dead ends: 29287 [2025-03-03 10:57:42,723 INFO L226 Difference]: Without dead ends: 15138 [2025-03-03 10:57:42,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:42,734 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:42,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 430 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:57:42,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15138 states. [2025-03-03 10:57:42,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15138 to 15138. [2025-03-03 10:57:42,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15138 states, 15137 states have (on average 1.0251040496795931) internal successors, (15517), 15137 states have internal predecessors, (15517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15138 states to 15138 states and 15517 transitions. [2025-03-03 10:57:42,900 INFO L78 Accepts]: Start accepts. Automaton has 15138 states and 15517 transitions. Word has length 1546 [2025-03-03 10:57:42,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:42,901 INFO L471 AbstractCegarLoop]: Abstraction has 15138 states and 15517 transitions. [2025-03-03 10:57:42,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:42,901 INFO L276 IsEmpty]: Start isEmpty. Operand 15138 states and 15517 transitions. [2025-03-03 10:57:42,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1601 [2025-03-03 10:57:42,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:42,936 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:57:42,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:57:42,936 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:42,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:42,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1914452731, now seen corresponding path program 1 times [2025-03-03 10:57:42,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:42,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825875115] [2025-03-03 10:57:42,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:42,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:43,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1600 statements into 1 equivalence classes. [2025-03-03 10:57:43,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1600 of 1600 statements. [2025-03-03 10:57:43,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:43,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:43,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 1520 proven. 0 refuted. 0 times theorem prover too weak. 2770 trivial. 0 not checked. [2025-03-03 10:57:43,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:43,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825875115] [2025-03-03 10:57:43,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825875115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:43,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:43,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:57:43,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897767510] [2025-03-03 10:57:43,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:43,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:43,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:43,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:43,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:43,748 INFO L87 Difference]: Start difference. First operand 15138 states and 15517 transitions. Second operand has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:44,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:44,339 INFO L93 Difference]: Finished difference Result 30930 states and 31702 transitions. [2025-03-03 10:57:44,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:44,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 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 1600 [2025-03-03 10:57:44,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:44,340 INFO L225 Difference]: With dead ends: 30930 [2025-03-03 10:57:44,340 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:57:44,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:44,352 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 6 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:44,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 413 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:57:44,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:57:44,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:57:44,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:44,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:57:44,352 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1600 [2025-03-03 10:57:44,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:44,353 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:57:44,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:44,353 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:57:44,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:57:44,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:57:44,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:57:44,358 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:57:44,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:57:44,875 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:57:44,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:57:44 BoogieIcfgContainer [2025-03-03 10:57:44,894 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:57:44,894 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:57:44,894 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:57:44,895 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:57:44,895 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:57:22" (3/4) ... [2025-03-03 10:57:44,896 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:57:44,920 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-03 10:57:44,921 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:57:44,923 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:57:44,924 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:57:45,066 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:57:45,067 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:57:45,067 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:57:45,067 INFO L158 Benchmark]: Toolchain (without parser) took 25646.65ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 107.5MB in the beginning and 631.2MB in the end (delta: -523.7MB). Peak memory consumption was 760.4MB. Max. memory is 16.1GB. [2025-03-03 10:57:45,068 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:57:45,068 INFO L158 Benchmark]: CACSL2BoogieTranslator took 593.74ms. Allocated memory is still 142.6MB. Free memory was 107.5MB in the beginning and 49.7MB in the end (delta: 57.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-03 10:57:45,068 INFO L158 Benchmark]: Boogie Procedure Inliner took 122.52ms. Allocated memory is still 142.6MB. Free memory was 49.7MB in the beginning and 90.4MB in the end (delta: -40.7MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2025-03-03 10:57:45,068 INFO L158 Benchmark]: Boogie Preprocessor took 129.24ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 57.9MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 10:57:45,068 INFO L158 Benchmark]: IcfgBuilder took 1756.87ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 57.9MB in the beginning and 64.8MB in the end (delta: -6.9MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. [2025-03-03 10:57:45,069 INFO L158 Benchmark]: TraceAbstraction took 22866.55ms. Allocated memory was 192.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 64.8MB in the beginning and 656.4MB in the end (delta: -591.6MB). Peak memory consumption was 645.7MB. Max. memory is 16.1GB. [2025-03-03 10:57:45,069 INFO L158 Benchmark]: Witness Printer took 172.28ms. Allocated memory is still 1.4GB. Free memory was 656.4MB in the beginning and 631.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 10:57:45,070 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.19ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 593.74ms. Allocated memory is still 142.6MB. Free memory was 107.5MB in the beginning and 49.7MB in the end (delta: 57.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 122.52ms. Allocated memory is still 142.6MB. Free memory was 49.7MB in the beginning and 90.4MB in the end (delta: -40.7MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 129.24ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 57.9MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * IcfgBuilder took 1756.87ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 57.9MB in the beginning and 64.8MB in the end (delta: -6.9MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. * TraceAbstraction took 22866.55ms. Allocated memory was 192.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 64.8MB in the beginning and 656.4MB in the end (delta: -591.6MB). Peak memory consumption was 645.7MB. Max. memory is 16.1GB. * Witness Printer took 172.28ms. Allocated memory is still 1.4GB. Free memory was 656.4MB in the beginning and 631.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 149]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 396 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.3s, OverallIterations: 16, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4381 SdHoareTripleChecker+Valid, 12.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4381 mSDsluCounter, 4785 SdHoareTripleChecker+Invalid, 9.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 2251 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13472 IncrementalHoareTripleChecker+Invalid, 15723 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2251 mSolverCounterUnsat, 4693 mSDtfsCounter, 13472 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15138occurred in iteration=15, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 3619 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 10886 NumberOfCodeBlocks, 10886 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 10870 ConstructedInterpolants, 0 QuantifiedInterpolants, 18404 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 21487/21487 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1783]: Location Invariant Derived location invariant: ((((((((((((((((((((((((a16 == 10) && (a12 == 6)) || (((a15 <= 3) && (a12 == 6)) && (a16 == 12))) || ((((a15 <= 3) && (a12 == 8)) && (((long long) a18 + 156) <= 0)) && (a16 <= 11))) || ((a16 == 9) && (a12 == 6))) || (((a15 <= 3) && (a16 == 12)) && (5 == a12))) || ((a16 <= 8) && (a12 == 9))) || (((a15 <= 3) && (a16 <= 11)) && (7 == a12))) || ((a16 == 8) && (5 == a12))) || ((((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (5 == a12)) && (a16 <= 11))) || (((a15 <= 3) && (a12 == 6)) && (a16 <= 11))) || ((a16 == 9) && (a15 <= 3))) || (((a16 <= 8) && (a12 == 8)) && (((long long) a18 + 156) <= 0))) || ((a16 <= 8) && (a12 == 6))) || (((a12 == 9) && (a15 <= 3)) && (a16 <= 11))) || ((a16 == 10) && (5 == a12))) || ((((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (7 <= a12)) && (a16 <= 11))) || ((a16 == 9) && (5 == a12))) || (((a15 <= 3) && (a16 == 12)) && (7 <= a12))) || (((a16 <= 8) && (0 <= ((long long) 87 + a18))) && (7 <= a12))) || (((a16 == 10) && (a15 <= 3)) && (7 <= a12))) || ((a16 == 9) && (7 <= a12))) || ((a16 <= 8) && (a15 <= 3))) || ((a16 <= 8) && (7 == a12))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:57:45,087 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