./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 00:30:41,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:30:41,655 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:30:41,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:30:41,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:30:41,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:30:41,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:30:41,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:30:41,683 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:30:41,683 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:30:41,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:30:41,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:30:41,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:30:41,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:30:41,684 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:30:41,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:30:41,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:30:41,684 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:30:41,684 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:30:41,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:30:41,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:30:41,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:30:41,684 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:30:41,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:30:41,685 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:30:41,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:30:41,685 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:30:41,685 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:30:41,685 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:30:41,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:30:41,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:30:41,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:30:41,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:30:41,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:30:41,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:30:41,685 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:30:41,685 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:30:41,685 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:30:41,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:30:41,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:30:41,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:30:41,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:30:41,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:30:41,685 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-17 00:30:41,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:30:41,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:30:41,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:30:41,913 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:30:41,914 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:30:41,915 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-17 00:30:43,120 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63b640ddf/7b16d962ba8f46a8aff72eb517818c0a/FLAG974443c58 [2025-03-17 00:30:43,400 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:30:43,402 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-17 00:30:43,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63b640ddf/7b16d962ba8f46a8aff72eb517818c0a/FLAG974443c58 [2025-03-17 00:30:43,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63b640ddf/7b16d962ba8f46a8aff72eb517818c0a [2025-03-17 00:30:43,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:30:43,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:30:43,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:30:43,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:30:43,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:30:43,438 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:30:43" (1/1) ... [2025-03-17 00:30:43,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e7b9a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:30:43, skipping insertion in model container [2025-03-17 00:30:43,441 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:30:43" (1/1) ... [2025-03-17 00:30:43,466 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:30:43,578 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-17 00:30:43,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:30:43,790 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:30:43,799 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-17 00:30:43,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:30:43,877 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:30:43,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:30:43 WrapperNode [2025-03-17 00:30:43,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:30:43,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:30:43,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:30:43,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:30:43,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:30:43" (1/1) ... [2025-03-17 00:30:43,904 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:30:43" (1/1) ... [2025-03-17 00:30:43,974 INFO L138 Inliner]: procedures = 26, calls = 97, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 751 [2025-03-17 00:30:43,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:30:43,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:30:43,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:30:43,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:30:43,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:30:43" (1/1) ... [2025-03-17 00:30:43,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:30:43" (1/1) ... [2025-03-17 00:30:43,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:30:43" (1/1) ... [2025-03-17 00:30:44,041 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-17 00:30:44,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:30:43" (1/1) ... [2025-03-17 00:30:44,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:30:43" (1/1) ... [2025-03-17 00:30:44,065 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:30:43" (1/1) ... [2025-03-17 00:30:44,069 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:30:43" (1/1) ... [2025-03-17 00:30:44,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:30:43" (1/1) ... [2025-03-17 00:30:44,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:30:43" (1/1) ... [2025-03-17 00:30:44,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:30:44,091 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:30:44,091 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:30:44,091 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:30:44,092 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:30:43" (1/1) ... [2025-03-17 00:30:44,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:30:44,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:30:44,121 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-17 00:30:44,124 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-17 00:30:44,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:30:44,144 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:30:44,144 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:30:44,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:30:44,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:30:44,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:30:44,283 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:30:44,285 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:30:45,208 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-17 00:30:45,208 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:30:45,242 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:30:45,244 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:30:45,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:30:45 BoogieIcfgContainer [2025-03-17 00:30:45,244 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:30:45,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:30:45,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:30:45,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:30:45,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:30:43" (1/3) ... [2025-03-17 00:30:45,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45906c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:30:45, skipping insertion in model container [2025-03-17 00:30:45,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:30:43" (2/3) ... [2025-03-17 00:30:45,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45906c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:30:45, skipping insertion in model container [2025-03-17 00:30:45,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:30:45" (3/3) ... [2025-03-17 00:30:45,253 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-80.i [2025-03-17 00:30:45,267 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:30:45,271 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-80.i that has 2 procedures, 299 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:30:45,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:30:45,344 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;@3c92327b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:30:45,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:30:45,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 299 states, 212 states have (on average 1.6367924528301887) internal successors, (347), 213 states have internal predecessors, (347), 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-17 00:30:45,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2025-03-17 00:30:45,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:30:45,384 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] [2025-03-17 00:30:45,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:30:45,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:30:45,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1896299794, now seen corresponding path program 1 times [2025-03-17 00:30:45,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:30:45,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361949955] [2025-03-17 00:30:45,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:30:45,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:30:45,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 564 statements into 1 equivalence classes. [2025-03-17 00:30:45,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 564 of 564 statements. [2025-03-17 00:30:45,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:30:45,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:30:45,944 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 13778 trivial. 0 not checked. [2025-03-17 00:30:45,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:30:45,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361949955] [2025-03-17 00:30:45,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361949955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:30:45,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371356149] [2025-03-17 00:30:45,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:30:45,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:30:45,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:30:45,949 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-17 00:30:45,951 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-17 00:30:46,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 564 statements into 1 equivalence classes. [2025-03-17 00:30:46,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 564 of 564 statements. [2025-03-17 00:30:46,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:30:46,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:30:46,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:30:46,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:30:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 13778 trivial. 0 not checked. [2025-03-17 00:30:46,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:30:46,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371356149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:30:46,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:30:46,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:30:46,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048401138] [2025-03-17 00:30:46,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:30:46,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:30:46,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:30:46,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:30:46,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:30:46,452 INFO L87 Difference]: Start difference. First operand has 299 states, 212 states have (on average 1.6367924528301887) internal successors, (347), 213 states have internal predecessors, (347), 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 74.5) internal successors, (149), 2 states have internal predecessors, (149), 2 states have call successors, (84), 2 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 2 states have call successors, (84) [2025-03-17 00:30:46,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:30:46,544 INFO L93 Difference]: Finished difference Result 595 states and 1112 transitions. [2025-03-17 00:30:46,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:30:46,548 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 2 states have call successors, (84), 2 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 2 states have call successors, (84) Word has length 564 [2025-03-17 00:30:46,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:30:46,558 INFO L225 Difference]: With dead ends: 595 [2025-03-17 00:30:46,558 INFO L226 Difference]: Without dead ends: 297 [2025-03-17 00:30:46,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 565 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-17 00:30:46,572 INFO L435 NwaCegarLoop]: 495 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, 495 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-17 00:30:46,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 495 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:30:46,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-17 00:30:46,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2025-03-17 00:30:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 211 states have (on average 1.6066350710900474) internal successors, (339), 211 states have internal predecessors, (339), 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-17 00:30:46,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 507 transitions. [2025-03-17 00:30:46,643 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 507 transitions. Word has length 564 [2025-03-17 00:30:46,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:30:46,643 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 507 transitions. [2025-03-17 00:30:46,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 2 states have call successors, (84), 2 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 2 states have call successors, (84) [2025-03-17 00:30:46,644 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 507 transitions. [2025-03-17 00:30:46,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2025-03-17 00:30:46,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:30:46,656 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] [2025-03-17 00:30:46,664 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-17 00:30:46,856 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,SelfDestructingSolverStorable0 [2025-03-17 00:30:46,857 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:30:46,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:30:46,858 INFO L85 PathProgramCache]: Analyzing trace with hash 809664019, now seen corresponding path program 1 times [2025-03-17 00:30:46,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:30:46,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690543803] [2025-03-17 00:30:46,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:30:46,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:30:46,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 565 statements into 1 equivalence classes. [2025-03-17 00:30:47,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 565 of 565 statements. [2025-03-17 00:30:47,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:30:47,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:30:47,437 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-17 00:30:47,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:30:47,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690543803] [2025-03-17 00:30:47,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690543803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:30:47,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:30:47,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:30:47,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60394062] [2025-03-17 00:30:47,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:30:47,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:30:47,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:30:47,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:30:47,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:30:47,443 INFO L87 Difference]: Start difference. First operand 297 states and 507 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-17 00:30:47,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:30:47,613 INFO L93 Difference]: Finished difference Result 887 states and 1515 transitions. [2025-03-17 00:30:47,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:30:47,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 565 [2025-03-17 00:30:47,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:30:47,622 INFO L225 Difference]: With dead ends: 887 [2025-03-17 00:30:47,622 INFO L226 Difference]: Without dead ends: 591 [2025-03-17 00:30:47,624 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-17 00:30:47,625 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 488 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1208 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-17 00:30:47,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1208 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:30:47,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-17 00:30:47,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 414. [2025-03-17 00:30:47,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 328 states have (on average 1.6829268292682926) internal successors, (552), 328 states have internal predecessors, (552), 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-17 00:30:47,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 720 transitions. [2025-03-17 00:30:47,674 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 720 transitions. Word has length 565 [2025-03-17 00:30:47,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:30:47,675 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 720 transitions. [2025-03-17 00:30:47,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-17 00:30:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 720 transitions. [2025-03-17 00:30:47,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2025-03-17 00:30:47,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:30:47,680 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] [2025-03-17 00:30:47,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:30:47,680 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:30:47,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:30:47,682 INFO L85 PathProgramCache]: Analyzing trace with hash -836751117, now seen corresponding path program 1 times [2025-03-17 00:30:47,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:30:47,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564172301] [2025-03-17 00:30:47,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:30:47,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:30:47,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 565 statements into 1 equivalence classes. [2025-03-17 00:30:47,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 565 of 565 statements. [2025-03-17 00:30:47,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:30:47,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:30:48,104 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-17 00:30:48,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:30:48,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564172301] [2025-03-17 00:30:48,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564172301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:30:48,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:30:48,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:30:48,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718704428] [2025-03-17 00:30:48,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:30:48,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:30:48,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:30:48,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:30:48,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:30:48,107 INFO L87 Difference]: Start difference. First operand 414 states and 720 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-17 00:30:48,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:30:48,200 INFO L93 Difference]: Finished difference Result 1157 states and 2021 transitions. [2025-03-17 00:30:48,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:30:48,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 565 [2025-03-17 00:30:48,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:30:48,209 INFO L225 Difference]: With dead ends: 1157 [2025-03-17 00:30:48,211 INFO L226 Difference]: Without dead ends: 744 [2025-03-17 00:30:48,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:30:48,213 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 353 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 1092 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-17 00:30:48,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 1092 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:30:48,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2025-03-17 00:30:48,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 741. [2025-03-17 00:30:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 617 states have (on average 1.6985413290113451) internal successors, (1048), 618 states have internal predecessors, (1048), 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-17 00:30:48,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1290 transitions. [2025-03-17 00:30:48,262 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1290 transitions. Word has length 565 [2025-03-17 00:30:48,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:30:48,265 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1290 transitions. [2025-03-17 00:30:48,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-17 00:30:48,265 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1290 transitions. [2025-03-17 00:30:48,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2025-03-17 00:30:48,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:30:48,271 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] [2025-03-17 00:30:48,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:30:48,271 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:30:48,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:30:48,272 INFO L85 PathProgramCache]: Analyzing trace with hash -138578732, now seen corresponding path program 1 times [2025-03-17 00:30:48,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:30:48,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966799191] [2025-03-17 00:30:48,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:30:48,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:30:48,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 565 statements into 1 equivalence classes. [2025-03-17 00:30:48,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 565 of 565 statements. [2025-03-17 00:30:48,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:30:48,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:30:48,538 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-17 00:30:48,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:30:48,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966799191] [2025-03-17 00:30:48,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966799191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:30:48,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:30:48,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:30:48,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18857616] [2025-03-17 00:30:48,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:30:48,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:30:48,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:30:48,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:30:48,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:30:48,540 INFO L87 Difference]: Start difference. First operand 741 states and 1290 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-17 00:30:48,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:30:48,625 INFO L93 Difference]: Finished difference Result 2093 states and 3652 transitions. [2025-03-17 00:30:48,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:30:48,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 565 [2025-03-17 00:30:48,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:30:48,636 INFO L225 Difference]: With dead ends: 2093 [2025-03-17 00:30:48,637 INFO L226 Difference]: Without dead ends: 1353 [2025-03-17 00:30:48,640 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-17 00:30:48,640 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 317 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 968 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.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:30:48,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 968 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:30:48,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2025-03-17 00:30:48,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1349. [2025-03-17 00:30:48,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1165 states have (on average 1.7081545064377683) internal successors, (1990), 1168 states have internal predecessors, (1990), 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-17 00:30:48,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 2348 transitions. [2025-03-17 00:30:48,696 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 2348 transitions. Word has length 565 [2025-03-17 00:30:48,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:30:48,697 INFO L471 AbstractCegarLoop]: Abstraction has 1349 states and 2348 transitions. [2025-03-17 00:30:48,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-17 00:30:48,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 2348 transitions. [2025-03-17 00:30:48,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2025-03-17 00:30:48,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:30:48,702 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] [2025-03-17 00:30:48,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:30:48,703 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:30:48,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:30:48,703 INFO L85 PathProgramCache]: Analyzing trace with hash -356669575, now seen corresponding path program 1 times [2025-03-17 00:30:48,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:30:48,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619617127] [2025-03-17 00:30:48,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:30:48,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:30:48,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 565 statements into 1 equivalence classes. [2025-03-17 00:30:48,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 565 of 565 statements. [2025-03-17 00:30:48,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:30:48,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:30:48,923 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-17 00:30:48,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:30:48,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619617127] [2025-03-17 00:30:48,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619617127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:30:48,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:30:48,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:30:48,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607289951] [2025-03-17 00:30:48,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:30:48,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:30:48,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:30:48,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:30:48,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:30:48,926 INFO L87 Difference]: Start difference. First operand 1349 states and 2348 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-17 00:30:49,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:30:49,035 INFO L93 Difference]: Finished difference Result 3770 states and 6557 transitions. [2025-03-17 00:30:49,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:30:49,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 565 [2025-03-17 00:30:49,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:30:49,049 INFO L225 Difference]: With dead ends: 3770 [2025-03-17 00:30:49,049 INFO L226 Difference]: Without dead ends: 2422 [2025-03-17 00:30:49,054 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-17 00:30:49,054 INFO L435 NwaCegarLoop]: 748 mSDtfsCounter, 353 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 1220 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-17 00:30:49,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 1220 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:30:49,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2025-03-17 00:30:49,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2419. [2025-03-17 00:30:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2419 states, 2083 states have (on average 1.686989918386942) internal successors, (3514), 2090 states have internal predecessors, (3514), 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-17 00:30:49,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 4168 transitions. [2025-03-17 00:30:49,149 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 4168 transitions. Word has length 565 [2025-03-17 00:30:49,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:30:49,151 INFO L471 AbstractCegarLoop]: Abstraction has 2419 states and 4168 transitions. [2025-03-17 00:30:49,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-17 00:30:49,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 4168 transitions. [2025-03-17 00:30:49,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2025-03-17 00:30:49,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:30:49,160 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] [2025-03-17 00:30:49,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:30:49,160 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:30:49,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:30:49,164 INFO L85 PathProgramCache]: Analyzing trace with hash 947724154, now seen corresponding path program 1 times [2025-03-17 00:30:49,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:30:49,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838373185] [2025-03-17 00:30:49,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:30:49,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:30:49,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 565 statements into 1 equivalence classes. [2025-03-17 00:30:49,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 565 of 565 statements. [2025-03-17 00:30:49,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:30:49,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:30:49,427 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-17 00:30:49,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:30:49,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838373185] [2025-03-17 00:30:49,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838373185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:30:49,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:30:49,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:30:49,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496327600] [2025-03-17 00:30:49,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:30:49,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:30:49,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:30:49,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:30:49,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:30:49,430 INFO L87 Difference]: Start difference. First operand 2419 states and 4168 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-17 00:30:49,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:30:49,607 INFO L93 Difference]: Finished difference Result 6999 states and 12034 transitions. [2025-03-17 00:30:49,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:30:49,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 565 [2025-03-17 00:30:49,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:30:49,632 INFO L225 Difference]: With dead ends: 6999 [2025-03-17 00:30:49,633 INFO L226 Difference]: Without dead ends: 4581 [2025-03-17 00:30:49,640 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-17 00:30:49,641 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 315 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1037 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-17 00:30:49,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1037 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:30:49,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4581 states. [2025-03-17 00:30:49,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4581 to 4577. [2025-03-17 00:30:49,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4577 states, 3941 states have (on average 1.677239279370718) internal successors, (6610), 3956 states have internal predecessors, (6610), 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-17 00:30:49,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4577 states to 4577 states and 7848 transitions. [2025-03-17 00:30:49,835 INFO L78 Accepts]: Start accepts. Automaton has 4577 states and 7848 transitions. Word has length 565 [2025-03-17 00:30:49,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:30:49,836 INFO L471 AbstractCegarLoop]: Abstraction has 4577 states and 7848 transitions. [2025-03-17 00:30:49,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-17 00:30:49,837 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 7848 transitions. [2025-03-17 00:30:49,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2025-03-17 00:30:49,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:30:49,845 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] [2025-03-17 00:30:49,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:30:49,846 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:30:49,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:30:49,846 INFO L85 PathProgramCache]: Analyzing trace with hash -7797125, now seen corresponding path program 1 times [2025-03-17 00:30:49,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:30:49,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737101026] [2025-03-17 00:30:49,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:30:49,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:30:49,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 565 statements into 1 equivalence classes. [2025-03-17 00:30:49,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 565 of 565 statements. [2025-03-17 00:30:49,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:30:49,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:30:50,025 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-17 00:30:50,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:30:50,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737101026] [2025-03-17 00:30:50,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737101026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:30:50,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:30:50,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:30:50,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542111046] [2025-03-17 00:30:50,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:30:50,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:30:50,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:30:50,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:30:50,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:30:50,027 INFO L87 Difference]: Start difference. First operand 4577 states and 7848 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-17 00:30:50,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:30:50,289 INFO L93 Difference]: Finished difference Result 11119 states and 18925 transitions. [2025-03-17 00:30:50,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:30:50,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 565 [2025-03-17 00:30:50,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:30:50,323 INFO L225 Difference]: With dead ends: 11119 [2025-03-17 00:30:50,324 INFO L226 Difference]: Without dead ends: 6543 [2025-03-17 00:30:50,333 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-17 00:30:50,334 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 219 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 977 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-17 00:30:50,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 977 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:30:50,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6543 states. [2025-03-17 00:30:50,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6543 to 6540. [2025-03-17 00:30:50,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6540 states, 5295 states have (on average 1.6188857412653446) internal successors, (8572), 5326 states have internal predecessors, (8572), 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-17 00:30:50,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6540 states to 6540 states and 10996 transitions. [2025-03-17 00:30:50,687 INFO L78 Accepts]: Start accepts. Automaton has 6540 states and 10996 transitions. Word has length 565 [2025-03-17 00:30:50,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:30:50,688 INFO L471 AbstractCegarLoop]: Abstraction has 6540 states and 10996 transitions. [2025-03-17 00:30:50,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-17 00:30:50,689 INFO L276 IsEmpty]: Start isEmpty. Operand 6540 states and 10996 transitions. [2025-03-17 00:30:50,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2025-03-17 00:30:50,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:30:50,702 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] [2025-03-17 00:30:50,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:30:50,702 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:30:50,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:30:50,703 INFO L85 PathProgramCache]: Analyzing trace with hash 23222682, now seen corresponding path program 1 times [2025-03-17 00:30:50,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:30:50,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005089173] [2025-03-17 00:30:50,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:30:50,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:30:50,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 565 statements into 1 equivalence classes. [2025-03-17 00:30:50,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 565 of 565 statements. [2025-03-17 00:30:50,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:30:50,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:30:50,904 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-17 00:30:50,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:30:50,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005089173] [2025-03-17 00:30:50,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005089173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:30:50,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:30:50,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:30:50,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732275196] [2025-03-17 00:30:50,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:30:50,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:30:50,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:30:50,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:30:50,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:30:50,906 INFO L87 Difference]: Start difference. First operand 6540 states and 10996 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-17 00:30:51,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:30:51,216 INFO L93 Difference]: Finished difference Result 13091 states and 22000 transitions. [2025-03-17 00:30:51,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:30:51,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 565 [2025-03-17 00:30:51,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:30:51,272 INFO L225 Difference]: With dead ends: 13091 [2025-03-17 00:30:51,275 INFO L226 Difference]: Without dead ends: 6552 [2025-03-17 00:30:51,291 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-17 00:30:51,292 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 296 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1009 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-17 00:30:51,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1009 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:30:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6552 states. [2025-03-17 00:30:51,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6552 to 5026. [2025-03-17 00:30:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5026 states, 4383 states have (on average 1.6545744923568333) internal successors, (7252), 4398 states have internal predecessors, (7252), 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-17 00:30:51,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5026 states to 5026 states and 8500 transitions. [2025-03-17 00:30:51,581 INFO L78 Accepts]: Start accepts. Automaton has 5026 states and 8500 transitions. Word has length 565 [2025-03-17 00:30:51,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:30:51,583 INFO L471 AbstractCegarLoop]: Abstraction has 5026 states and 8500 transitions. [2025-03-17 00:30:51,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-17 00:30:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 5026 states and 8500 transitions. [2025-03-17 00:30:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2025-03-17 00:30:51,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:30:51,601 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] [2025-03-17 00:30:51,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:30:51,602 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:30:51,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:30:51,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1479338076, now seen corresponding path program 1 times [2025-03-17 00:30:51,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:30:51,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863752957] [2025-03-17 00:30:51,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:30:51,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:30:51,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 565 statements into 1 equivalence classes. [2025-03-17 00:30:51,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 565 of 565 statements. [2025-03-17 00:30:51,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:30:51,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:30:51,948 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-17 00:30:51,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:30:51,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863752957] [2025-03-17 00:30:51,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863752957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:30:51,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:30:51,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:30:51,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961176784] [2025-03-17 00:30:51,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:30:51,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:30:51,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:30:51,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:30:51,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:30:51,950 INFO L87 Difference]: Start difference. First operand 5026 states and 8500 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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-17 00:30:52,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:30:52,309 INFO L93 Difference]: Finished difference Result 15076 states and 25498 transitions. [2025-03-17 00:30:52,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:30:52,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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 565 [2025-03-17 00:30:52,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:30:52,349 INFO L225 Difference]: With dead ends: 15076 [2025-03-17 00:30:52,349 INFO L226 Difference]: Without dead ends: 10051 [2025-03-17 00:30:52,365 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-17 00:30:52,366 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 503 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1466 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-17 00:30:52,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1466 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:30:52,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10051 states. [2025-03-17 00:30:52,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10051 to 5058. [2025-03-17 00:30:52,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5058 states, 4415 states have (on average 1.6498301245753115) internal successors, (7284), 4430 states have internal predecessors, (7284), 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-17 00:30:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5058 states to 5058 states and 8532 transitions. [2025-03-17 00:30:52,642 INFO L78 Accepts]: Start accepts. Automaton has 5058 states and 8532 transitions. Word has length 565 [2025-03-17 00:30:52,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:30:52,643 INFO L471 AbstractCegarLoop]: Abstraction has 5058 states and 8532 transitions. [2025-03-17 00:30:52,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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-17 00:30:52,643 INFO L276 IsEmpty]: Start isEmpty. Operand 5058 states and 8532 transitions. [2025-03-17 00:30:52,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2025-03-17 00:30:52,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:30:52,652 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] [2025-03-17 00:30:52,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:30:52,652 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:30:52,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:30:52,653 INFO L85 PathProgramCache]: Analyzing trace with hash -328116387, now seen corresponding path program 1 times [2025-03-17 00:30:52,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:30:52,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181170959] [2025-03-17 00:30:52,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:30:52,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:30:52,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 565 statements into 1 equivalence classes. [2025-03-17 00:30:52,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 565 of 565 statements. [2025-03-17 00:30:52,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:30:52,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:30:53,172 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-17 00:30:53,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:30:53,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181170959] [2025-03-17 00:30:53,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181170959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:30:53,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:30:53,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:30:53,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308081270] [2025-03-17 00:30:53,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:30:53,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:30:53,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:30:53,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:30:53,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:30:53,174 INFO L87 Difference]: Start difference. First operand 5058 states and 8532 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-17 00:30:53,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:30:53,540 INFO L93 Difference]: Finished difference Result 15172 states and 25594 transitions. [2025-03-17 00:30:53,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:30:53,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 565 [2025-03-17 00:30:53,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:30:53,574 INFO L225 Difference]: With dead ends: 15172 [2025-03-17 00:30:53,574 INFO L226 Difference]: Without dead ends: 10115 [2025-03-17 00:30:53,590 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-17 00:30:53,591 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 281 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 986 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-17 00:30:53,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 986 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:30:53,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10115 states. [2025-03-17 00:30:53,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10115 to 10113. [2025-03-17 00:30:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10113 states, 8828 states have (on average 1.6427276846397825) internal successors, (14502), 8858 states have internal predecessors, (14502), 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-17 00:30:54,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10113 states to 10113 states and 16998 transitions. [2025-03-17 00:30:54,013 INFO L78 Accepts]: Start accepts. Automaton has 10113 states and 16998 transitions. Word has length 565 [2025-03-17 00:30:54,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:30:54,014 INFO L471 AbstractCegarLoop]: Abstraction has 10113 states and 16998 transitions. [2025-03-17 00:30:54,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-17 00:30:54,015 INFO L276 IsEmpty]: Start isEmpty. Operand 10113 states and 16998 transitions. [2025-03-17 00:30:54,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2025-03-17 00:30:54,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:30:54,024 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] [2025-03-17 00:30:54,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:30:54,024 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:30:54,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:30:54,025 INFO L85 PathProgramCache]: Analyzing trace with hash -317613283, now seen corresponding path program 1 times [2025-03-17 00:30:54,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:30:54,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300567716] [2025-03-17 00:30:54,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:30:54,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:30:54,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 565 statements into 1 equivalence classes. [2025-03-17 00:30:54,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 565 of 565 statements. [2025-03-17 00:30:54,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:30:54,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:30:54,272 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-17 00:30:54,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:30:54,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300567716] [2025-03-17 00:30:54,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300567716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:30:54,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:30:54,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:30:54,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115040183] [2025-03-17 00:30:54,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:30:54,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:30:54,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:30:54,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:30:54,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:30:54,274 INFO L87 Difference]: Start difference. First operand 10113 states and 16998 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-17 00:30:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:30:54,529 INFO L93 Difference]: Finished difference Result 15138 states and 25417 transitions. [2025-03-17 00:30:54,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:30:54,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 565 [2025-03-17 00:30:54,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:30:54,551 INFO L225 Difference]: With dead ends: 15138 [2025-03-17 00:30:54,551 INFO L226 Difference]: Without dead ends: 5026 [2025-03-17 00:30:54,575 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-17 00:30:54,576 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 0 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 971 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-17 00:30:54,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 971 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:30:54,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5026 states. [2025-03-17 00:30:54,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5026 to 5026. [2025-03-17 00:30:54,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5026 states, 4383 states have (on average 1.6326716860597763) internal successors, (7156), 4398 states have internal predecessors, (7156), 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-17 00:30:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5026 states to 5026 states and 8404 transitions. [2025-03-17 00:30:54,837 INFO L78 Accepts]: Start accepts. Automaton has 5026 states and 8404 transitions. Word has length 565 [2025-03-17 00:30:54,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:30:54,838 INFO L471 AbstractCegarLoop]: Abstraction has 5026 states and 8404 transitions. [2025-03-17 00:30:54,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-17 00:30:54,838 INFO L276 IsEmpty]: Start isEmpty. Operand 5026 states and 8404 transitions. [2025-03-17 00:30:54,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-03-17 00:30:54,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:30:54,848 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] [2025-03-17 00:30:54,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 00:30:54,848 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:30:54,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:30:54,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1959378556, now seen corresponding path program 1 times [2025-03-17 00:30:54,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:30:54,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058568444] [2025-03-17 00:30:54,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:30:54,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:30:54,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-03-17 00:30:55,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-03-17 00:30:55,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:30:55,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:30:55,584 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-17 00:30:55,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:30:55,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058568444] [2025-03-17 00:30:55,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058568444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:30:55,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:30:55,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:30:55,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291375770] [2025-03-17 00:30:55,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:30:55,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:30:55,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:30:55,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:30:55,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:30:55,585 INFO L87 Difference]: Start difference. First operand 5026 states and 8404 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-17 00:30:56,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:30:56,276 INFO L93 Difference]: Finished difference Result 11524 states and 19018 transitions. [2025-03-17 00:30:56,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:30:56,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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 567 [2025-03-17 00:30:56,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:30:56,302 INFO L225 Difference]: With dead ends: 11524 [2025-03-17 00:30:56,302 INFO L226 Difference]: Without dead ends: 6379 [2025-03-17 00:30:56,319 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-17 00:30:56,320 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 1185 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:30:56,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 852 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:30:56,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6379 states. [2025-03-17 00:30:56,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6379 to 6298. [2025-03-17 00:30:56,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6298 states, 5047 states have (on average 1.5456706954626511) internal successors, (7801), 5078 states have internal predecessors, (7801), 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-17 00:30:56,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6298 states to 6298 states and 10225 transitions. [2025-03-17 00:30:56,701 INFO L78 Accepts]: Start accepts. Automaton has 6298 states and 10225 transitions. Word has length 567 [2025-03-17 00:30:56,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:30:56,702 INFO L471 AbstractCegarLoop]: Abstraction has 6298 states and 10225 transitions. [2025-03-17 00:30:56,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-17 00:30:56,702 INFO L276 IsEmpty]: Start isEmpty. Operand 6298 states and 10225 transitions. [2025-03-17 00:30:56,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-03-17 00:30:56,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:30: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] [2025-03-17 00:30:56,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 00:30:56,712 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:30:56,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:30:56,713 INFO L85 PathProgramCache]: Analyzing trace with hash -282600356, now seen corresponding path program 1 times [2025-03-17 00:30:56,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:30:56,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614366442] [2025-03-17 00:30:56,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:30:56,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:30:56,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-03-17 00:30:56,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-03-17 00:30:56,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:30:56,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:30:57,259 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-17 00:30:57,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:30:57,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614366442] [2025-03-17 00:30:57,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614366442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:30:57,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:30:57,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:30:57,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556620205] [2025-03-17 00:30:57,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:30:57,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:30:57,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:30:57,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:30:57,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:30:57,262 INFO L87 Difference]: Start difference. First operand 6298 states and 10225 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-17 00:30:57,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:30:57,945 INFO L93 Difference]: Finished difference Result 14489 states and 23515 transitions. [2025-03-17 00:30:57,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:30:57,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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 567 [2025-03-17 00:30:57,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:30:57,976 INFO L225 Difference]: With dead ends: 14489 [2025-03-17 00:30:57,976 INFO L226 Difference]: Without dead ends: 8192 [2025-03-17 00:30:57,990 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-17 00:30:57,991 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 303 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1472 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-17 00:30:57,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1472 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:30:57,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8192 states. [2025-03-17 00:30:58,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8192 to 8190. [2025-03-17 00:30:58,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8190 states, 6527 states have (on average 1.5379194116745825) internal successors, (10038), 6566 states have internal predecessors, (10038), 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-17 00:30:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8190 states to 8190 states and 13256 transitions. [2025-03-17 00:30:58,576 INFO L78 Accepts]: Start accepts. Automaton has 8190 states and 13256 transitions. Word has length 567 [2025-03-17 00:30:58,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:30:58,577 INFO L471 AbstractCegarLoop]: Abstraction has 8190 states and 13256 transitions. [2025-03-17 00:30:58,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-17 00:30:58,577 INFO L276 IsEmpty]: Start isEmpty. Operand 8190 states and 13256 transitions. [2025-03-17 00:30:58,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-03-17 00:30:58,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:30:58,590 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] [2025-03-17 00:30:58,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 00:30:58,590 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:30:58,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:30:58,591 INFO L85 PathProgramCache]: Analyzing trace with hash -327844068, now seen corresponding path program 1 times [2025-03-17 00:30:58,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:30:58,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360527564] [2025-03-17 00:30:58,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:30:58,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:30:58,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-03-17 00:30:58,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-03-17 00:30:58,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:30:58,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:30:58,789 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-17 00:30:58,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:30:58,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360527564] [2025-03-17 00:30:58,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360527564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:30:58,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:30:58,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:30:58,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167976670] [2025-03-17 00:30:58,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:30:58,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:30:58,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:30:58,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:30:58,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:30:58,793 INFO L87 Difference]: Start difference. First operand 8190 states and 13256 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-17 00:30:59,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:30:59,162 INFO L93 Difference]: Finished difference Result 16361 states and 26447 transitions. [2025-03-17 00:30:59,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:30:59,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 567 [2025-03-17 00:30:59,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:30:59,194 INFO L225 Difference]: With dead ends: 16361 [2025-03-17 00:30:59,194 INFO L226 Difference]: Without dead ends: 8237 [2025-03-17 00:30:59,211 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-17 00:30:59,212 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 296 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:30:59,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1053 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:30:59,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8237 states. [2025-03-17 00:30:59,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8237 to 6875. [2025-03-17 00:30:59,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6875 states, 5747 states have (on average 1.567774491038803) internal successors, (9010), 5770 states have internal predecessors, (9010), 1081 states have call successors, (1081), 46 states have call predecessors, (1081), 46 states have return successors, (1081), 1058 states have call predecessors, (1081), 1081 states have call successors, (1081) [2025-03-17 00:30:59,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6875 states to 6875 states and 11172 transitions. [2025-03-17 00:30:59,584 INFO L78 Accepts]: Start accepts. Automaton has 6875 states and 11172 transitions. Word has length 567 [2025-03-17 00:30:59,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:30:59,585 INFO L471 AbstractCegarLoop]: Abstraction has 6875 states and 11172 transitions. [2025-03-17 00:30:59,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-17 00:30:59,586 INFO L276 IsEmpty]: Start isEmpty. Operand 6875 states and 11172 transitions. [2025-03-17 00:30:59,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-03-17 00:30:59,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:30:59,594 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] [2025-03-17 00:30:59,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 00:30:59,595 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:30:59,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:30:59,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1093104093, now seen corresponding path program 1 times [2025-03-17 00:30:59,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:30:59,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723506009] [2025-03-17 00:30:59,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:30:59,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:30:59,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-03-17 00:30:59,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-03-17 00:30:59,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:30:59,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:31:00,188 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-17 00:31:00,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:31:00,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723506009] [2025-03-17 00:31:00,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723506009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:31:00,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:31:00,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:31:00,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347373775] [2025-03-17 00:31:00,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:31:00,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:31:00,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:31:00,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:31:00,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:31:00,191 INFO L87 Difference]: Start difference. First operand 6875 states and 11172 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-17 00:31:00,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:31:00,855 INFO L93 Difference]: Finished difference Result 15668 states and 25207 transitions. [2025-03-17 00:31:00,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:31:00,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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 567 [2025-03-17 00:31:00,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:31:00,885 INFO L225 Difference]: With dead ends: 15668 [2025-03-17 00:31:00,886 INFO L226 Difference]: Without dead ends: 8863 [2025-03-17 00:31:00,898 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-17 00:31:00,898 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 684 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:31:00,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1588 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:31:00,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8863 states. [2025-03-17 00:31:01,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8863 to 8444. [2025-03-17 00:31:01,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8444 states, 6726 states have (on average 1.5041629497472495) internal successors, (10117), 6761 states have internal predecessors, (10117), 1645 states have call successors, (1645), 72 states have call predecessors, (1645), 72 states have return successors, (1645), 1610 states have call predecessors, (1645), 1645 states have call successors, (1645) [2025-03-17 00:31:01,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8444 states to 8444 states and 13407 transitions. [2025-03-17 00:31:01,350 INFO L78 Accepts]: Start accepts. Automaton has 8444 states and 13407 transitions. Word has length 567 [2025-03-17 00:31:01,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:31:01,351 INFO L471 AbstractCegarLoop]: Abstraction has 8444 states and 13407 transitions. [2025-03-17 00:31:01,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-17 00:31:01,351 INFO L276 IsEmpty]: Start isEmpty. Operand 8444 states and 13407 transitions. [2025-03-17 00:31:01,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-03-17 00:31:01,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:31:01,360 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] [2025-03-17 00:31:01,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 00:31:01,360 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:31:01,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:31:01,360 INFO L85 PathProgramCache]: Analyzing trace with hash 2054718110, now seen corresponding path program 1 times [2025-03-17 00:31:01,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:31:01,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396331099] [2025-03-17 00:31:01,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:31:01,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:31:01,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-03-17 00:31:01,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-03-17 00:31:01,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:31:01,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:31:01,774 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-17 00:31:01,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:31:01,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396331099] [2025-03-17 00:31:01,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396331099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:31:01,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:31:01,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:31:01,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997995970] [2025-03-17 00:31:01,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:31:01,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:31:01,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:31:01,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:31:01,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:31:01,776 INFO L87 Difference]: Start difference. First operand 8444 states and 13407 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-17 00:31:03,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:31:03,057 INFO L93 Difference]: Finished difference Result 24922 states and 39669 transitions. [2025-03-17 00:31:03,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:31:03,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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 567 [2025-03-17 00:31:03,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:31:03,127 INFO L225 Difference]: With dead ends: 24922 [2025-03-17 00:31:03,128 INFO L226 Difference]: Without dead ends: 16580 [2025-03-17 00:31:03,148 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-17 00:31:03,148 INFO L435 NwaCegarLoop]: 1240 mSDtfsCounter, 945 mSDsluCounter, 1710 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 2950 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-17 00:31:03,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 2950 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:31:03,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16580 states. [2025-03-17 00:31:03,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16580 to 6565. [2025-03-17 00:31:03,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6565 states, 5615 states have (on average 1.5629563668744435) internal successors, (8776), 5632 states have internal predecessors, (8776), 903 states have call successors, (903), 46 states have call predecessors, (903), 46 states have return successors, (903), 886 states have call predecessors, (903), 903 states have call successors, (903) [2025-03-17 00:31:03,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6565 states to 6565 states and 10582 transitions. [2025-03-17 00:31:03,576 INFO L78 Accepts]: Start accepts. Automaton has 6565 states and 10582 transitions. Word has length 567 [2025-03-17 00:31:03,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:31:03,577 INFO L471 AbstractCegarLoop]: Abstraction has 6565 states and 10582 transitions. [2025-03-17 00:31:03,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-17 00:31:03,578 INFO L276 IsEmpty]: Start isEmpty. Operand 6565 states and 10582 transitions. [2025-03-17 00:31:03,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-03-17 00:31:03,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:31:03,588 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] [2025-03-17 00:31:03,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 00:31:03,589 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:31:03,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:31:03,589 INFO L85 PathProgramCache]: Analyzing trace with hash -886939489, now seen corresponding path program 1 times [2025-03-17 00:31:03,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:31:03,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103636163] [2025-03-17 00:31:03,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:31:03,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:31:03,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-03-17 00:31:03,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-03-17 00:31:03,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:31:03,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:31:05,037 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-17 00:31:05,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:31:05,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103636163] [2025-03-17 00:31:05,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103636163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:31:05,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:31:05,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 00:31:05,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389064567] [2025-03-17 00:31:05,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:31:05,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 00:31:05,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:31:05,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 00:31:05,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-17 00:31:05,042 INFO L87 Difference]: Start difference. First operand 6565 states and 10582 transitions. Second operand has 13 states, 13 states have (on average 11.538461538461538) internal successors, (150), 13 states have internal predecessors, (150), 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-17 00:31:14,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:31:14,921 INFO L93 Difference]: Finished difference Result 48341 states and 76133 transitions. [2025-03-17 00:31:14,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 00:31:14,922 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.538461538461538) internal successors, (150), 13 states have internal predecessors, (150), 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 567 [2025-03-17 00:31:14,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:31:15,045 INFO L225 Difference]: With dead ends: 48341 [2025-03-17 00:31:15,045 INFO L226 Difference]: Without dead ends: 41846 [2025-03-17 00:31:15,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2025-03-17 00:31:15,065 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 6748 mSDsluCounter, 4292 mSDsCounter, 0 mSdLazyCounter, 3905 mSolverCounterSat, 2867 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6748 SdHoareTripleChecker+Valid, 4900 SdHoareTripleChecker+Invalid, 6772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2867 IncrementalHoareTripleChecker+Valid, 3905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:31:15,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6748 Valid, 4900 Invalid, 6772 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2867 Valid, 3905 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2025-03-17 00:31:15,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41846 states. [2025-03-17 00:31:17,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41846 to 27246. [2025-03-17 00:31:17,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27246 states, 23393 states have (on average 1.5460607874150387) internal successors, (36167), 23473 states have internal predecessors, (36167), 3672 states have call successors, (3672), 180 states have call predecessors, (3672), 180 states have return successors, (3672), 3592 states have call predecessors, (3672), 3672 states have call successors, (3672) [2025-03-17 00:31:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27246 states to 27246 states and 43511 transitions. [2025-03-17 00:31:17,123 INFO L78 Accepts]: Start accepts. Automaton has 27246 states and 43511 transitions. Word has length 567 [2025-03-17 00:31:17,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:31:17,124 INFO L471 AbstractCegarLoop]: Abstraction has 27246 states and 43511 transitions. [2025-03-17 00:31:17,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.538461538461538) internal successors, (150), 13 states have internal predecessors, (150), 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-17 00:31:17,125 INFO L276 IsEmpty]: Start isEmpty. Operand 27246 states and 43511 transitions. [2025-03-17 00:31:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-03-17 00:31:17,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:31:17,142 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] [2025-03-17 00:31:17,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 00:31:17,142 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:31:17,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:31:17,143 INFO L85 PathProgramCache]: Analyzing trace with hash -536139552, now seen corresponding path program 1 times [2025-03-17 00:31:17,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:31:17,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023276979] [2025-03-17 00:31:17,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:31:17,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:31:17,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-03-17 00:31:17,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-03-17 00:31:17,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:31:17,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:31:17,799 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-17 00:31:17,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:31:17,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023276979] [2025-03-17 00:31:17,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023276979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:31:17,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230425333] [2025-03-17 00:31:17,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:31:17,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:31:17,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:31:17,802 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-17 00:31:17,857 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-17 00:31:18,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-03-17 00:31:18,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-03-17 00:31:18,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:31:18,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:31:18,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 1329 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 00:31:18,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:31:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 7025 proven. 132 refuted. 0 times theorem prover too weak. 6787 trivial. 0 not checked. [2025-03-17 00:31:18,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:31:19,118 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-17 00:31:19,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230425333] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:31:19,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:31:19,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-17 00:31:19,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564049819] [2025-03-17 00:31:19,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:31:19,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:31:19,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:31:19,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:31:19,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:31:19,121 INFO L87 Difference]: Start difference. First operand 27246 states and 43511 transitions. Second operand has 8 states, 8 states have (on average 27.625) internal successors, (221), 8 states have internal predecessors, (221), 3 states have call successors, (172), 2 states have call predecessors, (172), 4 states have return successors, (173), 3 states have call predecessors, (173), 3 states have call successors, (173) [2025-03-17 00:31:20,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:31:20,452 INFO L93 Difference]: Finished difference Result 43546 states and 69378 transitions. [2025-03-17 00:31:20,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 00:31:20,453 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 27.625) internal successors, (221), 8 states have internal predecessors, (221), 3 states have call successors, (172), 2 states have call predecessors, (172), 4 states have return successors, (173), 3 states have call predecessors, (173), 3 states have call successors, (173) Word has length 567 [2025-03-17 00:31:20,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:31:20,515 INFO L225 Difference]: With dead ends: 43546 [2025-03-17 00:31:20,515 INFO L226 Difference]: Without dead ends: 16370 [2025-03-17 00:31:20,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1140 GetRequests, 1131 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:31:20,605 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 835 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:31:20,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 972 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:31:20,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16370 states. [2025-03-17 00:31:21,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16370 to 15448. [2025-03-17 00:31:21,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15448 states, 13089 states have (on average 1.5266254106501642) internal successors, (19982), 13134 states have internal predecessors, (19982), 2228 states have call successors, (2228), 130 states have call predecessors, (2228), 130 states have return successors, (2228), 2183 states have call predecessors, (2228), 2228 states have call successors, (2228) [2025-03-17 00:31:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15448 states to 15448 states and 24438 transitions. [2025-03-17 00:31:21,715 INFO L78 Accepts]: Start accepts. Automaton has 15448 states and 24438 transitions. Word has length 567 [2025-03-17 00:31:21,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:31:21,716 INFO L471 AbstractCegarLoop]: Abstraction has 15448 states and 24438 transitions. [2025-03-17 00:31:21,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.625) internal successors, (221), 8 states have internal predecessors, (221), 3 states have call successors, (172), 2 states have call predecessors, (172), 4 states have return successors, (173), 3 states have call predecessors, (173), 3 states have call successors, (173) [2025-03-17 00:31:21,717 INFO L276 IsEmpty]: Start isEmpty. Operand 15448 states and 24438 transitions. [2025-03-17 00:31:21,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-17 00:31:21,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:31:21,725 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-17 00:31:21,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 00:31:21,929 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,SelfDestructingSolverStorable17 [2025-03-17 00:31:21,930 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:31:21,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:31:21,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1935966070, now seen corresponding path program 1 times [2025-03-17 00:31:21,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:31:21,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094218070] [2025-03-17 00:31:21,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:31:21,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:31:21,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-17 00:31:21,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-17 00:31:21,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:31:21,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:31:22,524 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-17 00:31:22,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:31:22,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094218070] [2025-03-17 00:31:22,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094218070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:31:22,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:31:22,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 00:31:22,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537394753] [2025-03-17 00:31:22,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:31:22,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 00:31:22,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:31:22,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 00:31:22,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:31:22,528 INFO L87 Difference]: Start difference. First operand 15448 states and 24438 transitions. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 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-17 00:31:24,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:31:24,481 INFO L93 Difference]: Finished difference Result 24901 states and 39532 transitions. [2025-03-17 00:31:24,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:31:24,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 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-17 00:31:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:31:24,523 INFO L225 Difference]: With dead ends: 24901 [2025-03-17 00:31:24,524 INFO L226 Difference]: Without dead ends: 15979 [2025-03-17 00:31:24,537 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-17 00:31:24,538 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 610 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:31:24,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 2463 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 00:31:24,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15979 states. [2025-03-17 00:31:25,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15979 to 15448. [2025-03-17 00:31:25,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15448 states, 13089 states have (on average 1.524791809916724) internal successors, (19958), 13134 states have internal predecessors, (19958), 2228 states have call successors, (2228), 130 states have call predecessors, (2228), 130 states have return successors, (2228), 2183 states have call predecessors, (2228), 2228 states have call successors, (2228) [2025-03-17 00:31:25,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15448 states to 15448 states and 24414 transitions. [2025-03-17 00:31:25,449 INFO L78 Accepts]: Start accepts. Automaton has 15448 states and 24414 transitions. Word has length 569 [2025-03-17 00:31:25,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:31:25,450 INFO L471 AbstractCegarLoop]: Abstraction has 15448 states and 24414 transitions. [2025-03-17 00:31:25,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 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-17 00:31:25,450 INFO L276 IsEmpty]: Start isEmpty. Operand 15448 states and 24414 transitions. [2025-03-17 00:31:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-03-17 00:31:25,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:31:25,457 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] [2025-03-17 00:31:25,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 00:31:25,458 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:31:25,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:31:25,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1367862606, now seen corresponding path program 1 times [2025-03-17 00:31:25,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:31:25,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149354355] [2025-03-17 00:31:25,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:31:25,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:31:25,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-17 00:31:25,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-17 00:31:25,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:31:25,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:31:25,848 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-17 00:31:25,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:31:25,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149354355] [2025-03-17 00:31:25,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149354355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:31:25,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:31:25,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:31:25,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656035704] [2025-03-17 00:31:25,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:31:25,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:31:25,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:31:25,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:31:25,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:31:25,850 INFO L87 Difference]: Start difference. First operand 15448 states and 24414 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-17 00:31:27,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:31:27,171 INFO L93 Difference]: Finished difference Result 22928 states and 36489 transitions. [2025-03-17 00:31:27,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:31:27,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 570 [2025-03-17 00:31:27,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:31:27,236 INFO L225 Difference]: With dead ends: 22928 [2025-03-17 00:31:27,237 INFO L226 Difference]: Without dead ends: 18128 [2025-03-17 00:31:27,251 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-17 00:31:27,252 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 308 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1036 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-17 00:31:27,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1036 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:31:27,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18128 states. [2025-03-17 00:31:28,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18128 to 17860. [2025-03-17 00:31:28,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17860 states, 15113 states have (on average 1.5281545689141798) internal successors, (23095), 15162 states have internal predecessors, (23095), 2588 states have call successors, (2588), 158 states have call predecessors, (2588), 158 states have return successors, (2588), 2539 states have call predecessors, (2588), 2588 states have call successors, (2588) [2025-03-17 00:31:28,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17860 states to 17860 states and 28271 transitions. [2025-03-17 00:31:28,425 INFO L78 Accepts]: Start accepts. Automaton has 17860 states and 28271 transitions. Word has length 570 [2025-03-17 00:31:28,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:31:28,426 INFO L471 AbstractCegarLoop]: Abstraction has 17860 states and 28271 transitions. [2025-03-17 00:31:28,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-17 00:31:28,426 INFO L276 IsEmpty]: Start isEmpty. Operand 17860 states and 28271 transitions. [2025-03-17 00:31:28,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-03-17 00:31:28,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:31:28,433 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] [2025-03-17 00:31:28,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 00:31:28,434 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:31:28,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:31:28,434 INFO L85 PathProgramCache]: Analyzing trace with hash -234672013, now seen corresponding path program 1 times [2025-03-17 00:31:28,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:31:28,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880710144] [2025-03-17 00:31:28,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:31:28,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:31:28,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-17 00:31:28,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-17 00:31:28,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:31:28,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:31:28,821 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-17 00:31:28,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:31:28,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880710144] [2025-03-17 00:31:28,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880710144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:31:28,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:31:28,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:31:28,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484629364] [2025-03-17 00:31:28,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:31:28,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:31:28,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:31:28,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:31:28,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:31:28,823 INFO L87 Difference]: Start difference. First operand 17860 states and 28271 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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-17 00:31:30,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:31:30,669 INFO L93 Difference]: Finished difference Result 51931 states and 82773 transitions. [2025-03-17 00:31:30,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:31:30,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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 570 [2025-03-17 00:31:30,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:31:30,773 INFO L225 Difference]: With dead ends: 51931 [2025-03-17 00:31:30,773 INFO L226 Difference]: Without dead ends: 34255 [2025-03-17 00:31:30,818 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-17 00:31:30,820 INFO L435 NwaCegarLoop]: 944 mSDtfsCounter, 807 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 2374 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-17 00:31:30,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 2374 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:31:30,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34255 states. [2025-03-17 00:31:32,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34255 to 17860. [2025-03-17 00:31:32,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17860 states, 15113 states have (on average 1.5278898961159266) internal successors, (23091), 15162 states have internal predecessors, (23091), 2588 states have call successors, (2588), 158 states have call predecessors, (2588), 158 states have return successors, (2588), 2539 states have call predecessors, (2588), 2588 states have call successors, (2588) [2025-03-17 00:31:32,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17860 states to 17860 states and 28267 transitions. [2025-03-17 00:31:32,616 INFO L78 Accepts]: Start accepts. Automaton has 17860 states and 28267 transitions. Word has length 570 [2025-03-17 00:31:32,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:31:32,617 INFO L471 AbstractCegarLoop]: Abstraction has 17860 states and 28267 transitions. [2025-03-17 00:31:32,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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-17 00:31:32,617 INFO L276 IsEmpty]: Start isEmpty. Operand 17860 states and 28267 transitions. [2025-03-17 00:31:32,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-03-17 00:31:32,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:31:32,626 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] [2025-03-17 00:31:32,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 00:31:32,626 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:31:32,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:31:32,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1118637684, now seen corresponding path program 1 times [2025-03-17 00:31:32,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:31:32,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832886288] [2025-03-17 00:31:32,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:31:32,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:31:32,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-17 00:31:32,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-17 00:31:32,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:31:32,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:31:36,181 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-17 00:31:36,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:31:36,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832886288] [2025-03-17 00:31:36,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832886288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:31:36,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:31:36,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-17 00:31:36,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161075777] [2025-03-17 00:31:36,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:31:36,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 00:31:36,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:31:36,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 00:31:36,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2025-03-17 00:31:36,183 INFO L87 Difference]: Start difference. First operand 17860 states and 28267 transitions. Second operand has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 22 states have internal predecessors, (153), 3 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 3 states have call predecessors, (84), 3 states have call successors, (84) [2025-03-17 00:31:50,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:31:50,294 INFO L93 Difference]: Finished difference Result 32888 states and 52203 transitions. [2025-03-17 00:31:50,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 00:31:50,295 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 22 states have internal predecessors, (153), 3 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 3 states have call predecessors, (84), 3 states have call successors, (84) Word has length 570 [2025-03-17 00:31:50,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:31:50,366 INFO L225 Difference]: With dead ends: 32888 [2025-03-17 00:31:50,367 INFO L226 Difference]: Without dead ends: 25790 [2025-03-17 00:31:50,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=512, Invalid=1380, Unknown=0, NotChecked=0, Total=1892 [2025-03-17 00:31:50,390 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 10564 mSDsluCounter, 5466 mSDsCounter, 0 mSdLazyCounter, 6843 mSolverCounterSat, 2339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10564 SdHoareTripleChecker+Valid, 6136 SdHoareTripleChecker+Invalid, 9182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2339 IncrementalHoareTripleChecker+Valid, 6843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:31:50,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10564 Valid, 6136 Invalid, 9182 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2339 Valid, 6843 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2025-03-17 00:31:50,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25790 states. [2025-03-17 00:31:52,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25790 to 22448. [2025-03-17 00:31:52,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22448 states, 18873 states have (on average 1.5230752927462512) internal successors, (28745), 18942 states have internal predecessors, (28745), 3360 states have call successors, (3360), 214 states have call predecessors, (3360), 214 states have return successors, (3360), 3291 states have call predecessors, (3360), 3360 states have call successors, (3360) [2025-03-17 00:31:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22448 states to 22448 states and 35465 transitions. [2025-03-17 00:31:52,139 INFO L78 Accepts]: Start accepts. Automaton has 22448 states and 35465 transitions. Word has length 570 [2025-03-17 00:31:52,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:31:52,140 INFO L471 AbstractCegarLoop]: Abstraction has 22448 states and 35465 transitions. [2025-03-17 00:31:52,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 22 states have internal predecessors, (153), 3 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 3 states have call predecessors, (84), 3 states have call successors, (84) [2025-03-17 00:31:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand 22448 states and 35465 transitions. [2025-03-17 00:31:52,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-03-17 00:31:52,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:31:52,152 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] [2025-03-17 00:31:52,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 00:31:52,152 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:31:52,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:31:52,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2144129683, now seen corresponding path program 1 times [2025-03-17 00:31:52,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:31:52,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121968905] [2025-03-17 00:31:52,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:31:52,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:31:52,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-17 00:31:52,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-17 00:31:52,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:31:52,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat