./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-55.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 cbc951d1083817befd74a2650ab351dd37b1e281e90b8f56425fa3f23be8e281 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:07:23,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:07:23,739 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:07:23,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:07:23,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:07:23,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:07:23,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:07:23,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:07:23,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:07:23,767 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:07:23,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:07:23,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:07:23,769 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:07:23,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:07:23,769 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:07:23,769 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:07:23,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:07:23,769 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:07:23,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:07:23,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:07:23,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:07:23,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:07:23,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:07:23,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:07:23,770 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:07:23,770 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:07:23,770 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:07:23,770 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:07:23,770 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:07:23,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:07:23,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:07:23,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:07:23,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:07:23,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:07:23,771 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:07:23,771 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:07:23,771 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:07:23,771 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:07:23,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:07:23,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:07:23,771 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:07:23,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:07:23,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:07:23,772 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 -> cbc951d1083817befd74a2650ab351dd37b1e281e90b8f56425fa3f23be8e281 [2025-03-17 00:07:23,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:07:23,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:07:24,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:07:24,002 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:07:24,002 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:07:24,003 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-55.i [2025-03-17 00:07:25,177 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f7c55ca4/102be56ed8a24638bd902f3761339eb0/FLAG4bf424c59 [2025-03-17 00:07:25,477 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:07:25,482 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-55.i [2025-03-17 00:07:25,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f7c55ca4/102be56ed8a24638bd902f3761339eb0/FLAG4bf424c59 [2025-03-17 00:07:25,729 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f7c55ca4/102be56ed8a24638bd902f3761339eb0 [2025-03-17 00:07:25,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:07:25,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:07:25,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:07:25,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:07:25,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:07:25,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:07:25" (1/1) ... [2025-03-17 00:07:25,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:25, skipping insertion in model container [2025-03-17 00:07:25,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:07:25" (1/1) ... [2025-03-17 00:07:25,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:07:25,858 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-55.i[916,929] [2025-03-17 00:07:25,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:07:25,963 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:07:25,972 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-55.i[916,929] [2025-03-17 00:07:26,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:07:26,041 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:07:26,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:26 WrapperNode [2025-03-17 00:07:26,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:07:26,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:07:26,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:07:26,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:07:26,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:26" (1/1) ... [2025-03-17 00:07:26,061 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:26" (1/1) ... [2025-03-17 00:07:26,107 INFO L138 Inliner]: procedures = 26, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 618 [2025-03-17 00:07:26,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:07:26,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:07:26,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:07:26,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:07:26,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:26" (1/1) ... [2025-03-17 00:07:26,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:26" (1/1) ... [2025-03-17 00:07:26,126 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:26" (1/1) ... [2025-03-17 00:07:26,165 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 00:07:26,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:26" (1/1) ... [2025-03-17 00:07:26,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:26" (1/1) ... [2025-03-17 00:07:26,186 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:26" (1/1) ... [2025-03-17 00:07:26,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:26" (1/1) ... [2025-03-17 00:07:26,200 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:26" (1/1) ... [2025-03-17 00:07:26,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:26" (1/1) ... [2025-03-17 00:07:26,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:07:26,220 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:07:26,221 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:07:26,221 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:07:26,222 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:26" (1/1) ... [2025-03-17 00:07:26,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:07:26,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:07:26,253 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 00:07:26,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 00:07:26,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:07:26,276 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:07:26,276 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:07:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:07:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:07:26,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:07:26,370 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:07:26,372 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:07:27,205 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-17 00:07:27,205 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:07:27,253 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:07:27,254 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:07:27,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:07:27 BoogieIcfgContainer [2025-03-17 00:07:27,254 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:07:27,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:07:27,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:07:27,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:07:27,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:07:25" (1/3) ... [2025-03-17 00:07:27,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4175019f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:07:27, skipping insertion in model container [2025-03-17 00:07:27,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:26" (2/3) ... [2025-03-17 00:07:27,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4175019f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:07:27, skipping insertion in model container [2025-03-17 00:07:27,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:07:27" (3/3) ... [2025-03-17 00:07:27,267 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-55.i [2025-03-17 00:07:27,280 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:07:27,284 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-55.i that has 2 procedures, 256 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:07:27,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:07:27,357 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;@c9f37d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:07:27,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:07:27,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 256 states, 155 states have (on average 1.5096774193548388) internal successors, (234), 156 states have internal predecessors, (234), 98 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 00:07:27,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-17 00:07:27,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:27,420 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:27,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:27,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:27,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1897506156, now seen corresponding path program 1 times [2025-03-17 00:07:27,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:27,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732744099] [2025-03-17 00:07:27,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:27,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:27,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-17 00:07:27,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-17 00:07:27,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:27,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 194 refuted. 0 times theorem prover too weak. 18818 trivial. 0 not checked. [2025-03-17 00:07:28,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:28,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732744099] [2025-03-17 00:07:28,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732744099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:07:28,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456245062] [2025-03-17 00:07:28,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:28,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:07:28,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:07:28,120 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:07:28,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 00:07:28,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-17 00:07:28,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-17 00:07:28,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:28,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:28,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 1299 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:07:28,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:07:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 18818 trivial. 0 not checked. [2025-03-17 00:07:28,528 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:07:28,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456245062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:28,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:07:28,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:07:28,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126478186] [2025-03-17 00:07:28,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:28,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:07:28,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:28,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:07:28,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:07:28,563 INFO L87 Difference]: Start difference. First operand has 256 states, 155 states have (on average 1.5096774193548388) internal successors, (234), 156 states have internal predecessors, (234), 98 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) Second operand has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) [2025-03-17 00:07:28,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:28,660 INFO L93 Difference]: Finished difference Result 509 states and 956 transitions. [2025-03-17 00:07:28,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:07:28,664 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) Word has length 589 [2025-03-17 00:07:28,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:28,673 INFO L225 Difference]: With dead ends: 509 [2025-03-17 00:07:28,674 INFO L226 Difference]: Without dead ends: 254 [2025-03-17 00:07:28,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 590 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:07:28,682 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:28,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 413 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:07:28,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-17 00:07:28,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2025-03-17 00:07:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 154 states have (on average 1.474025974025974) internal successors, (227), 154 states have internal predecessors, (227), 98 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 00:07:28,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 423 transitions. [2025-03-17 00:07:28,780 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 423 transitions. Word has length 589 [2025-03-17 00:07:28,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:28,782 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 423 transitions. [2025-03-17 00:07:28,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) [2025-03-17 00:07:28,782 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 423 transitions. [2025-03-17 00:07:28,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-17 00:07:28,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:28,794 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:28,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 00:07:28,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 00:07:28,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:28,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:28,998 INFO L85 PathProgramCache]: Analyzing trace with hash 947837750, now seen corresponding path program 1 times [2025-03-17 00:07:28,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:28,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528918863] [2025-03-17 00:07:28,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:28,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:29,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-17 00:07:29,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-17 00:07:29,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:29,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:29,661 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:07:29,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:29,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528918863] [2025-03-17 00:07:29,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528918863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:29,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:07:29,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:07:29,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488770086] [2025-03-17 00:07:29,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:29,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:07:29,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:29,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:07:29,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:07:29,669 INFO L87 Difference]: Start difference. First operand 254 states and 423 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:29,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:29,818 INFO L93 Difference]: Finished difference Result 760 states and 1267 transitions. [2025-03-17 00:07:29,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:07:29,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 589 [2025-03-17 00:07:29,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:29,825 INFO L225 Difference]: With dead ends: 760 [2025-03-17 00:07:29,826 INFO L226 Difference]: Without dead ends: 507 [2025-03-17 00:07:29,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:07:29,828 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 419 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:29,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1061 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:07:29,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-17 00:07:29,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 505. [2025-03-17 00:07:29,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 306 states have (on average 1.473856209150327) internal successors, (451), 306 states have internal predecessors, (451), 196 states have call successors, (196), 2 states have call predecessors, (196), 2 states have return successors, (196), 196 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-17 00:07:29,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 843 transitions. [2025-03-17 00:07:29,948 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 843 transitions. Word has length 589 [2025-03-17 00:07:29,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:29,951 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 843 transitions. [2025-03-17 00:07:29,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:29,952 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 843 transitions. [2025-03-17 00:07:29,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-17 00:07:29,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:29,964 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:29,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:07:29,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:29,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:29,966 INFO L85 PathProgramCache]: Analyzing trace with hash -987822537, now seen corresponding path program 1 times [2025-03-17 00:07:29,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:29,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689502791] [2025-03-17 00:07:29,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:29,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:30,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-17 00:07:30,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-17 00:07:30,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:30,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:07:30,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:30,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689502791] [2025-03-17 00:07:30,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689502791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:30,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:07:30,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:07:30,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50609828] [2025-03-17 00:07:30,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:30,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:07:30,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:30,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:07:30,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:07:30,427 INFO L87 Difference]: Start difference. First operand 505 states and 843 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:30,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:30,514 INFO L93 Difference]: Finished difference Result 1017 states and 1699 transitions. [2025-03-17 00:07:30,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:07:30,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 589 [2025-03-17 00:07:30,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:30,521 INFO L225 Difference]: With dead ends: 1017 [2025-03-17 00:07:30,521 INFO L226 Difference]: Without dead ends: 513 [2025-03-17 00:07:30,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:07:30,524 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 3 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:30,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 813 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:07:30,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-03-17 00:07:30,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 511. [2025-03-17 00:07:30,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 312 states have (on average 1.4711538461538463) internal successors, (459), 312 states have internal predecessors, (459), 196 states have call successors, (196), 2 states have call predecessors, (196), 2 states have return successors, (196), 196 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-17 00:07:30,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 851 transitions. [2025-03-17 00:07:30,608 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 851 transitions. Word has length 589 [2025-03-17 00:07:30,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:30,609 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 851 transitions. [2025-03-17 00:07:30,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 851 transitions. [2025-03-17 00:07:30,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-03-17 00:07:30,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:30,621 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:30,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:07:30,621 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:30,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:30,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1853934575, now seen corresponding path program 1 times [2025-03-17 00:07:30,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:30,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037540243] [2025-03-17 00:07:30,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:30,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:30,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-17 00:07:30,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-17 00:07:30,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:30,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:31,071 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:07:31,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:31,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037540243] [2025-03-17 00:07:31,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037540243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:31,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:07:31,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:07:31,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434533952] [2025-03-17 00:07:31,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:31,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:07:31,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:31,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:07:31,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:07:31,075 INFO L87 Difference]: Start difference. First operand 511 states and 851 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:31,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:31,160 INFO L93 Difference]: Finished difference Result 1327 states and 2212 transitions. [2025-03-17 00:07:31,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:07:31,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 590 [2025-03-17 00:07:31,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:31,169 INFO L225 Difference]: With dead ends: 1327 [2025-03-17 00:07:31,169 INFO L226 Difference]: Without dead ends: 817 [2025-03-17 00:07:31,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:07:31,175 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 253 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:31,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 851 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:07:31,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2025-03-17 00:07:31,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 813. [2025-03-17 00:07:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 516 states have (on average 1.494186046511628) internal successors, (771), 518 states have internal predecessors, (771), 292 states have call successors, (292), 4 states have call predecessors, (292), 4 states have return successors, (292), 290 states have call predecessors, (292), 292 states have call successors, (292) [2025-03-17 00:07:31,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1355 transitions. [2025-03-17 00:07:31,273 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1355 transitions. Word has length 590 [2025-03-17 00:07:31,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:31,276 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1355 transitions. [2025-03-17 00:07:31,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:31,277 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1355 transitions. [2025-03-17 00:07:31,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-03-17 00:07:31,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:31,287 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:31,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:07:31,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:31,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:31,289 INFO L85 PathProgramCache]: Analyzing trace with hash 363823378, now seen corresponding path program 1 times [2025-03-17 00:07:31,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:31,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130552309] [2025-03-17 00:07:31,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:31,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:31,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-17 00:07:31,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-17 00:07:31,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:31,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:31,547 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:07:31,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:31,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130552309] [2025-03-17 00:07:31,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130552309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:31,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:07:31,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:07:31,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79998998] [2025-03-17 00:07:31,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:31,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:07:31,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:31,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:07:31,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:07:31,549 INFO L87 Difference]: Start difference. First operand 813 states and 1355 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:31,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:31,667 INFO L93 Difference]: Finished difference Result 2201 states and 3666 transitions. [2025-03-17 00:07:31,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:07:31,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 590 [2025-03-17 00:07:31,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:31,681 INFO L225 Difference]: With dead ends: 2201 [2025-03-17 00:07:31,681 INFO L226 Difference]: Without dead ends: 1389 [2025-03-17 00:07:31,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:07:31,686 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 244 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:31,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 821 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:07:31,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2025-03-17 00:07:31,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1385. [2025-03-17 00:07:31,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 876 states have (on average 1.4874429223744292) internal successors, (1303), 882 states have internal predecessors, (1303), 500 states have call successors, (500), 8 states have call predecessors, (500), 8 states have return successors, (500), 494 states have call predecessors, (500), 500 states have call successors, (500) [2025-03-17 00:07:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2303 transitions. [2025-03-17 00:07:31,818 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2303 transitions. Word has length 590 [2025-03-17 00:07:31,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:31,823 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 2303 transitions. [2025-03-17 00:07:31,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:31,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2303 transitions. [2025-03-17 00:07:31,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-03-17 00:07:31,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:31,835 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:31,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:07:31,836 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:31,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:31,839 INFO L85 PathProgramCache]: Analyzing trace with hash 296816625, now seen corresponding path program 1 times [2025-03-17 00:07:31,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:31,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028524421] [2025-03-17 00:07:31,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:31,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:31,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-17 00:07:32,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-17 00:07:32,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:32,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:32,934 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:07:32,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:32,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028524421] [2025-03-17 00:07:32,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028524421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:32,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:07:32,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 00:07:32,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721085667] [2025-03-17 00:07:32,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:32,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 00:07:32,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:32,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 00:07:32,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:07:32,938 INFO L87 Difference]: Start difference. First operand 1385 states and 2303 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:34,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:34,345 INFO L93 Difference]: Finished difference Result 3915 states and 6442 transitions. [2025-03-17 00:07:34,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 00:07:34,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 590 [2025-03-17 00:07:34,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:34,369 INFO L225 Difference]: With dead ends: 3915 [2025-03-17 00:07:34,369 INFO L226 Difference]: Without dead ends: 2531 [2025-03-17 00:07:34,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:07:34,376 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 412 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:34,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1527 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 00:07:34,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2025-03-17 00:07:34,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2527. [2025-03-17 00:07:34,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2527 states, 1574 states have (on average 1.449174078780178) internal successors, (2281), 1588 states have internal predecessors, (2281), 920 states have call successors, (920), 32 states have call predecessors, (920), 32 states have return successors, (920), 906 states have call predecessors, (920), 920 states have call successors, (920) [2025-03-17 00:07:34,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2527 states to 2527 states and 4121 transitions. [2025-03-17 00:07:34,712 INFO L78 Accepts]: Start accepts. Automaton has 2527 states and 4121 transitions. Word has length 590 [2025-03-17 00:07:34,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:34,713 INFO L471 AbstractCegarLoop]: Abstraction has 2527 states and 4121 transitions. [2025-03-17 00:07:34,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:34,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2527 states and 4121 transitions. [2025-03-17 00:07:34,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-03-17 00:07:34,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:34,726 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:34,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:07:34,726 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:34,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:34,727 INFO L85 PathProgramCache]: Analyzing trace with hash 327836432, now seen corresponding path program 1 times [2025-03-17 00:07:34,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:34,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28173251] [2025-03-17 00:07:34,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:34,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:34,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-17 00:07:34,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-17 00:07:34,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:34,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:36,014 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:07:36,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:36,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28173251] [2025-03-17 00:07:36,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28173251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:36,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:07:36,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:07:36,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057704987] [2025-03-17 00:07:36,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:36,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:07:36,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:36,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:07:36,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:07:36,017 INFO L87 Difference]: Start difference. First operand 2527 states and 4121 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:36,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:36,637 INFO L93 Difference]: Finished difference Result 5839 states and 9410 transitions. [2025-03-17 00:07:36,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:07:36,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 590 [2025-03-17 00:07:36,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:36,664 INFO L225 Difference]: With dead ends: 5839 [2025-03-17 00:07:36,664 INFO L226 Difference]: Without dead ends: 3313 [2025-03-17 00:07:36,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:07:36,718 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 120 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:36,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1139 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:07:36,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3313 states. [2025-03-17 00:07:37,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3313 to 3295. [2025-03-17 00:07:37,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3295 states, 1974 states have (on average 1.3824721377912867) internal successors, (2729), 2004 states have internal predecessors, (2729), 1256 states have call successors, (1256), 64 states have call predecessors, (1256), 64 states have return successors, (1256), 1226 states have call predecessors, (1256), 1256 states have call successors, (1256) [2025-03-17 00:07:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3295 states to 3295 states and 5241 transitions. [2025-03-17 00:07:37,098 INFO L78 Accepts]: Start accepts. Automaton has 3295 states and 5241 transitions. Word has length 590 [2025-03-17 00:07:37,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:37,099 INFO L471 AbstractCegarLoop]: Abstraction has 3295 states and 5241 transitions. [2025-03-17 00:07:37,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:37,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3295 states and 5241 transitions. [2025-03-17 00:07:37,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-03-17 00:07:37,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:37,104 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:37,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:07:37,105 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:37,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:37,105 INFO L85 PathProgramCache]: Analyzing trace with hash 328789744, now seen corresponding path program 1 times [2025-03-17 00:07:37,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:37,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524398719] [2025-03-17 00:07:37,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:37,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:37,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-17 00:07:37,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-17 00:07:37,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:37,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:38,053 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 252 proven. 39 refuted. 0 times theorem prover too weak. 18721 trivial. 0 not checked. [2025-03-17 00:07:38,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:38,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524398719] [2025-03-17 00:07:38,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524398719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:07:38,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278016902] [2025-03-17 00:07:38,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:38,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:07:38,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:07:38,058 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:07:38,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 00:07:38,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-17 00:07:38,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-17 00:07:38,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:38,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:38,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 1294 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 00:07:38,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:07:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 9421 proven. 165 refuted. 0 times theorem prover too weak. 9426 trivial. 0 not checked. [2025-03-17 00:07:39,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:07:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 126 proven. 165 refuted. 0 times theorem prover too weak. 18721 trivial. 0 not checked. [2025-03-17 00:07:39,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278016902] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:07:39,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:07:39,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-03-17 00:07:39,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548251173] [2025-03-17 00:07:39,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:07:39,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 00:07:39,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:39,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 00:07:39,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:07:39,811 INFO L87 Difference]: Start difference. First operand 3295 states and 5241 transitions. Second operand has 10 states, 10 states have (on average 22.8) internal successors, (228), 10 states have internal predecessors, (228), 4 states have call successors, (208), 2 states have call predecessors, (208), 4 states have return successors, (210), 4 states have call predecessors, (210), 4 states have call successors, (210) [2025-03-17 00:07:41,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:41,785 INFO L93 Difference]: Finished difference Result 8531 states and 13407 transitions. [2025-03-17 00:07:41,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 00:07:41,786 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 22.8) internal successors, (228), 10 states have internal predecessors, (228), 4 states have call successors, (208), 2 states have call predecessors, (208), 4 states have return successors, (210), 4 states have call predecessors, (210), 4 states have call successors, (210) Word has length 590 [2025-03-17 00:07:41,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:41,817 INFO L225 Difference]: With dead ends: 8531 [2025-03-17 00:07:41,818 INFO L226 Difference]: Without dead ends: 5237 [2025-03-17 00:07:41,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1205 GetRequests, 1179 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=538, Unknown=0, NotChecked=0, Total=756 [2025-03-17 00:07:41,829 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 722 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 477 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 477 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:41,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1454 Invalid, 1750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [477 Valid, 1273 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 00:07:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5237 states. [2025-03-17 00:07:42,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5237 to 4947. [2025-03-17 00:07:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4947 states, 2896 states have (on average 1.331146408839779) internal successors, (3855), 2942 states have internal predecessors, (3855), 1924 states have call successors, (1924), 126 states have call predecessors, (1924), 126 states have return successors, (1924), 1878 states have call predecessors, (1924), 1924 states have call successors, (1924) [2025-03-17 00:07:42,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4947 states to 4947 states and 7703 transitions. [2025-03-17 00:07:42,387 INFO L78 Accepts]: Start accepts. Automaton has 4947 states and 7703 transitions. Word has length 590 [2025-03-17 00:07:42,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:42,388 INFO L471 AbstractCegarLoop]: Abstraction has 4947 states and 7703 transitions. [2025-03-17 00:07:42,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.8) internal successors, (228), 10 states have internal predecessors, (228), 4 states have call successors, (208), 2 states have call predecessors, (208), 4 states have return successors, (210), 4 states have call predecessors, (210), 4 states have call successors, (210) [2025-03-17 00:07:42,392 INFO L276 IsEmpty]: Start isEmpty. Operand 4947 states and 7703 transitions. [2025-03-17 00:07:42,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-03-17 00:07:42,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:42,401 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:42,411 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-17 00:07:42,601 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,SelfDestructingSolverStorable7 [2025-03-17 00:07:42,602 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:42,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:42,602 INFO L85 PathProgramCache]: Analyzing trace with hash -379556245, now seen corresponding path program 1 times [2025-03-17 00:07:42,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:42,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939240556] [2025-03-17 00:07:42,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:42,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:42,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-03-17 00:07:42,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-03-17 00:07:42,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:42,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:43,193 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:07:43,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:43,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939240556] [2025-03-17 00:07:43,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939240556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:43,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:07:43,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:07:43,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298090535] [2025-03-17 00:07:43,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:43,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:07:43,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:43,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:07:43,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:07:43,198 INFO L87 Difference]: Start difference. First operand 4947 states and 7703 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:44,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:44,010 INFO L93 Difference]: Finished difference Result 10029 states and 15549 transitions. [2025-03-17 00:07:44,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:07:44,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 592 [2025-03-17 00:07:44,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:44,051 INFO L225 Difference]: With dead ends: 10029 [2025-03-17 00:07:44,051 INFO L226 Difference]: Without dead ends: 5083 [2025-03-17 00:07:44,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-17 00:07:44,074 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 194 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:44,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 713 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:07:44,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5083 states. [2025-03-17 00:07:44,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5083 to 5059. [2025-03-17 00:07:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5059 states, 2984 states have (on average 1.3240616621983914) internal successors, (3951), 3030 states have internal predecessors, (3951), 1924 states have call successors, (1924), 150 states have call predecessors, (1924), 150 states have return successors, (1924), 1878 states have call predecessors, (1924), 1924 states have call successors, (1924) [2025-03-17 00:07:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5059 states to 5059 states and 7799 transitions. [2025-03-17 00:07:44,745 INFO L78 Accepts]: Start accepts. Automaton has 5059 states and 7799 transitions. Word has length 592 [2025-03-17 00:07:44,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:44,746 INFO L471 AbstractCegarLoop]: Abstraction has 5059 states and 7799 transitions. [2025-03-17 00:07:44,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:44,747 INFO L276 IsEmpty]: Start isEmpty. Operand 5059 states and 7799 transitions. [2025-03-17 00:07:44,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-03-17 00:07:44,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:44,754 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:44,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:07:44,754 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:44,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:44,759 INFO L85 PathProgramCache]: Analyzing trace with hash -949928630, now seen corresponding path program 1 times [2025-03-17 00:07:44,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:44,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271095006] [2025-03-17 00:07:44,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:44,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:44,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-03-17 00:07:44,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-03-17 00:07:44,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:44,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:07:47,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:47,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271095006] [2025-03-17 00:07:47,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271095006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:47,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:07:47,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 00:07:47,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521261541] [2025-03-17 00:07:47,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:47,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:07:47,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:47,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:07:47,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:07:47,716 INFO L87 Difference]: Start difference. First operand 5059 states and 7799 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:53,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:53,789 INFO L93 Difference]: Finished difference Result 26191 states and 40529 transitions. [2025-03-17 00:07:53,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 00:07:53,790 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 593 [2025-03-17 00:07:53,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:53,921 INFO L225 Difference]: With dead ends: 26191 [2025-03-17 00:07:53,921 INFO L226 Difference]: Without dead ends: 21133 [2025-03-17 00:07:53,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2025-03-17 00:07:53,952 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 1740 mSDsluCounter, 1671 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 2279 SdHoareTripleChecker+Invalid, 2053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:53,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1740 Valid, 2279 Invalid, 2053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [644 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-17 00:07:53,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21133 states. [2025-03-17 00:07:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21133 to 16486. [2025-03-17 00:07:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16486 states, 10230 states have (on average 1.372336265884653) internal successors, (14039), 10395 states have internal predecessors, (14039), 5862 states have call successors, (5862), 393 states have call predecessors, (5862), 393 states have return successors, (5862), 5697 states have call predecessors, (5862), 5862 states have call successors, (5862) [2025-03-17 00:07:56,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16486 states to 16486 states and 25763 transitions. [2025-03-17 00:07:56,359 INFO L78 Accepts]: Start accepts. Automaton has 16486 states and 25763 transitions. Word has length 593 [2025-03-17 00:07:56,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:56,360 INFO L471 AbstractCegarLoop]: Abstraction has 16486 states and 25763 transitions. [2025-03-17 00:07:56,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:56,361 INFO L276 IsEmpty]: Start isEmpty. Operand 16486 states and 25763 transitions. [2025-03-17 00:07:56,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-03-17 00:07:56,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:56,372 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:56,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:07:56,373 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:56,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:56,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1000371625, now seen corresponding path program 1 times [2025-03-17 00:07:56,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:56,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202196818] [2025-03-17 00:07:56,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:56,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:56,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-03-17 00:07:56,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-03-17 00:07:56,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:56,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:07:56,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:56,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202196818] [2025-03-17 00:07:56,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202196818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:56,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:07:56,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:07:56,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123909554] [2025-03-17 00:07:56,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:56,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:07:56,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:56,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:07:56,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:07:56,821 INFO L87 Difference]: Start difference. First operand 16486 states and 25763 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:08:01,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:08:01,854 INFO L93 Difference]: Finished difference Result 46099 states and 72116 transitions. [2025-03-17 00:08:01,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:08:01,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 593 [2025-03-17 00:08:01,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:08:02,034 INFO L225 Difference]: With dead ends: 46099 [2025-03-17 00:08:02,035 INFO L226 Difference]: Without dead ends: 29614 [2025-03-17 00:08:02,108 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-17 00:08:02,109 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 656 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1894 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:08:02,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 1894 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 00:08:02,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29614 states. [2025-03-17 00:08:05,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29614 to 19422. [2025-03-17 00:08:05,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19422 states, 12117 states have (on average 1.373524799867954) internal successors, (16643), 12305 states have internal predecessors, (16643), 6824 states have call successors, (6824), 480 states have call predecessors, (6824), 480 states have return successors, (6824), 6636 states have call predecessors, (6824), 6824 states have call successors, (6824) [2025-03-17 00:08:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19422 states to 19422 states and 30291 transitions. [2025-03-17 00:08:05,194 INFO L78 Accepts]: Start accepts. Automaton has 19422 states and 30291 transitions. Word has length 593 [2025-03-17 00:08:05,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:08:05,195 INFO L471 AbstractCegarLoop]: Abstraction has 19422 states and 30291 transitions. [2025-03-17 00:08:05,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:08:05,195 INFO L276 IsEmpty]: Start isEmpty. Operand 19422 states and 30291 transitions. [2025-03-17 00:08:05,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-03-17 00:08:05,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:08:05,211 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:08:05,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 00:08:05,211 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:08:05,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:08:05,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1398625269, now seen corresponding path program 1 times [2025-03-17 00:08:05,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:08:05,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294673753] [2025-03-17 00:08:05,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:08:05,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:08:05,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-03-17 00:08:05,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-03-17 00:08:05,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:08:05,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:08:05,902 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 126 proven. 165 refuted. 0 times theorem prover too weak. 18721 trivial. 0 not checked. [2025-03-17 00:08:05,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:08:05,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294673753] [2025-03-17 00:08:05,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294673753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:08:05,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606961459] [2025-03-17 00:08:05,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:08:05,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:08:05,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:08:05,906 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-17 00:08:05,915 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-17 00:08:06,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-03-17 00:08:06,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-03-17 00:08:06,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:08:06,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:08:06,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 00:08:06,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:08:07,689 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 12085 proven. 165 refuted. 0 times theorem prover too weak. 6762 trivial. 0 not checked. [2025-03-17 00:08:07,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:08:08,438 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 126 proven. 165 refuted. 0 times theorem prover too weak. 18721 trivial. 0 not checked. [2025-03-17 00:08:08,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606961459] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:08:08,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:08:08,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-17 00:08:08,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658338205] [2025-03-17 00:08:08,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:08:08,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 00:08:08,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:08:08,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 00:08:08,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-03-17 00:08:08,442 INFO L87 Difference]: Start difference. First operand 19422 states and 30291 transitions. Second operand has 17 states, 17 states have (on average 13.235294117647058) internal successors, (225), 17 states have internal predecessors, (225), 6 states have call successors, (208), 3 states have call predecessors, (208), 5 states have return successors, (209), 6 states have call predecessors, (209), 6 states have call successors, (209) [2025-03-17 00:08:12,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:08:12,806 INFO L93 Difference]: Finished difference Result 39380 states and 61231 transitions. [2025-03-17 00:08:12,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 00:08:12,807 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 13.235294117647058) internal successors, (225), 17 states have internal predecessors, (225), 6 states have call successors, (208), 3 states have call predecessors, (208), 5 states have return successors, (209), 6 states have call predecessors, (209), 6 states have call successors, (209) Word has length 593 [2025-03-17 00:08:12,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:08:12,927 INFO L225 Difference]: With dead ends: 39380 [2025-03-17 00:08:12,928 INFO L226 Difference]: Without dead ends: 19959 [2025-03-17 00:08:12,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1201 GetRequests, 1177 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2025-03-17 00:08:12,975 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 549 mSDsluCounter, 1527 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:08:12,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1808 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 00:08:12,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19959 states. [2025-03-17 00:08:16,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19959 to 19029. [2025-03-17 00:08:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19029 states, 11872 states have (on average 1.3673349056603774) internal successors, (16233), 12060 states have internal predecessors, (16233), 6676 states have call successors, (6676), 480 states have call predecessors, (6676), 480 states have return successors, (6676), 6488 states have call predecessors, (6676), 6676 states have call successors, (6676) [2025-03-17 00:08:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19029 states to 19029 states and 29585 transitions. [2025-03-17 00:08:16,168 INFO L78 Accepts]: Start accepts. Automaton has 19029 states and 29585 transitions. Word has length 593 [2025-03-17 00:08:16,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:08:16,169 INFO L471 AbstractCegarLoop]: Abstraction has 19029 states and 29585 transitions. [2025-03-17 00:08:16,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.235294117647058) internal successors, (225), 17 states have internal predecessors, (225), 6 states have call successors, (208), 3 states have call predecessors, (208), 5 states have return successors, (209), 6 states have call predecessors, (209), 6 states have call successors, (209) [2025-03-17 00:08:16,169 INFO L276 IsEmpty]: Start isEmpty. Operand 19029 states and 29585 transitions. [2025-03-17 00:08:16,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-03-17 00:08:16,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:08:16,180 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:08:16,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 00:08:16,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:08:16,385 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:08:16,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:08:16,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1885445118, now seen corresponding path program 1 times [2025-03-17 00:08:16,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:08:16,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124428688] [2025-03-17 00:08:16,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:08:16,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:08:16,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-03-17 00:08:16,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-03-17 00:08:16,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:08:16,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:08:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:08:17,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:08:17,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124428688] [2025-03-17 00:08:17,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124428688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:08:17,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:08:17,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:08:17,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221516610] [2025-03-17 00:08:17,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:08:17,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:08:17,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:08:17,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:08:17,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:08:17,199 INFO L87 Difference]: Start difference. First operand 19029 states and 29585 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:08:21,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:08:21,405 INFO L93 Difference]: Finished difference Result 38194 states and 59399 transitions. [2025-03-17 00:08:21,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:08:21,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 594 [2025-03-17 00:08:21,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:08:21,552 INFO L225 Difference]: With dead ends: 38194 [2025-03-17 00:08:21,552 INFO L226 Difference]: Without dead ends: 19166 [2025-03-17 00:08:21,624 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-17 00:08:21,625 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 291 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:08:21,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1004 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:08:21,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19166 states. [2025-03-17 00:08:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19166 to 19084. [2025-03-17 00:08:24,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19084 states, 11927 states have (on average 1.3656409826444202) internal successors, (16288), 12115 states have internal predecessors, (16288), 6676 states have call successors, (6676), 480 states have call predecessors, (6676), 480 states have return successors, (6676), 6488 states have call predecessors, (6676), 6676 states have call successors, (6676) [2025-03-17 00:08:25,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19084 states to 19084 states and 29640 transitions. [2025-03-17 00:08:25,153 INFO L78 Accepts]: Start accepts. Automaton has 19084 states and 29640 transitions. Word has length 594 [2025-03-17 00:08:25,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:08:25,154 INFO L471 AbstractCegarLoop]: Abstraction has 19084 states and 29640 transitions. [2025-03-17 00:08:25,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:08:25,154 INFO L276 IsEmpty]: Start isEmpty. Operand 19084 states and 29640 transitions. [2025-03-17 00:08:25,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-03-17 00:08:25,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:08:25,172 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:08:25,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 00:08:25,172 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:08:25,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:08:25,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1040973247, now seen corresponding path program 1 times [2025-03-17 00:08:25,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:08:25,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002432138] [2025-03-17 00:08:25,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:08:25,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:08:25,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-03-17 00:08:25,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-03-17 00:08:25,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:08:25,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:08:25,696 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 198 proven. 93 refuted. 0 times theorem prover too weak. 18721 trivial. 0 not checked. [2025-03-17 00:08:25,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:08:25,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002432138] [2025-03-17 00:08:25,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002432138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:08:25,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892230180] [2025-03-17 00:08:25,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:08:25,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:08:25,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:08:25,699 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-17 00:08:25,702 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-17 00:08:25,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-03-17 00:08:25,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-03-17 00:08:25,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:08:25,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:08:25,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 1301 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 00:08:25,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:08:26,844 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 8533 proven. 93 refuted. 0 times theorem prover too weak. 10386 trivial. 0 not checked. [2025-03-17 00:08:26,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:08:27,811 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 198 proven. 93 refuted. 0 times theorem prover too weak. 18721 trivial. 0 not checked. [2025-03-17 00:08:27,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892230180] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:08:27,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:08:27,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-17 00:08:27,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548209268] [2025-03-17 00:08:27,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:08:27,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 00:08:27,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:08:27,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 00:08:27,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:08:27,814 INFO L87 Difference]: Start difference. First operand 19084 states and 29640 transitions. Second operand has 11 states, 11 states have (on average 16.454545454545453) internal successors, (181), 10 states have internal predecessors, (181), 6 states have call successors, (160), 3 states have call predecessors, (160), 5 states have return successors, (161), 6 states have call predecessors, (161), 6 states have call successors, (161) [2025-03-17 00:08:31,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:08:31,176 INFO L93 Difference]: Finished difference Result 38575 states and 59679 transitions. [2025-03-17 00:08:31,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 00:08:31,177 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 16.454545454545453) internal successors, (181), 10 states have internal predecessors, (181), 6 states have call successors, (160), 3 states have call predecessors, (160), 5 states have return successors, (161), 6 states have call predecessors, (161), 6 states have call successors, (161) Word has length 594 [2025-03-17 00:08:31,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:08:31,327 INFO L225 Difference]: With dead ends: 38575 [2025-03-17 00:08:31,327 INFO L226 Difference]: Without dead ends: 19492 [2025-03-17 00:08:31,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1197 GetRequests, 1183 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-03-17 00:08:31,388 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 634 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:08:31,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 704 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:08:31,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19492 states.