./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-19.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 8782992ede62a00cd83cf50ccb00b62cd9fb02bef3f9a0721eb7de82bc29451b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:44:31,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:44:31,244 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:44:31,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:44:31,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:44:31,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:44:31,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:44:31,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:44:31,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:44:31,268 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:44:31,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:44:31,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:44:31,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:44:31,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:44:31,268 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:44:31,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:44:31,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:44:31,268 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:44:31,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:44:31,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:44:31,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:44:31,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:44:31,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:44:31,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:44:31,269 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:44:31,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:44:31,269 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:44:31,269 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:44:31,269 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:44:31,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:44:31,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:44:31,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:44:31,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:44:31,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:44:31,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:44:31,269 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:44:31,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:44:31,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:44:31,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:44:31,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:44:31,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:44:31,269 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:44:31,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:44:31,270 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 -> 8782992ede62a00cd83cf50ccb00b62cd9fb02bef3f9a0721eb7de82bc29451b [2025-03-03 19:44:31,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:44:31,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:44:31,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:44:31,522 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:44:31,523 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:44:31,524 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-19.i [2025-03-03 19:44:32,719 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b1d2e5e/05001358109c4f91aa453d389b8d2b76/FLAGf8178dd19 [2025-03-03 19:44:32,945 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:44:32,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-19.i [2025-03-03 19:44:32,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b1d2e5e/05001358109c4f91aa453d389b8d2b76/FLAGf8178dd19 [2025-03-03 19:44:32,966 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b1d2e5e/05001358109c4f91aa453d389b8d2b76 [2025-03-03 19:44:32,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:44:32,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:44:32,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:44:32,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:44:32,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:44:32,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:44:32" (1/1) ... [2025-03-03 19:44:32,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@261c242d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:32, skipping insertion in model container [2025-03-03 19:44:32,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:44:32" (1/1) ... [2025-03-03 19:44:32,997 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:44:33,094 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-19.i[916,929] [2025-03-03 19:44:33,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:44:33,202 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:44:33,209 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-19.i[916,929] [2025-03-03 19:44:33,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:44:33,276 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:44:33,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:33 WrapperNode [2025-03-03 19:44:33,278 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:44:33,279 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:44:33,279 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:44:33,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:44:33,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:33" (1/1) ... [2025-03-03 19:44:33,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:33" (1/1) ... [2025-03-03 19:44:33,348 INFO L138 Inliner]: procedures = 26, calls = 95, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 576 [2025-03-03 19:44:33,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:44:33,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:44:33,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:44:33,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:44:33,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:33" (1/1) ... [2025-03-03 19:44:33,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:33" (1/1) ... [2025-03-03 19:44:33,368 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:33" (1/1) ... [2025-03-03 19:44:33,402 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-03 19:44:33,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:33" (1/1) ... [2025-03-03 19:44:33,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:33" (1/1) ... [2025-03-03 19:44:33,424 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:33" (1/1) ... [2025-03-03 19:44:33,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:33" (1/1) ... [2025-03-03 19:44:33,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:33" (1/1) ... [2025-03-03 19:44:33,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:33" (1/1) ... [2025-03-03 19:44:33,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:44:33,457 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:44:33,458 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:44:33,458 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:44:33,459 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:33" (1/1) ... [2025-03-03 19:44:33,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:44:33,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:44:33,484 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-03 19:44:33,487 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-03 19:44:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:44:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:44:33,505 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:44:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:44:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:44:33,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:44:33,599 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:44:33,600 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:44:34,383 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 19:44:34,384 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:44:34,412 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:44:34,412 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:44:34,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:44:34 BoogieIcfgContainer [2025-03-03 19:44:34,413 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:44:34,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:44:34,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:44:34,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:44:34,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:44:32" (1/3) ... [2025-03-03 19:44:34,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dfe94a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:44:34, skipping insertion in model container [2025-03-03 19:44:34,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:33" (2/3) ... [2025-03-03 19:44:34,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dfe94a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:44:34, skipping insertion in model container [2025-03-03 19:44:34,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:44:34" (3/3) ... [2025-03-03 19:44:34,423 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-19.i [2025-03-03 19:44:34,434 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:44:34,438 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-19.i that has 2 procedures, 238 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:44:34,492 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:44:34,501 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;@57aeeb98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:44:34,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:44:34,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 238 states, 153 states have (on average 1.5098039215686274) internal successors, (231), 154 states have internal predecessors, (231), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 19:44:34,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-03 19:44:34,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:34,529 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:44:34,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:34,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:34,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1714756022, now seen corresponding path program 1 times [2025-03-03 19:44:34,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:34,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540167222] [2025-03-03 19:44:34,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:34,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:34,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-03 19:44:34,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-03 19:44:34,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:34,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:35,001 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 13122 trivial. 0 not checked. [2025-03-03 19:44:35,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:44:35,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540167222] [2025-03-03 19:44:35,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540167222] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:44:35,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445408017] [2025-03-03 19:44:35,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:35,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:44:35,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:44:35,006 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-03 19:44:35,008 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-03 19:44:35,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-03 19:44:35,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-03 19:44:35,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:35,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:35,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 1175 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:44:35,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:44:35,332 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 13122 trivial. 0 not checked. [2025-03-03 19:44:35,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:44:35,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445408017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:44:35,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:44:35,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:44:35,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121570752] [2025-03-03 19:44:35,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:44:35,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:44:35,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:44:35,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:44:35,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:44:35,357 INFO L87 Difference]: Start difference. First operand has 238 states, 153 states have (on average 1.5098039215686274) internal successors, (231), 154 states have internal predecessors, (231), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) Second operand has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (82), 2 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 2 states have call successors, (82) [2025-03-03 19:44:35,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:44:35,417 INFO L93 Difference]: Finished difference Result 469 states and 865 transitions. [2025-03-03 19:44:35,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:44:35,420 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (82), 2 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 2 states have call successors, (82) Word has length 520 [2025-03-03 19:44:35,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:44:35,428 INFO L225 Difference]: With dead ends: 469 [2025-03-03 19:44:35,428 INFO L226 Difference]: Without dead ends: 234 [2025-03-03 19:44:35,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 521 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-03 19:44:35,438 INFO L435 NwaCegarLoop]: 376 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, 376 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-03 19:44:35,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:44:35,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-03 19:44:35,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2025-03-03 19:44:35,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 150 states have (on average 1.48) internal successors, (222), 150 states have internal predecessors, (222), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 19:44:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 386 transitions. [2025-03-03 19:44:35,506 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 386 transitions. Word has length 520 [2025-03-03 19:44:35,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:44:35,507 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 386 transitions. [2025-03-03 19:44:35,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (82), 2 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 2 states have call successors, (82) [2025-03-03 19:44:35,509 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 386 transitions. [2025-03-03 19:44:35,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-03 19:44:35,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:35,520 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:44:35,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:44:35,721 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-03 19:44:35,721 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:35,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:35,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2096822204, now seen corresponding path program 1 times [2025-03-03 19:44:35,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:35,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547551530] [2025-03-03 19:44:35,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:35,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:35,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-03 19:44:35,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-03 19:44:35,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:35,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:36,479 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-03 19:44:36,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:44:36,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547551530] [2025-03-03 19:44:36,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547551530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:44:36,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:44:36,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:44:36,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976713101] [2025-03-03 19:44:36,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:44:36,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:44:36,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:44:36,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:44:36,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:44:36,486 INFO L87 Difference]: Start difference. First operand 234 states and 386 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-03 19:44:36,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:44:36,881 INFO L93 Difference]: Finished difference Result 696 states and 1152 transitions. [2025-03-03 19:44:36,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:44:36,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 520 [2025-03-03 19:44:36,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:44:36,889 INFO L225 Difference]: With dead ends: 696 [2025-03-03 19:44:36,890 INFO L226 Difference]: Without dead ends: 465 [2025-03-03 19:44:36,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:44:36,892 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 626 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:44:36,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 689 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:44:36,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-03 19:44:36,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 241. [2025-03-03 19:44:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 157 states have (on average 1.4904458598726114) internal successors, (234), 157 states have internal predecessors, (234), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 19:44:36,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 398 transitions. [2025-03-03 19:44:36,952 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 398 transitions. Word has length 520 [2025-03-03 19:44:36,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:44:36,956 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 398 transitions. [2025-03-03 19:44:36,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-03 19:44:36,957 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 398 transitions. [2025-03-03 19:44:36,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-03 19:44:36,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:36,966 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:44:36,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:44:36,967 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:36,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:36,967 INFO L85 PathProgramCache]: Analyzing trace with hash -2076484829, now seen corresponding path program 1 times [2025-03-03 19:44:36,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:36,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725133771] [2025-03-03 19:44:36,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:36,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:37,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-03 19:44:37,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-03 19:44:37,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:37,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:37,289 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-03 19:44:37,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:44:37,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725133771] [2025-03-03 19:44:37,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725133771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:44:37,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:44:37,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:44:37,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604570277] [2025-03-03 19:44:37,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:44:37,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:44:37,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:44:37,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:44:37,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:44:37,292 INFO L87 Difference]: Start difference. First operand 241 states and 398 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-03 19:44:37,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:44:37,393 INFO L93 Difference]: Finished difference Result 626 states and 1037 transitions. [2025-03-03 19:44:37,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:44:37,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 520 [2025-03-03 19:44:37,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:44:37,398 INFO L225 Difference]: With dead ends: 626 [2025-03-03 19:44:37,400 INFO L226 Difference]: Without dead ends: 388 [2025-03-03 19:44:37,401 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-03 19:44:37,402 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 219 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:44:37,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 800 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:44:37,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-03 19:44:37,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 385. [2025-03-03 19:44:37,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 271 states have (on average 1.5166051660516606) internal successors, (411), 272 states have internal predecessors, (411), 111 states have call successors, (111), 2 states have call predecessors, (111), 2 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2025-03-03 19:44:37,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 633 transitions. [2025-03-03 19:44:37,450 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 633 transitions. Word has length 520 [2025-03-03 19:44:37,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:44:37,453 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 633 transitions. [2025-03-03 19:44:37,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-03 19:44:37,453 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 633 transitions. [2025-03-03 19:44:37,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-03 19:44:37,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:37,461 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:44:37,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:44:37,461 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:37,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:37,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1248901444, now seen corresponding path program 1 times [2025-03-03 19:44:37,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:37,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426883139] [2025-03-03 19:44:37,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:37,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:37,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-03 19:44:37,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-03 19:44:37,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:37,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-03 19:44:39,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:44:39,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426883139] [2025-03-03 19:44:39,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426883139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:44:39,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:44:39,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 19:44:39,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056416629] [2025-03-03 19:44:39,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:44:39,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 19:44:39,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:44:39,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 19:44:39,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:44:39,788 INFO L87 Difference]: Start difference. First operand 385 states and 633 transitions. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-03 19:44:43,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:44:43,835 INFO L93 Difference]: Finished difference Result 1950 states and 3164 transitions. [2025-03-03 19:44:43,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 19:44:43,838 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 520 [2025-03-03 19:44:43,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:44:43,849 INFO L225 Difference]: With dead ends: 1950 [2025-03-03 19:44:43,849 INFO L226 Difference]: Without dead ends: 1568 [2025-03-03 19:44:43,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2025-03-03 19:44:43,852 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 2160 mSDsluCounter, 2561 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 3137 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:44:43,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2160 Valid, 3137 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-03 19:44:43,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2025-03-03 19:44:43,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1253. [2025-03-03 19:44:43,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 889 states have (on average 1.5118110236220472) internal successors, (1344), 896 states have internal predecessors, (1344), 349 states have call successors, (349), 14 states have call predecessors, (349), 14 states have return successors, (349), 342 states have call predecessors, (349), 349 states have call successors, (349) [2025-03-03 19:44:44,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2042 transitions. [2025-03-03 19:44:44,010 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2042 transitions. Word has length 520 [2025-03-03 19:44:44,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:44:44,011 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 2042 transitions. [2025-03-03 19:44:44,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-03 19:44:44,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2042 transitions. [2025-03-03 19:44:44,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-03 19:44:44,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:44,016 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:44:44,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:44:44,017 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:44,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:44,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1181894691, now seen corresponding path program 1 times [2025-03-03 19:44:44,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:44,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045374659] [2025-03-03 19:44:44,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:44,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:44,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-03 19:44:44,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-03 19:44:44,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:44,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:44,681 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-03 19:44:44,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:44:44,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045374659] [2025-03-03 19:44:44,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045374659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:44:44,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:44:44,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:44:44,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469574498] [2025-03-03 19:44:44,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:44:44,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:44:44,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:44:44,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:44:44,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:44:44,685 INFO L87 Difference]: Start difference. First operand 1253 states and 2042 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-03 19:44:45,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:44:45,165 INFO L93 Difference]: Finished difference Result 3859 states and 6281 transitions. [2025-03-03 19:44:45,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:44:45,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 520 [2025-03-03 19:44:45,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:44:45,181 INFO L225 Difference]: With dead ends: 3859 [2025-03-03 19:44:45,182 INFO L226 Difference]: Without dead ends: 2609 [2025-03-03 19:44:45,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:44:45,188 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 343 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:44:45,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1127 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:44:45,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2025-03-03 19:44:45,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 2501. [2025-03-03 19:44:45,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 1774 states have (on average 1.503945885005637) internal successors, (2668), 1788 states have internal predecessors, (2668), 698 states have call successors, (698), 28 states have call predecessors, (698), 28 states have return successors, (698), 684 states have call predecessors, (698), 698 states have call successors, (698) [2025-03-03 19:44:45,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 4064 transitions. [2025-03-03 19:44:45,478 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 4064 transitions. Word has length 520 [2025-03-03 19:44:45,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:44:45,479 INFO L471 AbstractCegarLoop]: Abstraction has 2501 states and 4064 transitions. [2025-03-03 19:44:45,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-03 19:44:45,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 4064 transitions. [2025-03-03 19:44:45,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-03 19:44:45,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:45,483 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:44:45,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:44:45,483 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:45,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:45,484 INFO L85 PathProgramCache]: Analyzing trace with hash 676336066, now seen corresponding path program 1 times [2025-03-03 19:44:45,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:45,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145842707] [2025-03-03 19:44:45,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:45,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:45,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-03 19:44:45,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-03 19:44:45,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:45,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:45,935 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-03 19:44:45,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:44:45,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145842707] [2025-03-03 19:44:45,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145842707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:44:45,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:44:45,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:44:45,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427024702] [2025-03-03 19:44:45,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:44:45,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:44:45,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:44:45,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:44:45,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:44:45,937 INFO L87 Difference]: Start difference. First operand 2501 states and 4064 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-03 19:44:46,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:44:46,295 INFO L93 Difference]: Finished difference Result 6249 states and 10164 transitions. [2025-03-03 19:44:46,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:44:46,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 520 [2025-03-03 19:44:46,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:44:46,323 INFO L225 Difference]: With dead ends: 6249 [2025-03-03 19:44:46,323 INFO L226 Difference]: Without dead ends: 3751 [2025-03-03 19:44:46,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:44:46,333 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 204 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:44:46,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 740 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:44:46,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3751 states. [2025-03-03 19:44:46,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3751 to 3749. [2025-03-03 19:44:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3749 states, 2659 states have (on average 1.4952989845806695) internal successors, (3976), 2680 states have internal predecessors, (3976), 1047 states have call successors, (1047), 42 states have call predecessors, (1047), 42 states have return successors, (1047), 1026 states have call predecessors, (1047), 1047 states have call successors, (1047) [2025-03-03 19:44:46,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3749 states to 3749 states and 6070 transitions. [2025-03-03 19:44:46,753 INFO L78 Accepts]: Start accepts. Automaton has 3749 states and 6070 transitions. Word has length 520 [2025-03-03 19:44:46,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:44:46,754 INFO L471 AbstractCegarLoop]: Abstraction has 3749 states and 6070 transitions. [2025-03-03 19:44:46,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-03 19:44:46,754 INFO L276 IsEmpty]: Start isEmpty. Operand 3749 states and 6070 transitions. [2025-03-03 19:44:46,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-03 19:44:46,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:46,758 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:44:46,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:44:46,758 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:46,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:46,759 INFO L85 PathProgramCache]: Analyzing trace with hash 382933059, now seen corresponding path program 1 times [2025-03-03 19:44:46,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:46,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473146694] [2025-03-03 19:44:46,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:46,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:46,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-03 19:44:46,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-03 19:44:46,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:46,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:47,319 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 156 proven. 87 refuted. 0 times theorem prover too weak. 13041 trivial. 0 not checked. [2025-03-03 19:44:47,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:44:47,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473146694] [2025-03-03 19:44:47,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473146694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:44:47,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810253203] [2025-03-03 19:44:47,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:47,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:44:47,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:44:47,321 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-03 19:44:47,323 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-03 19:44:47,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-03 19:44:47,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-03 19:44:47,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:47,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:47,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 19:44:47,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:44:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 2031 proven. 18 refuted. 0 times theorem prover too weak. 11235 trivial. 0 not checked. [2025-03-03 19:44:47,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:44:48,092 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 225 proven. 18 refuted. 0 times theorem prover too weak. 13041 trivial. 0 not checked. [2025-03-03 19:44:48,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810253203] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:44:48,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:44:48,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-03 19:44:48,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000989508] [2025-03-03 19:44:48,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:44:48,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:44:48,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:44:48,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:44:48,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:44:48,095 INFO L87 Difference]: Start difference. First operand 3749 states and 6070 transitions. Second operand has 9 states, 9 states have (on average 19.88888888888889) internal successors, (179), 9 states have internal predecessors, (179), 3 states have call successors, (117), 2 states have call predecessors, (117), 4 states have return successors, (119), 3 states have call predecessors, (119), 3 states have call successors, (119) [2025-03-03 19:44:50,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:44:50,509 INFO L93 Difference]: Finished difference Result 10539 states and 16798 transitions. [2025-03-03 19:44:50,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 19:44:50,510 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.88888888888889) internal successors, (179), 9 states have internal predecessors, (179), 3 states have call successors, (117), 2 states have call predecessors, (117), 4 states have return successors, (119), 3 states have call predecessors, (119), 3 states have call successors, (119) Word has length 520 [2025-03-03 19:44:50,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:44:50,549 INFO L225 Difference]: With dead ends: 10539 [2025-03-03 19:44:50,549 INFO L226 Difference]: Without dead ends: 6793 [2025-03-03 19:44:50,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1063 GetRequests, 1039 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2025-03-03 19:44:50,564 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 844 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:44:50,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 1525 Invalid, 2198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 1671 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 19:44:50,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6793 states. [2025-03-03 19:44:51,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6793 to 5340. [2025-03-03 19:44:51,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5340 states, 3768 states have (on average 1.4721337579617835) internal successors, (5547), 3802 states have internal predecessors, (5547), 1503 states have call successors, (1503), 68 states have call predecessors, (1503), 68 states have return successors, (1503), 1469 states have call predecessors, (1503), 1503 states have call successors, (1503) [2025-03-03 19:44:51,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5340 states to 5340 states and 8553 transitions. [2025-03-03 19:44:51,229 INFO L78 Accepts]: Start accepts. Automaton has 5340 states and 8553 transitions. Word has length 520 [2025-03-03 19:44:51,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:44:51,230 INFO L471 AbstractCegarLoop]: Abstraction has 5340 states and 8553 transitions. [2025-03-03 19:44:51,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.88888888888889) internal successors, (179), 9 states have internal predecessors, (179), 3 states have call successors, (117), 2 states have call predecessors, (117), 4 states have return successors, (119), 3 states have call predecessors, (119), 3 states have call successors, (119) [2025-03-03 19:44:51,231 INFO L276 IsEmpty]: Start isEmpty. Operand 5340 states and 8553 transitions. [2025-03-03 19:44:51,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-03 19:44:51,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:51,235 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:44:51,244 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-03 19:44:51,440 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,SelfDestructingSolverStorable6 [2025-03-03 19:44:51,440 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:51,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:51,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1085671458, now seen corresponding path program 1 times [2025-03-03 19:44:51,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:51,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334428988] [2025-03-03 19:44:51,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:51,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:51,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-03 19:44:51,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-03 19:44:51,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:51,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:51,938 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 195 proven. 48 refuted. 0 times theorem prover too weak. 13041 trivial. 0 not checked. [2025-03-03 19:44:51,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:44:51,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334428988] [2025-03-03 19:44:51,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334428988] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:44:51,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393813771] [2025-03-03 19:44:51,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:51,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:44:51,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:44:51,943 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-03 19:44:51,945 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-03 19:44:52,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-03 19:44:52,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-03 19:44:52,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:52,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:52,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 19:44:52,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:44:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 8277 proven. 48 refuted. 0 times theorem prover too weak. 4959 trivial. 0 not checked. [2025-03-03 19:44:52,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:44:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 195 proven. 48 refuted. 0 times theorem prover too weak. 13041 trivial. 0 not checked. [2025-03-03 19:44:53,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393813771] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:44:53,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:44:53,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-03-03 19:44:53,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355675941] [2025-03-03 19:44:53,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:44:53,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 19:44:53,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:44:53,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 19:44:53,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-03-03 19:44:53,122 INFO L87 Difference]: Start difference. First operand 5340 states and 8553 transitions. Second operand has 17 states, 17 states have (on average 13.117647058823529) internal successors, (223), 17 states have internal predecessors, (223), 6 states have call successors, (162), 3 states have call predecessors, (162), 6 states have return successors, (162), 6 states have call predecessors, (162), 6 states have call successors, (162) [2025-03-03 19:44:54,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:44:54,350 INFO L93 Difference]: Finished difference Result 10714 states and 17084 transitions. [2025-03-03 19:44:54,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 19:44:54,353 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 13.117647058823529) internal successors, (223), 17 states have internal predecessors, (223), 6 states have call successors, (162), 3 states have call predecessors, (162), 6 states have return successors, (162), 6 states have call predecessors, (162), 6 states have call successors, (162) Word has length 520 [2025-03-03 19:44:54,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:44:54,380 INFO L225 Difference]: With dead ends: 10714 [2025-03-03 19:44:54,381 INFO L226 Difference]: Without dead ends: 5504 [2025-03-03 19:44:54,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1050 GetRequests, 1031 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2025-03-03 19:44:54,393 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 930 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 521 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 521 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:44:54,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 1056 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [521 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:44:54,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5504 states. [2025-03-03 19:44:55,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5504 to 5392. [2025-03-03 19:44:55,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5392 states, 3813 states have (on average 1.4476789929189615) internal successors, (5520), 3847 states have internal predecessors, (5520), 1503 states have call successors, (1503), 75 states have call predecessors, (1503), 75 states have return successors, (1503), 1469 states have call predecessors, (1503), 1503 states have call successors, (1503) [2025-03-03 19:44:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5392 states to 5392 states and 8526 transitions. [2025-03-03 19:44:55,154 INFO L78 Accepts]: Start accepts. Automaton has 5392 states and 8526 transitions. Word has length 520 [2025-03-03 19:44:55,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:44:55,155 INFO L471 AbstractCegarLoop]: Abstraction has 5392 states and 8526 transitions. [2025-03-03 19:44:55,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.117647058823529) internal successors, (223), 17 states have internal predecessors, (223), 6 states have call successors, (162), 3 states have call predecessors, (162), 6 states have return successors, (162), 6 states have call predecessors, (162), 6 states have call successors, (162) [2025-03-03 19:44:55,156 INFO L276 IsEmpty]: Start isEmpty. Operand 5392 states and 8526 transitions. [2025-03-03 19:44:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2025-03-03 19:44:55,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:55,162 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:44:55,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 19:44:55,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:44:55,362 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:55,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:55,363 INFO L85 PathProgramCache]: Analyzing trace with hash 2003343902, now seen corresponding path program 1 times [2025-03-03 19:44:55,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:55,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752973229] [2025-03-03 19:44:55,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:55,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:55,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-03-03 19:44:55,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-03-03 19:44:55,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:55,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:10,363 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 195 proven. 48 refuted. 0 times theorem prover too weak. 13041 trivial. 0 not checked. [2025-03-03 19:45:10,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:10,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752973229] [2025-03-03 19:45:10,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752973229] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:45:10,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133003664] [2025-03-03 19:45:10,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:10,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:45:10,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:45:10,369 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-03 19:45:10,371 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-03 19:45:10,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-03-03 19:45:10,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-03-03 19:45:10,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:10,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:10,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 19:45:10,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:45:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 4389 proven. 90 refuted. 0 times theorem prover too weak. 8805 trivial. 0 not checked. [2025-03-03 19:45:11,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:45:12,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133003664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:45:12,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:45:12,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2025-03-03 19:45:12,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497702291] [2025-03-03 19:45:12,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 19:45:12,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 19:45:12,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:12,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 19:45:12,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2025-03-03 19:45:12,522 INFO L87 Difference]: Start difference. First operand 5392 states and 8526 transitions. Second operand has 16 states, 16 states have (on average 10.4375) internal successors, (167), 16 states have internal predecessors, (167), 3 states have call successors, (98), 3 states have call predecessors, (98), 4 states have return successors, (98), 3 states have call predecessors, (98), 3 states have call successors, (98) [2025-03-03 19:45:27,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:27,220 INFO L93 Difference]: Finished difference Result 20036 states and 31045 transitions. [2025-03-03 19:45:27,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-03 19:45:27,221 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.4375) internal successors, (167), 16 states have internal predecessors, (167), 3 states have call successors, (98), 3 states have call predecessors, (98), 4 states have return successors, (98), 3 states have call predecessors, (98), 3 states have call successors, (98) Word has length 522 [2025-03-03 19:45:27,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:27,300 INFO L225 Difference]: With dead ends: 20036 [2025-03-03 19:45:27,300 INFO L226 Difference]: Without dead ends: 14778 [2025-03-03 19:45:27,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 582 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=855, Invalid=2451, Unknown=0, NotChecked=0, Total=3306 [2025-03-03 19:45:27,319 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 2455 mSDsluCounter, 2614 mSDsCounter, 0 mSdLazyCounter, 3378 mSolverCounterSat, 1543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2521 SdHoareTripleChecker+Valid, 3056 SdHoareTripleChecker+Invalid, 4921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1543 IncrementalHoareTripleChecker+Valid, 3378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:27,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2521 Valid, 3056 Invalid, 4921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1543 Valid, 3378 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2025-03-03 19:45:27,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14778 states. [2025-03-03 19:45:29,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14778 to 11244. [2025-03-03 19:45:29,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11244 states, 7866 states have (on average 1.4225781845919145) internal successors, (11190), 7933 states have internal predecessors, (11190), 3171 states have call successors, (3171), 206 states have call predecessors, (3171), 206 states have return successors, (3171), 3104 states have call predecessors, (3171), 3171 states have call successors, (3171) [2025-03-03 19:45:29,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11244 states to 11244 states and 17532 transitions. [2025-03-03 19:45:29,447 INFO L78 Accepts]: Start accepts. Automaton has 11244 states and 17532 transitions. Word has length 522 [2025-03-03 19:45:29,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:29,452 INFO L471 AbstractCegarLoop]: Abstraction has 11244 states and 17532 transitions. [2025-03-03 19:45:29,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.4375) internal successors, (167), 16 states have internal predecessors, (167), 3 states have call successors, (98), 3 states have call predecessors, (98), 4 states have return successors, (98), 3 states have call predecessors, (98), 3 states have call successors, (98) [2025-03-03 19:45:29,455 INFO L276 IsEmpty]: Start isEmpty. Operand 11244 states and 17532 transitions. [2025-03-03 19:45:29,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2025-03-03 19:45:29,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:29,480 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:45:29,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 19:45:29,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:45:29,682 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:29,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:29,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1584745922, now seen corresponding path program 1 times [2025-03-03 19:45:29,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:29,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599386347] [2025-03-03 19:45:29,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:29,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:29,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-03-03 19:45:30,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-03-03 19:45:30,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:30,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 291 proven. 189 refuted. 0 times theorem prover too weak. 12804 trivial. 0 not checked. [2025-03-03 19:45:33,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:33,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599386347] [2025-03-03 19:45:33,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599386347] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:45:33,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564990340] [2025-03-03 19:45:33,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:33,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:45:33,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:45:33,777 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:45:33,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 19:45:33,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-03-03 19:45:34,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-03-03 19:45:34,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:34,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:34,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-03 19:45:34,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:45:37,931 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 8840 proven. 594 refuted. 0 times theorem prover too weak. 3850 trivial. 0 not checked. [2025-03-03 19:45:37,932 INFO L312 TraceCheckSpWp]: Computing backward predicates...