./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label23.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_label23.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 8d85db598b116be798c82f2dd8d1706b14592e07af324ce511eec8d5748ab1b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:54:40,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:54:40,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:54:40,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:54:40,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:54:40,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:54:40,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:54:40,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:54:40,205 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:54:40,205 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:54:40,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:54:40,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:54:40,206 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:54:40,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:54:40,207 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:54:40,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:54:40,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:54:40,207 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:54:40,207 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:54:40,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:54:40,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:54:40,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:54:40,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:54:40,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:54:40,207 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:54:40,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:54:40,207 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:54:40,207 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:54:40,207 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:54:40,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:54:40,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:54:40,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:54:40,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:54:40,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:54:40,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:54:40,208 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:54:40,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:54:40,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:54:40,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:54:40,209 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:54:40,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:54:40,209 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:54:40,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:54:40,209 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 -> 8d85db598b116be798c82f2dd8d1706b14592e07af324ce511eec8d5748ab1b3 [2025-03-03 10:54:40,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:54:40,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:54:40,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:54:40,457 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:54:40,457 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:54:40,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label23.c [2025-03-03 10:54:41,675 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f4af28a/59ae7bef9f914602b1250bbe204b5501/FLAGff41c0aa6 [2025-03-03 10:54:42,046 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:54:42,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label23.c [2025-03-03 10:54:42,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f4af28a/59ae7bef9f914602b1250bbe204b5501/FLAGff41c0aa6 [2025-03-03 10:54:42,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f4af28a/59ae7bef9f914602b1250bbe204b5501 [2025-03-03 10:54:42,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:54:42,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:54:42,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:54:42,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:54:42,093 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:54:42,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:54:42" (1/1) ... [2025-03-03 10:54:42,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@329ee5fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:42, skipping insertion in model container [2025-03-03 10:54:42,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:54:42" (1/1) ... [2025-03-03 10:54:42,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:54:42,269 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_label23.c[3431,3444] [2025-03-03 10:54:42,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:54:42,496 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:54:42,509 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_label23.c[3431,3444] [2025-03-03 10:54:42,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:54:42,632 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:54:42,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:42 WrapperNode [2025-03-03 10:54:42,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:54:42,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:54:42,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:54:42,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:54:42,639 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:54:42" (1/1) ... [2025-03-03 10:54:42,655 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:54:42" (1/1) ... [2025-03-03 10:54:42,777 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-03 10:54:42,778 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:54:42,778 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:54:42,778 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:54:42,779 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:54:42,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:42" (1/1) ... [2025-03-03 10:54:42,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:42" (1/1) ... [2025-03-03 10:54:42,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:42" (1/1) ... [2025-03-03 10:54:42,856 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:54:42,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:42" (1/1) ... [2025-03-03 10:54:42,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:42" (1/1) ... [2025-03-03 10:54:42,897 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:42" (1/1) ... [2025-03-03 10:54:42,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:42" (1/1) ... [2025-03-03 10:54:42,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:42" (1/1) ... [2025-03-03 10:54:42,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:42" (1/1) ... [2025-03-03 10:54:42,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:54:42,934 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:54:42,934 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:54:42,934 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:54:42,935 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:42" (1/1) ... [2025-03-03 10:54:42,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:54:42,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:54:42,962 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:54:42,968 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:54:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:54:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:54:42,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:54:42,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:54:43,026 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:54:43,028 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:54:44,679 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-03 10:54:44,744 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-03 10:54:44,744 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:54:44,761 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:54:44,762 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:54:44,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:54:44 BoogieIcfgContainer [2025-03-03 10:54:44,762 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:54:44,766 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:54:44,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:54:44,769 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:54:44,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:54:42" (1/3) ... [2025-03-03 10:54:44,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b43bc69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:54:44, skipping insertion in model container [2025-03-03 10:54:44,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:42" (2/3) ... [2025-03-03 10:54:44,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b43bc69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:54:44, skipping insertion in model container [2025-03-03 10:54:44,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:54:44" (3/3) ... [2025-03-03 10:54:44,772 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label23.c [2025-03-03 10:54:44,784 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:54:44,785 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label23.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:54:44,845 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:54:44,855 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;@254e176a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:54:44,855 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:54:44,860 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:54:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 10:54:44,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:44,866 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] [2025-03-03 10:54:44,866 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:44,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:44,870 INFO L85 PathProgramCache]: Analyzing trace with hash 2034105045, now seen corresponding path program 1 times [2025-03-03 10:54:44,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:44,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585645642] [2025-03-03 10:54:44,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:44,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:44,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-03 10:54:44,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 10:54:44,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:44,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:45,123 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:54:45,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:45,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585645642] [2025-03-03 10:54:45,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585645642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:45,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:45,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:54:45,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468509174] [2025-03-03 10:54:45,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:45,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:45,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:45,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:45,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:45,148 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 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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:54:46,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:46,447 INFO L93 Difference]: Finished difference Result 1137 states and 2115 transitions. [2025-03-03 10:54:46,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:46,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2025-03-03 10:54:46,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:46,462 INFO L225 Difference]: With dead ends: 1137 [2025-03-03 10:54:46,462 INFO L226 Difference]: Without dead ends: 662 [2025-03-03 10:54:46,465 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:54:46,467 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 355 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 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:54:46,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 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:54:46,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-03 10:54:46,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-03-03 10:54:46,526 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:54:46,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1166 transitions. [2025-03-03 10:54:46,532 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1166 transitions. Word has length 31 [2025-03-03 10:54:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:46,533 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1166 transitions. [2025-03-03 10:54:46,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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:54:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1166 transitions. [2025-03-03 10:54:46,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 10:54:46,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:46,537 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:46,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:54:46,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:46,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:46,538 INFO L85 PathProgramCache]: Analyzing trace with hash -2128463485, now seen corresponding path program 1 times [2025-03-03 10:54:46,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:46,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274319982] [2025-03-03 10:54:46,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:46,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:46,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 10:54:46,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 10:54:46,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:46,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:54:46,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:46,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274319982] [2025-03-03 10:54:46,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274319982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:46,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:46,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:54:46,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341314006] [2025-03-03 10:54:46,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:46,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:46,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:46,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:46,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:46,741 INFO L87 Difference]: Start difference. First operand 662 states and 1166 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:47,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:47,862 INFO L93 Difference]: Finished difference Result 1980 states and 3493 transitions. [2025-03-03 10:54:47,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:47,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-03 10:54:47,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:47,868 INFO L225 Difference]: With dead ends: 1980 [2025-03-03 10:54:47,869 INFO L226 Difference]: Without dead ends: 1320 [2025-03-03 10:54:47,870 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:54:47,871 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 344 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:47,871 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.1s Time] [2025-03-03 10:54:47,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-03-03 10:54:47,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2025-03-03 10:54:47,908 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:54:47,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 2197 transitions. [2025-03-03 10:54:47,915 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 2197 transitions. Word has length 96 [2025-03-03 10:54:47,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:47,915 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 2197 transitions. [2025-03-03 10:54:47,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:47,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 2197 transitions. [2025-03-03 10:54:47,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 10:54:47,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:47,919 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:47,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:54:47,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:47,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:47,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1532150408, now seen corresponding path program 1 times [2025-03-03 10:54:47,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:47,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747337199] [2025-03-03 10:54:47,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:47,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:47,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 10:54:47,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 10:54:47,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:47,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:48,168 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:54:48,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:48,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747337199] [2025-03-03 10:54:48,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747337199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:48,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:48,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:54:48,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045661692] [2025-03-03 10:54:48,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:48,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:54:48,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:48,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:54:48,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:54:48,171 INFO L87 Difference]: Start difference. First operand 1320 states and 2197 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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:54:49,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:49,957 INFO L93 Difference]: Finished difference Result 3625 states and 5926 transitions. [2025-03-03 10:54:49,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:54:49,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-03-03 10:54:49,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:49,966 INFO L225 Difference]: With dead ends: 3625 [2025-03-03 10:54:49,967 INFO L226 Difference]: Without dead ends: 2307 [2025-03-03 10:54:49,968 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:54:49,969 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1005 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:49,969 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.7s Time] [2025-03-03 10:54:49,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-03-03 10:54:50,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-03-03 10:54:50,009 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:54:50,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3467 transitions. [2025-03-03 10:54:50,016 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3467 transitions. Word has length 99 [2025-03-03 10:54:50,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:50,016 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3467 transitions. [2025-03-03 10:54:50,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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:54:50,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3467 transitions. [2025-03-03 10:54:50,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 10:54:50,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:50,018 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:50,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:54:50,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:50,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:50,020 INFO L85 PathProgramCache]: Analyzing trace with hash 2094190426, now seen corresponding path program 1 times [2025-03-03 10:54:50,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:50,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100100073] [2025-03-03 10:54:50,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:50,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:50,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 10:54:50,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 10:54:50,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:50,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:50,175 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 10:54:50,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:50,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100100073] [2025-03-03 10:54:50,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100100073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:50,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:50,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:54:50,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101117238] [2025-03-03 10:54:50,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:50,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:50,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:50,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:50,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:50,177 INFO L87 Difference]: Start difference. First operand 2307 states and 3467 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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:54:51,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:51,185 INFO L93 Difference]: Finished difference Result 6257 states and 9726 transitions. [2025-03-03 10:54:51,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:51,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-03-03 10:54:51,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:51,197 INFO L225 Difference]: With dead ends: 6257 [2025-03-03 10:54:51,197 INFO L226 Difference]: Without dead ends: 4281 [2025-03-03 10:54:51,200 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:54:51,201 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 270 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:51,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 211 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:54:51,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2025-03-03 10:54:51,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 4281. [2025-03-03 10:54:51,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4281 states, 4280 states have (on average 1.3539719626168225) internal successors, (5795), 4280 states have internal predecessors, (5795), 0 states have call successors, (0), 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:54:51,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 5795 transitions. [2025-03-03 10:54:51,263 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 5795 transitions. Word has length 118 [2025-03-03 10:54:51,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:51,263 INFO L471 AbstractCegarLoop]: Abstraction has 4281 states and 5795 transitions. [2025-03-03 10:54:51,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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:54:51,264 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 5795 transitions. [2025-03-03 10:54:51,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-03 10:54:51,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:51,267 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:54:51,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:54:51,267 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:51,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:51,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1715714989, now seen corresponding path program 1 times [2025-03-03 10:54:51,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:51,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340968542] [2025-03-03 10:54:51,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:51,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:51,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 10:54:51,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 10:54:51,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:51,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:51,466 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:54:51,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:51,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340968542] [2025-03-03 10:54:51,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340968542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:51,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:51,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:54:51,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072596788] [2025-03-03 10:54:51,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:51,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:51,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:51,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:51,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:51,469 INFO L87 Difference]: Start difference. First operand 4281 states and 5795 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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:54:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:52,459 INFO L93 Difference]: Finished difference Result 9547 states and 12996 transitions. [2025-03-03 10:54:52,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:52,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 214 [2025-03-03 10:54:52,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:52,474 INFO L225 Difference]: With dead ends: 9547 [2025-03-03 10:54:52,474 INFO L226 Difference]: Without dead ends: 5597 [2025-03-03 10:54:52,480 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:54:52,481 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 280 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 546 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:54:52,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 546 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:54:52,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2025-03-03 10:54:52,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 5597. [2025-03-03 10:54:52,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5597 states, 5596 states have (on average 1.2975339528234453) internal successors, (7261), 5596 states have internal predecessors, (7261), 0 states have call successors, (0), 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:54:52,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 7261 transitions. [2025-03-03 10:54:52,557 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 7261 transitions. Word has length 214 [2025-03-03 10:54:52,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:52,558 INFO L471 AbstractCegarLoop]: Abstraction has 5597 states and 7261 transitions. [2025-03-03 10:54:52,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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:54:52,559 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 7261 transitions. [2025-03-03 10:54:52,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-03 10:54:52,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:52,564 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:54:52,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:54:52,564 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:52,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:52,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1703720111, now seen corresponding path program 1 times [2025-03-03 10:54:52,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:52,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151549802] [2025-03-03 10:54:52,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:52,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:52,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-03 10:54:52,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-03 10:54:52,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:52,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:52,795 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-03 10:54:52,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:52,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151549802] [2025-03-03 10:54:52,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151549802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:52,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:52,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:54:52,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101773776] [2025-03-03 10:54:52,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:52,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:52,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:52,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:52,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:52,799 INFO L87 Difference]: Start difference. First operand 5597 states and 7261 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 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:54:53,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:53,826 INFO L93 Difference]: Finished difference Result 14153 states and 18437 transitions. [2025-03-03 10:54:53,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:53,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 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 298 [2025-03-03 10:54:53,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:53,844 INFO L225 Difference]: With dead ends: 14153 [2025-03-03 10:54:53,845 INFO L226 Difference]: Without dead ends: 7571 [2025-03-03 10:54:53,849 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:54:53,850 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 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, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:53,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:54:53,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2025-03-03 10:54:53,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 6584. [2025-03-03 10:54:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6584 states, 6583 states have (on average 1.0742822421388425) internal successors, (7072), 6583 states have internal predecessors, (7072), 0 states have call successors, (0), 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:54:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6584 states to 6584 states and 7072 transitions. [2025-03-03 10:54:53,939 INFO L78 Accepts]: Start accepts. Automaton has 6584 states and 7072 transitions. Word has length 298 [2025-03-03 10:54:53,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:53,939 INFO L471 AbstractCegarLoop]: Abstraction has 6584 states and 7072 transitions. [2025-03-03 10:54:53,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 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:54:53,939 INFO L276 IsEmpty]: Start isEmpty. Operand 6584 states and 7072 transitions. [2025-03-03 10:54:53,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-03-03 10:54:53,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:53,942 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:54:53,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:54:53,943 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:53,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:53,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1702933883, now seen corresponding path program 1 times [2025-03-03 10:54:53,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:53,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623005147] [2025-03-03 10:54:53,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:53,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:53,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-03 10:54:53,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-03 10:54:53,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:53,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:54,300 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-03 10:54:54,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:54,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623005147] [2025-03-03 10:54:54,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623005147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:54,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:54,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:54:54,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140126124] [2025-03-03 10:54:54,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:54,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:54,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:54,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:54,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:54,303 INFO L87 Difference]: Start difference. First operand 6584 states and 7072 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 2 states have internal predecessors, (268), 0 states have call successors, (0), 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:54:55,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:55,098 INFO L93 Difference]: Finished difference Result 15798 states and 17037 transitions. [2025-03-03 10:54:55,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:55,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 2 states have internal predecessors, (268), 0 states have call successors, (0), 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 362 [2025-03-03 10:54:55,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:55,119 INFO L225 Difference]: With dead ends: 15798 [2025-03-03 10:54:55,119 INFO L226 Difference]: Without dead ends: 9545 [2025-03-03 10:54:55,125 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:54:55,126 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 99 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:55,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 43 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:54:55,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9545 states. [2025-03-03 10:54:55,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9545 to 9545. [2025-03-03 10:54:55,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9545 states, 9544 states have (on average 1.073658843252305) internal successors, (10247), 9544 states have internal predecessors, (10247), 0 states have call successors, (0), 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:54:55,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9545 states to 9545 states and 10247 transitions. [2025-03-03 10:54:55,225 INFO L78 Accepts]: Start accepts. Automaton has 9545 states and 10247 transitions. Word has length 362 [2025-03-03 10:54:55,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:55,225 INFO L471 AbstractCegarLoop]: Abstraction has 9545 states and 10247 transitions. [2025-03-03 10:54:55,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 2 states have internal predecessors, (268), 0 states have call successors, (0), 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:54:55,226 INFO L276 IsEmpty]: Start isEmpty. Operand 9545 states and 10247 transitions. [2025-03-03 10:54:55,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-03-03 10:54:55,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:55,229 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:54:55,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:54:55,230 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:55,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:55,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1784309273, now seen corresponding path program 1 times [2025-03-03 10:54:55,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:55,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082847337] [2025-03-03 10:54:55,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:55,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:55,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-03-03 10:54:55,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-03-03 10:54:55,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:55,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:55,480 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-03 10:54:55,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:55,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082847337] [2025-03-03 10:54:55,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082847337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:55,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:55,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:54:55,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988066984] [2025-03-03 10:54:55,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:55,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:55,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:55,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:55,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:55,483 INFO L87 Difference]: Start difference. First operand 9545 states and 10247 transitions. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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:54:56,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:56,190 INFO L93 Difference]: Finished difference Result 21391 states and 23041 transitions. [2025-03-03 10:54:56,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:56,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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 370 [2025-03-03 10:54:56,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:56,214 INFO L225 Difference]: With dead ends: 21391 [2025-03-03 10:54:56,214 INFO L226 Difference]: Without dead ends: 12506 [2025-03-03 10:54:56,222 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:54:56,223 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 301 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:56,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 420 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:54:56,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12506 states. [2025-03-03 10:54:56,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12506 to 12506. [2025-03-03 10:54:56,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12506 states, 12505 states have (on average 1.0669332267093163) internal successors, (13342), 12505 states have internal predecessors, (13342), 0 states have call successors, (0), 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:54:56,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 13342 transitions. [2025-03-03 10:54:56,351 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 13342 transitions. Word has length 370 [2025-03-03 10:54:56,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:56,351 INFO L471 AbstractCegarLoop]: Abstraction has 12506 states and 13342 transitions. [2025-03-03 10:54:56,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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:54:56,352 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 13342 transitions. [2025-03-03 10:54:56,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 716 [2025-03-03 10:54:56,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:56,371 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:54:56,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:54:56,371 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:56,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:56,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1600761231, now seen corresponding path program 1 times [2025-03-03 10:54:56,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:56,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131219097] [2025-03-03 10:54:56,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:56,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:56,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 715 statements into 1 equivalence classes. [2025-03-03 10:54:56,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 715 of 715 statements. [2025-03-03 10:54:56,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:56,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:57,160 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 717 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-03 10:54:57,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:57,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131219097] [2025-03-03 10:54:57,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131219097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:57,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:57,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:54:57,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608357685] [2025-03-03 10:54:57,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:57,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:54:57,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:57,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:54:57,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:54:57,166 INFO L87 Difference]: Start difference. First operand 12506 states and 13342 transitions. Second operand has 4 states, 4 states have (on average 149.75) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 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:54:58,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:58,290 INFO L93 Difference]: Finished difference Result 24681 states and 26351 transitions. [2025-03-03 10:54:58,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:54:58,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 149.75) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 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 715 [2025-03-03 10:54:58,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:58,306 INFO L225 Difference]: With dead ends: 24681 [2025-03-03 10:54:58,306 INFO L226 Difference]: Without dead ends: 12506 [2025-03-03 10:54:58,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:54:58,315 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 301 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:58,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 115 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:54:58,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12506 states. [2025-03-03 10:54:58,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12506 to 12506. [2025-03-03 10:54:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12506 states, 12505 states have (on average 1.0662934826069572) internal successors, (13334), 12505 states have internal predecessors, (13334), 0 states have call successors, (0), 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:54:58,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 13334 transitions. [2025-03-03 10:54:58,446 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 13334 transitions. Word has length 715 [2025-03-03 10:54:58,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:58,447 INFO L471 AbstractCegarLoop]: Abstraction has 12506 states and 13334 transitions. [2025-03-03 10:54:58,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 149.75) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 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:54:58,447 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 13334 transitions. [2025-03-03 10:54:58,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2025-03-03 10:54:58,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:58,500 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:54:58,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:54:58,500 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:58,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:58,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1402822306, now seen corresponding path program 1 times [2025-03-03 10:54:58,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:58,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902051237] [2025-03-03 10:54:58,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:58,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:58,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 819 statements into 1 equivalence classes. [2025-03-03 10:54:58,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 819 of 819 statements. [2025-03-03 10:54:58,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:58,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-03 10:54:59,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:59,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902051237] [2025-03-03 10:54:59,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902051237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:59,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:59,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:54:59,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732403289] [2025-03-03 10:54:59,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:59,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:59,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:59,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:59,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:59,019 INFO L87 Difference]: Start difference. First operand 12506 states and 13334 transitions. Second operand has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 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:54:59,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:59,662 INFO L93 Difference]: Finished difference Result 27642 states and 29452 transitions. [2025-03-03 10:54:59,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:59,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 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 819 [2025-03-03 10:54:59,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:59,686 INFO L225 Difference]: With dead ends: 27642 [2025-03-03 10:54:59,686 INFO L226 Difference]: Without dead ends: 15796 [2025-03-03 10:54:59,691 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:54:59,692 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 223 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:59,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 36 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:54:59,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15796 states. [2025-03-03 10:54:59,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15796 to 15138. [2025-03-03 10:54:59,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15138 states, 15137 states have (on average 1.0519918081522097) internal successors, (15924), 15137 states have internal predecessors, (15924), 0 states have call successors, (0), 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:54:59,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15138 states to 15138 states and 15924 transitions. [2025-03-03 10:54:59,812 INFO L78 Accepts]: Start accepts. Automaton has 15138 states and 15924 transitions. Word has length 819 [2025-03-03 10:54:59,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:59,813 INFO L471 AbstractCegarLoop]: Abstraction has 15138 states and 15924 transitions. [2025-03-03 10:54:59,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 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:54:59,813 INFO L276 IsEmpty]: Start isEmpty. Operand 15138 states and 15924 transitions. [2025-03-03 10:54:59,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2025-03-03 10:54:59,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:59,824 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:59,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:54:59,824 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:59,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:59,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1376349913, now seen corresponding path program 1 times [2025-03-03 10:54:59,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:59,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255986448] [2025-03-03 10:54:59,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:59,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:59,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 843 statements into 1 equivalence classes. [2025-03-03 10:54:59,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 843 of 843 statements. [2025-03-03 10:54:59,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:59,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:00,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 761 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2025-03-03 10:55:00,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:00,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255986448] [2025-03-03 10:55:00,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255986448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:00,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:00,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:00,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8605197] [2025-03-03 10:55:00,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:00,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:00,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:00,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:00,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:00,330 INFO L87 Difference]: Start difference. First operand 15138 states and 15924 transitions. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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:55:00,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:00,914 INFO L93 Difference]: Finished difference Result 29616 states and 31184 transitions. [2025-03-03 10:55:00,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:00,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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 843 [2025-03-03 10:55:00,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:00,930 INFO L225 Difference]: With dead ends: 29616 [2025-03-03 10:55:00,930 INFO L226 Difference]: Without dead ends: 15138 [2025-03-03 10:55:00,942 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:55:00,943 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 109 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:00,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 419 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:55:00,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15138 states. [2025-03-03 10:55:01,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15138 to 14480. [2025-03-03 10:55:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14480 states, 14479 states have (on average 1.049727191104358) internal successors, (15199), 14479 states have internal predecessors, (15199), 0 states have call successors, (0), 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:55:01,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 15199 transitions. [2025-03-03 10:55:01,132 INFO L78 Accepts]: Start accepts. Automaton has 14480 states and 15199 transitions. Word has length 843 [2025-03-03 10:55:01,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:01,133 INFO L471 AbstractCegarLoop]: Abstraction has 14480 states and 15199 transitions. [2025-03-03 10:55:01,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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:55:01,134 INFO L276 IsEmpty]: Start isEmpty. Operand 14480 states and 15199 transitions. [2025-03-03 10:55:01,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 965 [2025-03-03 10:55:01,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:01,146 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:55:01,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:55:01,146 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:01,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:01,147 INFO L85 PathProgramCache]: Analyzing trace with hash -583376599, now seen corresponding path program 1 times [2025-03-03 10:55:01,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:01,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177891141] [2025-03-03 10:55:01,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:01,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:01,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 964 statements into 1 equivalence classes. [2025-03-03 10:55:01,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 964 of 964 statements. [2025-03-03 10:55:01,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:01,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:01,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1464 backedges. 1064 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-03-03 10:55:01,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:01,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177891141] [2025-03-03 10:55:01,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177891141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:01,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:01,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:01,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638606078] [2025-03-03 10:55:01,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:01,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:01,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:01,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:01,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:01,601 INFO L87 Difference]: Start difference. First operand 14480 states and 15199 transitions. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 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:55:02,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:02,183 INFO L93 Difference]: Finished difference Result 30932 states and 32488 transitions. [2025-03-03 10:55:02,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:02,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 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 964 [2025-03-03 10:55:02,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:02,202 INFO L225 Difference]: With dead ends: 30932 [2025-03-03 10:55:02,202 INFO L226 Difference]: Without dead ends: 17112 [2025-03-03 10:55:02,212 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:55:02,212 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:02,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 430 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:55:02,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states. [2025-03-03 10:55:02,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 16783. [2025-03-03 10:55:02,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16783 states, 16782 states have (on average 1.0436777499702061) internal successors, (17515), 16782 states have internal predecessors, (17515), 0 states have call successors, (0), 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:55:02,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16783 states to 16783 states and 17515 transitions. [2025-03-03 10:55:02,427 INFO L78 Accepts]: Start accepts. Automaton has 16783 states and 17515 transitions. Word has length 964 [2025-03-03 10:55:02,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:02,428 INFO L471 AbstractCegarLoop]: Abstraction has 16783 states and 17515 transitions. [2025-03-03 10:55:02,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 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:55:02,428 INFO L276 IsEmpty]: Start isEmpty. Operand 16783 states and 17515 transitions. [2025-03-03 10:55:02,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 966 [2025-03-03 10:55:02,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:02,441 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:55:02,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:55:02,441 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:02,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:02,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1444055213, now seen corresponding path program 1 times [2025-03-03 10:55:02,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:02,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252490977] [2025-03-03 10:55:02,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:02,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:02,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 965 statements into 1 equivalence classes. [2025-03-03 10:55:02,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 965 of 965 statements. [2025-03-03 10:55:02,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:02,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:02,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 779 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2025-03-03 10:55:02,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:02,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252490977] [2025-03-03 10:55:02,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252490977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:02,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:02,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:02,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042855751] [2025-03-03 10:55:02,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:02,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:02,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:02,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:02,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:02,878 INFO L87 Difference]: Start difference. First operand 16783 states and 17515 transitions. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 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:55:03,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:03,567 INFO L93 Difference]: Finished difference Result 32906 states and 34366 transitions. [2025-03-03 10:55:03,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:03,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 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 965 [2025-03-03 10:55:03,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:03,585 INFO L225 Difference]: With dead ends: 32906 [2025-03-03 10:55:03,585 INFO L226 Difference]: Without dead ends: 16783 [2025-03-03 10:55:03,596 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:55:03,597 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 95 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:03,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 377 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:55:03,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16783 states. [2025-03-03 10:55:03,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16783 to 16454. [2025-03-03 10:55:03,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16454 states, 16453 states have (on average 1.0369537470370145) internal successors, (17061), 16453 states have internal predecessors, (17061), 0 states have call successors, (0), 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:55:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16454 states to 16454 states and 17061 transitions. [2025-03-03 10:55:03,814 INFO L78 Accepts]: Start accepts. Automaton has 16454 states and 17061 transitions. Word has length 965 [2025-03-03 10:55:03,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:03,815 INFO L471 AbstractCegarLoop]: Abstraction has 16454 states and 17061 transitions. [2025-03-03 10:55:03,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 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:55:03,816 INFO L276 IsEmpty]: Start isEmpty. Operand 16454 states and 17061 transitions. [2025-03-03 10:55:03,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1245 [2025-03-03 10:55:03,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:03,842 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-03 10:55:03,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:55:03,842 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:03,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:03,843 INFO L85 PathProgramCache]: Analyzing trace with hash 814750405, now seen corresponding path program 1 times [2025-03-03 10:55:03,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:03,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175298457] [2025-03-03 10:55:03,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:03,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:03,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1244 statements into 1 equivalence classes. [2025-03-03 10:55:03,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1244 of 1244 statements. [2025-03-03 10:55:03,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:03,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2740 backedges. 1954 proven. 0 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2025-03-03 10:55:05,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:05,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175298457] [2025-03-03 10:55:05,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175298457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:05,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:05,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 10:55:05,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598549709] [2025-03-03 10:55:05,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:05,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 10:55:05,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:05,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 10:55:05,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:55:05,022 INFO L87 Difference]: Start difference. First operand 16454 states and 17061 transitions. Second operand has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 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:55:05,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:05,992 INFO L93 Difference]: Finished difference Result 32249 states and 33459 transitions. [2025-03-03 10:55:05,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 10:55:05,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 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 1244 [2025-03-03 10:55:05,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:06,006 INFO L225 Difference]: With dead ends: 32249 [2025-03-03 10:55:06,006 INFO L226 Difference]: Without dead ends: 16455 [2025-03-03 10:55:06,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:55:06,016 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 357 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:06,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 566 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1794 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:55:06,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16455 states. [2025-03-03 10:55:06,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16455 to 16454. [2025-03-03 10:55:06,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16454 states, 16453 states have (on average 1.036710630280192) internal successors, (17057), 16453 states have internal predecessors, (17057), 0 states have call successors, (0), 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:55:06,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16454 states to 16454 states and 17057 transitions. [2025-03-03 10:55:06,144 INFO L78 Accepts]: Start accepts. Automaton has 16454 states and 17057 transitions. Word has length 1244 [2025-03-03 10:55:06,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:06,145 INFO L471 AbstractCegarLoop]: Abstraction has 16454 states and 17057 transitions. [2025-03-03 10:55:06,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 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:55:06,145 INFO L276 IsEmpty]: Start isEmpty. Operand 16454 states and 17057 transitions. [2025-03-03 10:55:06,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1249 [2025-03-03 10:55:06,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:06,160 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, 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, 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:55:06,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:55:06,160 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:06,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:06,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1533911733, now seen corresponding path program 1 times [2025-03-03 10:55:06,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:06,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656716875] [2025-03-03 10:55:06,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:06,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:06,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1248 statements into 1 equivalence classes. [2025-03-03 10:55:06,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1248 of 1248 statements. [2025-03-03 10:55:06,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:06,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3261 backedges. 2218 proven. 0 refuted. 0 times theorem prover too weak. 1043 trivial. 0 not checked. [2025-03-03 10:55:06,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:06,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656716875] [2025-03-03 10:55:06,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656716875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:06,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:06,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:06,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227322715] [2025-03-03 10:55:06,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:06,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:06,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:06,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:06,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:06,737 INFO L87 Difference]: Start difference. First operand 16454 states and 17057 transitions. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:07,458 INFO L93 Difference]: Finished difference Result 32248 states and 33450 transitions. [2025-03-03 10:55:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:07,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1248 [2025-03-03 10:55:07,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:07,474 INFO L225 Difference]: With dead ends: 32248 [2025-03-03 10:55:07,475 INFO L226 Difference]: Without dead ends: 16454 [2025-03-03 10:55:07,486 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:55:07,487 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 193 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:07,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 425 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:55:07,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2025-03-03 10:55:07,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 16125. [2025-03-03 10:55:07,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16125 states, 16124 states have (on average 1.0342346812205407) internal successors, (16676), 16124 states have internal predecessors, (16676), 0 states have call successors, (0), 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:55:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 16676 transitions. [2025-03-03 10:55:07,627 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 16676 transitions. Word has length 1248 [2025-03-03 10:55:07,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:07,627 INFO L471 AbstractCegarLoop]: Abstraction has 16125 states and 16676 transitions. [2025-03-03 10:55:07,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:07,627 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 16676 transitions. [2025-03-03 10:55:07,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1259 [2025-03-03 10:55:07,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:07,641 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:55:07,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:55:07,642 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:07,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:07,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1864627259, now seen corresponding path program 1 times [2025-03-03 10:55:07,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:07,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383848086] [2025-03-03 10:55:07,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:07,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:07,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1258 statements into 1 equivalence classes. [2025-03-03 10:55:07,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1258 of 1258 statements. [2025-03-03 10:55:07,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:07,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:09,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2636 backedges. 1887 proven. 0 refuted. 0 times theorem prover too weak. 749 trivial. 0 not checked. [2025-03-03 10:55:09,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:09,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383848086] [2025-03-03 10:55:09,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383848086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:09,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:09,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:55:09,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710711093] [2025-03-03 10:55:09,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:09,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:55:09,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:09,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:55:09,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:55:09,018 INFO L87 Difference]: Start difference. First operand 16125 states and 16676 transitions. Second operand has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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:55:09,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:09,785 INFO L93 Difference]: Finished difference Result 31600 states and 32698 transitions. [2025-03-03 10:55:09,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:55:09,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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 1258 [2025-03-03 10:55:09,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:09,800 INFO L225 Difference]: With dead ends: 31600 [2025-03-03 10:55:09,800 INFO L226 Difference]: Without dead ends: 16135 [2025-03-03 10:55:09,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:55:09,811 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:09,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 444 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:55:09,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16135 states. [2025-03-03 10:55:09,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16135 to 15796. [2025-03-03 10:55:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15796 states, 15795 states have (on average 1.0342513453624564) internal successors, (16336), 15795 states have internal predecessors, (16336), 0 states have call successors, (0), 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:55:09,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15796 states to 15796 states and 16336 transitions. [2025-03-03 10:55:09,935 INFO L78 Accepts]: Start accepts. Automaton has 15796 states and 16336 transitions. Word has length 1258 [2025-03-03 10:55:09,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:09,936 INFO L471 AbstractCegarLoop]: Abstraction has 15796 states and 16336 transitions. [2025-03-03 10:55:09,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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:55:09,936 INFO L276 IsEmpty]: Start isEmpty. Operand 15796 states and 16336 transitions. [2025-03-03 10:55:09,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1274 [2025-03-03 10:55:09,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:09,948 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, 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, 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:55:09,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:55:09,949 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:09,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:09,949 INFO L85 PathProgramCache]: Analyzing trace with hash 439406110, now seen corresponding path program 1 times [2025-03-03 10:55:09,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:09,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140095832] [2025-03-03 10:55:09,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:09,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:10,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1273 statements into 1 equivalence classes. [2025-03-03 10:55:10,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1273 of 1273 statements. [2025-03-03 10:55:10,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:10,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3413 backedges. 1990 proven. 0 refuted. 0 times theorem prover too weak. 1423 trivial. 0 not checked. [2025-03-03 10:55:10,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:10,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140095832] [2025-03-03 10:55:10,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140095832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:10,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:10,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:10,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712781031] [2025-03-03 10:55:10,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:10,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:10,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:10,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:10,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:10,860 INFO L87 Difference]: Start difference. First operand 15796 states and 16336 transitions. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 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:55:11,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:11,439 INFO L93 Difference]: Finished difference Result 31590 states and 32674 transitions. [2025-03-03 10:55:11,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:11,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 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 1273 [2025-03-03 10:55:11,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:11,456 INFO L225 Difference]: With dead ends: 31590 [2025-03-03 10:55:11,456 INFO L226 Difference]: Without dead ends: 16454 [2025-03-03 10:55:11,466 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:55:11,466 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:11,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 438 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:55:11,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2025-03-03 10:55:11,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 16454. [2025-03-03 10:55:11,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16454 states, 16453 states have (on average 1.0331246581170608) internal successors, (16998), 16453 states have internal predecessors, (16998), 0 states have call successors, (0), 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:55:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16454 states to 16454 states and 16998 transitions. [2025-03-03 10:55:11,595 INFO L78 Accepts]: Start accepts. Automaton has 16454 states and 16998 transitions. Word has length 1273 [2025-03-03 10:55:11,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:11,595 INFO L471 AbstractCegarLoop]: Abstraction has 16454 states and 16998 transitions. [2025-03-03 10:55:11,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 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:55:11,595 INFO L276 IsEmpty]: Start isEmpty. Operand 16454 states and 16998 transitions. [2025-03-03 10:55:11,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1299 [2025-03-03 10:55:11,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:11,607 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-03 10:55:11,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:55:11,608 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:11,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:11,608 INFO L85 PathProgramCache]: Analyzing trace with hash -223626776, now seen corresponding path program 1 times [2025-03-03 10:55:11,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:11,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245696612] [2025-03-03 10:55:11,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:11,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:11,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1298 statements into 1 equivalence classes. [2025-03-03 10:55:11,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1298 of 1298 statements. [2025-03-03 10:55:11,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:11,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:12,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2983 backedges. 2064 proven. 0 refuted. 0 times theorem prover too weak. 919 trivial. 0 not checked. [2025-03-03 10:55:12,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:12,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245696612] [2025-03-03 10:55:12,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245696612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:12,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:12,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:55:12,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988215430] [2025-03-03 10:55:12,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:12,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:55:12,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:12,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:55:12,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:55:12,431 INFO L87 Difference]: Start difference. First operand 16454 states and 16998 transitions. Second operand has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 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:55:13,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:13,182 INFO L93 Difference]: Finished difference Result 32248 states and 33332 transitions. [2025-03-03 10:55:13,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:55:13,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 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 1298 [2025-03-03 10:55:13,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:13,195 INFO L225 Difference]: With dead ends: 32248 [2025-03-03 10:55:13,195 INFO L226 Difference]: Without dead ends: 16454 [2025-03-03 10:55:13,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:55:13,203 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 120 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:13,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 563 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:55:13,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2025-03-03 10:55:13,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 16454. [2025-03-03 10:55:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16454 states, 16453 states have (on average 1.0323953078465933) internal successors, (16986), 16453 states have internal predecessors, (16986), 0 states have call successors, (0), 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:55:13,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16454 states to 16454 states and 16986 transitions. [2025-03-03 10:55:13,314 INFO L78 Accepts]: Start accepts. Automaton has 16454 states and 16986 transitions. Word has length 1298 [2025-03-03 10:55:13,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:13,315 INFO L471 AbstractCegarLoop]: Abstraction has 16454 states and 16986 transitions. [2025-03-03 10:55:13,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 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:55:13,315 INFO L276 IsEmpty]: Start isEmpty. Operand 16454 states and 16986 transitions. [2025-03-03 10:55:13,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1328 [2025-03-03 10:55:13,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:13,328 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-03 10:55:13,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:55:13,328 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:13,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:13,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1196369747, now seen corresponding path program 1 times [2025-03-03 10:55:13,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:13,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767732277] [2025-03-03 10:55:13,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:13,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:13,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1327 statements into 1 equivalence classes. [2025-03-03 10:55:13,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1327 of 1327 statements. [2025-03-03 10:55:13,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:13,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:13,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 704 proven. 0 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked. [2025-03-03 10:55:13,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:13,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767732277] [2025-03-03 10:55:13,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767732277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:13,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:13,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:13,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571855513] [2025-03-03 10:55:13,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:13,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:13,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:13,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:13,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:13,985 INFO L87 Difference]: Start difference. First operand 16454 states and 16986 transitions. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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:55:14,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:14,597 INFO L93 Difference]: Finished difference Result 32248 states and 33308 transitions. [2025-03-03 10:55:14,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:14,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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 1327 [2025-03-03 10:55:14,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:14,610 INFO L225 Difference]: With dead ends: 32248 [2025-03-03 10:55:14,610 INFO L226 Difference]: Without dead ends: 16454 [2025-03-03 10:55:14,619 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:55:14,619 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 268 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:14,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 415 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:55:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2025-03-03 10:55:14,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 15796. [2025-03-03 10:55:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15796 states, 15795 states have (on average 1.022412155745489) internal successors, (16149), 15795 states have internal predecessors, (16149), 0 states have call successors, (0), 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:55:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15796 states to 15796 states and 16149 transitions. [2025-03-03 10:55:14,735 INFO L78 Accepts]: Start accepts. Automaton has 15796 states and 16149 transitions. Word has length 1327 [2025-03-03 10:55:14,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:14,736 INFO L471 AbstractCegarLoop]: Abstraction has 15796 states and 16149 transitions. [2025-03-03 10:55:14,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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:55:14,736 INFO L276 IsEmpty]: Start isEmpty. Operand 15796 states and 16149 transitions. [2025-03-03 10:55:14,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1605 [2025-03-03 10:55:14,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:14,752 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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] [2025-03-03 10:55:14,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 10:55:14,752 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:14,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:14,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1398566419, now seen corresponding path program 1 times [2025-03-03 10:55:14,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:14,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255094021] [2025-03-03 10:55:14,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:14,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:14,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1604 statements into 1 equivalence classes. [2025-03-03 10:55:14,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1604 of 1604 statements. [2025-03-03 10:55:14,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:14,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 4699 trivial. 0 not checked. [2025-03-03 10:55:15,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:15,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255094021] [2025-03-03 10:55:15,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255094021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:15,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:15,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:55:15,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193460630] [2025-03-03 10:55:15,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:15,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:55:15,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:15,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:55:15,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:55:15,600 INFO L87 Difference]: Start difference. First operand 15796 states and 16149 transitions. Second operand has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 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:55:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:16,611 INFO L93 Difference]: Finished difference Result 33569 states and 34350 transitions. [2025-03-03 10:55:16,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:55:16,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 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 1604 [2025-03-03 10:55:16,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:16,612 INFO L225 Difference]: With dead ends: 33569 [2025-03-03 10:55:16,612 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:55:16,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:55:16,624 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 636 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:16,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 36 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1513 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:55:16,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:55:16,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:55:16,624 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:55:16,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:55:16,625 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1604 [2025-03-03 10:55:16,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:16,625 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:55:16,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 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:55:16,625 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:55:16,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:55:16,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:55:16,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 10:55:16,630 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:16,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:55:17,292 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:55:17,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:55:17 BoogieIcfgContainer [2025-03-03 10:55:17,304 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:55:17,305 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:55:17,305 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:55:17,305 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:55:17,306 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:54:44" (3/4) ... [2025-03-03 10:55:17,307 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:55:17,335 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-03 10:55:17,336 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:55:17,337 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:55:17,338 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:55:17,475 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:55:17,475 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:55:17,476 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:55:17,476 INFO L158 Benchmark]: Toolchain (without parser) took 35392.18ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 107.3MB in the beginning and 1.1GB in the end (delta: -969.1MB). Peak memory consumption was 779.6MB. Max. memory is 16.1GB. [2025-03-03 10:55:17,476 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:55:17,477 INFO L158 Benchmark]: CACSL2BoogieTranslator took 547.41ms. Allocated memory is still 142.6MB. Free memory was 107.3MB in the beginning and 49.5MB in the end (delta: 57.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-03 10:55:17,477 INFO L158 Benchmark]: Boogie Procedure Inliner took 143.94ms. Allocated memory is still 142.6MB. Free memory was 49.5MB in the beginning and 90.2MB in the end (delta: -40.7MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2025-03-03 10:55:17,477 INFO L158 Benchmark]: Boogie Preprocessor took 154.18ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 56.8MB in the end (delta: 33.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 10:55:17,477 INFO L158 Benchmark]: IcfgBuilder took 1828.24ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 56.8MB in the beginning and 54.1MB in the end (delta: 2.7MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2025-03-03 10:55:17,477 INFO L158 Benchmark]: TraceAbstraction took 32538.15ms. Allocated memory was 184.5MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 53.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 657.6MB. Max. memory is 16.1GB. [2025-03-03 10:55:17,477 INFO L158 Benchmark]: Witness Printer took 170.78ms. Allocated memory is still 1.9GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 10:55:17,481 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.68ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 547.41ms. Allocated memory is still 142.6MB. Free memory was 107.3MB in the beginning and 49.5MB in the end (delta: 57.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 143.94ms. Allocated memory is still 142.6MB. Free memory was 49.5MB in the beginning and 90.2MB in the end (delta: -40.7MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 154.18ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 56.8MB in the end (delta: 33.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * IcfgBuilder took 1828.24ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 56.8MB in the beginning and 54.1MB in the end (delta: 2.7MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. * TraceAbstraction took 32538.15ms. Allocated memory was 184.5MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 53.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 657.6MB. Max. memory is 16.1GB. * Witness Printer took 170.78ms. Allocated memory is still 1.9GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 24.9MB). 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: 110]: 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: 31.8s, OverallIterations: 20, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5976 SdHoareTripleChecker+Valid, 16.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5976 mSDsluCounter, 5817 SdHoareTripleChecker+Invalid, 13.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 390 mSDsCounter, 2688 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20287 IncrementalHoareTripleChecker+Invalid, 22975 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2688 mSolverCounterUnsat, 5427 mSDtfsCounter, 20287 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16783occurred in iteration=12, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 4288 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 15146 NumberOfCodeBlocks, 15146 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 15126 ConstructedInterpolants, 0 QuantifiedInterpolants, 31437 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 30441/30441 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: (((((((((((((((((((((a12 == 9) && (a15 <= 3)) && (a16 == 12)) || (((a15 <= 3) && (a16 <= 11)) && (7 == a12))) || (((a16 != 10) && (a16 <= 11)) && (7 == a12))) || (((a16 == 10) && (a12 == 6)) && (a15 == 3))) || ((a16 <= 8) && (a12 == 8))) || ((((a12 <= 5) && (a15 <= 3)) && (0 <= ((long long) a18 + 155))) && (a16 == 12))) || (((a12 == 9) && (a16 != 10)) && (a16 <= 11))) || ((((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (a12 <= 7)) && (a16 <= 11))) || (((a12 == 6) && (a16 <= 11)) && (4 <= a15))) || (((a12 == 9) && (a15 <= 3)) && (a16 <= 11))) || ((((a12 <= 5) && (a16 != 10)) && (0 <= ((long long) a18 + 155))) && (a16 <= 11))) || ((((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (a12 == 6)) && (a16 == 12))) || (((a12 <= 5) && (a16 <= 11)) && (4 <= a15))) || ((((a16 != 10) && (a12 == 8)) && (0 <= ((long long) a18 + 155))) && (a16 <= 11))) || (((a15 <= 3) && (a12 == 8)) && (a16 <= 11))) || (((a15 <= 3) && (a12 == 8)) && (a16 == 12))) || ((a16 <= 8) && (a15 <= 3))) || ((((a15 <= 3) && (0 <= ((long long) a18 + 155))) && (a12 == 6)) && (a16 <= 11))) || ((((a15 <= 3) && (0 <= ((long long) a18 + 155))) && (a16 == 12)) && (7 == a12))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:55:17,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE