./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-82.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-82.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 90db53ce72b1ee9ca381af5f4f7789bdc057550f196d455f7f131773caa16c27 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:10:47,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:10:47,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:10:47,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:10:47,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:10:47,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:10:47,887 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:10:47,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:10:47,887 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:10:47,887 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:10:47,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:10:47,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:10:47,888 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:10:47,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:10:47,889 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:10:47,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:10:47,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:10:47,889 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:10:47,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:10:47,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:10:47,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:10:47,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:10:47,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:10:47,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:10:47,890 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:10:47,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:10:47,890 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:10:47,890 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:10:47,890 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:10:47,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:10:47,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:10:47,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:10:47,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:10:47,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:10:47,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:10:47,891 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:10:47,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:10:47,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:10:47,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:10:47,891 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:10:47,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:10:47,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:10:47,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:10:47,892 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 -> 90db53ce72b1ee9ca381af5f4f7789bdc057550f196d455f7f131773caa16c27 [2025-03-17 00:10:48,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:10:48,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:10:48,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:10:48,107 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:10:48,110 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:10:48,111 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-82.i [2025-03-17 00:10:49,236 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a717b8d58/624c8c1ebca84961b2bede7b50ed12df/FLAG5e7347803 [2025-03-17 00:10:49,555 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:10:49,556 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-82.i [2025-03-17 00:10:49,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a717b8d58/624c8c1ebca84961b2bede7b50ed12df/FLAG5e7347803 [2025-03-17 00:10:49,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a717b8d58/624c8c1ebca84961b2bede7b50ed12df [2025-03-17 00:10:49,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:10:49,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:10:49,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:10:49,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:10:49,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:10:49,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:10:49" (1/1) ... [2025-03-17 00:10:49,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b88f9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:49, skipping insertion in model container [2025-03-17 00:10:49,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:10:49" (1/1) ... [2025-03-17 00:10:49,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:10:49,921 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-82.i[916,929] [2025-03-17 00:10:49,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:10:50,008 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:10:50,015 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-82.i[916,929] [2025-03-17 00:10:50,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:10:50,094 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:10:50,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:50 WrapperNode [2025-03-17 00:10:50,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:10:50,097 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:10:50,097 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:10:50,097 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:10:50,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:50" (1/1) ... [2025-03-17 00:10:50,115 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:50" (1/1) ... [2025-03-17 00:10:50,153 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 573 [2025-03-17 00:10:50,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:10:50,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:10:50,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:10:50,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:10:50,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:50" (1/1) ... [2025-03-17 00:10:50,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:50" (1/1) ... [2025-03-17 00:10:50,174 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:50" (1/1) ... [2025-03-17 00:10:50,192 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 00:10:50,192 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:50" (1/1) ... [2025-03-17 00:10:50,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:50" (1/1) ... [2025-03-17 00:10:50,214 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:50" (1/1) ... [2025-03-17 00:10:50,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:50" (1/1) ... [2025-03-17 00:10:50,222 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:50" (1/1) ... [2025-03-17 00:10:50,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:50" (1/1) ... [2025-03-17 00:10:50,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:10:50,229 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:10:50,229 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:10:50,229 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:10:50,230 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:50" (1/1) ... [2025-03-17 00:10:50,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:10:50,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:10:50,258 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 00:10:50,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 00:10:50,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:10:50,280 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:10:50,280 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:10:50,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:10:50,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:10:50,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:10:50,393 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:10:50,394 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:10:51,019 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-17 00:10:51,019 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:10:51,039 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:10:51,041 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:10:51,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:10:51 BoogieIcfgContainer [2025-03-17 00:10:51,041 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:10:51,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:10:51,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:10:51,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:10:51,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:10:49" (1/3) ... [2025-03-17 00:10:51,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2329ccd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:10:51, skipping insertion in model container [2025-03-17 00:10:51,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:50" (2/3) ... [2025-03-17 00:10:51,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2329ccd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:10:51, skipping insertion in model container [2025-03-17 00:10:51,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:10:51" (3/3) ... [2025-03-17 00:10:51,050 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-82.i [2025-03-17 00:10:51,061 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:10:51,064 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-82.i that has 2 procedures, 230 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:10:51,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:10:51,117 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;@2aa65a39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:10:51,117 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:10:51,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 230 states, 147 states have (on average 1.530612244897959) internal successors, (225), 148 states have internal predecessors, (225), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 00:10:51,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-03-17 00:10:51,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:10:51,141 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:10:51,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:10:51,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:10:51,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1868123319, now seen corresponding path program 1 times [2025-03-17 00:10:51,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:10:51,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998132364] [2025-03-17 00:10:51,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:51,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:10:51,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-17 00:10:51,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-17 00:10:51,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:51,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:51,696 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-03-17 00:10:51,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:10:51,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998132364] [2025-03-17 00:10:51,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998132364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:10:51,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124054748] [2025-03-17 00:10:51,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:51,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:10:51,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:10:51,700 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:10:51,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 00:10:51,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-17 00:10:51,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-17 00:10:51,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:51,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:51,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:10:52,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:10:52,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-03-17 00:10:52,072 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:10:52,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124054748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:10:52,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:10:52,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:10:52,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965602671] [2025-03-17 00:10:52,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:10:52,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:10:52,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:10:52,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:10:52,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:10:52,100 INFO L87 Difference]: Start difference. First operand has 230 states, 147 states have (on average 1.530612244897959) internal successors, (225), 148 states have internal predecessors, (225), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) Second operand has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-17 00:10:52,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:10:52,149 INFO L93 Difference]: Finished difference Result 456 states and 846 transitions. [2025-03-17 00:10:52,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:10:52,151 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) Word has length 498 [2025-03-17 00:10:52,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:10:52,160 INFO L225 Difference]: With dead ends: 456 [2025-03-17 00:10:52,161 INFO L226 Difference]: Without dead ends: 227 [2025-03-17 00:10:52,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:10:52,170 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:10:52,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 367 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:10:52,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-17 00:10:52,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2025-03-17 00:10:52,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 145 states have (on average 1.5034482758620689) internal successors, (218), 145 states have internal predecessors, (218), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 00:10:52,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 378 transitions. [2025-03-17 00:10:52,239 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 378 transitions. Word has length 498 [2025-03-17 00:10:52,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:10:52,241 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 378 transitions. [2025-03-17 00:10:52,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-17 00:10:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 378 transitions. [2025-03-17 00:10:52,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-03-17 00:10:52,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:10:52,250 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:10:52,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 00:10:52,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 00:10:52,451 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:10:52,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:10:52,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1875321885, now seen corresponding path program 1 times [2025-03-17 00:10:52,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:10:52,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611689216] [2025-03-17 00:10:52,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:52,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:10:52,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-17 00:10:52,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-17 00:10:52,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:52,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-17 00:10:52,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:10:52,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611689216] [2025-03-17 00:10:52,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611689216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:10:52,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:10:52,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:10:52,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155614594] [2025-03-17 00:10:52,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:10:52,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:10:52,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:10:52,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:10:52,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:10:52,844 INFO L87 Difference]: Start difference. First operand 227 states and 378 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:10:52,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:10:52,957 INFO L93 Difference]: Finished difference Result 586 states and 977 transitions. [2025-03-17 00:10:52,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:10:52,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 498 [2025-03-17 00:10:52,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:10:52,965 INFO L225 Difference]: With dead ends: 586 [2025-03-17 00:10:52,966 INFO L226 Difference]: Without dead ends: 360 [2025-03-17 00:10:52,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:10:52,968 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 218 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:10:52,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 700 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:10:52,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-17 00:10:53,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 357. [2025-03-17 00:10:53,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 243 states have (on average 1.522633744855967) internal successors, (370), 244 states have internal predecessors, (370), 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-17 00:10:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 592 transitions. [2025-03-17 00:10:53,034 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 592 transitions. Word has length 498 [2025-03-17 00:10:53,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:10:53,035 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 592 transitions. [2025-03-17 00:10:53,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:10:53,035 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 592 transitions. [2025-03-17 00:10:53,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-03-17 00:10:53,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:10:53,039 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:10:53,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:10:53,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:10:53,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:10:53,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1177731125, now seen corresponding path program 1 times [2025-03-17 00:10:53,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:10:53,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162198099] [2025-03-17 00:10:53,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:53,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:10:53,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-17 00:10:53,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-17 00:10:53,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:53,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-17 00:10:54,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:10:54,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162198099] [2025-03-17 00:10:54,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162198099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:10:54,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:10:54,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:10:54,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142515497] [2025-03-17 00:10:54,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:10:54,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:10:54,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:10:54,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:10:54,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:10:54,045 INFO L87 Difference]: Start difference. First operand 357 states and 592 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:10:54,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:10:54,301 INFO L93 Difference]: Finished difference Result 967 states and 1604 transitions. [2025-03-17 00:10:54,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:10:54,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 499 [2025-03-17 00:10:54,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:10:54,309 INFO L225 Difference]: With dead ends: 967 [2025-03-17 00:10:54,310 INFO L226 Difference]: Without dead ends: 611 [2025-03-17 00:10:54,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:10:54,312 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 205 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:10:54,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 979 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:10:54,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-03-17 00:10:54,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 601. [2025-03-17 00:10:54,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 427 states have (on average 1.540983606557377) internal successors, (658), 430 states have internal predecessors, (658), 169 states have call successors, (169), 4 states have call predecessors, (169), 4 states have return successors, (169), 166 states have call predecessors, (169), 169 states have call successors, (169) [2025-03-17 00:10:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 996 transitions. [2025-03-17 00:10:54,375 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 996 transitions. Word has length 499 [2025-03-17 00:10:54,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:10:54,377 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 996 transitions. [2025-03-17 00:10:54,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:10:54,379 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 996 transitions. [2025-03-17 00:10:54,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-17 00:10:54,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:10:54,382 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:10:54,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:10:54,382 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:10:54,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:10:54,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1295819795, now seen corresponding path program 1 times [2025-03-17 00:10:54,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:10:54,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932909476] [2025-03-17 00:10:54,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:54,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:10:54,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-17 00:10:54,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-17 00:10:54,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:54,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-17 00:10:56,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:10:56,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932909476] [2025-03-17 00:10:56,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932909476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:10:56,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:10:56,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 00:10:56,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364352672] [2025-03-17 00:10:56,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:10:56,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 00:10:56,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:10:56,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 00:10:56,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-17 00:10:56,850 INFO L87 Difference]: Start difference. First operand 601 states and 996 transitions. Second operand has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-17 00:11:00,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:00,138 INFO L93 Difference]: Finished difference Result 1865 states and 3043 transitions. [2025-03-17 00:11:00,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 00:11:00,139 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) Word has length 500 [2025-03-17 00:11:00,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:00,147 INFO L225 Difference]: With dead ends: 1865 [2025-03-17 00:11:00,147 INFO L226 Difference]: Without dead ends: 1265 [2025-03-17 00:11:00,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2025-03-17 00:11:00,150 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 1852 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 2333 mSolverCounterSat, 658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1852 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 2991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 658 IncrementalHoareTripleChecker+Valid, 2333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:00,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1852 Valid, 2266 Invalid, 2991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [658 Valid, 2333 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-17 00:11:00,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2025-03-17 00:11:00,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 993. [2025-03-17 00:11:00,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 722 states have (on average 1.5290858725761773) internal successors, (1104), 728 states have internal predecessors, (1104), 260 states have call successors, (260), 10 states have call predecessors, (260), 10 states have return successors, (260), 254 states have call predecessors, (260), 260 states have call successors, (260) [2025-03-17 00:11:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1624 transitions. [2025-03-17 00:11:00,258 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1624 transitions. Word has length 500 [2025-03-17 00:11:00,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:00,259 INFO L471 AbstractCegarLoop]: Abstraction has 993 states and 1624 transitions. [2025-03-17 00:11:00,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-17 00:11:00,259 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1624 transitions. [2025-03-17 00:11:00,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-17 00:11:00,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:00,263 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:11:00,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:11:00,264 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:00,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:00,264 INFO L85 PathProgramCache]: Analyzing trace with hash -742236494, now seen corresponding path program 1 times [2025-03-17 00:11:00,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:00,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343800535] [2025-03-17 00:11:00,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:00,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:00,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-17 00:11:00,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-17 00:11:00,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:00,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 81 proven. 156 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-03-17 00:11:00,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:00,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343800535] [2025-03-17 00:11:00,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343800535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:11:00,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571032180] [2025-03-17 00:11:00,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:00,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:11:00,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:11:00,795 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:11:00,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 00:11:00,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-17 00:11:00,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-17 00:11:00,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:00,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:00,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 00:11:00,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:11:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 849 proven. 6 refuted. 0 times theorem prover too weak. 11785 trivial. 0 not checked. [2025-03-17 00:11:01,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:11:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 231 proven. 6 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-03-17 00:11:01,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571032180] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:11:01,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:11:01,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-17 00:11:01,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847464423] [2025-03-17 00:11:01,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:11:01,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:11:01,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:01,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:11:01,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:11:01,414 INFO L87 Difference]: Start difference. First operand 993 states and 1624 transitions. Second operand has 9 states, 9 states have (on average 20.0) internal successors, (180), 9 states have internal predecessors, (180), 4 states have call successors, (134), 2 states have call predecessors, (134), 4 states have return successors, (136), 4 states have call predecessors, (136), 4 states have call successors, (136) [2025-03-17 00:11:01,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:01,946 INFO L93 Difference]: Finished difference Result 1623 states and 2644 transitions. [2025-03-17 00:11:01,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 00:11:01,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.0) internal successors, (180), 9 states have internal predecessors, (180), 4 states have call successors, (134), 2 states have call predecessors, (134), 4 states have return successors, (136), 4 states have call predecessors, (136), 4 states have call successors, (136) Word has length 500 [2025-03-17 00:11:01,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:01,952 INFO L225 Difference]: With dead ends: 1623 [2025-03-17 00:11:01,953 INFO L226 Difference]: Without dead ends: 631 [2025-03-17 00:11:01,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1014 GetRequests, 997 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2025-03-17 00:11:01,957 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 563 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 459 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 459 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:01,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 673 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [459 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:11:01,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-03-17 00:11:01,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 621. [2025-03-17 00:11:01,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 442 states have (on average 1.504524886877828) internal successors, (665), 445 states have internal predecessors, (665), 169 states have call successors, (169), 9 states have call predecessors, (169), 9 states have return successors, (169), 166 states have call predecessors, (169), 169 states have call successors, (169) [2025-03-17 00:11:01,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1003 transitions. [2025-03-17 00:11:01,993 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1003 transitions. Word has length 500 [2025-03-17 00:11:01,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:01,995 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 1003 transitions. [2025-03-17 00:11:01,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.0) internal successors, (180), 9 states have internal predecessors, (180), 4 states have call successors, (134), 2 states have call predecessors, (134), 4 states have return successors, (136), 4 states have call predecessors, (136), 4 states have call successors, (136) [2025-03-17 00:11:01,995 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1003 transitions. [2025-03-17 00:11:01,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-17 00:11:01,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:01,998 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:11:02,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 00:11:02,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:11:02,199 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:02,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:02,200 INFO L85 PathProgramCache]: Analyzing trace with hash -466901771, now seen corresponding path program 1 times [2025-03-17 00:11:02,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:02,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955590084] [2025-03-17 00:11:02,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:02,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:02,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-17 00:11:02,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-17 00:11:02,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:02,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:02,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-17 00:11:02,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:02,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955590084] [2025-03-17 00:11:02,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955590084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:02,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:02,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:11:02,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123008055] [2025-03-17 00:11:02,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:02,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:11:02,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:02,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:11:02,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:11:02,563 INFO L87 Difference]: Start difference. First operand 621 states and 1003 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:11:02,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:02,608 INFO L93 Difference]: Finished difference Result 1245 states and 2009 transitions. [2025-03-17 00:11:02,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:11:02,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 500 [2025-03-17 00:11:02,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:02,613 INFO L225 Difference]: With dead ends: 1245 [2025-03-17 00:11:02,613 INFO L226 Difference]: Without dead ends: 625 [2025-03-17 00:11:02,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:11:02,616 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 372 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:02,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 363 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:11:02,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-03-17 00:11:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 621. [2025-03-17 00:11:02,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 442 states have (on average 1.495475113122172) internal successors, (661), 445 states have internal predecessors, (661), 169 states have call successors, (169), 9 states have call predecessors, (169), 9 states have return successors, (169), 166 states have call predecessors, (169), 169 states have call successors, (169) [2025-03-17 00:11:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 999 transitions. [2025-03-17 00:11:02,650 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 999 transitions. Word has length 500 [2025-03-17 00:11:02,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:02,651 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 999 transitions. [2025-03-17 00:11:02,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:11:02,652 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 999 transitions. [2025-03-17 00:11:02,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-17 00:11:02,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:02,654 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:11:02,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:11:02,654 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:02,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:02,655 INFO L85 PathProgramCache]: Analyzing trace with hash -972460396, now seen corresponding path program 1 times [2025-03-17 00:11:02,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:02,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923787143] [2025-03-17 00:11:02,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:02,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:02,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-17 00:11:02,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-17 00:11:02,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:02,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-17 00:11:03,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:03,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923787143] [2025-03-17 00:11:03,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923787143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:03,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:03,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 00:11:03,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798882086] [2025-03-17 00:11:03,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:03,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:11:03,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:03,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:11:03,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:11:03,772 INFO L87 Difference]: Start difference. First operand 621 states and 999 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:11:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:04,727 INFO L93 Difference]: Finished difference Result 1556 states and 2483 transitions. [2025-03-17 00:11:04,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 00:11:04,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 500 [2025-03-17 00:11:04,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:04,733 INFO L225 Difference]: With dead ends: 1556 [2025-03-17 00:11:04,733 INFO L226 Difference]: Without dead ends: 936 [2025-03-17 00:11:04,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:11:04,736 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 728 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 2009 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:04,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 2009 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 00:11:04,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-03-17 00:11:04,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 645. [2025-03-17 00:11:04,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 466 states have (on average 1.502145922746781) internal successors, (700), 469 states have internal predecessors, (700), 169 states have call successors, (169), 9 states have call predecessors, (169), 9 states have return successors, (169), 166 states have call predecessors, (169), 169 states have call successors, (169) [2025-03-17 00:11:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1038 transitions. [2025-03-17 00:11:04,781 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1038 transitions. Word has length 500 [2025-03-17 00:11:04,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:04,782 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 1038 transitions. [2025-03-17 00:11:04,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:11:04,782 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1038 transitions. [2025-03-17 00:11:04,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-17 00:11:04,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:04,785 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:11:04,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:11:04,785 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:04,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:04,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1284450611, now seen corresponding path program 1 times [2025-03-17 00:11:04,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:04,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537500263] [2025-03-17 00:11:04,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:04,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:04,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-17 00:11:04,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-17 00:11:04,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:04,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:05,165 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 177 proven. 60 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-03-17 00:11:05,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:05,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537500263] [2025-03-17 00:11:05,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537500263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:11:05,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900993662] [2025-03-17 00:11:05,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:05,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:11:05,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:11:05,169 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:11:05,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 00:11:05,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-17 00:11:05,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-17 00:11:05,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:05,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:05,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 00:11:05,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:11:05,580 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 4917 proven. 60 refuted. 0 times theorem prover too weak. 7663 trivial. 0 not checked. [2025-03-17 00:11:05,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:11:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 177 proven. 60 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-03-17 00:11:05,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900993662] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:11:05,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:11:05,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-17 00:11:05,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7942006] [2025-03-17 00:11:05,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:11:05,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:11:05,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:05,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:11:05,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:11:05,885 INFO L87 Difference]: Start difference. First operand 645 states and 1038 transitions. Second operand has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 3 states have call successors, (120), 2 states have call predecessors, (120), 4 states have return successors, (121), 3 states have call predecessors, (121), 3 states have call successors, (121) [2025-03-17 00:11:06,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:06,249 INFO L93 Difference]: Finished difference Result 1300 states and 2085 transitions. [2025-03-17 00:11:06,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 00:11:06,250 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 3 states have call successors, (120), 2 states have call predecessors, (120), 4 states have return successors, (121), 3 states have call predecessors, (121), 3 states have call successors, (121) Word has length 500 [2025-03-17 00:11:06,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:06,255 INFO L225 Difference]: With dead ends: 1300 [2025-03-17 00:11:06,255 INFO L226 Difference]: Without dead ends: 656 [2025-03-17 00:11:06,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1006 GetRequests, 997 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:11:06,258 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 404 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:06,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 666 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:11:06,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2025-03-17 00:11:06,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 646. [2025-03-17 00:11:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 466 states have (on average 1.4914163090128756) internal successors, (695), 469 states have internal predecessors, (695), 169 states have call successors, (169), 10 states have call predecessors, (169), 10 states have return successors, (169), 166 states have call predecessors, (169), 169 states have call successors, (169) [2025-03-17 00:11:06,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1033 transitions. [2025-03-17 00:11:06,313 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1033 transitions. Word has length 500 [2025-03-17 00:11:06,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:06,314 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 1033 transitions. [2025-03-17 00:11:06,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 3 states have call successors, (120), 2 states have call predecessors, (120), 4 states have return successors, (121), 3 states have call predecessors, (121), 3 states have call successors, (121) [2025-03-17 00:11:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1033 transitions. [2025-03-17 00:11:06,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-03-17 00:11:06,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:06,317 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:11:06,326 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-17 00:11:06,518 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-17 00:11:06,518 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:06,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:06,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1992075638, now seen corresponding path program 1 times [2025-03-17 00:11:06,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:06,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257485166] [2025-03-17 00:11:06,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:06,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:06,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-03-17 00:11:06,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-03-17 00:11:06,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:06,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:06,861 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 87 proven. 150 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-03-17 00:11:06,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:06,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257485166] [2025-03-17 00:11:06,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257485166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:11:06,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132840273] [2025-03-17 00:11:06,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:06,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:11:06,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:11:06,863 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:11:06,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 00:11:06,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-03-17 00:11:07,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-03-17 00:11:07,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:07,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:07,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 00:11:07,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:11:07,526 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 5937 proven. 150 refuted. 0 times theorem prover too weak. 6553 trivial. 0 not checked. [2025-03-17 00:11:07,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:11:07,891 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 87 proven. 150 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-03-17 00:11:07,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132840273] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:11:07,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:11:07,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-17 00:11:07,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616074357] [2025-03-17 00:11:07,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:11:07,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:11:07,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:07,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:11:07,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:11:07,894 INFO L87 Difference]: Start difference. First operand 646 states and 1033 transitions. Second operand has 9 states, 9 states have (on average 23.22222222222222) internal successors, (209), 9 states have internal predecessors, (209), 4 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 4 states have call predecessors, (181), 4 states have call successors, (181) [2025-03-17 00:11:08,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:08,267 INFO L93 Difference]: Finished difference Result 1051 states and 1659 transitions. [2025-03-17 00:11:08,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 00:11:08,268 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 23.22222222222222) internal successors, (209), 9 states have internal predecessors, (209), 4 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 4 states have call predecessors, (181), 4 states have call successors, (181) Word has length 501 [2025-03-17 00:11:08,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:08,271 INFO L225 Difference]: With dead ends: 1051 [2025-03-17 00:11:08,271 INFO L226 Difference]: Without dead ends: 406 [2025-03-17 00:11:08,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1009 GetRequests, 999 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-03-17 00:11:08,276 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 308 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:08,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 610 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:11:08,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-17 00:11:08,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 398. [2025-03-17 00:11:08,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 276 states have (on average 1.4130434782608696) internal successors, (390), 277 states have internal predecessors, (390), 111 states have call successors, (111), 10 states have call predecessors, (111), 10 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2025-03-17 00:11:08,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 612 transitions. [2025-03-17 00:11:08,308 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 612 transitions. Word has length 501 [2025-03-17 00:11:08,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:08,309 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 612 transitions. [2025-03-17 00:11:08,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.22222222222222) internal successors, (209), 9 states have internal predecessors, (209), 4 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 4 states have call predecessors, (181), 4 states have call successors, (181) [2025-03-17 00:11:08,310 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 612 transitions. [2025-03-17 00:11:08,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-03-17 00:11:08,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:08,312 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:11:08,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 00:11:08,512 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-17 00:11:08,513 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:08,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:08,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1959100631, now seen corresponding path program 1 times [2025-03-17 00:11:08,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:08,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611792779] [2025-03-17 00:11:08,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:08,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:08,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-17 00:11:08,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-17 00:11:08,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:08,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:15,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 153 proven. 84 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-03-17 00:11:15,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:15,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611792779] [2025-03-17 00:11:15,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611792779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:11:15,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977543597] [2025-03-17 00:11:15,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:15,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:11:15,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:11:15,198 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-17 00:11:15,199 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-17 00:11:15,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-17 00:11:15,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-17 00:11:15,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:15,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:15,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 00:11:15,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:11:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 8679 proven. 456 refuted. 0 times theorem prover too weak. 3505 trivial. 0 not checked. [2025-03-17 00:11:20,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:11:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 477 proven. 225 refuted. 0 times theorem prover too weak. 11938 trivial. 0 not checked. [2025-03-17 00:11:22,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977543597] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:11:22,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:11:22,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23, 17] total 50 [2025-03-17 00:11:22,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34804830] [2025-03-17 00:11:22,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:11:22,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-17 00:11:22,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:22,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-17 00:11:22,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=2121, Unknown=0, NotChecked=0, Total=2450 [2025-03-17 00:11:22,527 INFO L87 Difference]: Start difference. First operand 398 states and 612 transitions. Second operand has 50 states, 48 states have (on average 5.4375) internal successors, (261), 47 states have internal predecessors, (261), 13 states have call successors, (169), 6 states have call predecessors, (169), 12 states have return successors, (170), 13 states have call predecessors, (170), 13 states have call successors, (170)