./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-80.i --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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-80.i -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 331df49ab4a0447b27b0a585123d8827689038cde32f4bb2dec4383418b91892 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:22:48,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:22:48,280 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:22:48,286 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:22:48,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:22:48,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:22:48,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:22:48,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:22:48,312 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:22:48,312 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:22:48,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:22:48,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:22:48,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:22:48,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:22:48,313 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:22:48,313 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:22:48,313 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:22:48,313 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:22:48,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:22:48,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:22:48,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:22:48,313 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:22:48,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:22:48,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:22:48,315 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:22:48,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:22:48,315 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:22:48,315 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:22:48,315 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:22:48,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:22:48,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:22:48,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:22:48,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:22:48,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:22:48,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:22:48,316 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:22:48,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:22:48,316 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:22:48,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:22:48,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:22:48,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:22:48,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:22:48,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:22:48,317 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 -> 331df49ab4a0447b27b0a585123d8827689038cde32f4bb2dec4383418b91892 [2025-03-08 11:22:48,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:22:48,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:22:48,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:22:48,565 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:22:48,565 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:22:48,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-80.i [2025-03-08 11:22:49,651 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/badc593e1/9704c1fd61814ebeb03f110f67874e6e/FLAG465256b30 [2025-03-08 11:22:49,898 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:22:49,899 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-80.i [2025-03-08 11:22:49,909 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/badc593e1/9704c1fd61814ebeb03f110f67874e6e/FLAG465256b30 [2025-03-08 11:22:49,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/badc593e1/9704c1fd61814ebeb03f110f67874e6e [2025-03-08 11:22:49,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:22:49,923 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:22:49,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:22:49,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:22:49,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:22:49,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:22:49" (1/1) ... [2025-03-08 11:22:49,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:49, skipping insertion in model container [2025-03-08 11:22:49,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:22:49" (1/1) ... [2025-03-08 11:22:49,964 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:22:50,059 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-80.i[916,929] [2025-03-08 11:22:50,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:22:50,178 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:22:50,185 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-80.i[916,929] [2025-03-08 11:22:50,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:22:50,258 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:22:50,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:50 WrapperNode [2025-03-08 11:22:50,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:22:50,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:22:50,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:22:50,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:22:50,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:50" (1/1) ... [2025-03-08 11:22:50,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:50" (1/1) ... [2025-03-08 11:22:50,356 INFO L138 Inliner]: procedures = 26, calls = 97, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 751 [2025-03-08 11:22:50,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:22:50,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:22:50,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:22:50,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:22:50,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:50" (1/1) ... [2025-03-08 11:22:50,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:50" (1/1) ... [2025-03-08 11:22:50,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:50" (1/1) ... [2025-03-08 11:22:50,407 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 11:22:50,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:50" (1/1) ... [2025-03-08 11:22:50,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:50" (1/1) ... [2025-03-08 11:22:50,436 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:50" (1/1) ... [2025-03-08 11:22:50,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:50" (1/1) ... [2025-03-08 11:22:50,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:50" (1/1) ... [2025-03-08 11:22:50,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:50" (1/1) ... [2025-03-08 11:22:50,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:22:50,474 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:22:50,475 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:22:50,475 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:22:50,476 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:50" (1/1) ... [2025-03-08 11:22:50,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:22:50,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:22:50,501 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 11:22:50,503 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 11:22:50,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:22:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:22:50,522 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:22:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:22:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:22:50,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:22:50,640 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:22:50,641 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:22:51,529 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-08 11:22:51,529 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:22:51,566 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:22:51,568 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:22:51,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:22:51 BoogieIcfgContainer [2025-03-08 11:22:51,569 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:22:51,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:22:51,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:22:51,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:22:51,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:22:49" (1/3) ... [2025-03-08 11:22:51,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea533ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:22:51, skipping insertion in model container [2025-03-08 11:22:51,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:50" (2/3) ... [2025-03-08 11:22:51,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea533ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:22:51, skipping insertion in model container [2025-03-08 11:22:51,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:22:51" (3/3) ... [2025-03-08 11:22:51,577 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-80.i [2025-03-08 11:22:51,587 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:22:51,590 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-80.i that has 2 procedures, 304 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:22:51,649 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:22:51,660 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;@32947418, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:22:51,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:22:51,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 304 states, 217 states have (on average 1.6221198156682028) internal successors, (352), 218 states have internal predecessors, (352), 84 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 11:22:51,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-03-08 11:22:51,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:51,695 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:22:51,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:51,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:51,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1268947126, now seen corresponding path program 1 times [2025-03-08 11:22:51,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:51,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796540620] [2025-03-08 11:22:51,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:51,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:51,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-03-08 11:22:51,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-03-08 11:22:51,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:51,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:52,347 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 11:22:52,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:52,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796540620] [2025-03-08 11:22:52,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796540620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:52,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:52,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 11:22:52,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163606441] [2025-03-08 11:22:52,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:52,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:22:52,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:52,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:22:52,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:22:52,375 INFO L87 Difference]: Start difference. First operand has 304 states, 217 states have (on average 1.6221198156682028) internal successors, (352), 218 states have internal predecessors, (352), 84 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) Second operand has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:22:52,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:52,448 INFO L93 Difference]: Finished difference Result 602 states and 1119 transitions. [2025-03-08 11:22:52,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:22:52,452 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 568 [2025-03-08 11:22:52,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:52,462 INFO L225 Difference]: With dead ends: 602 [2025-03-08 11:22:52,462 INFO L226 Difference]: Without dead ends: 301 [2025-03-08 11:22:52,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:22:52,469 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:52,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 499 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:22:52,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-08 11:22:52,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2025-03-08 11:22:52,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 215 states have (on average 1.5953488372093023) internal successors, (343), 215 states have internal predecessors, (343), 84 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 11:22:52,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 511 transitions. [2025-03-08 11:22:52,547 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 511 transitions. Word has length 568 [2025-03-08 11:22:52,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:52,550 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 511 transitions. [2025-03-08 11:22:52,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:22:52,551 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 511 transitions. [2025-03-08 11:22:52,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-08 11:22:52,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:52,562 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:22:52,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 11:22:52,562 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:52,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:52,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1221295598, now seen corresponding path program 1 times [2025-03-08 11:22:52,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:52,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560948829] [2025-03-08 11:22:52,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:52,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:52,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-08 11:22:52,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-08 11:22:52,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:52,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:53,075 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 11:22:53,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:53,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560948829] [2025-03-08 11:22:53,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560948829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:53,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:53,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:22:53,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476365074] [2025-03-08 11:22:53,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:53,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:22:53,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:53,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:22:53,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:53,081 INFO L87 Difference]: Start difference. First operand 301 states and 511 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:22:53,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:53,206 INFO L93 Difference]: Finished difference Result 895 states and 1523 transitions. [2025-03-08 11:22:53,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:22:53,207 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), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 569 [2025-03-08 11:22:53,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:53,214 INFO L225 Difference]: With dead ends: 895 [2025-03-08 11:22:53,215 INFO L226 Difference]: Without dead ends: 597 [2025-03-08 11:22:53,217 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 11:22:53,218 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 490 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:53,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1217 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:22:53,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-08 11:22:53,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 418. [2025-03-08 11:22:53,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 332 states have (on average 1.6746987951807228) internal successors, (556), 332 states have internal predecessors, (556), 84 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 11:22:53,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 724 transitions. [2025-03-08 11:22:53,272 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 724 transitions. Word has length 569 [2025-03-08 11:22:53,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:53,273 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 724 transitions. [2025-03-08 11:22:53,273 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), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:22:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 724 transitions. [2025-03-08 11:22:53,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-08 11:22:53,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:53,282 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:22:53,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:22:53,283 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:53,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:53,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1722033934, now seen corresponding path program 1 times [2025-03-08 11:22:53,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:53,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421622426] [2025-03-08 11:22:53,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:53,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:53,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-08 11:22:53,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-08 11:22:53,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:53,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:53,545 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 11:22:53,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:53,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421622426] [2025-03-08 11:22:53,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421622426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:53,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:53,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:22:53,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132828546] [2025-03-08 11:22:53,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:53,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:22:53,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:53,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:22:53,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:53,551 INFO L87 Difference]: Start difference. First operand 418 states and 724 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:22:53,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:53,637 INFO L93 Difference]: Finished difference Result 1165 states and 2029 transitions. [2025-03-08 11:22:53,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:22:53,638 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), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 569 [2025-03-08 11:22:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:53,644 INFO L225 Difference]: With dead ends: 1165 [2025-03-08 11:22:53,646 INFO L226 Difference]: Without dead ends: 750 [2025-03-08 11:22:53,648 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 11:22:53,648 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 355 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:53,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1101 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:22:53,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-03-08 11:22:53,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 747. [2025-03-08 11:22:53,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 623 states have (on average 1.6918138041733548) internal successors, (1054), 624 states have internal predecessors, (1054), 121 states have call successors, (121), 2 states have call predecessors, (121), 2 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) [2025-03-08 11:22:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1296 transitions. [2025-03-08 11:22:53,697 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1296 transitions. Word has length 569 [2025-03-08 11:22:53,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:53,698 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1296 transitions. [2025-03-08 11:22:53,698 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), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:22:53,698 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1296 transitions. [2025-03-08 11:22:53,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-08 11:22:53,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:53,706 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:22:53,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:22:53,706 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:53,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:53,707 INFO L85 PathProgramCache]: Analyzing trace with hash 967857806, now seen corresponding path program 1 times [2025-03-08 11:22:53,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:53,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197772514] [2025-03-08 11:22:53,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:53,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:53,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-08 11:22:53,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-08 11:22:53,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:53,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:53,926 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 11:22:53,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:53,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197772514] [2025-03-08 11:22:53,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197772514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:53,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:53,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:22:53,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684649731] [2025-03-08 11:22:53,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:53,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:22:53,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:53,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:22:53,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:53,930 INFO L87 Difference]: Start difference. First operand 747 states and 1296 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:22:54,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:54,025 INFO L93 Difference]: Finished difference Result 2107 states and 3666 transitions. [2025-03-08 11:22:54,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:22:54,026 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), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 569 [2025-03-08 11:22:54,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:54,036 INFO L225 Difference]: With dead ends: 2107 [2025-03-08 11:22:54,037 INFO L226 Difference]: Without dead ends: 1363 [2025-03-08 11:22:54,039 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 11:22:54,040 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 321 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:54,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 974 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:22:54,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2025-03-08 11:22:54,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1359. [2025-03-08 11:22:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1175 states have (on average 1.702127659574468) internal successors, (2000), 1178 states have internal predecessors, (2000), 179 states have call successors, (179), 4 states have call predecessors, (179), 4 states have return successors, (179), 176 states have call predecessors, (179), 179 states have call successors, (179) [2025-03-08 11:22:54,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2358 transitions. [2025-03-08 11:22:54,110 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2358 transitions. Word has length 569 [2025-03-08 11:22:54,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:54,112 INFO L471 AbstractCegarLoop]: Abstraction has 1359 states and 2358 transitions. [2025-03-08 11:22:54,112 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), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:22:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2358 transitions. [2025-03-08 11:22:54,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-08 11:22:54,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:54,117 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:22:54,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:22:54,117 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:54,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:54,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1497991031, now seen corresponding path program 1 times [2025-03-08 11:22:54,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:54,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994157347] [2025-03-08 11:22:54,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:54,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:54,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-08 11:22:54,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-08 11:22:54,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:54,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 11:22:54,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:54,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994157347] [2025-03-08 11:22:54,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994157347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:54,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:54,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:22:54,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999276119] [2025-03-08 11:22:54,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:54,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:22:54,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:54,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:22:54,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:54,312 INFO L87 Difference]: Start difference. First operand 1359 states and 2358 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:22:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:54,417 INFO L93 Difference]: Finished difference Result 3796 states and 6583 transitions. [2025-03-08 11:22:54,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:22:54,418 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), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 569 [2025-03-08 11:22:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:54,432 INFO L225 Difference]: With dead ends: 3796 [2025-03-08 11:22:54,432 INFO L226 Difference]: Without dead ends: 2440 [2025-03-08 11:22:54,436 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 11:22:54,437 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 356 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:54,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1228 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:22:54,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2440 states. [2025-03-08 11:22:54,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2440 to 2437. [2025-03-08 11:22:54,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2437 states, 2101 states have (on average 1.6811042360780581) internal successors, (3532), 2108 states have internal predecessors, (3532), 327 states have call successors, (327), 8 states have call predecessors, (327), 8 states have return successors, (327), 320 states have call predecessors, (327), 327 states have call successors, (327) [2025-03-08 11:22:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 4186 transitions. [2025-03-08 11:22:54,573 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 4186 transitions. Word has length 569 [2025-03-08 11:22:54,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:54,574 INFO L471 AbstractCegarLoop]: Abstraction has 2437 states and 4186 transitions. [2025-03-08 11:22:54,575 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), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:22:54,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 4186 transitions. [2025-03-08 11:22:54,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-08 11:22:54,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:54,582 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:22:54,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:22:54,582 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:54,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:54,583 INFO L85 PathProgramCache]: Analyzing trace with hash 283508904, now seen corresponding path program 1 times [2025-03-08 11:22:54,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:54,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240908343] [2025-03-08 11:22:54,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:54,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:54,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-08 11:22:54,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-08 11:22:54,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:54,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:54,782 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 11:22:54,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:54,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240908343] [2025-03-08 11:22:54,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240908343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:54,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:54,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:22:54,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934791154] [2025-03-08 11:22:54,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:54,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:22:54,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:54,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:22:54,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:54,788 INFO L87 Difference]: Start difference. First operand 2437 states and 4186 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:22:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:54,947 INFO L93 Difference]: Finished difference Result 7049 states and 12084 transitions. [2025-03-08 11:22:54,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:22:54,948 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), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 569 [2025-03-08 11:22:54,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:54,971 INFO L225 Difference]: With dead ends: 7049 [2025-03-08 11:22:54,971 INFO L226 Difference]: Without dead ends: 4615 [2025-03-08 11:22:54,978 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 11:22:54,979 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 319 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:54,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1044 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:22:54,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4615 states. [2025-03-08 11:22:55,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4615 to 4611. [2025-03-08 11:22:55,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4611 states, 3975 states have (on average 1.671446540880503) internal successors, (6644), 3990 states have internal predecessors, (6644), 619 states have call successors, (619), 16 states have call predecessors, (619), 16 states have return successors, (619), 604 states have call predecessors, (619), 619 states have call successors, (619) [2025-03-08 11:22:55,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4611 states to 4611 states and 7882 transitions. [2025-03-08 11:22:55,180 INFO L78 Accepts]: Start accepts. Automaton has 4611 states and 7882 transitions. Word has length 569 [2025-03-08 11:22:55,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:55,181 INFO L471 AbstractCegarLoop]: Abstraction has 4611 states and 7882 transitions. [2025-03-08 11:22:55,182 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), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:22:55,182 INFO L276 IsEmpty]: Start isEmpty. Operand 4611 states and 7882 transitions. [2025-03-08 11:22:55,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-08 11:22:55,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:55,193 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:22:55,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:22:55,194 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:55,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:55,194 INFO L85 PathProgramCache]: Analyzing trace with hash 727120327, now seen corresponding path program 1 times [2025-03-08 11:22:55,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:55,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041844816] [2025-03-08 11:22:55,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:55,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:55,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-08 11:22:55,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-08 11:22:55,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:55,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 11:22:55,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:55,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041844816] [2025-03-08 11:22:55,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041844816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:55,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:55,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:22:55,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843182028] [2025-03-08 11:22:55,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:55,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:22:55,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:55,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:22:55,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:55,418 INFO L87 Difference]: Start difference. First operand 4611 states and 7882 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:22:55,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:55,626 INFO L93 Difference]: Finished difference Result 11217 states and 19023 transitions. [2025-03-08 11:22:55,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:22:55,627 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), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 569 [2025-03-08 11:22:55,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:55,664 INFO L225 Difference]: With dead ends: 11217 [2025-03-08 11:22:55,664 INFO L226 Difference]: Without dead ends: 6609 [2025-03-08 11:22:55,677 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 11:22:55,678 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 223 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:55,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 983 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:22:55,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6609 states. [2025-03-08 11:22:55,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6609 to 6606. [2025-03-08 11:22:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6606 states, 5361 states have (on average 1.6112665547472487) internal successors, (8638), 5392 states have internal predecessors, (8638), 1212 states have call successors, (1212), 32 states have call predecessors, (1212), 32 states have return successors, (1212), 1181 states have call predecessors, (1212), 1212 states have call successors, (1212) [2025-03-08 11:22:56,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6606 states to 6606 states and 11062 transitions. [2025-03-08 11:22:56,006 INFO L78 Accepts]: Start accepts. Automaton has 6606 states and 11062 transitions. Word has length 569 [2025-03-08 11:22:56,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:56,007 INFO L471 AbstractCegarLoop]: Abstraction has 6606 states and 11062 transitions. [2025-03-08 11:22:56,008 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), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:22:56,008 INFO L276 IsEmpty]: Start isEmpty. Operand 6606 states and 11062 transitions. [2025-03-08 11:22:56,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-08 11:22:56,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:56,019 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:22:56,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:22:56,020 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:56,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:56,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1688734344, now seen corresponding path program 1 times [2025-03-08 11:22:56,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:56,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834314191] [2025-03-08 11:22:56,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:56,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:56,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-08 11:22:56,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-08 11:22:56,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:56,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:56,192 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 11:22:56,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:56,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834314191] [2025-03-08 11:22:56,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834314191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:56,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:56,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:22:56,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523919352] [2025-03-08 11:22:56,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:56,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:22:56,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:56,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:22:56,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:56,197 INFO L87 Difference]: Start difference. First operand 6606 states and 11062 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:22:56,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:56,443 INFO L93 Difference]: Finished difference Result 13221 states and 22130 transitions. [2025-03-08 11:22:56,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:22:56,448 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), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 569 [2025-03-08 11:22:56,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:56,491 INFO L225 Difference]: With dead ends: 13221 [2025-03-08 11:22:56,491 INFO L226 Difference]: Without dead ends: 6618 [2025-03-08 11:22:56,506 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 11:22:56,506 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 301 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:56,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1015 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:22:56,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6618 states. [2025-03-08 11:22:56,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6618 to 5060. [2025-03-08 11:22:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5060 states, 4417 states have (on average 1.64953588408422) internal successors, (7286), 4432 states have internal predecessors, (7286), 624 states have call successors, (624), 18 states have call predecessors, (624), 18 states have return successors, (624), 609 states have call predecessors, (624), 624 states have call successors, (624) [2025-03-08 11:22:56,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5060 states to 5060 states and 8534 transitions. [2025-03-08 11:22:56,702 INFO L78 Accepts]: Start accepts. Automaton has 5060 states and 8534 transitions. Word has length 569 [2025-03-08 11:22:56,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:56,703 INFO L471 AbstractCegarLoop]: Abstraction has 5060 states and 8534 transitions. [2025-03-08 11:22:56,703 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), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:22:56,704 INFO L276 IsEmpty]: Start isEmpty. Operand 5060 states and 8534 transitions. [2025-03-08 11:22:56,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-08 11:22:56,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:56,712 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:22:56,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:22:56,712 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:56,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:56,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1801429255, now seen corresponding path program 1 times [2025-03-08 11:22:56,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:56,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681732131] [2025-03-08 11:22:56,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:56,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:56,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-08 11:22:56,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-08 11:22:56,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:56,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:57,016 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 11:22:57,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:57,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681732131] [2025-03-08 11:22:57,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681732131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:57,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:57,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:22:57,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416003756] [2025-03-08 11:22:57,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:57,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:22:57,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:57,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:22:57,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:22:57,018 INFO L87 Difference]: Start difference. First operand 5060 states and 8534 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:22:57,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:57,288 INFO L93 Difference]: Finished difference Result 15174 states and 25596 transitions. [2025-03-08 11:22:57,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:22:57,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 569 [2025-03-08 11:22:57,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:57,326 INFO L225 Difference]: With dead ends: 15174 [2025-03-08 11:22:57,326 INFO L226 Difference]: Without dead ends: 10117 [2025-03-08 11:22:57,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:22:57,345 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 507 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:57,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1476 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:22:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10117 states. [2025-03-08 11:22:57,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10117 to 5092. [2025-03-08 11:22:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5092 states, 4449 states have (on average 1.644864014385255) internal successors, (7318), 4464 states have internal predecessors, (7318), 624 states have call successors, (624), 18 states have call predecessors, (624), 18 states have return successors, (624), 609 states have call predecessors, (624), 624 states have call successors, (624) [2025-03-08 11:22:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5092 states to 5092 states and 8566 transitions. [2025-03-08 11:22:57,685 INFO L78 Accepts]: Start accepts. Automaton has 5092 states and 8566 transitions. Word has length 569 [2025-03-08 11:22:57,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:57,687 INFO L471 AbstractCegarLoop]: Abstraction has 5092 states and 8566 transitions. [2025-03-08 11:22:57,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:22:57,687 INFO L276 IsEmpty]: Start isEmpty. Operand 5092 states and 8566 transitions. [2025-03-08 11:22:57,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-08 11:22:57,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:57,699 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:22:57,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:22:57,700 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:57,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:57,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1604915750, now seen corresponding path program 1 times [2025-03-08 11:22:57,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:57,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77145328] [2025-03-08 11:22:57,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:57,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:57,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-08 11:22:57,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-08 11:22:57,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:57,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 11:22:58,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:58,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77145328] [2025-03-08 11:22:58,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77145328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:58,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:58,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:22:58,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524795301] [2025-03-08 11:22:58,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:58,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:22:58,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:58,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:22:58,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:58,272 INFO L87 Difference]: Start difference. First operand 5092 states and 8566 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:22:58,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:58,565 INFO L93 Difference]: Finished difference Result 15270 states and 25692 transitions. [2025-03-08 11:22:58,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:22:58,566 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), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 569 [2025-03-08 11:22:58,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:58,593 INFO L225 Difference]: With dead ends: 15270 [2025-03-08 11:22:58,593 INFO L226 Difference]: Without dead ends: 10181 [2025-03-08 11:22:58,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 11:22:58,607 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 282 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:58,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 993 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:22:58,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10181 states. [2025-03-08 11:22:58,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10181 to 10179. [2025-03-08 11:22:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10179 states, 8894 states have (on average 1.6379581740499214) internal successors, (14568), 8924 states have internal predecessors, (14568), 1248 states have call successors, (1248), 36 states have call predecessors, (1248), 36 states have return successors, (1248), 1218 states have call predecessors, (1248), 1248 states have call successors, (1248) [2025-03-08 11:22:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10179 states to 10179 states and 17064 transitions. [2025-03-08 11:22:58,945 INFO L78 Accepts]: Start accepts. Automaton has 10179 states and 17064 transitions. Word has length 569 [2025-03-08 11:22:58,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:58,946 INFO L471 AbstractCegarLoop]: Abstraction has 10179 states and 17064 transitions. [2025-03-08 11:22:58,946 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), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:22:58,946 INFO L276 IsEmpty]: Start isEmpty. Operand 10179 states and 17064 transitions. [2025-03-08 11:22:58,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-08 11:22:58,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:58,955 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:22:58,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:22:58,955 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:58,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:58,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1930511974, now seen corresponding path program 1 times [2025-03-08 11:22:58,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:58,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964644487] [2025-03-08 11:22:58,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:58,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:59,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-08 11:22:59,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-08 11:22:59,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:59,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 11:22:59,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:59,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964644487] [2025-03-08 11:22:59,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964644487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:59,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:59,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:22:59,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544405934] [2025-03-08 11:22:59,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:59,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:22:59,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:59,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:22:59,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:59,167 INFO L87 Difference]: Start difference. First operand 10179 states and 17064 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:22:59,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:59,329 INFO L93 Difference]: Finished difference Result 15236 states and 25515 transitions. [2025-03-08 11:22:59,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:22:59,330 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), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 569 [2025-03-08 11:22:59,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:59,348 INFO L225 Difference]: With dead ends: 15236 [2025-03-08 11:22:59,348 INFO L226 Difference]: Without dead ends: 5060 [2025-03-08 11:22:59,368 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 11:22:59,369 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 0 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:59,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 979 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:22:59,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5060 states. [2025-03-08 11:22:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5060 to 5060. [2025-03-08 11:22:59,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5060 states, 4417 states have (on average 1.6278016753452569) internal successors, (7190), 4432 states have internal predecessors, (7190), 624 states have call successors, (624), 18 states have call predecessors, (624), 18 states have return successors, (624), 609 states have call predecessors, (624), 624 states have call successors, (624) [2025-03-08 11:22:59,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5060 states to 5060 states and 8438 transitions. [2025-03-08 11:22:59,527 INFO L78 Accepts]: Start accepts. Automaton has 5060 states and 8438 transitions. Word has length 569 [2025-03-08 11:22:59,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:59,528 INFO L471 AbstractCegarLoop]: Abstraction has 5060 states and 8438 transitions. [2025-03-08 11:22:59,529 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), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:22:59,529 INFO L276 IsEmpty]: Start isEmpty. Operand 5060 states and 8438 transitions. [2025-03-08 11:22:59,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-08 11:22:59,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:59,537 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:22:59,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:22:59,538 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:59,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:59,538 INFO L85 PathProgramCache]: Analyzing trace with hash -2072308379, now seen corresponding path program 1 times [2025-03-08 11:22:59,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:59,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610979266] [2025-03-08 11:22:59,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:59,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:59,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-08 11:22:59,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-08 11:22:59,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:59,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 11:23:00,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:23:00,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610979266] [2025-03-08 11:23:00,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610979266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:23:00,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:23:00,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:23:00,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769920967] [2025-03-08 11:23:00,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:23:00,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:23:00,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:23:00,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:23:00,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:23:00,236 INFO L87 Difference]: Start difference. First operand 5060 states and 8438 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:23:00,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:23:00,763 INFO L93 Difference]: Finished difference Result 11622 states and 19116 transitions. [2025-03-08 11:23:00,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:23:00,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 571 [2025-03-08 11:23:00,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:23:00,788 INFO L225 Difference]: With dead ends: 11622 [2025-03-08 11:23:00,789 INFO L226 Difference]: Without dead ends: 6445 [2025-03-08 11:23:00,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 11:23:00,802 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 864 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:23:00,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 980 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:23:00,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6445 states. [2025-03-08 11:23:01,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6445 to 6364. [2025-03-08 11:23:01,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6364 states, 5113 states have (on average 1.5386270291414044) internal successors, (7867), 5144 states have internal predecessors, (7867), 1212 states have call successors, (1212), 38 states have call predecessors, (1212), 38 states have return successors, (1212), 1181 states have call predecessors, (1212), 1212 states have call successors, (1212) [2025-03-08 11:23:01,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6364 states to 6364 states and 10291 transitions. [2025-03-08 11:23:01,212 INFO L78 Accepts]: Start accepts. Automaton has 6364 states and 10291 transitions. Word has length 571 [2025-03-08 11:23:01,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:23:01,213 INFO L471 AbstractCegarLoop]: Abstraction has 6364 states and 10291 transitions. [2025-03-08 11:23:01,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:23:01,213 INFO L276 IsEmpty]: Start isEmpty. Operand 6364 states and 10291 transitions. [2025-03-08 11:23:01,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-08 11:23:01,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:23:01,223 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:23:01,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 11:23:01,223 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:23:01,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:23:01,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1440789381, now seen corresponding path program 1 times [2025-03-08 11:23:01,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:23:01,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652884870] [2025-03-08 11:23:01,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:01,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:23:01,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-08 11:23:01,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-08 11:23:01,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:01,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 11:23:01,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:23:01,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652884870] [2025-03-08 11:23:01,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652884870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:23:01,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:23:01,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:23:01,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594563827] [2025-03-08 11:23:01,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:23:01,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:23:01,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:23:01,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:23:01,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:23:01,673 INFO L87 Difference]: Start difference. First operand 6364 states and 10291 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:23:02,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:23:02,329 INFO L93 Difference]: Finished difference Result 14636 states and 23662 transitions. [2025-03-08 11:23:02,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:23:02,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 571 [2025-03-08 11:23:02,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:23:02,360 INFO L225 Difference]: With dead ends: 14636 [2025-03-08 11:23:02,360 INFO L226 Difference]: Without dead ends: 8275 [2025-03-08 11:23:02,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:23:02,376 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 308 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:23:02,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1484 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:23:02,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8275 states. [2025-03-08 11:23:02,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8275 to 8273. [2025-03-08 11:23:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8273 states, 6610 states have (on average 1.5311649016641453) internal successors, (10121), 6649 states have internal predecessors, (10121), 1609 states have call successors, (1609), 53 states have call predecessors, (1609), 53 states have return successors, (1609), 1570 states have call predecessors, (1609), 1609 states have call successors, (1609) [2025-03-08 11:23:02,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8273 states to 8273 states and 13339 transitions. [2025-03-08 11:23:02,771 INFO L78 Accepts]: Start accepts. Automaton has 8273 states and 13339 transitions. Word has length 571 [2025-03-08 11:23:02,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:23:02,772 INFO L471 AbstractCegarLoop]: Abstraction has 8273 states and 13339 transitions. [2025-03-08 11:23:02,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:23:02,773 INFO L276 IsEmpty]: Start isEmpty. Operand 8273 states and 13339 transitions. [2025-03-08 11:23:02,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-08 11:23:02,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:23:02,782 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:23:02,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 11:23:02,783 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:23:02,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:23:02,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1137954340, now seen corresponding path program 1 times [2025-03-08 11:23:02,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:23:02,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708433462] [2025-03-08 11:23:02,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:02,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:23:02,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-08 11:23:02,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-08 11:23:02,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:02,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 11:23:03,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:23:03,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708433462] [2025-03-08 11:23:03,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708433462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:23:03,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:23:03,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:23:03,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363734442] [2025-03-08 11:23:03,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:23:03,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:23:03,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:23:03,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:23:03,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:23:03,365 INFO L87 Difference]: Start difference. First operand 8273 states and 13339 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:23:04,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:23:04,007 INFO L93 Difference]: Finished difference Result 17089 states and 27585 transitions. [2025-03-08 11:23:04,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:23:04,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 571 [2025-03-08 11:23:04,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:23:04,041 INFO L225 Difference]: With dead ends: 17089 [2025-03-08 11:23:04,042 INFO L226 Difference]: Without dead ends: 8885 [2025-03-08 11:23:04,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:23:04,058 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 674 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:23:04,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1588 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:23:04,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8885 states. [2025-03-08 11:23:04,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8885 to 6646. [2025-03-08 11:23:04,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6646 states, 5749 states have (on average 1.5898417116020178) internal successors, (9140), 5768 states have internal predecessors, (9140), 865 states have call successors, (865), 31 states have call predecessors, (865), 31 states have return successors, (865), 846 states have call predecessors, (865), 865 states have call successors, (865) [2025-03-08 11:23:04,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6646 states to 6646 states and 10870 transitions. [2025-03-08 11:23:04,431 INFO L78 Accepts]: Start accepts. Automaton has 6646 states and 10870 transitions. Word has length 571 [2025-03-08 11:23:04,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:23:04,432 INFO L471 AbstractCegarLoop]: Abstraction has 6646 states and 10870 transitions. [2025-03-08 11:23:04,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:23:04,432 INFO L276 IsEmpty]: Start isEmpty. Operand 6646 states and 10870 transitions. [2025-03-08 11:23:04,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-08 11:23:04,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:23:04,444 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:23:04,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 11:23:04,444 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:23:04,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:23:04,445 INFO L85 PathProgramCache]: Analyzing trace with hash 883217795, now seen corresponding path program 1 times [2025-03-08 11:23:04,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:23:04,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819681089] [2025-03-08 11:23:04,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:04,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:23:04,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-08 11:23:04,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-08 11:23:04,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:04,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:04,990 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 11:23:04,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:23:04,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819681089] [2025-03-08 11:23:04,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819681089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:23:04,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:23:04,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:23:04,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820469245] [2025-03-08 11:23:04,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:23:04,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:23:04,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:23:04,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:23:04,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:23:04,992 INFO L87 Difference]: Start difference. First operand 6646 states and 10870 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:23:05,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:23:05,718 INFO L93 Difference]: Finished difference Result 19546 states and 32058 transitions. [2025-03-08 11:23:05,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:23:05,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 571 [2025-03-08 11:23:05,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:23:05,756 INFO L225 Difference]: With dead ends: 19546 [2025-03-08 11:23:05,756 INFO L226 Difference]: Without dead ends: 13001 [2025-03-08 11:23:05,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:23:05,770 INFO L435 NwaCegarLoop]: 1243 mSDtfsCounter, 955 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 2964 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:23:05,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [955 Valid, 2964 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:23:05,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13001 states. [2025-03-08 11:23:06,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13001 to 5564. [2025-03-08 11:23:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5564 states, 5054 states have (on average 1.6325682627621685) internal successors, (8251), 5063 states have internal predecessors, (8251), 489 states have call successors, (489), 20 states have call predecessors, (489), 20 states have return successors, (489), 480 states have call predecessors, (489), 489 states have call successors, (489) [2025-03-08 11:23:06,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5564 states to 5564 states and 9229 transitions. [2025-03-08 11:23:06,044 INFO L78 Accepts]: Start accepts. Automaton has 5564 states and 9229 transitions. Word has length 571 [2025-03-08 11:23:06,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:23:06,045 INFO L471 AbstractCegarLoop]: Abstraction has 5564 states and 9229 transitions. [2025-03-08 11:23:06,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:23:06,045 INFO L276 IsEmpty]: Start isEmpty. Operand 5564 states and 9229 transitions. [2025-03-08 11:23:06,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-08 11:23:06,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:23:06,053 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:23:06,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 11:23:06,053 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:23:06,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:23:06,054 INFO L85 PathProgramCache]: Analyzing trace with hash -113854558, now seen corresponding path program 1 times [2025-03-08 11:23:06,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:23:06,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158343852] [2025-03-08 11:23:06,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:06,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:23:06,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-08 11:23:06,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-08 11:23:06,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:06,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:07,931 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 11:23:07,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:23:07,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158343852] [2025-03-08 11:23:07,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158343852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:23:07,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:23:07,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 11:23:07,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519261832] [2025-03-08 11:23:07,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:23:07,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 11:23:07,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:23:07,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 11:23:07,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-08 11:23:07,934 INFO L87 Difference]: Start difference. First operand 5564 states and 9229 transitions. Second operand has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 15 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:23:17,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:23:17,557 INFO L93 Difference]: Finished difference Result 37811 states and 61899 transitions. [2025-03-08 11:23:17,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 11:23:17,558 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 15 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 571 [2025-03-08 11:23:17,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:23:17,635 INFO L225 Difference]: With dead ends: 37811 [2025-03-08 11:23:17,635 INFO L226 Difference]: Without dead ends: 32341 [2025-03-08 11:23:17,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=283, Invalid=907, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 11:23:17,650 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 9188 mSDsluCounter, 6245 mSDsCounter, 0 mSdLazyCounter, 5488 mSolverCounterSat, 4188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9188 SdHoareTripleChecker+Valid, 7124 SdHoareTripleChecker+Invalid, 9676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4188 IncrementalHoareTripleChecker+Valid, 5488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:23:17,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9188 Valid, 7124 Invalid, 9676 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4188 Valid, 5488 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2025-03-08 11:23:17,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32341 states. [2025-03-08 11:23:18,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32341 to 27868. [2025-03-08 11:23:18,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27868 states, 25246 states have (on average 1.60766061950408) internal successors, (40587), 25294 states have internal predecessors, (40587), 2506 states have call successors, (2506), 115 states have call predecessors, (2506), 115 states have return successors, (2506), 2458 states have call predecessors, (2506), 2506 states have call successors, (2506) [2025-03-08 11:23:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27868 states to 27868 states and 45599 transitions. [2025-03-08 11:23:19,054 INFO L78 Accepts]: Start accepts. Automaton has 27868 states and 45599 transitions. Word has length 571 [2025-03-08 11:23:19,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:23:19,055 INFO L471 AbstractCegarLoop]: Abstraction has 27868 states and 45599 transitions. [2025-03-08 11:23:19,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 15 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:23:19,055 INFO L276 IsEmpty]: Start isEmpty. Operand 27868 states and 45599 transitions. [2025-03-08 11:23:19,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-08 11:23:19,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:23:19,074 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:23:19,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 11:23:19,074 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:23:19,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:23:19,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2123958399, now seen corresponding path program 1 times [2025-03-08 11:23:19,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:23:19,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368037295] [2025-03-08 11:23:19,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:19,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:23:19,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-08 11:23:19,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-08 11:23:19,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:19,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 117 proven. 132 refuted. 0 times theorem prover too weak. 13695 trivial. 0 not checked. [2025-03-08 11:23:19,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:23:19,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368037295] [2025-03-08 11:23:19,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368037295] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:23:19,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790314831] [2025-03-08 11:23:19,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:19,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:23:19,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:23:19,609 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 11:23:19,611 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 11:23:19,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-08 11:23:20,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-08 11:23:20,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:20,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:20,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:23:20,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:23:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 3149 proven. 30 refuted. 0 times theorem prover too weak. 10765 trivial. 0 not checked. [2025-03-08 11:23:20,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:23:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 219 proven. 30 refuted. 0 times theorem prover too weak. 13695 trivial. 0 not checked. [2025-03-08 11:23:20,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790314831] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:23:20,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:23:20,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-08 11:23:20,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041383366] [2025-03-08 11:23:20,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:23:20,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 11:23:20,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:23:20,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 11:23:20,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:23:20,716 INFO L87 Difference]: Start difference. First operand 27868 states and 45599 transitions. Second operand has 9 states, 9 states have (on average 33.22222222222222) internal successors, (299), 9 states have internal predecessors, (299), 4 states have call successors, (138), 2 states have call predecessors, (138), 4 states have return successors, (140), 4 states have call predecessors, (140), 4 states have call successors, (140) [2025-03-08 11:23:21,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:23:21,753 INFO L93 Difference]: Finished difference Result 41794 states and 68383 transitions. [2025-03-08 11:23:21,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 11:23:21,753 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.22222222222222) internal successors, (299), 9 states have internal predecessors, (299), 4 states have call successors, (138), 2 states have call predecessors, (138), 4 states have return successors, (140), 4 states have call predecessors, (140), 4 states have call successors, (140) Word has length 571 [2025-03-08 11:23:21,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:23:21,796 INFO L225 Difference]: With dead ends: 41794 [2025-03-08 11:23:21,796 INFO L226 Difference]: Without dead ends: 14068 [2025-03-08 11:23:21,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1154 GetRequests, 1139 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:23:21,816 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 548 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:23:21,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 946 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 11:23:21,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14068 states. [2025-03-08 11:23:22,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14068 to 13178. [2025-03-08 11:23:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13178 states, 11956 states have (on average 1.588992974238876) internal successors, (18998), 11976 states have internal predecessors, (18998), 1154 states have call successors, (1154), 67 states have call predecessors, (1154), 67 states have return successors, (1154), 1134 states have call predecessors, (1154), 1154 states have call successors, (1154) [2025-03-08 11:23:22,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13178 states to 13178 states and 21306 transitions. [2025-03-08 11:23:22,659 INFO L78 Accepts]: Start accepts. Automaton has 13178 states and 21306 transitions. Word has length 571 [2025-03-08 11:23:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:23:22,660 INFO L471 AbstractCegarLoop]: Abstraction has 13178 states and 21306 transitions. [2025-03-08 11:23:22,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.22222222222222) internal successors, (299), 9 states have internal predecessors, (299), 4 states have call successors, (138), 2 states have call predecessors, (138), 4 states have return successors, (140), 4 states have call predecessors, (140), 4 states have call successors, (140) [2025-03-08 11:23:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 13178 states and 21306 transitions. [2025-03-08 11:23:22,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-08 11:23:22,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:23:22,671 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:23:22,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 11:23:22,871 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,SelfDestructingSolverStorable16 [2025-03-08 11:23:22,872 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:23:22,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:23:22,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1563953898, now seen corresponding path program 1 times [2025-03-08 11:23:22,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:23:22,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311766372] [2025-03-08 11:23:22,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:22,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:23:22,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-08 11:23:22,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-08 11:23:22,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:22,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:23,420 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 11:23:23,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:23:23,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311766372] [2025-03-08 11:23:23,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311766372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:23:23,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:23:23,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 11:23:23,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733203913] [2025-03-08 11:23:23,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:23:23,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 11:23:23,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:23:23,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 11:23:23,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:23:23,423 INFO L87 Difference]: Start difference. First operand 13178 states and 21306 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:23:24,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:23:24,616 INFO L93 Difference]: Finished difference Result 21326 states and 34630 transitions. [2025-03-08 11:23:24,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:23:24,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 574 [2025-03-08 11:23:24,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:23:24,647 INFO L225 Difference]: With dead ends: 21326 [2025-03-08 11:23:24,647 INFO L226 Difference]: Without dead ends: 13747 [2025-03-08 11:23:24,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:23:24,656 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 799 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:23:24,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 1944 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:23:24,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13747 states. [2025-03-08 11:23:25,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13747 to 13742. [2025-03-08 11:23:25,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13742 states, 12449 states have (on average 1.5849465820547834) internal successors, (19731), 12471 states have internal predecessors, (19731), 1222 states have call successors, (1222), 70 states have call predecessors, (1222), 70 states have return successors, (1222), 1200 states have call predecessors, (1222), 1222 states have call successors, (1222) [2025-03-08 11:23:25,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13742 states to 13742 states and 22175 transitions. [2025-03-08 11:23:25,340 INFO L78 Accepts]: Start accepts. Automaton has 13742 states and 22175 transitions. Word has length 574 [2025-03-08 11:23:25,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:23:25,340 INFO L471 AbstractCegarLoop]: Abstraction has 13742 states and 22175 transitions. [2025-03-08 11:23:25,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:23:25,341 INFO L276 IsEmpty]: Start isEmpty. Operand 13742 states and 22175 transitions. [2025-03-08 11:23:25,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-08 11:23:25,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:23:25,349 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:23:25,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 11:23:25,349 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:23:25,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:23:25,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1096974893, now seen corresponding path program 1 times [2025-03-08 11:23:25,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:23:25,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596340487] [2025-03-08 11:23:25,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:25,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:23:25,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-08 11:23:25,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-08 11:23:25,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:25,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:25,770 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 11:23:25,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:23:25,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596340487] [2025-03-08 11:23:25,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596340487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:23:25,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:23:25,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:23:25,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034032364] [2025-03-08 11:23:25,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:23:25,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:23:25,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:23:25,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:23:25,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:23:25,773 INFO L87 Difference]: Start difference. First operand 13742 states and 22175 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:23:26,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:23:26,348 INFO L93 Difference]: Finished difference Result 20218 states and 32865 transitions. [2025-03-08 11:23:26,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:23:26,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 575 [2025-03-08 11:23:26,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:23:26,378 INFO L225 Difference]: With dead ends: 20218 [2025-03-08 11:23:26,378 INFO L226 Difference]: Without dead ends: 16025 [2025-03-08 11:23:26,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 11:23:26,384 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 307 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:23:26,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 1038 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:23:26,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16025 states. [2025-03-08 11:23:27,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16025 to 15757. [2025-03-08 11:23:27,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15757 states, 14262 states have (on average 1.5880661898751929) internal successors, (22649), 14286 states have internal predecessors, (22649), 1412 states have call successors, (1412), 82 states have call predecessors, (1412), 82 states have return successors, (1412), 1388 states have call predecessors, (1412), 1412 states have call successors, (1412) [2025-03-08 11:23:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15757 states to 15757 states and 25473 transitions. [2025-03-08 11:23:27,188 INFO L78 Accepts]: Start accepts. Automaton has 15757 states and 25473 transitions. Word has length 575 [2025-03-08 11:23:27,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:23:27,189 INFO L471 AbstractCegarLoop]: Abstraction has 15757 states and 25473 transitions. [2025-03-08 11:23:27,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:23:27,189 INFO L276 IsEmpty]: Start isEmpty. Operand 15757 states and 25473 transitions. [2025-03-08 11:23:27,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-08 11:23:27,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:23:27,197 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:23:27,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 11:23:27,197 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:23:27,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:23:27,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1272459092, now seen corresponding path program 1 times [2025-03-08 11:23:27,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:23:27,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998696739] [2025-03-08 11:23:27,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:27,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:23:27,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-08 11:23:27,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-08 11:23:27,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:27,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:28,591 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 11:23:28,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:23:28,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998696739] [2025-03-08 11:23:28,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998696739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:23:28,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:23:28,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 11:23:28,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096096983] [2025-03-08 11:23:28,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:23:28,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 11:23:28,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:23:28,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 11:23:28,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:23:28,593 INFO L87 Difference]: Start difference. First operand 15757 states and 25473 transitions. Second operand has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 2 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) [2025-03-08 11:23:31,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:23:31,919 INFO L93 Difference]: Finished difference Result 31245 states and 49831 transitions. [2025-03-08 11:23:31,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:23:31,919 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 2 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) Word has length 575 [2025-03-08 11:23:31,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:23:31,967 INFO L225 Difference]: With dead ends: 31245 [2025-03-08 11:23:31,968 INFO L226 Difference]: Without dead ends: 25078 [2025-03-08 11:23:31,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-08 11:23:31,979 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 1354 mSDsluCounter, 4402 mSDsCounter, 0 mSdLazyCounter, 1988 mSolverCounterSat, 590 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 4916 SdHoareTripleChecker+Invalid, 2578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 590 IncrementalHoareTripleChecker+Valid, 1988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:23:31,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1354 Valid, 4916 Invalid, 2578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [590 Valid, 1988 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 11:23:31,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25078 states. [2025-03-08 11:23:33,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25078 to 23180. [2025-03-08 11:23:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23180 states, 20341 states have (on average 1.5443685167887518) internal successors, (31414), 20394 states have internal predecessors, (31414), 2685 states have call successors, (2685), 153 states have call predecessors, (2685), 153 states have return successors, (2685), 2632 states have call predecessors, (2685), 2685 states have call successors, (2685) [2025-03-08 11:23:33,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23180 states to 23180 states and 36784 transitions. [2025-03-08 11:23:33,703 INFO L78 Accepts]: Start accepts. Automaton has 23180 states and 36784 transitions. Word has length 575 [2025-03-08 11:23:33,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:23:33,703 INFO L471 AbstractCegarLoop]: Abstraction has 23180 states and 36784 transitions. [2025-03-08 11:23:33,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 2 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) [2025-03-08 11:23:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand 23180 states and 36784 transitions. [2025-03-08 11:23:33,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-08 11:23:33,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:23:33,715 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:23:33,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 11:23:33,715 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:23:33,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:23:33,715 INFO L85 PathProgramCache]: Analyzing trace with hash -737644749, now seen corresponding path program 1 times [2025-03-08 11:23:33,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:23:33,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146268120] [2025-03-08 11:23:33,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:33,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:23:33,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-08 11:23:33,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-08 11:23:33,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:33,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 11:23:34,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:23:34,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146268120] [2025-03-08 11:23:34,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146268120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:23:34,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:23:34,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:23:34,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163494708] [2025-03-08 11:23:34,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:23:34,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:23:34,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:23:34,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:23:34,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:23:34,102 INFO L87 Difference]: Start difference. First operand 23180 states and 36784 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:23:38,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:23:38,354 INFO L93 Difference]: Finished difference Result 76618 states and 121144 transitions. [2025-03-08 11:23:38,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:23:38,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 575 [2025-03-08 11:23:38,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:23:38,487 INFO L225 Difference]: With dead ends: 76618 [2025-03-08 11:23:38,487 INFO L226 Difference]: Without dead ends: 53625 [2025-03-08 11:23:38,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:23:38,524 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 814 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 2378 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:23:38,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 2378 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:23:38,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53625 states. [2025-03-08 11:23:40,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53625 to 23180. [2025-03-08 11:23:40,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23180 states, 20341 states have (on average 1.5433852809596382) internal successors, (31394), 20394 states have internal predecessors, (31394), 2685 states have call successors, (2685), 153 states have call predecessors, (2685), 153 states have return successors, (2685), 2632 states have call predecessors, (2685), 2685 states have call successors, (2685) [2025-03-08 11:23:40,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23180 states to 23180 states and 36764 transitions. [2025-03-08 11:23:40,267 INFO L78 Accepts]: Start accepts. Automaton has 23180 states and 36764 transitions. Word has length 575 [2025-03-08 11:23:40,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:23:40,268 INFO L471 AbstractCegarLoop]: Abstraction has 23180 states and 36764 transitions. [2025-03-08 11:23:40,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:23:40,268 INFO L276 IsEmpty]: Start isEmpty. Operand 23180 states and 36764 transitions. [2025-03-08 11:23:40,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-08 11:23:40,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:23:40,278 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:23:40,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 11:23:40,278 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:23:40,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:23:40,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1734717102, now seen corresponding path program 1 times [2025-03-08 11:23:40,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:23:40,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539523000] [2025-03-08 11:23:40,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:40,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:23:40,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-08 11:23:40,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-08 11:23:40,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:40,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:41,525 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 11:23:41,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:23:41,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539523000] [2025-03-08 11:23:41,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539523000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:23:41,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:23:41,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 11:23:41,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126987225] [2025-03-08 11:23:41,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:23:41,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 11:23:41,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:23:41,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 11:23:41,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 11:23:41,527 INFO L87 Difference]: Start difference. First operand 23180 states and 36764 transitions. Second operand has 13 states, 13 states have (on average 12.153846153846153) internal successors, (158), 13 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:23:51,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:23:51,384 INFO L93 Difference]: Finished difference Result 67485 states and 107311 transitions. [2025-03-08 11:23:51,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 11:23:51,388 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.153846153846153) internal successors, (158), 13 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 575 [2025-03-08 11:23:51,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:23:51,501 INFO L225 Difference]: With dead ends: 67485 [2025-03-08 11:23:51,501 INFO L226 Difference]: Without dead ends: 56978 [2025-03-08 11:23:51,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=398, Invalid=1162, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 11:23:51,527 INFO L435 NwaCegarLoop]: 1017 mSDtfsCounter, 7131 mSDsluCounter, 5126 mSDsCounter, 0 mSdLazyCounter, 4500 mSolverCounterSat, 2868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7131 SdHoareTripleChecker+Valid, 6143 SdHoareTripleChecker+Invalid, 7368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2868 IncrementalHoareTripleChecker+Valid, 4500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:23:51,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7131 Valid, 6143 Invalid, 7368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2868 Valid, 4500 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-03-08 11:23:51,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56978 states. [2025-03-08 11:23:54,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56978 to 38608. [2025-03-08 11:23:54,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38608 states, 33950 states have (on average 1.5569661266568484) internal successors, (52859), 34033 states have internal predecessors, (52859), 4371 states have call successors, (4371), 286 states have call predecessors, (4371), 286 states have return successors, (4371), 4288 states have call predecessors, (4371), 4371 states have call successors, (4371) [2025-03-08 11:23:54,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38608 states to 38608 states and 61601 transitions. [2025-03-08 11:23:54,514 INFO L78 Accepts]: Start accepts. Automaton has 38608 states and 61601 transitions. Word has length 575 [2025-03-08 11:23:54,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:23:54,515 INFO L471 AbstractCegarLoop]: Abstraction has 38608 states and 61601 transitions. [2025-03-08 11:23:54,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.153846153846153) internal successors, (158), 13 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 11:23:54,515 INFO L276 IsEmpty]: Start isEmpty. Operand 38608 states and 61601 transitions. [2025-03-08 11:23:54,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-08 11:23:54,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:23:54,531 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:23:54,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 11:23:54,532 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:23:54,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:23:54,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1714379727, now seen corresponding path program 1 times [2025-03-08 11:23:54,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:23:54,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003627764] [2025-03-08 11:23:54,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:54,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:23:54,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-08 11:23:54,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-08 11:23:54,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:54,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:54,981 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 129 proven. 120 refuted. 0 times theorem prover too weak. 13695 trivial. 0 not checked. [2025-03-08 11:23:54,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:23:54,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003627764] [2025-03-08 11:23:54,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003627764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:23:54,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802477542] [2025-03-08 11:23:54,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:54,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:23:54,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:23:54,985 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:23:54,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 11:23:55,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-08 11:23:55,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-08 11:23:55,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:55,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:55,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 1340 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:23:55,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:23:55,496 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 4505 proven. 48 refuted. 0 times theorem prover too weak. 9391 trivial. 0 not checked. [2025-03-08 11:23:55,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:23:55,790 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 201 proven. 48 refuted. 0 times theorem prover too weak. 13695 trivial. 0 not checked. [2025-03-08 11:23:55,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802477542] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:23:55,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:23:55,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-08 11:23:55,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123813792] [2025-03-08 11:23:55,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:23:55,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 11:23:55,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:23:55,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 11:23:55,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:23:55,792 INFO L87 Difference]: Start difference. First operand 38608 states and 61601 transitions. Second operand has 9 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 4 states have call successors, (140), 2 states have call predecessors, (140), 4 states have return successors, (142), 4 states have call predecessors, (142), 4 states have call successors, (142) [2025-03-08 11:23:56,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:23:56,887 INFO L93 Difference]: Finished difference Result 51300 states and 81360 transitions. [2025-03-08 11:23:56,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 11:23:56,887 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 4 states have call successors, (140), 2 states have call predecessors, (140), 4 states have return successors, (142), 4 states have call predecessors, (142), 4 states have call successors, (142) Word has length 575 [2025-03-08 11:23:56,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:23:56,928 INFO L225 Difference]: With dead ends: 51300 [2025-03-08 11:23:56,928 INFO L226 Difference]: Without dead ends: 12819 [2025-03-08 11:23:56,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1162 GetRequests, 1147 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:23:56,973 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 534 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:23:56,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 941 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:23:56,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12819 states. [2025-03-08 11:23:57,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12819 to 12671. [2025-03-08 11:23:57,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12671 states, 11079 states have (on average 1.4785630472064266) internal successors, (16381), 11108 states have internal predecessors, (16381), 1484 states have call successors, (1484), 107 states have call predecessors, (1484), 107 states have return successors, (1484), 1455 states have call predecessors, (1484), 1484 states have call successors, (1484) [2025-03-08 11:23:57,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12671 states to 12671 states and 19349 transitions. [2025-03-08 11:23:57,855 INFO L78 Accepts]: Start accepts. Automaton has 12671 states and 19349 transitions. Word has length 575 [2025-03-08 11:23:57,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:23:57,855 INFO L471 AbstractCegarLoop]: Abstraction has 12671 states and 19349 transitions. [2025-03-08 11:23:57,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 4 states have call successors, (140), 2 states have call predecessors, (140), 4 states have return successors, (142), 4 states have call predecessors, (142), 4 states have call successors, (142) [2025-03-08 11:23:57,856 INFO L276 IsEmpty]: Start isEmpty. Operand 12671 states and 19349 transitions. [2025-03-08 11:23:57,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-03-08 11:23:57,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:23:57,862 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:23:57,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 11:23:58,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-08 11:23:58,063 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:23:58,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:23:58,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1509811926, now seen corresponding path program 1 times [2025-03-08 11:23:58,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:23:58,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116245558] [2025-03-08 11:23:58,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:58,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:23:58,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-03-08 11:23:58,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-03-08 11:23:58,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:58,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 11:24:00,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:00,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116245558] [2025-03-08 11:24:00,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116245558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:00,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:00,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 11:24:00,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879890268] [2025-03-08 11:24:00,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:00,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 11:24:00,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:00,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 11:24:00,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 11:24:00,089 INFO L87 Difference]: Start difference. First operand 12671 states and 19349 transitions. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 2 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84)