./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label37.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label37.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 a60dbc2f79c578f373d1608befa1a0be5fe97eed98271e53ccf8c768ad5b972e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 01:53:28,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:53:28,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:53:28,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:53:28,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:53:28,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:53:28,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:53:28,771 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:53:28,771 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:53:28,772 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:53:28,772 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:53:28,772 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:53:28,772 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:53:28,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:53:28,772 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:53:28,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:53:28,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:53:28,772 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:53:28,773 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:53:28,773 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:53:28,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:53:28,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:53:28,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:53:28,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:53:28,773 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:53:28,773 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:53:28,773 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:53:28,773 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:53:28,773 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:53:28,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:53:28,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:53:28,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:53:28,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:53:28,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:53:28,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:53:28,774 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:53:28,774 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:53:28,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:53:28,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:53:28,774 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:53:28,774 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:53:28,774 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:53:28,774 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:53:28,774 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 -> a60dbc2f79c578f373d1608befa1a0be5fe97eed98271e53ccf8c768ad5b972e [2025-03-08 01:53:29,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:53:29,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:53:29,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:53:29,024 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:53:29,024 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:53:29,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label37.c [2025-03-08 01:53:30,168 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9084982fc/76a0c790627e4c708ec546444bff4f9b/FLAGf5c78a7d3 [2025-03-08 01:53:30,564 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:53:30,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label37.c [2025-03-08 01:53:30,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9084982fc/76a0c790627e4c708ec546444bff4f9b/FLAGf5c78a7d3 [2025-03-08 01:53:30,733 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9084982fc/76a0c790627e4c708ec546444bff4f9b [2025-03-08 01:53:30,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:53:30,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:53:30,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:53:30,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:53:30,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:53:30,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:53:30" (1/1) ... [2025-03-08 01:53:30,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404a5b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:30, skipping insertion in model container [2025-03-08 01:53:30,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:53:30" (1/1) ... [2025-03-08 01:53:30,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:53:31,035 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/Problem13_label37.c[7700,7713] [2025-03-08 01:53:31,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:53:31,613 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:53:31,629 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/Problem13_label37.c[7700,7713] [2025-03-08 01:53:31,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:53:31,927 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:53:31,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:31 WrapperNode [2025-03-08 01:53:31,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:53:31,929 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:53:31,929 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:53:31,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:53:31,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:31" (1/1) ... [2025-03-08 01:53:31,973 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:31" (1/1) ... [2025-03-08 01:53:32,313 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-08 01:53:32,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:53:32,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:53:32,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:53:32,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:53:32,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:31" (1/1) ... [2025-03-08 01:53:32,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:31" (1/1) ... [2025-03-08 01:53:32,439 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:31" (1/1) ... [2025-03-08 01:53:32,603 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 01:53:32,603 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:31" (1/1) ... [2025-03-08 01:53:32,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:31" (1/1) ... [2025-03-08 01:53:32,767 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:31" (1/1) ... [2025-03-08 01:53:32,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:31" (1/1) ... [2025-03-08 01:53:32,813 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:31" (1/1) ... [2025-03-08 01:53:32,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:31" (1/1) ... [2025-03-08 01:53:32,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:53:32,878 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:53:32,878 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:53:32,878 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:53:32,879 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:31" (1/1) ... [2025-03-08 01:53:32,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:53:32,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:53:32,905 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 01:53:32,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 01:53:32,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:53:32,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:53:32,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:53:32,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:53:32,975 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:53:32,977 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:53:37,158 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-08 01:53:37,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-08 01:53:37,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-08 01:53:37,367 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-08 01:53:37,367 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:53:37,405 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:53:37,405 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:53:37,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:53:37 BoogieIcfgContainer [2025-03-08 01:53:37,406 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:53:37,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:53:37,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:53:37,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:53:37,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:53:30" (1/3) ... [2025-03-08 01:53:37,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102e2fdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:53:37, skipping insertion in model container [2025-03-08 01:53:37,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:31" (2/3) ... [2025-03-08 01:53:37,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102e2fdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:53:37, skipping insertion in model container [2025-03-08 01:53:37,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:53:37" (3/3) ... [2025-03-08 01:53:37,414 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label37.c [2025-03-08 01:53:37,429 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:53:37,430 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label37.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 01:53:37,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:53:37,525 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;@48d7cc4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:53:37,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:53:37,534 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:37,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 01:53:37,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:37,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:53:37,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:37,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:37,548 INFO L85 PathProgramCache]: Analyzing trace with hash -523355690, now seen corresponding path program 1 times [2025-03-08 01:53:37,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:37,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748474736] [2025-03-08 01:53:37,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:37,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:37,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 01:53:37,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 01:53:37,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:37,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:37,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:53:37,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:37,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748474736] [2025-03-08 01:53:37,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748474736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:37,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:37,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:53:37,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834839910] [2025-03-08 01:53:37,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:37,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:37,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:37,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:37,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:37,878 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:41,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:41,747 INFO L93 Difference]: Finished difference Result 3121 states and 5801 transitions. [2025-03-08 01:53:41,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:41,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-03-08 01:53:41,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:41,766 INFO L225 Difference]: With dead ends: 3121 [2025-03-08 01:53:41,766 INFO L226 Difference]: Without dead ends: 1944 [2025-03-08 01:53:41,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:41,772 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 935 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 3124 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 3701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 3124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:41,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 571 Invalid, 3701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 3124 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-08 01:53:41,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2025-03-08 01:53:41,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1873. [2025-03-08 01:53:41,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1872 states have (on average 1.7393162393162394) internal successors, (3256), 1872 states have internal predecessors, (3256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:41,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 3256 transitions. [2025-03-08 01:53:41,862 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 3256 transitions. Word has length 54 [2025-03-08 01:53:41,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:41,862 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 3256 transitions. [2025-03-08 01:53:41,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:41,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 3256 transitions. [2025-03-08 01:53:41,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 01:53:41,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:41,865 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:53:41,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:53:41,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:41,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:41,866 INFO L85 PathProgramCache]: Analyzing trace with hash 524478063, now seen corresponding path program 1 times [2025-03-08 01:53:41,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:41,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798647657] [2025-03-08 01:53:41,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:41,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:41,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 01:53:41,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 01:53:41,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:41,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:53:42,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:42,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798647657] [2025-03-08 01:53:42,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798647657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:42,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:42,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:53:42,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874425604] [2025-03-08 01:53:42,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:42,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:42,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:42,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:42,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:42,227 INFO L87 Difference]: Start difference. First operand 1873 states and 3256 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:44,907 INFO L93 Difference]: Finished difference Result 4604 states and 7964 transitions. [2025-03-08 01:53:44,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:44,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-03-08 01:53:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:44,917 INFO L225 Difference]: With dead ends: 4604 [2025-03-08 01:53:44,917 INFO L226 Difference]: Without dead ends: 2733 [2025-03-08 01:53:44,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:44,920 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 815 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3016 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:44,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 738 Invalid, 3180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3016 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 01:53:44,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2025-03-08 01:53:44,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2670. [2025-03-08 01:53:44,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2670 states, 2669 states have (on average 1.6579243162233046) internal successors, (4425), 2669 states have internal predecessors, (4425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 4425 transitions. [2025-03-08 01:53:44,980 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 4425 transitions. Word has length 119 [2025-03-08 01:53:44,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:44,980 INFO L471 AbstractCegarLoop]: Abstraction has 2670 states and 4425 transitions. [2025-03-08 01:53:44,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:44,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 4425 transitions. [2025-03-08 01:53:44,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 01:53:44,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:44,985 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:53:44,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:53:44,986 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:44,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:44,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1888003715, now seen corresponding path program 1 times [2025-03-08 01:53:44,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:44,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065310713] [2025-03-08 01:53:44,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:44,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:45,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 01:53:45,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 01:53:45,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:45,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:53:45,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:45,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065310713] [2025-03-08 01:53:45,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065310713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:45,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:45,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:53:45,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745759031] [2025-03-08 01:53:45,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:45,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:45,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:45,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:45,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:45,158 INFO L87 Difference]: Start difference. First operand 2670 states and 4425 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:47,774 INFO L93 Difference]: Finished difference Result 7732 states and 12864 transitions. [2025-03-08 01:53:47,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:47,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2025-03-08 01:53:47,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:47,789 INFO L225 Difference]: With dead ends: 7732 [2025-03-08 01:53:47,789 INFO L226 Difference]: Without dead ends: 5064 [2025-03-08 01:53:47,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:47,794 INFO L435 NwaCegarLoop]: 983 mSDtfsCounter, 870 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 3255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:47,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 1136 Invalid, 3255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 01:53:47,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5064 states. [2025-03-08 01:53:47,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5064 to 5063. [2025-03-08 01:53:47,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5063 states, 5062 states have (on average 1.454563413670486) internal successors, (7363), 5062 states have internal predecessors, (7363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:47,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5063 states to 5063 states and 7363 transitions. [2025-03-08 01:53:47,861 INFO L78 Accepts]: Start accepts. Automaton has 5063 states and 7363 transitions. Word has length 120 [2025-03-08 01:53:47,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:47,861 INFO L471 AbstractCegarLoop]: Abstraction has 5063 states and 7363 transitions. [2025-03-08 01:53:47,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:47,861 INFO L276 IsEmpty]: Start isEmpty. Operand 5063 states and 7363 transitions. [2025-03-08 01:53:47,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 01:53:47,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:47,866 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:53:47,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 01:53:47,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:47,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:47,866 INFO L85 PathProgramCache]: Analyzing trace with hash 448274661, now seen corresponding path program 1 times [2025-03-08 01:53:47,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:47,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598632311] [2025-03-08 01:53:47,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:47,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:47,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 01:53:47,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 01:53:47,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:47,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:53:47,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:47,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598632311] [2025-03-08 01:53:47,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598632311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:47,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:47,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:53:47,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272652343] [2025-03-08 01:53:47,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:47,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:47,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:47,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:47,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:47,988 INFO L87 Difference]: Start difference. First operand 5063 states and 7363 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:50,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:50,852 INFO L93 Difference]: Finished difference Result 12513 states and 18431 transitions. [2025-03-08 01:53:50,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:50,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-08 01:53:50,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:50,873 INFO L225 Difference]: With dead ends: 12513 [2025-03-08 01:53:50,874 INFO L226 Difference]: Without dead ends: 7452 [2025-03-08 01:53:50,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:50,879 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 871 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2661 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:50,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1175 Invalid, 3380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2661 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 01:53:50,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7452 states. [2025-03-08 01:53:50,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7452 to 7444. [2025-03-08 01:53:50,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7444 states, 7443 states have (on average 1.336826548434771) internal successors, (9950), 7443 states have internal predecessors, (9950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7444 states to 7444 states and 9950 transitions. [2025-03-08 01:53:50,964 INFO L78 Accepts]: Start accepts. Automaton has 7444 states and 9950 transitions. Word has length 123 [2025-03-08 01:53:50,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:50,965 INFO L471 AbstractCegarLoop]: Abstraction has 7444 states and 9950 transitions. [2025-03-08 01:53:50,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:50,965 INFO L276 IsEmpty]: Start isEmpty. Operand 7444 states and 9950 transitions. [2025-03-08 01:53:50,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 01:53:50,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:50,966 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:53:50,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 01:53:50,966 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:50,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:50,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1972395911, now seen corresponding path program 1 times [2025-03-08 01:53:50,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:50,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511176124] [2025-03-08 01:53:50,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:50,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:50,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 01:53:50,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 01:53:50,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:50,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:51,072 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:53:51,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:51,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511176124] [2025-03-08 01:53:51,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511176124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:51,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:51,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:53:51,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211214354] [2025-03-08 01:53:51,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:51,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:51,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:51,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:51,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:51,073 INFO L87 Difference]: Start difference. First operand 7444 states and 9950 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:53,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:53,550 INFO L93 Difference]: Finished difference Result 20424 states and 27781 transitions. [2025-03-08 01:53:53,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:53,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-03-08 01:53:53,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:53,581 INFO L225 Difference]: With dead ends: 20424 [2025-03-08 01:53:53,581 INFO L226 Difference]: Without dead ends: 13769 [2025-03-08 01:53:53,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:53,591 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 805 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2489 mSolverCounterSat, 784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 784 IncrementalHoareTripleChecker+Valid, 2489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:53,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 1161 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [784 Valid, 2489 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 01:53:53,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13769 states. [2025-03-08 01:53:53,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13769 to 12962. [2025-03-08 01:53:53,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12962 states, 12961 states have (on average 1.2383303757426125) internal successors, (16050), 12961 states have internal predecessors, (16050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:53,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12962 states to 12962 states and 16050 transitions. [2025-03-08 01:53:53,806 INFO L78 Accepts]: Start accepts. Automaton has 12962 states and 16050 transitions. Word has length 127 [2025-03-08 01:53:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:53,807 INFO L471 AbstractCegarLoop]: Abstraction has 12962 states and 16050 transitions. [2025-03-08 01:53:53,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 12962 states and 16050 transitions. [2025-03-08 01:53:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 01:53:53,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:53,809 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:53:53,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 01:53:53,809 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:53,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:53,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1401240883, now seen corresponding path program 1 times [2025-03-08 01:53:53,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:53,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308560601] [2025-03-08 01:53:53,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:53,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:53,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 01:53:53,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 01:53:53,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:53,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:54,015 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:53:54,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:54,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308560601] [2025-03-08 01:53:54,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308560601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:54,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:54,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:53:54,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272431056] [2025-03-08 01:53:54,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:54,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:54,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:54,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:54,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:54,019 INFO L87 Difference]: Start difference. First operand 12962 states and 16050 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:56,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:56,088 INFO L93 Difference]: Finished difference Result 25135 states and 31301 transitions. [2025-03-08 01:53:56,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:56,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2025-03-08 01:53:56,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:56,110 INFO L225 Difference]: With dead ends: 25135 [2025-03-08 01:53:56,110 INFO L226 Difference]: Without dead ends: 12962 [2025-03-08 01:53:56,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:56,123 INFO L435 NwaCegarLoop]: 1083 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:56,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1212 Invalid, 2524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 01:53:56,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12962 states. [2025-03-08 01:53:56,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12962 to 12962. [2025-03-08 01:53:56,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12962 states, 12961 states have (on average 1.2379446030398888) internal successors, (16045), 12961 states have internal predecessors, (16045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12962 states to 12962 states and 16045 transitions. [2025-03-08 01:53:56,253 INFO L78 Accepts]: Start accepts. Automaton has 12962 states and 16045 transitions. Word has length 143 [2025-03-08 01:53:56,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:56,254 INFO L471 AbstractCegarLoop]: Abstraction has 12962 states and 16045 transitions. [2025-03-08 01:53:56,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 12962 states and 16045 transitions. [2025-03-08 01:53:56,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 01:53:56,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:56,256 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:53:56,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 01:53:56,256 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:56,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:56,256 INFO L85 PathProgramCache]: Analyzing trace with hash -673657015, now seen corresponding path program 1 times [2025-03-08 01:53:56,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:56,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646514973] [2025-03-08 01:53:56,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:56,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:56,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 01:53:56,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 01:53:56,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:56,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:53:56,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:56,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646514973] [2025-03-08 01:53:56,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646514973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:56,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:56,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:53:56,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225644353] [2025-03-08 01:53:56,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:56,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:56,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:56,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:56,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:56,345 INFO L87 Difference]: Start difference. First operand 12962 states and 16045 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:59,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:59,111 INFO L93 Difference]: Finished difference Result 31448 states and 39970 transitions. [2025-03-08 01:53:59,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:59,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2025-03-08 01:53:59,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:59,134 INFO L225 Difference]: With dead ends: 31448 [2025-03-08 01:53:59,134 INFO L226 Difference]: Without dead ends: 19275 [2025-03-08 01:53:59,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:59,146 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 909 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 908 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 908 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:59,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 957 Invalid, 3299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [908 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 01:53:59,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19275 states. [2025-03-08 01:53:59,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19275 to 18478. [2025-03-08 01:53:59,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18478 states, 18477 states have (on average 1.2248200465443524) internal successors, (22631), 18477 states have internal predecessors, (22631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:59,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18478 states to 18478 states and 22631 transitions. [2025-03-08 01:53:59,300 INFO L78 Accepts]: Start accepts. Automaton has 18478 states and 22631 transitions. Word has length 150 [2025-03-08 01:53:59,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:59,301 INFO L471 AbstractCegarLoop]: Abstraction has 18478 states and 22631 transitions. [2025-03-08 01:53:59,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:59,301 INFO L276 IsEmpty]: Start isEmpty. Operand 18478 states and 22631 transitions. [2025-03-08 01:53:59,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-08 01:53:59,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:59,303 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:53:59,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 01:53:59,303 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:59,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:59,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1970027706, now seen corresponding path program 1 times [2025-03-08 01:53:59,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:59,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925662510] [2025-03-08 01:53:59,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:59,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:59,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-08 01:53:59,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-08 01:53:59,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:59,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:59,418 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-08 01:53:59,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:59,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925662510] [2025-03-08 01:53:59,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925662510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:59,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:59,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:53:59,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978035921] [2025-03-08 01:53:59,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:59,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:59,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:59,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:59,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:59,419 INFO L87 Difference]: Start difference. First operand 18478 states and 22631 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:02,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:02,140 INFO L93 Difference]: Finished difference Result 42487 states and 53153 transitions. [2025-03-08 01:54:02,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:02,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 239 [2025-03-08 01:54:02,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:02,180 INFO L225 Difference]: With dead ends: 42487 [2025-03-08 01:54:02,180 INFO L226 Difference]: Without dead ends: 24798 [2025-03-08 01:54:02,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:02,197 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 996 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 1023 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 3412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1023 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:02,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 796 Invalid, 3412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1023 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 01:54:02,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24798 states. [2025-03-08 01:54:02,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24798 to 24786. [2025-03-08 01:54:02,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24786 states, 24785 states have (on average 1.230260238047206) internal successors, (30492), 24785 states have internal predecessors, (30492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:02,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24786 states to 24786 states and 30492 transitions. [2025-03-08 01:54:02,450 INFO L78 Accepts]: Start accepts. Automaton has 24786 states and 30492 transitions. Word has length 239 [2025-03-08 01:54:02,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:02,451 INFO L471 AbstractCegarLoop]: Abstraction has 24786 states and 30492 transitions. [2025-03-08 01:54:02,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:02,453 INFO L276 IsEmpty]: Start isEmpty. Operand 24786 states and 30492 transitions. [2025-03-08 01:54:02,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-08 01:54:02,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:02,459 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:54:02,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 01:54:02,459 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:02,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:02,460 INFO L85 PathProgramCache]: Analyzing trace with hash 898505358, now seen corresponding path program 1 times [2025-03-08 01:54:02,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:02,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795925109] [2025-03-08 01:54:02,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:02,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:02,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-08 01:54:02,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-08 01:54:02,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:02,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:02,711 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:54:02,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:02,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795925109] [2025-03-08 01:54:02,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795925109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:02,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:02,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:54:02,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941256198] [2025-03-08 01:54:02,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:02,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:02,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:02,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:02,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:02,713 INFO L87 Difference]: Start difference. First operand 24786 states and 30492 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:05,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:05,129 INFO L93 Difference]: Finished difference Result 49597 states and 61040 transitions. [2025-03-08 01:54:05,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:05,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 316 [2025-03-08 01:54:05,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:05,155 INFO L225 Difference]: With dead ends: 49597 [2025-03-08 01:54:05,155 INFO L226 Difference]: Without dead ends: 25600 [2025-03-08 01:54:05,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:05,169 INFO L435 NwaCegarLoop]: 1799 mSDtfsCounter, 722 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2560 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1942 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 2560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:05,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1942 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 2560 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 01:54:05,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25600 states. [2025-03-08 01:54:05,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25600 to 25574. [2025-03-08 01:54:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25574 states, 25573 states have (on average 1.2079145974269738) internal successors, (30890), 25573 states have internal predecessors, (30890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:05,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25574 states to 25574 states and 30890 transitions. [2025-03-08 01:54:05,388 INFO L78 Accepts]: Start accepts. Automaton has 25574 states and 30890 transitions. Word has length 316 [2025-03-08 01:54:05,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:05,388 INFO L471 AbstractCegarLoop]: Abstraction has 25574 states and 30890 transitions. [2025-03-08 01:54:05,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:05,389 INFO L276 IsEmpty]: Start isEmpty. Operand 25574 states and 30890 transitions. [2025-03-08 01:54:05,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-08 01:54:05,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:05,394 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:54:05,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 01:54:05,395 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:05,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:05,398 INFO L85 PathProgramCache]: Analyzing trace with hash 560685410, now seen corresponding path program 1 times [2025-03-08 01:54:05,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:05,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710917387] [2025-03-08 01:54:05,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:05,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:05,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-08 01:54:05,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-08 01:54:05,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:05,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:05,626 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 379 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 01:54:05,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:05,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710917387] [2025-03-08 01:54:05,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710917387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:05,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:05,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:54:05,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144258090] [2025-03-08 01:54:05,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:05,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:54:05,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:05,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:54:05,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:54:05,628 INFO L87 Difference]: Start difference. First operand 25574 states and 30890 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:10,831 INFO L93 Difference]: Finished difference Result 75756 states and 92428 transitions. [2025-03-08 01:54:10,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:54:10,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 342 [2025-03-08 01:54:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:10,885 INFO L225 Difference]: With dead ends: 75756 [2025-03-08 01:54:10,885 INFO L226 Difference]: Without dead ends: 50971 [2025-03-08 01:54:10,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:54:10,902 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 1708 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 7203 mSolverCounterSat, 981 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1708 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 8184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 981 IncrementalHoareTripleChecker+Valid, 7203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:10,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1708 Valid, 1154 Invalid, 8184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [981 Valid, 7203 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-08 01:54:10,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50971 states. [2025-03-08 01:54:11,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50971 to 50847. [2025-03-08 01:54:11,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50847 states, 50846 states have (on average 1.1909098060811076) internal successors, (60553), 50846 states have internal predecessors, (60553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:11,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50847 states to 50847 states and 60553 transitions. [2025-03-08 01:54:11,308 INFO L78 Accepts]: Start accepts. Automaton has 50847 states and 60553 transitions. Word has length 342 [2025-03-08 01:54:11,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:11,309 INFO L471 AbstractCegarLoop]: Abstraction has 50847 states and 60553 transitions. [2025-03-08 01:54:11,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 50847 states and 60553 transitions. [2025-03-08 01:54:11,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-08 01:54:11,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:11,313 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:54:11,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 01:54:11,313 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:11,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:11,314 INFO L85 PathProgramCache]: Analyzing trace with hash 571000431, now seen corresponding path program 1 times [2025-03-08 01:54:11,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:11,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138506206] [2025-03-08 01:54:11,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:11,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:11,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-08 01:54:11,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-08 01:54:11,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:11,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:11,724 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:54:11,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:11,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138506206] [2025-03-08 01:54:11,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138506206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:11,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:11,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:54:11,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830636334] [2025-03-08 01:54:11,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:11,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:54:11,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:11,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:54:11,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:54:11,726 INFO L87 Difference]: Start difference. First operand 50847 states and 60553 transitions. Second operand has 4 states, 4 states have (on average 86.25) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:15,209 INFO L93 Difference]: Finished difference Result 122943 states and 144330 transitions. [2025-03-08 01:54:15,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:54:15,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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 345 [2025-03-08 01:54:15,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:15,283 INFO L225 Difference]: With dead ends: 122943 [2025-03-08 01:54:15,283 INFO L226 Difference]: Without dead ends: 61861 [2025-03-08 01:54:15,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:54:15,325 INFO L435 NwaCegarLoop]: 946 mSDtfsCounter, 1469 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 4299 mSolverCounterSat, 779 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 5078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 779 IncrementalHoareTripleChecker+Valid, 4299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:15,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1469 Valid, 1163 Invalid, 5078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [779 Valid, 4299 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-08 01:54:15,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61861 states. [2025-03-08 01:54:15,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61861 to 61072. [2025-03-08 01:54:15,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61072 states, 61071 states have (on average 1.151332056131388) internal successors, (70313), 61071 states have internal predecessors, (70313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:15,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61072 states to 61072 states and 70313 transitions. [2025-03-08 01:54:15,934 INFO L78 Accepts]: Start accepts. Automaton has 61072 states and 70313 transitions. Word has length 345 [2025-03-08 01:54:15,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:15,934 INFO L471 AbstractCegarLoop]: Abstraction has 61072 states and 70313 transitions. [2025-03-08 01:54:15,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 61072 states and 70313 transitions. [2025-03-08 01:54:15,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-03-08 01:54:15,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:15,937 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-08 01:54:15,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 01:54:15,937 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:15,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:15,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1644040571, now seen corresponding path program 1 times [2025-03-08 01:54:15,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:15,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315208192] [2025-03-08 01:54:15,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:15,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:15,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-03-08 01:54:15,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-03-08 01:54:15,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:15,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:16,085 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-08 01:54:16,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:16,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315208192] [2025-03-08 01:54:16,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315208192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:16,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:16,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:54:16,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404043422] [2025-03-08 01:54:16,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:16,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:16,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:16,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:16,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:16,087 INFO L87 Difference]: Start difference. First operand 61072 states and 70313 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:18,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:18,638 INFO L93 Difference]: Finished difference Result 132357 states and 154299 transitions. [2025-03-08 01:54:18,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:18,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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-08 01:54:18,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:18,901 INFO L225 Difference]: With dead ends: 132357 [2025-03-08 01:54:18,901 INFO L226 Difference]: Without dead ends: 72074 [2025-03-08 01:54:18,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:18,921 INFO L435 NwaCegarLoop]: 1429 mSDtfsCounter, 1112 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 2290 mSolverCounterSat, 737 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 3027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 737 IncrementalHoareTripleChecker+Valid, 2290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:18,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 1517 Invalid, 3027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [737 Valid, 2290 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 01:54:18,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72074 states. [2025-03-08 01:54:19,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72074 to 72073. [2025-03-08 01:54:19,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72073 states, 72072 states have (on average 1.1341991341991342) internal successors, (81744), 72072 states have internal predecessors, (81744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:19,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72073 states to 72073 states and 81744 transitions. [2025-03-08 01:54:19,706 INFO L78 Accepts]: Start accepts. Automaton has 72073 states and 81744 transitions. Word has length 370 [2025-03-08 01:54:19,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:19,706 INFO L471 AbstractCegarLoop]: Abstraction has 72073 states and 81744 transitions. [2025-03-08 01:54:19,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:19,706 INFO L276 IsEmpty]: Start isEmpty. Operand 72073 states and 81744 transitions. [2025-03-08 01:54:19,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-03-08 01:54:19,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:19,710 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 01:54:19,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 01:54:19,710 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:19,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:19,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1771625279, now seen corresponding path program 1 times [2025-03-08 01:54:19,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:19,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763621078] [2025-03-08 01:54:19,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:19,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:19,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-08 01:54:19,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-08 01:54:19,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:19,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:20,138 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-08 01:54:20,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:20,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763621078] [2025-03-08 01:54:20,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763621078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:20,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:20,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:54:20,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340162294] [2025-03-08 01:54:20,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:20,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:20,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:20,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:20,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:20,141 INFO L87 Difference]: Start difference. First operand 72073 states and 81744 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:22,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:22,841 INFO L93 Difference]: Finished difference Result 143377 states and 162728 transitions. [2025-03-08 01:54:22,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:22,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 405 [2025-03-08 01:54:22,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:22,935 INFO L225 Difference]: With dead ends: 143377 [2025-03-08 01:54:22,935 INFO L226 Difference]: Without dead ends: 72093 [2025-03-08 01:54:22,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:22,984 INFO L435 NwaCegarLoop]: 1727 mSDtfsCounter, 706 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2493 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 2493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:22,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1870 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 2493 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 01:54:23,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72093 states. [2025-03-08 01:54:23,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72093 to 72071. [2025-03-08 01:54:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72071 states, 72070 states have (on average 1.108491744137644) internal successors, (79889), 72070 states have internal predecessors, (79889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72071 states to 72071 states and 79889 transitions. [2025-03-08 01:54:23,743 INFO L78 Accepts]: Start accepts. Automaton has 72071 states and 79889 transitions. Word has length 405 [2025-03-08 01:54:23,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:23,744 INFO L471 AbstractCegarLoop]: Abstraction has 72071 states and 79889 transitions. [2025-03-08 01:54:23,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:23,744 INFO L276 IsEmpty]: Start isEmpty. Operand 72071 states and 79889 transitions. [2025-03-08 01:54:23,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-08 01:54:23,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:23,751 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:54:23,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 01:54:23,751 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:23,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:23,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1857441275, now seen corresponding path program 1 times [2025-03-08 01:54:23,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:23,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083594875] [2025-03-08 01:54:23,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:23,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:23,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-08 01:54:23,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-08 01:54:23,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:23,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:24,065 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-08 01:54:24,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:24,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083594875] [2025-03-08 01:54:24,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083594875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:24,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:24,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:54:24,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087043839] [2025-03-08 01:54:24,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:24,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:24,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:24,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:24,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:24,067 INFO L87 Difference]: Start difference. First operand 72071 states and 79889 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:26,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:26,874 INFO L93 Difference]: Finished difference Result 157511 states and 175916 transitions. [2025-03-08 01:54:26,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:26,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 500 [2025-03-08 01:54:26,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:26,994 INFO L225 Difference]: With dead ends: 157511 [2025-03-08 01:54:26,994 INFO L226 Difference]: Without dead ends: 86229 [2025-03-08 01:54:27,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:27,025 INFO L435 NwaCegarLoop]: 1620 mSDtfsCounter, 817 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 2409 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 3053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 2409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:27,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 1761 Invalid, 3053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [644 Valid, 2409 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 01:54:27,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86229 states. [2025-03-08 01:54:27,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86229 to 86212. [2025-03-08 01:54:27,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86212 states, 86211 states have (on average 1.0860679031678093) internal successors, (93631), 86211 states have internal predecessors, (93631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:28,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86212 states to 86212 states and 93631 transitions. [2025-03-08 01:54:28,049 INFO L78 Accepts]: Start accepts. Automaton has 86212 states and 93631 transitions. Word has length 500 [2025-03-08 01:54:28,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:28,049 INFO L471 AbstractCegarLoop]: Abstraction has 86212 states and 93631 transitions. [2025-03-08 01:54:28,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:28,050 INFO L276 IsEmpty]: Start isEmpty. Operand 86212 states and 93631 transitions. [2025-03-08 01:54:28,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-03-08 01:54:28,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:28,061 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:54:28,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 01:54:28,061 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:28,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:28,062 INFO L85 PathProgramCache]: Analyzing trace with hash 587682753, now seen corresponding path program 1 times [2025-03-08 01:54:28,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:28,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782888639] [2025-03-08 01:54:28,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:28,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:28,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-08 01:54:28,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-08 01:54:28,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:28,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:28,617 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-08 01:54:28,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:28,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782888639] [2025-03-08 01:54:28,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782888639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:28,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:28,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 01:54:28,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971007101] [2025-03-08 01:54:28,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:28,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:54:28,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:28,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:54:28,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:54:28,618 INFO L87 Difference]: Start difference. First operand 86212 states and 93631 transitions. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:33,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:33,567 INFO L93 Difference]: Finished difference Result 245067 states and 267108 transitions. [2025-03-08 01:54:33,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:54:33,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 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 536 [2025-03-08 01:54:33,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:33,748 INFO L225 Difference]: With dead ends: 245067 [2025-03-08 01:54:33,748 INFO L226 Difference]: Without dead ends: 159644 [2025-03-08 01:54:33,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:54:33,816 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 1722 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 6319 mSolverCounterSat, 1035 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1722 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 7354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1035 IncrementalHoareTripleChecker+Valid, 6319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:33,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1722 Valid, 924 Invalid, 7354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1035 Valid, 6319 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-08 01:54:33,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159644 states. [2025-03-08 01:54:35,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159644 to 131901. [2025-03-08 01:54:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131901 states, 131900 states have (on average 1.0807808946171342) internal successors, (142555), 131900 states have internal predecessors, (142555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:35,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131901 states to 131901 states and 142555 transitions. [2025-03-08 01:54:35,395 INFO L78 Accepts]: Start accepts. Automaton has 131901 states and 142555 transitions. Word has length 536 [2025-03-08 01:54:35,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:35,395 INFO L471 AbstractCegarLoop]: Abstraction has 131901 states and 142555 transitions. [2025-03-08 01:54:35,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:35,396 INFO L276 IsEmpty]: Start isEmpty. Operand 131901 states and 142555 transitions. [2025-03-08 01:54:35,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2025-03-08 01:54:35,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:35,407 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:54:35,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 01:54:35,407 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:35,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:35,408 INFO L85 PathProgramCache]: Analyzing trace with hash -463541877, now seen corresponding path program 1 times [2025-03-08 01:54:35,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:35,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985646683] [2025-03-08 01:54:35,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:35,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:35,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes. [2025-03-08 01:54:35,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements. [2025-03-08 01:54:35,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:35,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:36,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 533 proven. 75 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2025-03-08 01:54:36,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:36,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985646683] [2025-03-08 01:54:36,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985646683] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:54:36,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886732510] [2025-03-08 01:54:36,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:36,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:54:36,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:54:36,004 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:54:36,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 01:54:36,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes. [2025-03-08 01:54:36,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements. [2025-03-08 01:54:36,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:36,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:36,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:54:36,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:54:36,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 533 proven. 0 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2025-03-08 01:54:36,438 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:54:36,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886732510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:36,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:54:36,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-08 01:54:36,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801291671] [2025-03-08 01:54:36,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:36,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:36,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:36,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:36,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:54:36,439 INFO L87 Difference]: Start difference. First operand 131901 states and 142555 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:39,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:39,424 INFO L93 Difference]: Finished difference Result 339535 states and 367613 transitions. [2025-03-08 01:54:39,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:39,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 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 547 [2025-03-08 01:54:39,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:39,671 INFO L225 Difference]: With dead ends: 339535 [2025-03-08 01:54:39,671 INFO L226 Difference]: Without dead ends: 208423 [2025-03-08 01:54:39,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:54:39,776 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 1025 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 2547 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 3009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 2547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:39,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 965 Invalid, 3009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 2547 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 01:54:39,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208423 states. [2025-03-08 01:54:41,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208423 to 205236. [2025-03-08 01:54:42,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205236 states, 205235 states have (on average 1.0682144858333131) internal successors, (219235), 205235 states have internal predecessors, (219235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205236 states to 205236 states and 219235 transitions. [2025-03-08 01:54:42,386 INFO L78 Accepts]: Start accepts. Automaton has 205236 states and 219235 transitions. Word has length 547 [2025-03-08 01:54:42,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:42,387 INFO L471 AbstractCegarLoop]: Abstraction has 205236 states and 219235 transitions. [2025-03-08 01:54:42,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:42,387 INFO L276 IsEmpty]: Start isEmpty. Operand 205236 states and 219235 transitions. [2025-03-08 01:54:42,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2025-03-08 01:54:42,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:42,402 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:54:42,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 01:54:42,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 01:54:42,603 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:42,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:42,604 INFO L85 PathProgramCache]: Analyzing trace with hash -83479354, now seen corresponding path program 1 times [2025-03-08 01:54:42,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:42,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379211015] [2025-03-08 01:54:42,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:42,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:43,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-03-08 01:54:43,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-03-08 01:54:43,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:43,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2025-03-08 01:54:43,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:43,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379211015] [2025-03-08 01:54:43,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379211015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:43,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:43,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:54:43,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080645864] [2025-03-08 01:54:43,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:43,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:43,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:43,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:43,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:43,498 INFO L87 Difference]: Start difference. First operand 205236 states and 219235 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:46,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:46,830 INFO L93 Difference]: Finished difference Result 494678 states and 528772 transitions. [2025-03-08 01:54:46,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:46,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 609 [2025-03-08 01:54:46,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:47,364 INFO L225 Difference]: With dead ends: 494678 [2025-03-08 01:54:47,364 INFO L226 Difference]: Without dead ends: 290231 [2025-03-08 01:54:47,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:47,462 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 953 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 2528 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 3209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:47,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 564 Invalid, 3209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2528 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 01:54:47,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290231 states. [2025-03-08 01:54:49,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290231 to 248517. [2025-03-08 01:54:49,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248517 states, 248516 states have (on average 1.0671506059971994) internal successors, (265204), 248516 states have internal predecessors, (265204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248517 states to 248517 states and 265204 transitions. [2025-03-08 01:54:50,508 INFO L78 Accepts]: Start accepts. Automaton has 248517 states and 265204 transitions. Word has length 609 [2025-03-08 01:54:50,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:50,509 INFO L471 AbstractCegarLoop]: Abstraction has 248517 states and 265204 transitions. [2025-03-08 01:54:50,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 248517 states and 265204 transitions. [2025-03-08 01:54:50,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 963 [2025-03-08 01:54:50,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:50,610 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:54:50,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 01:54:50,611 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:50,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:50,611 INFO L85 PathProgramCache]: Analyzing trace with hash 98446104, now seen corresponding path program 1 times [2025-03-08 01:54:50,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:50,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106458103] [2025-03-08 01:54:50,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:50,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:50,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 962 statements into 1 equivalence classes. [2025-03-08 01:54:50,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 962 of 962 statements. [2025-03-08 01:54:50,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:50,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:51,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2134 backedges. 1325 proven. 0 refuted. 0 times theorem prover too weak. 809 trivial. 0 not checked. [2025-03-08 01:54:51,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:51,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106458103] [2025-03-08 01:54:51,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106458103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:51,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:51,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:54:51,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871856173] [2025-03-08 01:54:51,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:51,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:51,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:51,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:51,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:51,487 INFO L87 Difference]: Start difference. First operand 248517 states and 265204 transitions. Second operand has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:54,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:54,691 INFO L93 Difference]: Finished difference Result 493094 states and 526247 transitions. [2025-03-08 01:54:54,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:54,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 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 962 [2025-03-08 01:54:54,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted.