./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-65.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 31da68eea262c34083df1fad46a5753e80d18ad2f5e3cbbafbfb2efef5c55c33 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:00:36,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:00:36,810 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:00:36,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:00:36,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:00:36,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:00:36,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:00:36,838 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:00:36,838 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:00:36,838 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:00:36,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:00:36,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:00:36,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:00:36,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:00:36,839 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:00:36,839 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:00:36,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:00:36,839 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:00:36,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:00:36,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:00:36,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:00:36,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:00:36,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:00:36,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:00:36,840 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:00:36,840 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:00:36,840 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:00:36,840 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:00:36,840 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:00:36,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:00:36,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:00:36,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:00:36,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:00:36,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:00:36,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:00:36,841 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:00:36,841 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:00:36,841 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:00:36,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:00:36,841 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:00:36,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:00:36,841 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:00:36,841 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:00:36,841 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 -> 31da68eea262c34083df1fad46a5753e80d18ad2f5e3cbbafbfb2efef5c55c33 [2025-03-08 11:00:37,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:00:37,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:00:37,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:00:37,080 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:00:37,080 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:00:37,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-65.i [2025-03-08 11:00:38,237 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b724843ee/7d31c64ec2494babaa0ed33d13b91352/FLAGa88d97541 [2025-03-08 11:00:38,518 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:00:38,519 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-65.i [2025-03-08 11:00:38,531 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b724843ee/7d31c64ec2494babaa0ed33d13b91352/FLAGa88d97541 [2025-03-08 11:00:38,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b724843ee/7d31c64ec2494babaa0ed33d13b91352 [2025-03-08 11:00:38,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:00:38,820 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:00:38,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:00:38,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:00:38,824 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:00:38,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:00:38" (1/1) ... [2025-03-08 11:00:38,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9801bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:38, skipping insertion in model container [2025-03-08 11:00:38,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:00:38" (1/1) ... [2025-03-08 11:00:38,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:00:38,960 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-65.i[916,929] [2025-03-08 11:00:39,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:00:39,066 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:00:39,073 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-65.i[916,929] [2025-03-08 11:00:39,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:00:39,139 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:00:39,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:39 WrapperNode [2025-03-08 11:00:39,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:00:39,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:00:39,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:00:39,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:00:39,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:39" (1/1) ... [2025-03-08 11:00:39,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:39" (1/1) ... [2025-03-08 11:00:39,205 INFO L138 Inliner]: procedures = 26, calls = 83, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 569 [2025-03-08 11:00:39,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:00:39,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:00:39,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:00:39,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:00:39,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:39" (1/1) ... [2025-03-08 11:00:39,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:39" (1/1) ... [2025-03-08 11:00:39,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:39" (1/1) ... [2025-03-08 11:00:39,256 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:00:39,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:39" (1/1) ... [2025-03-08 11:00:39,257 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:39" (1/1) ... [2025-03-08 11:00:39,276 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:39" (1/1) ... [2025-03-08 11:00:39,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:39" (1/1) ... [2025-03-08 11:00:39,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:39" (1/1) ... [2025-03-08 11:00:39,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:39" (1/1) ... [2025-03-08 11:00:39,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:00:39,300 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:00:39,301 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:00:39,301 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:00:39,301 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:39" (1/1) ... [2025-03-08 11:00:39,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:00:39,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:00:39,330 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:00:39,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:00:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:00:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:00:39,352 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:00:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:00:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:00:39,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:00:39,438 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:00:39,440 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:00:40,025 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L449: havoc property_#t~bitwise53#1;havoc property_#t~short54#1;havoc property_#t~bitwise55#1;havoc property_#t~short56#1; [2025-03-08 11:00:40,116 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-08 11:00:40,117 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:00:40,147 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:00:40,147 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:00:40,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:00:40 BoogieIcfgContainer [2025-03-08 11:00:40,148 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:00:40,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:00:40,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:00:40,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:00:40,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:00:38" (1/3) ... [2025-03-08 11:00:40,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8685e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:00:40, skipping insertion in model container [2025-03-08 11:00:40,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:39" (2/3) ... [2025-03-08 11:00:40,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8685e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:00:40, skipping insertion in model container [2025-03-08 11:00:40,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:00:40" (3/3) ... [2025-03-08 11:00:40,154 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-65.i [2025-03-08 11:00:40,164 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:00:40,167 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-65.i that has 2 procedures, 231 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:00:40,211 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:00:40,222 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;@5e423383, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:00:40,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:00:40,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 231 states, 158 states have (on average 1.5506329113924051) internal successors, (245), 159 states have internal predecessors, (245), 70 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 11:00:40,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-08 11:00:40,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:40,252 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:00:40,252 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:40,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:40,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1583439552, now seen corresponding path program 1 times [2025-03-08 11:00:40,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:40,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263183721] [2025-03-08 11:00:40,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:40,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:40,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-08 11:00:40,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-08 11:00:40,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:40,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 9522 trivial. 0 not checked. [2025-03-08 11:00:40,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:40,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263183721] [2025-03-08 11:00:40,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263183721] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:00:40,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392225152] [2025-03-08 11:00:40,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:40,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:00:40,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:00:40,765 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:00:40,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:00:40,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-08 11:00:41,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-08 11:00:41,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:41,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:41,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:00:41,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:00:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 9522 trivial. 0 not checked. [2025-03-08 11:00:41,091 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:00:41,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392225152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:41,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:00:41,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:00:41,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817924482] [2025-03-08 11:00:41,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:41,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:00:41,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:41,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:00:41,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:00:41,117 INFO L87 Difference]: Start difference. First operand has 231 states, 158 states have (on average 1.5506329113924051) internal successors, (245), 159 states have internal predecessors, (245), 70 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) Second operand has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 2 states have call successors, (70), 2 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 2 states have call successors, (70) [2025-03-08 11:00:41,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:41,164 INFO L93 Difference]: Finished difference Result 454 states and 833 transitions. [2025-03-08 11:00:41,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:00:41,167 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 2 states have call successors, (70), 2 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 2 states have call successors, (70) Word has length 454 [2025-03-08 11:00:41,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:41,175 INFO L225 Difference]: With dead ends: 454 [2025-03-08 11:00:41,176 INFO L226 Difference]: Without dead ends: 226 [2025-03-08 11:00:41,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:00:41,184 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:41,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 364 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:00:41,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-08 11:00:41,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2025-03-08 11:00:41,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 154 states have (on average 1.5064935064935066) internal successors, (232), 154 states have internal predecessors, (232), 70 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 11:00:41,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 372 transitions. [2025-03-08 11:00:41,238 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 372 transitions. Word has length 454 [2025-03-08 11:00:41,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:41,240 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 372 transitions. [2025-03-08 11:00:41,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 2 states have call successors, (70), 2 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 2 states have call successors, (70) [2025-03-08 11:00:41,240 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 372 transitions. [2025-03-08 11:00:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-08 11:00:41,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:41,248 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:00:41,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 11:00:41,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:00:41,449 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:41,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:41,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1166702097, now seen corresponding path program 1 times [2025-03-08 11:00:41,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:41,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352933802] [2025-03-08 11:00:41,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:41,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:41,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-08 11:00:41,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-08 11:00:41,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:41,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:41,846 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-08 11:00:41,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:41,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352933802] [2025-03-08 11:00:41,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352933802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:41,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:41,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:00:41,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455131921] [2025-03-08 11:00:41,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:41,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:00:41,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:41,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:00:41,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:00:41,853 INFO L87 Difference]: Start difference. First operand 226 states and 372 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:00:41,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:41,951 INFO L93 Difference]: Finished difference Result 587 states and 971 transitions. [2025-03-08 11:00:41,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:00:41,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 455 [2025-03-08 11:00:41,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:41,957 INFO L225 Difference]: With dead ends: 587 [2025-03-08 11:00:41,958 INFO L226 Difference]: Without dead ends: 364 [2025-03-08 11:00:41,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:00:41,960 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 212 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:41,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 844 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:00:41,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-08 11:00:42,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2025-03-08 11:00:42,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 264 states have (on average 1.5378787878787878) internal successors, (406), 265 states have internal predecessors, (406), 94 states have call successors, (94), 2 states have call predecessors, (94), 2 states have return successors, (94), 93 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-08 11:00:42,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 594 transitions. [2025-03-08 11:00:42,007 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 594 transitions. Word has length 455 [2025-03-08 11:00:42,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:42,011 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 594 transitions. [2025-03-08 11:00:42,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:00:42,011 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 594 transitions. [2025-03-08 11:00:42,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-08 11:00:42,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:42,024 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:00:42,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:00:42,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:42,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:42,025 INFO L85 PathProgramCache]: Analyzing trace with hash 935146018, now seen corresponding path program 1 times [2025-03-08 11:00:42,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:42,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787027551] [2025-03-08 11:00:42,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:42,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:42,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-08 11:00:42,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-08 11:00:42,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:42,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-08 11:00:42,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:42,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787027551] [2025-03-08 11:00:42,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787027551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:42,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:42,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:00:42,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405849808] [2025-03-08 11:00:42,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:42,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:00:42,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:42,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:00:42,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:00:42,374 INFO L87 Difference]: Start difference. First operand 361 states and 594 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:00:42,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:42,489 INFO L93 Difference]: Finished difference Result 1058 states and 1742 transitions. [2025-03-08 11:00:42,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:00:42,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 456 [2025-03-08 11:00:42,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:42,500 INFO L225 Difference]: With dead ends: 1058 [2025-03-08 11:00:42,500 INFO L226 Difference]: Without dead ends: 700 [2025-03-08 11:00:42,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:00:42,502 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 349 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:42,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 965 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:00:42,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-03-08 11:00:42,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 698. [2025-03-08 11:00:42,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 505 states have (on average 1.5207920792079208) internal successors, (768), 507 states have internal predecessors, (768), 188 states have call successors, (188), 4 states have call predecessors, (188), 4 states have return successors, (188), 186 states have call predecessors, (188), 188 states have call successors, (188) [2025-03-08 11:00:42,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1144 transitions. [2025-03-08 11:00:42,598 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1144 transitions. Word has length 456 [2025-03-08 11:00:42,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:42,602 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1144 transitions. [2025-03-08 11:00:42,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:00:42,602 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1144 transitions. [2025-03-08 11:00:42,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-08 11:00:42,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:42,608 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:00:42,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:00:42,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:42,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:42,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1634340381, now seen corresponding path program 1 times [2025-03-08 11:00:42,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:42,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356705610] [2025-03-08 11:00:42,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:42,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:42,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-08 11:00:42,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-08 11:00:42,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:42,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-08 11:00:42,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:42,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356705610] [2025-03-08 11:00:42,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356705610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:42,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:42,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:00:42,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665467847] [2025-03-08 11:00:42,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:42,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:00:42,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:42,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:00:42,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:00:42,912 INFO L87 Difference]: Start difference. First operand 698 states and 1144 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:00:43,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:43,189 INFO L93 Difference]: Finished difference Result 1982 states and 3261 transitions. [2025-03-08 11:00:43,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:00:43,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 456 [2025-03-08 11:00:43,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:43,197 INFO L225 Difference]: With dead ends: 1982 [2025-03-08 11:00:43,197 INFO L226 Difference]: Without dead ends: 1248 [2025-03-08 11:00:43,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:00:43,200 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 772 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:43,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1171 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:00:43,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2025-03-08 11:00:43,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1238. [2025-03-08 11:00:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 953 states have (on average 1.5278069254984261) internal successors, (1456), 959 states have internal predecessors, (1456), 276 states have call successors, (276), 8 states have call predecessors, (276), 8 states have return successors, (276), 270 states have call predecessors, (276), 276 states have call successors, (276) [2025-03-08 11:00:43,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 2008 transitions. [2025-03-08 11:00:43,307 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 2008 transitions. Word has length 456 [2025-03-08 11:00:43,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:43,309 INFO L471 AbstractCegarLoop]: Abstraction has 1238 states and 2008 transitions. [2025-03-08 11:00:43,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:00:43,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 2008 transitions. [2025-03-08 11:00:43,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-08 11:00:43,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:43,316 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:00:43,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:00:43,316 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:43,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:43,317 INFO L85 PathProgramCache]: Analyzing trace with hash -2043164606, now seen corresponding path program 1 times [2025-03-08 11:00:43,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:43,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937608784] [2025-03-08 11:00:43,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:43,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:43,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-08 11:00:43,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-08 11:00:43,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:43,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:43,571 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-08 11:00:43,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:43,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937608784] [2025-03-08 11:00:43,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937608784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:43,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:43,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:00:43,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234189250] [2025-03-08 11:00:43,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:43,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:00:43,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:43,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:00:43,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:00:43,576 INFO L87 Difference]: Start difference. First operand 1238 states and 2008 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:00:43,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:43,755 INFO L93 Difference]: Finished difference Result 3708 states and 6018 transitions. [2025-03-08 11:00:43,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:00:43,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 456 [2025-03-08 11:00:43,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:43,769 INFO L225 Difference]: With dead ends: 3708 [2025-03-08 11:00:43,770 INFO L226 Difference]: Without dead ends: 2473 [2025-03-08 11:00:43,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:00:43,775 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 355 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:43,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1041 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:00:43,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2025-03-08 11:00:43,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 1374. [2025-03-08 11:00:43,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1089 states have (on average 1.5133149678604223) internal successors, (1648), 1095 states have internal predecessors, (1648), 276 states have call successors, (276), 8 states have call predecessors, (276), 8 states have return successors, (276), 270 states have call predecessors, (276), 276 states have call successors, (276) [2025-03-08 11:00:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2200 transitions. [2025-03-08 11:00:43,882 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2200 transitions. Word has length 456 [2025-03-08 11:00:43,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:43,883 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 2200 transitions. [2025-03-08 11:00:43,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:00:43,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2200 transitions. [2025-03-08 11:00:43,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-08 11:00:43,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:43,886 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:00:43,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:00:43,887 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:43,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:43,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1232316138, now seen corresponding path program 1 times [2025-03-08 11:00:43,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:43,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601674249] [2025-03-08 11:00:43,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:43,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:43,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-08 11:00:43,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-08 11:00:43,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:43,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-08 11:00:44,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:44,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601674249] [2025-03-08 11:00:44,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601674249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:44,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:44,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:00:44,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187817518] [2025-03-08 11:00:44,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:44,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:00:44,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:44,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:00:44,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:00:44,053 INFO L87 Difference]: Start difference. First operand 1374 states and 2200 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:00:44,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:44,128 INFO L93 Difference]: Finished difference Result 2593 states and 4141 transitions. [2025-03-08 11:00:44,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:00:44,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 457 [2025-03-08 11:00:44,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:44,136 INFO L225 Difference]: With dead ends: 2593 [2025-03-08 11:00:44,136 INFO L226 Difference]: Without dead ends: 1222 [2025-03-08 11:00:44,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:00:44,140 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 0 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:44,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 698 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:00:44,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2025-03-08 11:00:44,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1222. [2025-03-08 11:00:44,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 937 states have (on average 1.4770544290288155) internal successors, (1384), 943 states have internal predecessors, (1384), 276 states have call successors, (276), 8 states have call predecessors, (276), 8 states have return successors, (276), 270 states have call predecessors, (276), 276 states have call successors, (276) [2025-03-08 11:00:44,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1936 transitions. [2025-03-08 11:00:44,236 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1936 transitions. Word has length 457 [2025-03-08 11:00:44,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:44,237 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1936 transitions. [2025-03-08 11:00:44,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:00:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1936 transitions. [2025-03-08 11:00:44,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-08 11:00:44,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:44,241 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:00:44,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:00:44,241 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:44,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:44,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1730495899, now seen corresponding path program 1 times [2025-03-08 11:00:44,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:44,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291514484] [2025-03-08 11:00:44,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:44,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:44,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-08 11:00:44,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-08 11:00:44,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:44,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:44,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-08 11:00:44,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:44,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291514484] [2025-03-08 11:00:44,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291514484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:44,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:44,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:00:44,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617842485] [2025-03-08 11:00:44,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:44,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:00:44,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:44,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:00:44,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:00:44,490 INFO L87 Difference]: Start difference. First operand 1222 states and 1936 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:00:44,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:44,567 INFO L93 Difference]: Finished difference Result 2441 states and 3869 transitions. [2025-03-08 11:00:44,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:00:44,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 458 [2025-03-08 11:00:44,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:44,577 INFO L225 Difference]: With dead ends: 2441 [2025-03-08 11:00:44,577 INFO L226 Difference]: Without dead ends: 1222 [2025-03-08 11:00:44,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:00:44,582 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 244 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:44,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 348 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:00:44,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2025-03-08 11:00:44,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1222. [2025-03-08 11:00:44,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 937 states have (on average 1.4749199573105656) internal successors, (1382), 943 states have internal predecessors, (1382), 276 states have call successors, (276), 8 states have call predecessors, (276), 8 states have return successors, (276), 270 states have call predecessors, (276), 276 states have call successors, (276) [2025-03-08 11:00:44,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1934 transitions. [2025-03-08 11:00:44,657 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1934 transitions. Word has length 458 [2025-03-08 11:00:44,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:44,658 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1934 transitions. [2025-03-08 11:00:44,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:00:44,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1934 transitions. [2025-03-08 11:00:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-08 11:00:44,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:44,663 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:00:44,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:00:44,663 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:44,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:44,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2023959484, now seen corresponding path program 1 times [2025-03-08 11:00:44,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:44,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295744198] [2025-03-08 11:00:44,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:44,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:44,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 11:00:44,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 11:00:44,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:44,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:45,583 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-08 11:00:45,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:45,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295744198] [2025-03-08 11:00:45,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295744198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:45,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:45,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 11:00:45,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938427592] [2025-03-08 11:00:45,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:45,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 11:00:45,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:45,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 11:00:45,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:00:45,586 INFO L87 Difference]: Start difference. First operand 1222 states and 1934 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:00:46,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:46,484 INFO L93 Difference]: Finished difference Result 4147 states and 6632 transitions. [2025-03-08 11:00:46,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:00:46,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 460 [2025-03-08 11:00:46,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:46,499 INFO L225 Difference]: With dead ends: 4147 [2025-03-08 11:00:46,499 INFO L226 Difference]: Without dead ends: 2928 [2025-03-08 11:00:46,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:00:46,503 INFO L435 NwaCegarLoop]: 974 mSDtfsCounter, 884 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:46,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 2761 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:00:46,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2025-03-08 11:00:46,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1358. [2025-03-08 11:00:46,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1001 states have (on average 1.4445554445554445) internal successors, (1446), 1008 states have internal predecessors, (1446), 346 states have call successors, (346), 10 states have call predecessors, (346), 10 states have return successors, (346), 339 states have call predecessors, (346), 346 states have call successors, (346) [2025-03-08 11:00:46,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 2138 transitions. [2025-03-08 11:00:46,652 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 2138 transitions. Word has length 460 [2025-03-08 11:00:46,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:46,653 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 2138 transitions. [2025-03-08 11:00:46,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:00:46,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 2138 transitions. [2025-03-08 11:00:46,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-08 11:00:46,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:46,657 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:00:46,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:00:46,657 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:46,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:46,658 INFO L85 PathProgramCache]: Analyzing trace with hash -340257988, now seen corresponding path program 1 times [2025-03-08 11:00:46,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:46,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021527534] [2025-03-08 11:00:46,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:46,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:46,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-08 11:00:46,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-08 11:00:46,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:46,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:48,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-08 11:00:48,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:48,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021527534] [2025-03-08 11:00:48,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021527534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:48,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:48,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:00:48,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817434297] [2025-03-08 11:00:48,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:48,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:00:48,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:48,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:00:48,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:00:48,744 INFO L87 Difference]: Start difference. First operand 1358 states and 2138 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) [2025-03-08 11:00:50,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:50,699 INFO L93 Difference]: Finished difference Result 4580 states and 7100 transitions. [2025-03-08 11:00:50,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:00:50,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) Word has length 461 [2025-03-08 11:00:50,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:50,716 INFO L225 Difference]: With dead ends: 4580 [2025-03-08 11:00:50,716 INFO L226 Difference]: Without dead ends: 3345 [2025-03-08 11:00:50,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-03-08 11:00:50,721 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 1283 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 949 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 949 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:50,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 1080 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [949 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 11:00:50,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3345 states. [2025-03-08 11:00:51,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3345 to 3070. [2025-03-08 11:00:51,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3070 states, 2173 states have (on average 1.3612517257248045) internal successors, (2958), 2196 states have internal predecessors, (2958), 862 states have call successors, (862), 34 states have call predecessors, (862), 34 states have return successors, (862), 839 states have call predecessors, (862), 862 states have call successors, (862) [2025-03-08 11:00:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 4682 transitions. [2025-03-08 11:00:51,067 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 4682 transitions. Word has length 461 [2025-03-08 11:00:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:51,069 INFO L471 AbstractCegarLoop]: Abstraction has 3070 states and 4682 transitions. [2025-03-08 11:00:51,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) [2025-03-08 11:00:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 4682 transitions. [2025-03-08 11:00:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-08 11:00:51,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:51,073 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:00:51,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:00:51,074 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:51,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:51,074 INFO L85 PathProgramCache]: Analyzing trace with hash 621356029, now seen corresponding path program 1 times [2025-03-08 11:00:51,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:51,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494874866] [2025-03-08 11:00:51,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:51,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:51,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-08 11:00:51,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-08 11:00:51,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:51,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:52,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-08 11:00:52,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:52,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494874866] [2025-03-08 11:00:52,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494874866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:52,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:52,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:00:52,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184142845] [2025-03-08 11:00:52,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:52,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:00:52,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:52,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:00:52,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:00:52,478 INFO L87 Difference]: Start difference. First operand 3070 states and 4682 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) [2025-03-08 11:00:53,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:53,498 INFO L93 Difference]: Finished difference Result 6233 states and 9352 transitions. [2025-03-08 11:00:53,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 11:00:53,499 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) Word has length 461 [2025-03-08 11:00:53,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:53,516 INFO L225 Difference]: With dead ends: 6233 [2025-03-08 11:00:53,516 INFO L226 Difference]: Without dead ends: 3266 [2025-03-08 11:00:53,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:00:53,525 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 484 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:53,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 895 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:00:53,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2025-03-08 11:00:53,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2025-03-08 11:00:53,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 2320 states have (on average 1.3280172413793103) internal successors, (3081), 2343 states have internal predecessors, (3081), 862 states have call successors, (862), 83 states have call predecessors, (862), 83 states have return successors, (862), 839 states have call predecessors, (862), 862 states have call successors, (862) [2025-03-08 11:00:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4805 transitions. [2025-03-08 11:00:53,875 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4805 transitions. Word has length 461 [2025-03-08 11:00:53,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:53,876 INFO L471 AbstractCegarLoop]: Abstraction has 3266 states and 4805 transitions. [2025-03-08 11:00:53,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) [2025-03-08 11:00:53,876 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4805 transitions. [2025-03-08 11:00:53,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-08 11:00:53,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:53,881 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:00:53,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:00:53,881 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:53,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:53,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1186098434, now seen corresponding path program 1 times [2025-03-08 11:00:53,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:53,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620099297] [2025-03-08 11:00:53,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:53,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:53,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-08 11:00:53,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-08 11:00:53,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:53,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:54,551 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-08 11:00:54,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:54,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620099297] [2025-03-08 11:00:54,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620099297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:54,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:54,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:00:54,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288993631] [2025-03-08 11:00:54,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:54,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:00:54,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:54,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:00:54,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:00:54,553 INFO L87 Difference]: Start difference. First operand 3266 states and 4805 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:00:55,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:55,892 INFO L93 Difference]: Finished difference Result 9971 states and 14838 transitions. [2025-03-08 11:00:55,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 11:00:55,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 461 [2025-03-08 11:00:55,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:55,935 INFO L225 Difference]: With dead ends: 9971 [2025-03-08 11:00:55,935 INFO L226 Difference]: Without dead ends: 6812 [2025-03-08 11:00:55,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:00:55,947 INFO L435 NwaCegarLoop]: 974 mSDtfsCounter, 681 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 3245 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:55,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 3245 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:00:55,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6812 states. [2025-03-08 11:00:56,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6812 to 3218. [2025-03-08 11:00:56,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3218 states, 2272 states have (on average 1.3243838028169015) internal successors, (3009), 2295 states have internal predecessors, (3009), 862 states have call successors, (862), 83 states have call predecessors, (862), 83 states have return successors, (862), 839 states have call predecessors, (862), 862 states have call successors, (862) [2025-03-08 11:00:56,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3218 states to 3218 states and 4733 transitions. [2025-03-08 11:00:56,354 INFO L78 Accepts]: Start accepts. Automaton has 3218 states and 4733 transitions. Word has length 461 [2025-03-08 11:00:56,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:56,355 INFO L471 AbstractCegarLoop]: Abstraction has 3218 states and 4733 transitions. [2025-03-08 11:00:56,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:00:56,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3218 states and 4733 transitions. [2025-03-08 11:00:56,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-03-08 11:00:56,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:56,360 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:00:56,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:00:56,361 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:56,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:56,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1114824074, now seen corresponding path program 1 times [2025-03-08 11:00:56,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:56,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121919574] [2025-03-08 11:00:56,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:56,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:56,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-08 11:00:56,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-08 11:00:56,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:56,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:56,712 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-08 11:00:56,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:56,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121919574] [2025-03-08 11:00:56,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121919574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:56,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:56,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:00:56,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350102286] [2025-03-08 11:00:56,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:56,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:00:56,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:56,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:00:56,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:00:56,714 INFO L87 Difference]: Start difference. First operand 3218 states and 4733 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:00:57,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:57,591 INFO L93 Difference]: Finished difference Result 8378 states and 12286 transitions. [2025-03-08 11:00:57,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:00:57,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 464 [2025-03-08 11:00:57,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:57,610 INFO L225 Difference]: With dead ends: 8378 [2025-03-08 11:00:57,611 INFO L226 Difference]: Without dead ends: 5267 [2025-03-08 11:00:57,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:00:57,618 INFO L435 NwaCegarLoop]: 645 mSDtfsCounter, 690 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:57,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 1244 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:00:57,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5267 states. [2025-03-08 11:00:58,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5267 to 3384. [2025-03-08 11:00:58,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3384 states, 2438 states have (on average 1.3457752255947497) internal successors, (3281), 2461 states have internal predecessors, (3281), 862 states have call successors, (862), 83 states have call predecessors, (862), 83 states have return successors, (862), 839 states have call predecessors, (862), 862 states have call successors, (862) [2025-03-08 11:00:58,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 3384 states and 5005 transitions. [2025-03-08 11:00:58,119 INFO L78 Accepts]: Start accepts. Automaton has 3384 states and 5005 transitions. Word has length 464 [2025-03-08 11:00:58,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:58,120 INFO L471 AbstractCegarLoop]: Abstraction has 3384 states and 5005 transitions. [2025-03-08 11:00:58,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:00:58,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3384 states and 5005 transitions. [2025-03-08 11:00:58,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-08 11:00:58,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:58,127 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:00:58,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 11:00:58,128 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:58,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:58,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1208026773, now seen corresponding path program 1 times [2025-03-08 11:00:58,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:58,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21399915] [2025-03-08 11:00:58,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:58,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:58,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-08 11:00:58,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-08 11:00:58,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:58,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-08 11:00:58,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:58,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21399915] [2025-03-08 11:00:58,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21399915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:58,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:58,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:00:58,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066765837] [2025-03-08 11:00:58,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:58,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:00:58,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:58,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:00:58,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:00:58,272 INFO L87 Difference]: Start difference. First operand 3384 states and 5005 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:00:58,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:58,761 INFO L93 Difference]: Finished difference Result 6758 states and 9960 transitions. [2025-03-08 11:00:58,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:00:58,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 465 [2025-03-08 11:00:58,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:58,780 INFO L225 Difference]: With dead ends: 6758 [2025-03-08 11:00:58,780 INFO L226 Difference]: Without dead ends: 3481 [2025-03-08 11:00:58,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:00:58,787 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 191 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:58,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 836 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:00:58,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3481 states. [2025-03-08 11:00:59,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3481 to 2453. [2025-03-08 11:00:59,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 1795 states have (on average 1.3832869080779944) internal successors, (2483), 1806 states have internal predecessors, (2483), 598 states have call successors, (598), 59 states have call predecessors, (598), 59 states have return successors, (598), 587 states have call predecessors, (598), 598 states have call successors, (598) [2025-03-08 11:00:59,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 3679 transitions. [2025-03-08 11:00:59,060 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 3679 transitions. Word has length 465 [2025-03-08 11:00:59,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:59,061 INFO L471 AbstractCegarLoop]: Abstraction has 2453 states and 3679 transitions. [2025-03-08 11:00:59,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:00:59,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3679 transitions. [2025-03-08 11:00:59,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-08 11:00:59,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:59,064 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:00:59,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 11:00:59,065 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:59,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:59,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1826770989, now seen corresponding path program 1 times [2025-03-08 11:00:59,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:59,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963252427] [2025-03-08 11:00:59,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:59,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:59,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-08 11:00:59,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-08 11:00:59,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:59,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-08 11:00:59,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:59,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963252427] [2025-03-08 11:00:59,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963252427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:59,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:59,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:00:59,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175814524] [2025-03-08 11:00:59,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:59,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:00:59,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:59,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:00:59,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:00:59,368 INFO L87 Difference]: Start difference. First operand 2453 states and 3679 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:01:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:01:00,361 INFO L93 Difference]: Finished difference Result 6649 states and 9837 transitions. [2025-03-08 11:01:00,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:01:00,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 465 [2025-03-08 11:01:00,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:01:00,376 INFO L225 Difference]: With dead ends: 6649 [2025-03-08 11:01:00,376 INFO L226 Difference]: Without dead ends: 4303 [2025-03-08 11:01:00,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:01:00,382 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 872 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:01:00,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1791 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 11:01:00,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4303 states. [2025-03-08 11:01:00,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4303 to 2393. [2025-03-08 11:01:00,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2393 states, 1735 states have (on average 1.3706051873198848) internal successors, (2378), 1746 states have internal predecessors, (2378), 598 states have call successors, (598), 59 states have call predecessors, (598), 59 states have return successors, (598), 587 states have call predecessors, (598), 598 states have call successors, (598) [2025-03-08 11:01:00,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3574 transitions. [2025-03-08 11:01:00,680 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3574 transitions. Word has length 465 [2025-03-08 11:01:00,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:01:00,681 INFO L471 AbstractCegarLoop]: Abstraction has 2393 states and 3574 transitions. [2025-03-08 11:01:00,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:01:00,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3574 transitions. [2025-03-08 11:01:00,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-08 11:01:00,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:01:00,685 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:01:00,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 11:01:00,685 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:01:00,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:01:00,686 INFO L85 PathProgramCache]: Analyzing trace with hash -966653324, now seen corresponding path program 1 times [2025-03-08 11:01:00,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:01:00,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559791781] [2025-03-08 11:01:00,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:00,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:01:00,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-08 11:01:00,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-08 11:01:00,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:00,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:00,971 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-08 11:01:00,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:01:00,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559791781] [2025-03-08 11:01:00,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559791781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:01:00,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:01:00,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:01:00,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260980302] [2025-03-08 11:01:00,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:01:00,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:01:00,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:01:00,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:01:00,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:01:00,975 INFO L87 Difference]: Start difference. First operand 2393 states and 3574 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:01:02,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:01:02,070 INFO L93 Difference]: Finished difference Result 8293 states and 12265 transitions. [2025-03-08 11:01:02,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:01:02,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 465 [2025-03-08 11:01:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:01:02,089 INFO L225 Difference]: With dead ends: 8293 [2025-03-08 11:01:02,089 INFO L226 Difference]: Without dead ends: 6007 [2025-03-08 11:01:02,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:01:02,095 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 449 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:01:02,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1119 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:01:02,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6007 states. [2025-03-08 11:01:02,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6007 to 5985. [2025-03-08 11:01:02,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5985 states, 4660 states have (on average 1.392274678111588) internal successors, (6488), 4695 states have internal predecessors, (6488), 1168 states have call successors, (1168), 156 states have call predecessors, (1168), 156 states have return successors, (1168), 1133 states have call predecessors, (1168), 1168 states have call successors, (1168) [2025-03-08 11:01:02,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5985 states to 5985 states and 8824 transitions. [2025-03-08 11:01:02,785 INFO L78 Accepts]: Start accepts. Automaton has 5985 states and 8824 transitions. Word has length 465 [2025-03-08 11:01:02,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:01:02,785 INFO L471 AbstractCegarLoop]: Abstraction has 5985 states and 8824 transitions. [2025-03-08 11:01:02,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 11:01:02,786 INFO L276 IsEmpty]: Start isEmpty. Operand 5985 states and 8824 transitions. [2025-03-08 11:01:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-08 11:01:02,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:01:02,791 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:01:02,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 11:01:02,791 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:01:02,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:01:02,792 INFO L85 PathProgramCache]: Analyzing trace with hash -686303435, now seen corresponding path program 1 times [2025-03-08 11:01:02,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:01:02,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191798370] [2025-03-08 11:01:02,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:02,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:01:02,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-08 11:01:02,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-08 11:01:02,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:02,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:03,077 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 126 proven. 81 refuted. 0 times theorem prover too weak. 9453 trivial. 0 not checked. [2025-03-08 11:01:03,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:01:03,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191798370] [2025-03-08 11:01:03,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191798370] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:01:03,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066509565] [2025-03-08 11:01:03,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:03,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:01:03,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:01:03,080 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:01:03,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 11:01:03,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-08 11:01:03,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-08 11:01:03,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:03,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:03,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 11:01:03,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:01:04,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 4169 proven. 12 refuted. 0 times theorem prover too weak. 5479 trivial. 0 not checked. [2025-03-08 11:01:04,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:01:08,205 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 195 proven. 12 refuted. 0 times theorem prover too weak. 9453 trivial. 0 not checked. [2025-03-08 11:01:08,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066509565] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:01:08,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:01:08,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 18 [2025-03-08 11:01:08,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448075627] [2025-03-08 11:01:08,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:01:08,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 11:01:08,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:01:08,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 11:01:08,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-03-08 11:01:08,208 INFO L87 Difference]: Start difference. First operand 5985 states and 8824 transitions. Second operand has 18 states, 18 states have (on average 15.277777777777779) internal successors, (275), 18 states have internal predecessors, (275), 8 states have call successors, (167), 5 states have call predecessors, (167), 8 states have return successors, (168), 8 states have call predecessors, (168), 8 states have call successors, (168) [2025-03-08 11:01:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:01:10,891 INFO L93 Difference]: Finished difference Result 11206 states and 16647 transitions. [2025-03-08 11:01:10,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-08 11:01:10,892 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 15.277777777777779) internal successors, (275), 18 states have internal predecessors, (275), 8 states have call successors, (167), 5 states have call predecessors, (167), 8 states have return successors, (168), 8 states have call predecessors, (168), 8 states have call successors, (168) Word has length 465 [2025-03-08 11:01:10,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:01:10,910 INFO L225 Difference]: With dead ends: 11206 [2025-03-08 11:01:10,910 INFO L226 Difference]: Without dead ends: 5332 [2025-03-08 11:01:10,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 978 GetRequests, 926 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=814, Invalid=2048, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 11:01:10,920 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 1828 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 1242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1829 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 2620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1242 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:01:10,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1829 Valid, 1332 Invalid, 2620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1242 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 11:01:10,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5332 states. [2025-03-08 11:01:11,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5332 to 2970. [2025-03-08 11:01:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2970 states, 2464 states have (on average 1.4618506493506493) internal successors, (3602), 2475 states have internal predecessors, (3602), 443 states have call successors, (443), 62 states have call predecessors, (443), 62 states have return successors, (443), 432 states have call predecessors, (443), 443 states have call successors, (443) [2025-03-08 11:01:11,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2970 states to 2970 states and 4488 transitions. [2025-03-08 11:01:11,284 INFO L78 Accepts]: Start accepts. Automaton has 2970 states and 4488 transitions. Word has length 465 [2025-03-08 11:01:11,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:01:11,285 INFO L471 AbstractCegarLoop]: Abstraction has 2970 states and 4488 transitions. [2025-03-08 11:01:11,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 15.277777777777779) internal successors, (275), 18 states have internal predecessors, (275), 8 states have call successors, (167), 5 states have call predecessors, (167), 8 states have return successors, (168), 8 states have call predecessors, (168), 8 states have call successors, (168) [2025-03-08 11:01:11,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2970 states and 4488 transitions. [2025-03-08 11:01:11,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-08 11:01:11,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:01:11,289 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:01:11,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 11:01:11,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 11:01:11,490 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:01:11,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:01:11,491 INFO L85 PathProgramCache]: Analyzing trace with hash 771782343, now seen corresponding path program 1 times [2025-03-08 11:01:11,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:01:11,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348538432] [2025-03-08 11:01:11,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:11,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:01:11,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-08 11:01:11,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-08 11:01:11,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:11,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 18 proven. 189 refuted. 0 times theorem prover too weak. 9453 trivial. 0 not checked. [2025-03-08 11:01:12,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:01:12,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348538432] [2025-03-08 11:01:12,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348538432] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:01:12,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243090010] [2025-03-08 11:01:12,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:12,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:01:12,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:01:12,037 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:01:12,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 11:01:12,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-08 11:01:12,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-08 11:01:12,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:12,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:12,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 1068 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 11:01:12,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:01:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 1593 proven. 189 refuted. 0 times theorem prover too weak. 7878 trivial. 0 not checked. [2025-03-08 11:01:12,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:01:13,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 18 proven. 189 refuted. 0 times theorem prover too weak. 9453 trivial. 0 not checked. [2025-03-08 11:01:13,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243090010] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:01:13,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:01:13,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 11:01:13,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256543654] [2025-03-08 11:01:13,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:01:13,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 11:01:13,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:01:13,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 11:01:13,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:01:13,277 INFO L87 Difference]: Start difference. First operand 2970 states and 4488 transitions. Second operand has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 2 states have call successors, (133), 2 states have call predecessors, (133), 4 states have return successors, (134), 2 states have call predecessors, (134), 2 states have call successors, (134) [2025-03-08 11:01:13,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:01:13,901 INFO L93 Difference]: Finished difference Result 5945 states and 8909 transitions. [2025-03-08 11:01:13,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 11:01:13,902 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 2 states have call successors, (133), 2 states have call predecessors, (133), 4 states have return successors, (134), 2 states have call predecessors, (134), 2 states have call successors, (134) Word has length 466 [2025-03-08 11:01:13,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:01:13,911 INFO L225 Difference]: With dead ends: 5945 [2025-03-08 11:01:13,911 INFO L226 Difference]: Without dead ends: 3106 [2025-03-08 11:01:13,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 943 GetRequests, 928 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-03-08 11:01:13,915 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 745 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:01:13,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 699 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:01:13,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2025-03-08 11:01:14,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 3022. [2025-03-08 11:01:14,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3022 states, 2503 states have (on average 1.4498601677986416) internal successors, (3629), 2514 states have internal predecessors, (3629), 443 states have call successors, (443), 75 states have call predecessors, (443), 75 states have return successors, (443), 432 states have call predecessors, (443), 443 states have call successors, (443) [2025-03-08 11:01:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 4515 transitions. [2025-03-08 11:01:14,252 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 4515 transitions. Word has length 466 [2025-03-08 11:01:14,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:01:14,253 INFO L471 AbstractCegarLoop]: Abstraction has 3022 states and 4515 transitions. [2025-03-08 11:01:14,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 2 states have call successors, (133), 2 states have call predecessors, (133), 4 states have return successors, (134), 2 states have call predecessors, (134), 2 states have call successors, (134) [2025-03-08 11:01:14,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 4515 transitions. [2025-03-08 11:01:14,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-03-08 11:01:14,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:01:14,256 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:01:14,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 11:01:14,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:01:14,457 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:01:14,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:01:14,458 INFO L85 PathProgramCache]: Analyzing trace with hash -442981656, now seen corresponding path program 1 times [2025-03-08 11:01:14,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:01:14,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982987860] [2025-03-08 11:01:14,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:14,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:01:14,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-08 11:01:14,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-08 11:01:14,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:14,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 11:01:14,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1105413040] [2025-03-08 11:01:14,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:14,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:01:14,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:01:14,621 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:01:14,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 11:01:14,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-08 11:01:14,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-08 11:01:14,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:14,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:14,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 11:01:14,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:01:15,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 5805 proven. 186 refuted. 0 times theorem prover too weak. 3669 trivial. 0 not checked. [2025-03-08 11:01:15,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:01:15,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:01:15,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982987860] [2025-03-08 11:01:15,563 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 11:01:15,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105413040] [2025-03-08 11:01:15,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105413040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:01:15,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:01:15,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-08 11:01:15,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820243514] [2025-03-08 11:01:15,563 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 11:01:15,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 11:01:15,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:01:15,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 11:01:15,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 11:01:15,564 INFO L87 Difference]: Start difference. First operand 3022 states and 4515 transitions. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 3 states have call successors, (70), 3 states have call predecessors, (70), 5 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) [2025-03-08 11:01:16,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:01:16,419 INFO L93 Difference]: Finished difference Result 6043 states and 8960 transitions. [2025-03-08 11:01:16,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 11:01:16,420 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 3 states have call successors, (70), 3 states have call predecessors, (70), 5 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) Word has length 467 [2025-03-08 11:01:16,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:01:16,429 INFO L225 Difference]: With dead ends: 6043 [2025-03-08 11:01:16,429 INFO L226 Difference]: Without dead ends: 3156 [2025-03-08 11:01:16,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:01:16,433 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 206 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:01:16,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 835 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:01:16,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3156 states. [2025-03-08 11:01:16,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3156 to 3066. [2025-03-08 11:01:16,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3066 states, 2536 states have (on average 1.428627760252366) internal successors, (3623), 2547 states have internal predecessors, (3623), 443 states have call successors, (443), 86 states have call predecessors, (443), 86 states have return successors, (443), 432 states have call predecessors, (443), 443 states have call successors, (443) [2025-03-08 11:01:16,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 4509 transitions. [2025-03-08 11:01:16,772 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 4509 transitions. Word has length 467 [2025-03-08 11:01:16,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:01:16,772 INFO L471 AbstractCegarLoop]: Abstraction has 3066 states and 4509 transitions. [2025-03-08 11:01:16,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 3 states have call successors, (70), 3 states have call predecessors, (70), 5 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) [2025-03-08 11:01:16,773 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 4509 transitions. [2025-03-08 11:01:16,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-03-08 11:01:16,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:01:16,776 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:01:16,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 11:01:16,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 11:01:16,980 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:01:16,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:01:16,981 INFO L85 PathProgramCache]: Analyzing trace with hash -683521785, now seen corresponding path program 1 times [2025-03-08 11:01:16,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:01:16,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055437573] [2025-03-08 11:01:16,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:16,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:01:17,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-08 11:01:17,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-08 11:01:17,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:17,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 11:01:17,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1823383345] [2025-03-08 11:01:17,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:17,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:01:17,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:01:17,136 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:01:17,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 11:01:17,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-08 11:01:17,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-08 11:01:17,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:17,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:17,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-08 11:01:17,395 INFO L279 TraceCheckSpWp]: Computing forward predicates...