./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-45.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_fillercodestructure_filler-pe-ci_file-45.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 bbb30f5a716e95823cb1372888b0a3f5fc4a46205d14c7acf98f1ada42093098 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:48:24,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:48:24,799 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:48:24,805 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:48:24,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:48:24,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:48:24,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:48:24,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:48:24,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:48:24,821 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:48:24,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:48:24,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:48:24,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:48:24,821 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:48:24,821 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:48:24,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:48:24,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:48:24,822 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:48:24,822 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:48:24,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:48:24,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:48:24,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:48:24,822 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:48:24,822 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:48:24,822 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:48:24,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:48:24,823 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:48:24,823 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:48:24,823 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:48:24,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:48:24,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:48:24,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:48:24,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:48:24,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:48:24,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:48:24,823 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:48:24,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:48:24,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:48:24,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:48:24,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:48:24,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:48:24,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:48:24,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:48:24,824 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 -> bbb30f5a716e95823cb1372888b0a3f5fc4a46205d14c7acf98f1ada42093098 [2025-03-17 00:48:25,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:48:25,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:48:25,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:48:25,070 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:48:25,070 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:48:25,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-45.i [2025-03-17 00:48:26,250 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49f7f74df/aeba51b9cef94545b04e7565f61a5f48/FLAG66e52b376 [2025-03-17 00:48:26,502 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:48:26,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-45.i [2025-03-17 00:48:26,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49f7f74df/aeba51b9cef94545b04e7565f61a5f48/FLAG66e52b376 [2025-03-17 00:48:26,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49f7f74df/aeba51b9cef94545b04e7565f61a5f48 [2025-03-17 00:48:26,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:48:26,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:48:26,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:48:26,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:48:26,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:48:26,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:48:26" (1/1) ... [2025-03-17 00:48:26,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3249ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:48:26, skipping insertion in model container [2025-03-17 00:48:26,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:48:26" (1/1) ... [2025-03-17 00:48:26,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:48:26,939 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_fillercodestructure_filler-pe-ci_file-45.i[919,932] [2025-03-17 00:48:26,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:48:26,995 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:48:27,003 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_fillercodestructure_filler-pe-ci_file-45.i[919,932] [2025-03-17 00:48:27,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:48:27,042 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:48:27,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:48:27 WrapperNode [2025-03-17 00:48:27,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:48:27,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:48:27,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:48:27,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:48:27,048 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:48:27" (1/1) ... [2025-03-17 00:48:27,058 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:48:27" (1/1) ... [2025-03-17 00:48:27,104 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2025-03-17 00:48:27,105 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:48:27,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:48:27,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:48:27,106 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:48:27,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:48:27" (1/1) ... [2025-03-17 00:48:27,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:48:27" (1/1) ... [2025-03-17 00:48:27,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:48:27" (1/1) ... [2025-03-17 00:48:27,138 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:48:27,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:48:27" (1/1) ... [2025-03-17 00:48:27,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:48:27" (1/1) ... [2025-03-17 00:48:27,145 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:48:27" (1/1) ... [2025-03-17 00:48:27,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:48:27" (1/1) ... [2025-03-17 00:48:27,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:48:27" (1/1) ... [2025-03-17 00:48:27,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:48:27" (1/1) ... [2025-03-17 00:48:27,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:48:27,158 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:48:27,159 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:48:27,159 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:48:27,160 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:48:27" (1/1) ... [2025-03-17 00:48:27,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:48:27,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:48:27,189 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:48:27,196 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:48:27,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:48:27,214 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:48:27,214 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:48:27,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:48:27,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:48:27,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:48:27,285 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:48:27,287 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:48:27,590 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 00:48:27,591 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:48:27,598 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:48:27,599 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:48:27,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:48:27 BoogieIcfgContainer [2025-03-17 00:48:27,599 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:48:27,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:48:27,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:48:27,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:48:27,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:48:26" (1/3) ... [2025-03-17 00:48:27,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23dac5fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:48:27, skipping insertion in model container [2025-03-17 00:48:27,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:48:27" (2/3) ... [2025-03-17 00:48:27,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23dac5fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:48:27, skipping insertion in model container [2025-03-17 00:48:27,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:48:27" (3/3) ... [2025-03-17 00:48:27,608 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-45.i [2025-03-17 00:48:27,619 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:48:27,623 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-45.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:48:27,664 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:48:27,673 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;@6aa3a31f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:48:27,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:48:27,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 00:48:27,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 00:48:27,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:48:27,686 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:27,687 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:48:27,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:48:27,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1049071209, now seen corresponding path program 1 times [2025-03-17 00:48:27,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:48:27,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603397263] [2025-03-17 00:48:27,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:48:27,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:48:27,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 00:48:27,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 00:48:27,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:48:27,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:48:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 00:48:28,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:48:28,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603397263] [2025-03-17 00:48:28,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603397263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:48:28,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:48:28,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:48:28,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121043263] [2025-03-17 00:48:28,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:48:28,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:48:28,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:48:28,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:48:28,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:48:28,212 INFO L87 Difference]: Start difference. First operand has 79 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:48:28,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:48:28,278 INFO L93 Difference]: Finished difference Result 228 states and 417 transitions. [2025-03-17 00:48:28,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:48:28,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2025-03-17 00:48:28,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:48:28,286 INFO L225 Difference]: With dead ends: 228 [2025-03-17 00:48:28,286 INFO L226 Difference]: Without dead ends: 150 [2025-03-17 00:48:28,289 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:48:28,291 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 109 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:48:28,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 252 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:48:28,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-17 00:48:28,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2025-03-17 00:48:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 93 states have internal predecessors, (125), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 00:48:28,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 229 transitions. [2025-03-17 00:48:28,348 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 229 transitions. Word has length 169 [2025-03-17 00:48:28,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:48:28,350 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 229 transitions. [2025-03-17 00:48:28,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:48:28,350 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 229 transitions. [2025-03-17 00:48:28,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-17 00:48:28,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:48:28,354 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:28,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 00:48:28,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:48:28,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:48:28,355 INFO L85 PathProgramCache]: Analyzing trace with hash 244221585, now seen corresponding path program 1 times [2025-03-17 00:48:28,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:48:28,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405935233] [2025-03-17 00:48:28,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:48:28,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:48:28,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 00:48:28,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 00:48:28,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:48:28,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:48:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 00:48:28,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:48:28,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405935233] [2025-03-17 00:48:28,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405935233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:48:28,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:48:28,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:48:28,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657289590] [2025-03-17 00:48:28,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:48:28,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:48:28,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:48:28,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:48:28,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:48:28,523 INFO L87 Difference]: Start difference. First operand 148 states and 229 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:48:28,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:48:28,583 INFO L93 Difference]: Finished difference Result 339 states and 524 transitions. [2025-03-17 00:48:28,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:48:28,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2025-03-17 00:48:28,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:48:28,587 INFO L225 Difference]: With dead ends: 339 [2025-03-17 00:48:28,587 INFO L226 Difference]: Without dead ends: 192 [2025-03-17 00:48:28,588 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:48:28,590 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 31 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:48:28,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 244 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:48:28,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-17 00:48:28,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 168. [2025-03-17 00:48:28,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 113 states have (on average 1.3716814159292035) internal successors, (155), 113 states have internal predecessors, (155), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 00:48:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 259 transitions. [2025-03-17 00:48:28,618 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 259 transitions. Word has length 170 [2025-03-17 00:48:28,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:48:28,618 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 259 transitions. [2025-03-17 00:48:28,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:48:28,618 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 259 transitions. [2025-03-17 00:48:28,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-17 00:48:28,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:48:28,623 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:28,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:48:28,624 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:48:28,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:48:28,624 INFO L85 PathProgramCache]: Analyzing trace with hash 355643125, now seen corresponding path program 1 times [2025-03-17 00:48:28,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:48:28,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19933183] [2025-03-17 00:48:28,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:48:28,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:48:28,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 00:48:28,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 00:48:28,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:48:28,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:48:36,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 00:48:36,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:48:36,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19933183] [2025-03-17 00:48:36,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19933183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:48:36,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:48:36,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 00:48:36,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689180708] [2025-03-17 00:48:36,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:48:36,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 00:48:36,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:48:36,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 00:48:36,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:48:36,620 INFO L87 Difference]: Start difference. First operand 168 states and 259 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 00:48:38,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:48:38,440 INFO L93 Difference]: Finished difference Result 447 states and 682 transitions. [2025-03-17 00:48:38,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:48:38,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170 [2025-03-17 00:48:38,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:48:38,444 INFO L225 Difference]: With dead ends: 447 [2025-03-17 00:48:38,444 INFO L226 Difference]: Without dead ends: 280 [2025-03-17 00:48:38,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:48:38,445 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 242 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 00:48:38,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 285 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 00:48:38,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-17 00:48:38,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 249. [2025-03-17 00:48:38,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 176 states have (on average 1.3977272727272727) internal successors, (246), 178 states have internal predecessors, (246), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 00:48:38,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 382 transitions. [2025-03-17 00:48:38,480 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 382 transitions. Word has length 170 [2025-03-17 00:48:38,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:48:38,481 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 382 transitions. [2025-03-17 00:48:38,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 00:48:38,481 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 382 transitions. [2025-03-17 00:48:38,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-17 00:48:38,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:48:38,482 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:38,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:48:38,483 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:48:38,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:48:38,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2098453460, now seen corresponding path program 1 times [2025-03-17 00:48:38,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:48:38,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256505246] [2025-03-17 00:48:38,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:48:38,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:48:38,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 00:48:38,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 00:48:38,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:48:38,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:48:48,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 00:48:48,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:48:48,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256505246] [2025-03-17 00:48:48,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256505246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:48:48,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:48:48,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:48:48,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466117693] [2025-03-17 00:48:48,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:48:48,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:48:48,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:48:48,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:48:48,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:48:48,291 INFO L87 Difference]: Start difference. First operand 249 states and 382 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:48:48,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:48:48,788 INFO L93 Difference]: Finished difference Result 680 states and 1036 transitions. [2025-03-17 00:48:48,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:48:48,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2025-03-17 00:48:48,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:48:48,793 INFO L225 Difference]: With dead ends: 680 [2025-03-17 00:48:48,793 INFO L226 Difference]: Without dead ends: 432 [2025-03-17 00:48:48,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:48:48,794 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 146 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:48:48,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 360 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:48:48,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-03-17 00:48:48,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 296. [2025-03-17 00:48:48,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 223 states have (on average 1.4125560538116593) internal successors, (315), 225 states have internal predecessors, (315), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 00:48:48,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 451 transitions. [2025-03-17 00:48:48,835 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 451 transitions. Word has length 170 [2025-03-17 00:48:48,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:48:48,836 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 451 transitions. [2025-03-17 00:48:48,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:48:48,836 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 451 transitions. [2025-03-17 00:48:48,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-17 00:48:48,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:48:48,838 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:48,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:48:48,839 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:48:48,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:48:48,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1863194934, now seen corresponding path program 1 times [2025-03-17 00:48:48,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:48:48,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166635650] [2025-03-17 00:48:48,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:48:48,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:48:48,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 00:48:48,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 00:48:48,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:48:48,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:48:49,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 00:48:49,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:48:49,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166635650] [2025-03-17 00:48:49,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166635650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:48:49,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:48:49,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 00:48:49,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856120832] [2025-03-17 00:48:49,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:48:49,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 00:48:49,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:48:49,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 00:48:49,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:48:49,642 INFO L87 Difference]: Start difference. First operand 296 states and 451 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 00:48:50,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:48:50,327 INFO L93 Difference]: Finished difference Result 744 states and 1126 transitions. [2025-03-17 00:48:50,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:48:50,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170 [2025-03-17 00:48:50,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:48:50,331 INFO L225 Difference]: With dead ends: 744 [2025-03-17 00:48:50,331 INFO L226 Difference]: Without dead ends: 449 [2025-03-17 00:48:50,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:48:50,332 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 232 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:48:50,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 299 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:48:50,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-17 00:48:50,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 232. [2025-03-17 00:48:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 167 states have (on average 1.3832335329341316) internal successors, (231), 168 states have internal predecessors, (231), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 00:48:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 351 transitions. [2025-03-17 00:48:50,365 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 351 transitions. Word has length 170 [2025-03-17 00:48:50,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:48:50,365 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 351 transitions. [2025-03-17 00:48:50,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 00:48:50,366 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 351 transitions. [2025-03-17 00:48:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-17 00:48:50,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:48:50,367 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:50,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:48:50,367 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:48:50,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:48:50,368 INFO L85 PathProgramCache]: Analyzing trace with hash -688962027, now seen corresponding path program 1 times [2025-03-17 00:48:50,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:48:50,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597992877] [2025-03-17 00:48:50,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:48:50,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:48:50,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 00:48:50,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 00:48:50,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:48:50,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:48:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 00:48:51,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:48:51,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597992877] [2025-03-17 00:48:51,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597992877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:48:51,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:48:51,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:48:51,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285713417] [2025-03-17 00:48:51,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:48:51,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:48:51,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:48:51,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:48:51,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:48:51,588 INFO L87 Difference]: Start difference. First operand 232 states and 351 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:48:52,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:48:52,031 INFO L93 Difference]: Finished difference Result 597 states and 897 transitions. [2025-03-17 00:48:52,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:48:52,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2025-03-17 00:48:52,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:48:52,034 INFO L225 Difference]: With dead ends: 597 [2025-03-17 00:48:52,034 INFO L226 Difference]: Without dead ends: 378 [2025-03-17 00:48:52,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:48:52,035 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 127 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:48:52,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 504 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:48:52,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-17 00:48:52,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 232. [2025-03-17 00:48:52,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 167 states have (on average 1.3832335329341316) internal successors, (231), 168 states have internal predecessors, (231), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 00:48:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 351 transitions. [2025-03-17 00:48:52,065 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 351 transitions. Word has length 170 [2025-03-17 00:48:52,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:48:52,066 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 351 transitions. [2025-03-17 00:48:52,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:48:52,066 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 351 transitions. [2025-03-17 00:48:52,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-17 00:48:52,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:48:52,067 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:52,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:48:52,068 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:48:52,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:48:52,068 INFO L85 PathProgramCache]: Analyzing trace with hash 60397171, now seen corresponding path program 1 times [2025-03-17 00:48:52,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:48:52,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726882946] [2025-03-17 00:48:52,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:48:52,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:48:52,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 00:48:52,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 00:48:52,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:48:52,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:48:58,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 00:48:58,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:48:58,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726882946] [2025-03-17 00:48:58,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726882946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:48:58,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:48:58,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:48:58,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823067726] [2025-03-17 00:48:58,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:48:58,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:48:58,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:48:58,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:48:58,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:48:58,747 INFO L87 Difference]: Start difference. First operand 232 states and 351 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:48:59,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:48:59,251 INFO L93 Difference]: Finished difference Result 611 states and 913 transitions. [2025-03-17 00:48:59,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:48:59,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2025-03-17 00:48:59,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:48:59,254 INFO L225 Difference]: With dead ends: 611 [2025-03-17 00:48:59,254 INFO L226 Difference]: Without dead ends: 392 [2025-03-17 00:48:59,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:48:59,255 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 160 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:48:59,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 321 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:48:59,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-17 00:48:59,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 320. [2025-03-17 00:48:59,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 231 states have (on average 1.3722943722943723) internal successors, (317), 234 states have internal predecessors, (317), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 00:48:59,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 477 transitions. [2025-03-17 00:48:59,311 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 477 transitions. Word has length 170 [2025-03-17 00:48:59,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:48:59,311 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 477 transitions. [2025-03-17 00:48:59,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:48:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 477 transitions. [2025-03-17 00:48:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-17 00:48:59,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:48:59,313 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:59,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:48:59,313 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:48:59,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:48:59,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1567948980, now seen corresponding path program 1 times [2025-03-17 00:48:59,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:48:59,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611616592] [2025-03-17 00:48:59,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:48:59,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:48:59,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 00:48:59,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 00:48:59,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:48:59,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:49:00,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 00:49:00,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:49:00,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611616592] [2025-03-17 00:49:00,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611616592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:49:00,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:49:00,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:49:00,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967075389] [2025-03-17 00:49:00,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:49:00,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:49:00,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:49:00,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:49:00,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:49:00,118 INFO L87 Difference]: Start difference. First operand 320 states and 477 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:49:00,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:49:00,594 INFO L93 Difference]: Finished difference Result 692 states and 1026 transitions. [2025-03-17 00:49:00,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:49:00,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2025-03-17 00:49:00,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:49:00,599 INFO L225 Difference]: With dead ends: 692 [2025-03-17 00:49:00,599 INFO L226 Difference]: Without dead ends: 385 [2025-03-17 00:49:00,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:49:00,600 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 132 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:49:00,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 537 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:49:00,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-17 00:49:00,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 303. [2025-03-17 00:49:00,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 214 states have (on average 1.3644859813084111) internal successors, (292), 217 states have internal predecessors, (292), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 00:49:00,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 452 transitions. [2025-03-17 00:49:00,654 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 452 transitions. Word has length 170 [2025-03-17 00:49:00,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:49:00,654 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 452 transitions. [2025-03-17 00:49:00,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:49:00,654 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 452 transitions. [2025-03-17 00:49:00,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 00:49:00,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:49:00,655 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:00,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:49:00,655 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:49:00,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:49:00,656 INFO L85 PathProgramCache]: Analyzing trace with hash 629305712, now seen corresponding path program 1 times [2025-03-17 00:49:00,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:49:00,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925929549] [2025-03-17 00:49:00,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:49:00,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:49:00,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 00:49:00,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 00:49:00,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:49:00,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:49:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 00:49:00,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:49:00,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925929549] [2025-03-17 00:49:00,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925929549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:49:00,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:49:00,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:49:00,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696666071] [2025-03-17 00:49:00,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:49:00,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:49:00,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:49:00,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:49:00,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:49:00,890 INFO L87 Difference]: Start difference. First operand 303 states and 452 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:49:01,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:49:01,021 INFO L93 Difference]: Finished difference Result 727 states and 1062 transitions. [2025-03-17 00:49:01,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:49:01,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-03-17 00:49:01,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:49:01,024 INFO L225 Difference]: With dead ends: 727 [2025-03-17 00:49:01,024 INFO L226 Difference]: Without dead ends: 437 [2025-03-17 00:49:01,025 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:49:01,025 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 91 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:49:01,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 254 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:49:01,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-17 00:49:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 403. [2025-03-17 00:49:01,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 301 states have (on average 1.3588039867109634) internal successors, (409), 308 states have internal predecessors, (409), 88 states have call successors, (88), 13 states have call predecessors, (88), 13 states have return successors, (88), 81 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-17 00:49:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 585 transitions. [2025-03-17 00:49:01,098 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 585 transitions. Word has length 171 [2025-03-17 00:49:01,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:49:01,098 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 585 transitions. [2025-03-17 00:49:01,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:49:01,098 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 585 transitions. [2025-03-17 00:49:01,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 00:49:01,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:49:01,100 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:01,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:49:01,100 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:49:01,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:49:01,101 INFO L85 PathProgramCache]: Analyzing trace with hash 758388431, now seen corresponding path program 1 times [2025-03-17 00:49:01,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:49:01,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419447722] [2025-03-17 00:49:01,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:49:01,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:49:01,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 00:49:01,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 00:49:01,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:49:01,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:49:31,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 00:49:31,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:49:31,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419447722] [2025-03-17 00:49:31,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419447722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:49:31,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:49:31,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 00:49:31,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440420365] [2025-03-17 00:49:31,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:49:31,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 00:49:31,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:49:31,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 00:49:31,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2025-03-17 00:49:31,114 INFO L87 Difference]: Start difference. First operand 403 states and 585 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:49:33,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:49:33,186 INFO L93 Difference]: Finished difference Result 866 states and 1244 transitions. [2025-03-17 00:49:33,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 00:49:33,187 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-03-17 00:49:33,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:49:33,190 INFO L225 Difference]: With dead ends: 866 [2025-03-17 00:49:33,190 INFO L226 Difference]: Without dead ends: 480 [2025-03-17 00:49:33,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-17 00:49:33,191 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 247 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:49:33,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 465 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 00:49:33,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-17 00:49:33,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 445. [2025-03-17 00:49:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 341 states have (on average 1.3372434017595307) internal successors, (456), 348 states have internal predecessors, (456), 88 states have call successors, (88), 15 states have call predecessors, (88), 15 states have return successors, (88), 81 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-17 00:49:33,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 632 transitions. [2025-03-17 00:49:33,279 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 632 transitions. Word has length 171 [2025-03-17 00:49:33,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:49:33,280 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 632 transitions. [2025-03-17 00:49:33,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:49:33,280 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 632 transitions. [2025-03-17 00:49:33,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 00:49:33,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:49:33,281 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:33,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:49:33,281 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:49:33,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:49:33,282 INFO L85 PathProgramCache]: Analyzing trace with hash -2029027056, now seen corresponding path program 1 times [2025-03-17 00:49:33,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:49:33,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970996669] [2025-03-17 00:49:33,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:49:33,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:49:33,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 00:49:33,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 00:49:33,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:49:33,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat