./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-5.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 15008c5480ac4162784403044af77a10b48a2663fed021487d04a0af163dfd9e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:08:54,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:08:54,861 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:08:54,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:08:54,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:08:54,882 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:08:54,883 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:08:54,883 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:08:54,883 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:08:54,883 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:08:54,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:08:54,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:08:54,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:08:54,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:08:54,884 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:08:54,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:08:54,884 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:08:54,884 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:08:54,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:08:54,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:08:54,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:08:54,885 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:08:54,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:08:54,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:08:54,885 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:08:54,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:08:54,885 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:08:54,885 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:08:54,885 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:08:54,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:08:54,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:08:54,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:08:54,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:08:54,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:08:54,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:08:54,886 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:08:54,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:08:54,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:08:54,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:08:54,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:08:54,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:08:54,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:08:54,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:08:54,886 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 -> 15008c5480ac4162784403044af77a10b48a2663fed021487d04a0af163dfd9e [2025-03-03 20:08:55,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:08:55,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:08:55,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:08:55,119 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:08:55,119 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:08:55,120 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-500_file-5.i [2025-03-03 20:08:56,243 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3332fc89/28d9f99ba2a14c769e00648967af87aa/FLAG03846caaa [2025-03-03 20:08:56,569 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:08:56,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-5.i [2025-03-03 20:08:56,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3332fc89/28d9f99ba2a14c769e00648967af87aa/FLAG03846caaa [2025-03-03 20:08:56,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3332fc89/28d9f99ba2a14c769e00648967af87aa [2025-03-03 20:08:56,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:08:56,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:08:56,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:08:56,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:08:56,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:08:56,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:08:56" (1/1) ... [2025-03-03 20:08:56,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c621b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:56, skipping insertion in model container [2025-03-03 20:08:56,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:08:56" (1/1) ... [2025-03-03 20:08:56,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:08:56,759 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-500_file-5.i[915,928] [2025-03-03 20:08:56,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:08:56,898 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:08:56,905 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-500_file-5.i[915,928] [2025-03-03 20:08:56,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:08:56,985 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:08:56,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:56 WrapperNode [2025-03-03 20:08:56,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:08:56,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:08:56,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:08:56,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:08:56,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:56" (1/1) ... [2025-03-03 20:08:57,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:56" (1/1) ... [2025-03-03 20:08:57,065 INFO L138 Inliner]: procedures = 26, calls = 98, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 757 [2025-03-03 20:08:57,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:08:57,066 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:08:57,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:08:57,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:08:57,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:56" (1/1) ... [2025-03-03 20:08:57,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:56" (1/1) ... [2025-03-03 20:08:57,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:56" (1/1) ... [2025-03-03 20:08:57,119 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:08:57,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:56" (1/1) ... [2025-03-03 20:08:57,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:56" (1/1) ... [2025-03-03 20:08:57,133 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:56" (1/1) ... [2025-03-03 20:08:57,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:56" (1/1) ... [2025-03-03 20:08:57,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:56" (1/1) ... [2025-03-03 20:08:57,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:56" (1/1) ... [2025-03-03 20:08:57,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:08:57,155 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:08:57,155 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:08:57,155 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:08:57,156 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:56" (1/1) ... [2025-03-03 20:08:57,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:08:57,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:57,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:08:57,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:08:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:08:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:08:57,195 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:08:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:08:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:08:57,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:08:57,313 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:08:57,315 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:08:58,326 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-03 20:08:58,326 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:08:58,351 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:08:58,351 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-03 20:08:58,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:08:58 BoogieIcfgContainer [2025-03-03 20:08:58,351 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:08:58,353 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:08:58,353 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:08:58,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:08:58,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:08:56" (1/3) ... [2025-03-03 20:08:58,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fde30fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:08:58, skipping insertion in model container [2025-03-03 20:08:58,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:56" (2/3) ... [2025-03-03 20:08:58,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fde30fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:08:58, skipping insertion in model container [2025-03-03 20:08:58,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:08:58" (3/3) ... [2025-03-03 20:08:58,361 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-5.i [2025-03-03 20:08:58,370 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:08:58,373 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-5.i that has 2 procedures, 309 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:08:58,426 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:08:58,435 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;@4ab3bb64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:08:58,436 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:08:58,441 INFO L276 IsEmpty]: Start isEmpty. Operand has 309 states, 221 states have (on average 1.6244343891402715) internal successors, (359), 222 states have internal predecessors, (359), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-03 20:08:58,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-03-03 20:08:58,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:58,471 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:58,471 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:58,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:58,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1024684568, now seen corresponding path program 1 times [2025-03-03 20:08:58,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:58,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055511142] [2025-03-03 20:08:58,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:58,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:58,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-03 20:08:58,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-03 20:08:58,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:58,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 14112 trivial. 0 not checked. [2025-03-03 20:08:58,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:58,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055511142] [2025-03-03 20:08:58,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055511142] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:08:58,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266570061] [2025-03-03 20:08:58,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:58,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:58,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:58,972 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:08:58,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:08:59,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-03 20:08:59,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-03 20:08:59,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:59,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:59,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:08:59,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:08:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 14112 trivial. 0 not checked. [2025-03-03 20:08:59,365 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:08:59,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266570061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:59,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:08:59,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:08:59,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772601107] [2025-03-03 20:08:59,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:59,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:08:59,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:59,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:08:59,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:08:59,391 INFO L87 Difference]: Start difference. First operand has 309 states, 221 states have (on average 1.6244343891402715) internal successors, (359), 222 states have internal predecessors, (359), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (85), 2 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 2 states have call successors, (85) [2025-03-03 20:08:59,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:59,457 INFO L93 Difference]: Finished difference Result 612 states and 1138 transitions. [2025-03-03 20:08:59,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:08:59,462 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (85), 2 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 2 states have call successors, (85) Word has length 570 [2025-03-03 20:08:59,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:59,472 INFO L225 Difference]: With dead ends: 612 [2025-03-03 20:08:59,473 INFO L226 Difference]: Without dead ends: 306 [2025-03-03 20:08:59,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 571 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:08:59,481 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:59,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 507 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:08:59,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-03 20:08:59,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2025-03-03 20:08:59,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 219 states have (on average 1.6027397260273972) internal successors, (351), 219 states have internal predecessors, (351), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-03 20:08:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 521 transitions. [2025-03-03 20:08:59,555 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 521 transitions. Word has length 570 [2025-03-03 20:08:59,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:59,557 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 521 transitions. [2025-03-03 20:08:59,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (85), 2 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 2 states have call successors, (85) [2025-03-03 20:08:59,557 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 521 transitions. [2025-03-03 20:08:59,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-03 20:08:59,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:59,569 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:59,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:08:59,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:08:59,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:59,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:59,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1164346331, now seen corresponding path program 1 times [2025-03-03 20:08:59,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:59,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692322890] [2025-03-03 20:08:59,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:59,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:59,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-03 20:08:59,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-03 20:08:59,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:59,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:00,378 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-03 20:09:00,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:00,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692322890] [2025-03-03 20:09:00,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692322890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:00,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:00,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:09:00,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787499243] [2025-03-03 20:09:00,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:00,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:09:00,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:00,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:09:00,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:00,386 INFO L87 Difference]: Start difference. First operand 306 states and 521 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 2 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) [2025-03-03 20:09:00,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:00,461 INFO L93 Difference]: Finished difference Result 609 states and 1039 transitions. [2025-03-03 20:09:00,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:09:00,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 2 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) Word has length 571 [2025-03-03 20:09:00,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:00,467 INFO L225 Difference]: With dead ends: 609 [2025-03-03 20:09:00,467 INFO L226 Difference]: Without dead ends: 306 [2025-03-03 20:09:00,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:00,468 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 440 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:00,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 492 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:09:00,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-03 20:09:00,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2025-03-03 20:09:00,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 219 states have (on average 1.5981735159817352) internal successors, (350), 219 states have internal predecessors, (350), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-03 20:09:00,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 520 transitions. [2025-03-03 20:09:00,502 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 520 transitions. Word has length 571 [2025-03-03 20:09:00,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:00,505 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 520 transitions. [2025-03-03 20:09:00,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 2 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) [2025-03-03 20:09:00,505 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 520 transitions. [2025-03-03 20:09:00,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-03-03 20:09:00,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:00,514 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:09:00,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:09:00,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:00,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:00,515 INFO L85 PathProgramCache]: Analyzing trace with hash -299013836, now seen corresponding path program 1 times [2025-03-03 20:09:00,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:00,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929721925] [2025-03-03 20:09:00,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:00,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:00,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-03 20:09:00,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-03 20:09:00,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:00,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-03 20:09:00,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:00,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929721925] [2025-03-03 20:09:00,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929721925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:00,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:00,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:09:00,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028663377] [2025-03-03 20:09:00,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:00,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:09:00,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:00,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:09:00,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:00,879 INFO L87 Difference]: Start difference. First operand 306 states and 520 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-03 20:09:00,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:00,961 INFO L93 Difference]: Finished difference Result 912 states and 1554 transitions. [2025-03-03 20:09:00,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:09:00,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 572 [2025-03-03 20:09:00,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:00,966 INFO L225 Difference]: With dead ends: 912 [2025-03-03 20:09:00,966 INFO L226 Difference]: Without dead ends: 609 [2025-03-03 20:09:00,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-03 20:09:00,968 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 327 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:00,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1089 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:09:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-03-03 20:09:01,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 607. [2025-03-03 20:09:01,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 434 states have (on average 1.599078341013825) internal successors, (694), 434 states have internal predecessors, (694), 170 states have call successors, (170), 2 states have call predecessors, (170), 2 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2025-03-03 20:09:01,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1034 transitions. [2025-03-03 20:09:01,046 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1034 transitions. Word has length 572 [2025-03-03 20:09:01,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:01,047 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 1034 transitions. [2025-03-03 20:09:01,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-03 20:09:01,047 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1034 transitions. [2025-03-03 20:09:01,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-03-03 20:09:01,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:01,055 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:09:01,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:09:01,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:01,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:01,056 INFO L85 PathProgramCache]: Analyzing trace with hash -992406541, now seen corresponding path program 1 times [2025-03-03 20:09:01,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:01,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546908614] [2025-03-03 20:09:01,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:01,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:01,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-03 20:09:01,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-03 20:09:01,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:01,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:01,328 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-03 20:09:01,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:01,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546908614] [2025-03-03 20:09:01,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546908614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:01,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:01,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:09:01,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199518809] [2025-03-03 20:09:01,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:01,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:09:01,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:01,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:09:01,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:01,330 INFO L87 Difference]: Start difference. First operand 607 states and 1034 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-03 20:09:01,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:01,453 INFO L93 Difference]: Finished difference Result 1613 states and 2736 transitions. [2025-03-03 20:09:01,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:09:01,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 572 [2025-03-03 20:09:01,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:01,460 INFO L225 Difference]: With dead ends: 1613 [2025-03-03 20:09:01,460 INFO L226 Difference]: Without dead ends: 1009 [2025-03-03 20:09:01,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:01,463 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 306 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:01,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 983 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:09:01,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-03-03 20:09:01,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1005. [2025-03-03 20:09:01,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 700 states have (on average 1.562857142857143) internal successors, (1094), 702 states have internal predecessors, (1094), 300 states have call successors, (300), 4 states have call predecessors, (300), 4 states have return successors, (300), 298 states have call predecessors, (300), 300 states have call successors, (300) [2025-03-03 20:09:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1694 transitions. [2025-03-03 20:09:01,596 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1694 transitions. Word has length 572 [2025-03-03 20:09:01,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:01,598 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1694 transitions. [2025-03-03 20:09:01,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-03 20:09:01,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1694 transitions. [2025-03-03 20:09:01,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-03-03 20:09:01,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:01,606 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:09:01,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:09:01,607 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:01,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:01,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1264504466, now seen corresponding path program 1 times [2025-03-03 20:09:01,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:01,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376377251] [2025-03-03 20:09:01,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:01,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:01,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-03 20:09:01,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-03 20:09:01,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:01,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-03 20:09:01,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:01,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376377251] [2025-03-03 20:09:01,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376377251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:01,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:01,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:09:01,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516658317] [2025-03-03 20:09:01,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:01,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:09:01,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:01,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:09:01,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:01,831 INFO L87 Difference]: Start difference. First operand 1005 states and 1694 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-03 20:09:01,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:01,956 INFO L93 Difference]: Finished difference Result 2703 states and 4566 transitions. [2025-03-03 20:09:01,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:09:01,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 572 [2025-03-03 20:09:01,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:01,967 INFO L225 Difference]: With dead ends: 2703 [2025-03-03 20:09:01,968 INFO L226 Difference]: Without dead ends: 1701 [2025-03-03 20:09:01,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:01,972 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 307 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:01,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 1173 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:09:01,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2025-03-03 20:09:02,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1695. [2025-03-03 20:09:02,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1246 states have (on average 1.5906902086677368) internal successors, (1982), 1252 states have internal predecessors, (1982), 440 states have call successors, (440), 8 states have call predecessors, (440), 8 states have return successors, (440), 434 states have call predecessors, (440), 440 states have call successors, (440) [2025-03-03 20:09:02,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2862 transitions. [2025-03-03 20:09:02,096 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2862 transitions. Word has length 572 [2025-03-03 20:09:02,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:02,099 INFO L471 AbstractCegarLoop]: Abstraction has 1695 states and 2862 transitions. [2025-03-03 20:09:02,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-03 20:09:02,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2862 transitions. [2025-03-03 20:09:02,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-03-03 20:09:02,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:02,104 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:09:02,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:09:02,104 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:02,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:02,105 INFO L85 PathProgramCache]: Analyzing trace with hash 855680241, now seen corresponding path program 1 times [2025-03-03 20:09:02,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:02,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599912306] [2025-03-03 20:09:02,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:02,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:02,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-03 20:09:02,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-03 20:09:02,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:02,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:02,559 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-03 20:09:02,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:02,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599912306] [2025-03-03 20:09:02,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599912306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:02,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:02,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:09:02,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88011465] [2025-03-03 20:09:02,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:02,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:09:02,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:02,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:09:02,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:02,562 INFO L87 Difference]: Start difference. First operand 1695 states and 2862 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-03 20:09:02,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:02,783 INFO L93 Difference]: Finished difference Result 5079 states and 8580 transitions. [2025-03-03 20:09:02,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:09:02,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 572 [2025-03-03 20:09:02,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:02,799 INFO L225 Difference]: With dead ends: 5079 [2025-03-03 20:09:02,799 INFO L226 Difference]: Without dead ends: 3387 [2025-03-03 20:09:02,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:02,804 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 338 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:02,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1123 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:09:02,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3387 states. [2025-03-03 20:09:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3387 to 3385. [2025-03-03 20:09:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3385 states, 2488 states have (on average 1.585209003215434) internal successors, (3944), 2500 states have internal predecessors, (3944), 880 states have call successors, (880), 16 states have call predecessors, (880), 16 states have return successors, (880), 868 states have call predecessors, (880), 880 states have call successors, (880) [2025-03-03 20:09:03,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 5704 transitions. [2025-03-03 20:09:03,064 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 5704 transitions. Word has length 572 [2025-03-03 20:09:03,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:03,065 INFO L471 AbstractCegarLoop]: Abstraction has 3385 states and 5704 transitions. [2025-03-03 20:09:03,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-03 20:09:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 5704 transitions. [2025-03-03 20:09:03,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-03-03 20:09:03,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:03,071 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:09:03,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:09:03,071 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:03,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:03,072 INFO L85 PathProgramCache]: Analyzing trace with hash -24439366, now seen corresponding path program 1 times [2025-03-03 20:09:03,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:03,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921972786] [2025-03-03 20:09:03,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:03,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:03,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-03-03 20:09:03,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-03-03 20:09:03,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:03,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:08,710 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-03 20:09:08,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:08,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921972786] [2025-03-03 20:09:08,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921972786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:08,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:08,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 20:09:08,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924117618] [2025-03-03 20:09:08,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:08,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 20:09:08,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:08,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 20:09:08,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-03 20:09:08,714 INFO L87 Difference]: Start difference. First operand 3385 states and 5704 transitions. Second operand has 13 states, 13 states have (on average 11.615384615384615) internal successors, (151), 13 states have internal predecessors, (151), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-03 20:09:20,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:20,776 INFO L93 Difference]: Finished difference Result 18210 states and 30684 transitions. [2025-03-03 20:09:20,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 20:09:20,777 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.615384615384615) internal successors, (151), 13 states have internal predecessors, (151), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 573 [2025-03-03 20:09:20,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:20,859 INFO L225 Difference]: With dead ends: 18210 [2025-03-03 20:09:20,859 INFO L226 Difference]: Without dead ends: 16518 [2025-03-03 20:09:20,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2025-03-03 20:09:20,871 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 4941 mSDsluCounter, 6032 mSDsCounter, 0 mSdLazyCounter, 2732 mSolverCounterSat, 694 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4941 SdHoareTripleChecker+Valid, 6823 SdHoareTripleChecker+Invalid, 3426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 694 IncrementalHoareTripleChecker+Valid, 2732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:20,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4941 Valid, 6823 Invalid, 3426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [694 Valid, 2732 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2025-03-03 20:09:20,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16518 states. [2025-03-03 20:09:21,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16518 to 8329. [2025-03-03 20:09:21,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8329 states, 6776 states have (on average 1.6381345926800472) internal successors, (11100), 6820 states have internal predecessors, (11100), 1488 states have call successors, (1488), 64 states have call predecessors, (1488), 64 states have return successors, (1488), 1444 states have call predecessors, (1488), 1488 states have call successors, (1488) [2025-03-03 20:09:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8329 states to 8329 states and 14076 transitions. [2025-03-03 20:09:21,590 INFO L78 Accepts]: Start accepts. Automaton has 8329 states and 14076 transitions. Word has length 573 [2025-03-03 20:09:21,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:21,592 INFO L471 AbstractCegarLoop]: Abstraction has 8329 states and 14076 transitions. [2025-03-03 20:09:21,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.615384615384615) internal successors, (151), 13 states have internal predecessors, (151), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-03 20:09:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 8329 states and 14076 transitions. [2025-03-03 20:09:21,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-03-03 20:09:21,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:21,606 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:09:21,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:09:21,607 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:21,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:21,607 INFO L85 PathProgramCache]: Analyzing trace with hash -409806149, now seen corresponding path program 1 times [2025-03-03 20:09:21,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:21,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716584660] [2025-03-03 20:09:21,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:21,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:21,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-03-03 20:09:21,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-03-03 20:09:21,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:21,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:26,782 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-03 20:09:26,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:26,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716584660] [2025-03-03 20:09:26,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716584660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:26,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:26,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 20:09:26,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061217727] [2025-03-03 20:09:26,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:26,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 20:09:26,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:26,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 20:09:26,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-03 20:09:26,789 INFO L87 Difference]: Start difference. First operand 8329 states and 14076 transitions. Second operand has 13 states, 13 states have (on average 11.615384615384615) internal successors, (151), 13 states have internal predecessors, (151), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-03 20:10:14,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:14,890 INFO L93 Difference]: Finished difference Result 32166 states and 54212 transitions. [2025-03-03 20:10:14,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 20:10:14,890 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.615384615384615) internal successors, (151), 13 states have internal predecessors, (151), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 573 [2025-03-03 20:10:14,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:14,971 INFO L225 Difference]: With dead ends: 32166 [2025-03-03 20:10:14,971 INFO L226 Difference]: Without dead ends: 27954 [2025-03-03 20:10:14,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2025-03-03 20:10:14,990 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 4993 mSDsluCounter, 5150 mSDsCounter, 0 mSdLazyCounter, 2303 mSolverCounterSat, 794 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4993 SdHoareTripleChecker+Valid, 5839 SdHoareTripleChecker+Invalid, 3097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 794 IncrementalHoareTripleChecker+Valid, 2303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:14,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4993 Valid, 5839 Invalid, 3097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [794 Valid, 2303 Invalid, 0 Unknown, 0 Unchecked, 43.7s Time] [2025-03-03 20:10:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27954 states. [2025-03-03 20:10:15,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27954 to 8377. [2025-03-03 20:10:15,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8377 states, 6824 states have (on average 1.6395076201641265) internal successors, (11188), 6868 states have internal predecessors, (11188), 1488 states have call successors, (1488), 64 states have call predecessors, (1488), 64 states have return successors, (1488), 1444 states have call predecessors, (1488), 1488 states have call successors, (1488) [2025-03-03 20:10:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8377 states to 8377 states and 14164 transitions. [2025-03-03 20:10:15,753 INFO L78 Accepts]: Start accepts. Automaton has 8377 states and 14164 transitions. Word has length 573 [2025-03-03 20:10:15,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:15,754 INFO L471 AbstractCegarLoop]: Abstraction has 8377 states and 14164 transitions. [2025-03-03 20:10:15,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.615384615384615) internal successors, (151), 13 states have internal predecessors, (151), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-03 20:10:15,755 INFO L276 IsEmpty]: Start isEmpty. Operand 8377 states and 14164 transitions. [2025-03-03 20:10:15,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-03 20:10:15,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:15,768 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:15,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:10:15,769 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:15,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:15,769 INFO L85 PathProgramCache]: Analyzing trace with hash -270167663, now seen corresponding path program 1 times [2025-03-03 20:10:15,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:15,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926297169] [2025-03-03 20:10:15,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:15,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:15,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-03 20:10:15,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-03 20:10:15,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:15,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-03 20:10:16,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:16,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926297169] [2025-03-03 20:10:16,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926297169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:16,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:16,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:10:16,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242054609] [2025-03-03 20:10:16,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:16,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:10:16,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:16,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:10:16,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:10:16,110 INFO L87 Difference]: Start difference. First operand 8377 states and 14164 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-03 20:10:17,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:17,769 INFO L93 Difference]: Finished difference Result 25957 states and 43936 transitions. [2025-03-03 20:10:17,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:10:17,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 574 [2025-03-03 20:10:17,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:17,815 INFO L225 Difference]: With dead ends: 25957 [2025-03-03 20:10:17,815 INFO L226 Difference]: Without dead ends: 17583 [2025-03-03 20:10:17,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:10:17,835 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 1116 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1116 SdHoareTripleChecker+Valid, 2362 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:17,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1116 Valid, 2362 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:10:17,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17583 states. [2025-03-03 20:10:18,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17583 to 8817. [2025-03-03 20:10:18,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8817 states, 7264 states have (on average 1.6497797356828194) internal successors, (11984), 7308 states have internal predecessors, (11984), 1488 states have call successors, (1488), 64 states have call predecessors, (1488), 64 states have return successors, (1488), 1444 states have call predecessors, (1488), 1488 states have call successors, (1488) [2025-03-03 20:10:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8817 states to 8817 states and 14960 transitions. [2025-03-03 20:10:18,800 INFO L78 Accepts]: Start accepts. Automaton has 8817 states and 14960 transitions. Word has length 574 [2025-03-03 20:10:18,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:18,801 INFO L471 AbstractCegarLoop]: Abstraction has 8817 states and 14960 transitions. [2025-03-03 20:10:18,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-03 20:10:18,801 INFO L276 IsEmpty]: Start isEmpty. Operand 8817 states and 14960 transitions. [2025-03-03 20:10:18,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-03 20:10:18,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:18,812 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:18,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:10:18,813 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:18,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:18,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1584177874, now seen corresponding path program 1 times [2025-03-03 20:10:18,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:18,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821303098] [2025-03-03 20:10:18,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:18,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:18,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-03 20:10:18,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-03 20:10:18,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:18,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-03 20:10:19,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:19,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821303098] [2025-03-03 20:10:19,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821303098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:19,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:19,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 20:10:19,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272274657] [2025-03-03 20:10:19,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:19,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 20:10:19,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:19,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 20:10:19,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:10:19,874 INFO L87 Difference]: Start difference. First operand 8817 states and 14960 transitions. Second operand has 15 states, 15 states have (on average 10.133333333333333) internal successors, (152), 15 states have internal predecessors, (152), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-03 20:10:25,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:25,987 INFO L93 Difference]: Finished difference Result 35758 states and 60614 transitions. [2025-03-03 20:10:25,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 20:10:25,988 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.133333333333333) internal successors, (152), 15 states have internal predecessors, (152), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 574 [2025-03-03 20:10:25,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:26,065 INFO L225 Difference]: With dead ends: 35758 [2025-03-03 20:10:26,065 INFO L226 Difference]: Without dead ends: 31302 [2025-03-03 20:10:26,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-03-03 20:10:26,084 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 5654 mSDsluCounter, 5000 mSDsCounter, 0 mSdLazyCounter, 3740 mSolverCounterSat, 902 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5654 SdHoareTripleChecker+Valid, 5808 SdHoareTripleChecker+Invalid, 4642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 902 IncrementalHoareTripleChecker+Valid, 3740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:26,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5654 Valid, 5808 Invalid, 4642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [902 Valid, 3740 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-03 20:10:26,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31302 states.