./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-25.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8a0aa5268274913f166e3439344c11e1f55f1cae222bb90cd734b4386dad3afb --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:33:15,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:33:15,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:33:15,954 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:33:15,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:33:15,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:33:15,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:33:15,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:33:15,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:33:15,976 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:33:15,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:33:15,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:33:15,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:33:15,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:33:15,978 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:33:15,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:33:15,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:33:15,978 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:33:15,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:33:15,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:33:15,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:33:15,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:33:15,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:33:15,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:33:15,979 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:33:15,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:33:15,979 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:33:15,979 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:33:15,980 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:33:15,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:33:15,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:33:15,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:33:15,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:33:15,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:33:15,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:33:15,980 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:33:15,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:33:15,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:33:15,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:33:15,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:33:15,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:33:15,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:33:15,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:33:15,981 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-jdk21/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 -> 8a0aa5268274913f166e3439344c11e1f55f1cae222bb90cd734b4386dad3afb [2025-02-05 21:33:16,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:33:16,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:33:16,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:33:16,288 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:33:16,289 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:33:16,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-25.i [2025-02-05 21:33:17,759 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f957260b0/b36fbd871958455d9473f8d08a59435b/FLAG5a68d885a [2025-02-05 21:33:18,150 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:33:18,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-25.i [2025-02-05 21:33:18,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f957260b0/b36fbd871958455d9473f8d08a59435b/FLAG5a68d885a [2025-02-05 21:33:18,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f957260b0/b36fbd871958455d9473f8d08a59435b [2025-02-05 21:33:18,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:33:18,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:33:18,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:33:18,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:33:18,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:33:18,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:33:18" (1/1) ... [2025-02-05 21:33:18,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b3e873f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:18, skipping insertion in model container [2025-02-05 21:33:18,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:33:18" (1/1) ... [2025-02-05 21:33:18,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:33:18,363 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-25.i[916,929] [2025-02-05 21:33:18,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:33:18,489 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:33:18,497 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-25.i[916,929] [2025-02-05 21:33:18,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:33:18,600 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:33:18,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:18 WrapperNode [2025-02-05 21:33:18,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:33:18,601 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:33:18,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:33:18,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:33:18,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:18" (1/1) ... [2025-02-05 21:33:18,622 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:18" (1/1) ... [2025-02-05 21:33:18,669 INFO L138 Inliner]: procedures = 26, calls = 84, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 571 [2025-02-05 21:33:18,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:33:18,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:33:18,671 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:33:18,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:33:18,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:18" (1/1) ... [2025-02-05 21:33:18,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:18" (1/1) ... [2025-02-05 21:33:18,684 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:18" (1/1) ... [2025-02-05 21:33:18,721 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-02-05 21:33:18,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:18" (1/1) ... [2025-02-05 21:33:18,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:18" (1/1) ... [2025-02-05 21:33:18,743 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:18" (1/1) ... [2025-02-05 21:33:18,748 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:18" (1/1) ... [2025-02-05 21:33:18,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:18" (1/1) ... [2025-02-05 21:33:18,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:18" (1/1) ... [2025-02-05 21:33:18,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:33:18,773 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:33:18,773 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:33:18,773 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:33:18,774 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:18" (1/1) ... [2025-02-05 21:33:18,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:33:18,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:33:18,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:33:18,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:33:18,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:33:18,834 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:33:18,834 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:33:18,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:33:18,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:33:18,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:33:18,956 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:33:18,961 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:33:19,781 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-02-05 21:33:19,782 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:33:19,823 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:33:19,823 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:33:19,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:33:19 BoogieIcfgContainer [2025-02-05 21:33:19,823 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:33:19,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:33:19,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:33:19,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:33:19,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:33:18" (1/3) ... [2025-02-05 21:33:19,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c3b0c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:33:19, skipping insertion in model container [2025-02-05 21:33:19,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:18" (2/3) ... [2025-02-05 21:33:19,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c3b0c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:33:19, skipping insertion in model container [2025-02-05 21:33:19,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:33:19" (3/3) ... [2025-02-05 21:33:19,834 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-25.i [2025-02-05 21:33:19,848 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:33:19,851 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-25.i that has 2 procedures, 233 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:33:19,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:33:19,930 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;@502cc2b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:33:19,930 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:33:19,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 233 states, 159 states have (on average 1.5534591194968554) internal successors, (247), 160 states have internal predecessors, (247), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-05 21:33:19,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-02-05 21:33:19,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:19,958 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:33:19,959 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:19,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:19,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1863542256, now seen corresponding path program 1 times [2025-02-05 21:33:19,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:19,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022303005] [2025-02-05 21:33:19,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:19,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:20,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-02-05 21:33:20,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-02-05 21:33:20,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:20,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:20,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2025-02-05 21:33:20,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:20,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022303005] [2025-02-05 21:33:20,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022303005] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:33:20,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696576170] [2025-02-05 21:33:20,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:20,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:33:20,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:33:20,596 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:33:20,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:33:20,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-02-05 21:33:20,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-02-05 21:33:20,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:20,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:20,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 1056 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:33:20,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:33:21,036 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2025-02-05 21:33:21,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:33:21,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696576170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:21,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:33:21,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:33:21,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712398064] [2025-02-05 21:33:21,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:21,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:33:21,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:21,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:33:21,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:33:21,069 INFO L87 Difference]: Start difference. First operand has 233 states, 159 states have (on average 1.5534591194968554) internal successors, (247), 160 states have internal predecessors, (247), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 2 states, 2 states have (on average 54.0) internal successors, (108), 2 states have internal predecessors, (108), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) [2025-02-05 21:33:21,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:21,156 INFO L93 Difference]: Finished difference Result 460 states and 844 transitions. [2025-02-05 21:33:21,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:33:21,158 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 54.0) internal successors, (108), 2 states have internal predecessors, (108), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) Word has length 458 [2025-02-05 21:33:21,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:21,165 INFO L225 Difference]: With dead ends: 460 [2025-02-05 21:33:21,168 INFO L226 Difference]: Without dead ends: 230 [2025-02-05 21:33:21,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 459 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-02-05 21:33:21,178 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:21,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:33:21,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-05 21:33:21,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2025-02-05 21:33:21,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 157 states have internal predecessors, (240), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-05 21:33:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 382 transitions. [2025-02-05 21:33:21,257 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 382 transitions. Word has length 458 [2025-02-05 21:33:21,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:21,259 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 382 transitions. [2025-02-05 21:33:21,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.0) internal successors, (108), 2 states have internal predecessors, (108), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) [2025-02-05 21:33:21,260 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 382 transitions. [2025-02-05 21:33:21,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-02-05 21:33:21,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:21,274 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:33:21,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:33:21,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:33:21,478 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:21,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:21,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1703289432, now seen corresponding path program 1 times [2025-02-05 21:33:21,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:21,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571511706] [2025-02-05 21:33:21,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:21,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:21,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-02-05 21:33:21,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-02-05 21:33:21,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:21,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:21,966 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:33:21,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:21,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571511706] [2025-02-05 21:33:21,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571511706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:21,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:21,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:33:21,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683262498] [2025-02-05 21:33:21,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:21,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:33:21,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:21,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:33:21,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:33:21,974 INFO L87 Difference]: Start difference. First operand 230 states and 382 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:33:22,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:22,085 INFO L93 Difference]: Finished difference Result 592 states and 988 transitions. [2025-02-05 21:33:22,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:33:22,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 459 [2025-02-05 21:33:22,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:22,090 INFO L225 Difference]: With dead ends: 592 [2025-02-05 21:33:22,090 INFO L226 Difference]: Without dead ends: 365 [2025-02-05 21:33:22,092 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-02-05 21:33:22,092 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 222 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:22,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 883 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:33:22,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-02-05 21:33:22,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2025-02-05 21:33:22,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 276 states have (on average 1.5833333333333333) internal successors, (437), 277 states have internal predecessors, (437), 83 states have call successors, (83), 2 states have call predecessors, (83), 2 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2025-02-05 21:33:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 603 transitions. [2025-02-05 21:33:22,133 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 603 transitions. Word has length 459 [2025-02-05 21:33:22,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:22,134 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 603 transitions. [2025-02-05 21:33:22,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:33:22,134 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 603 transitions. [2025-02-05 21:33:22,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-02-05 21:33:22,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:22,138 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:33:22,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:33:22,139 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:22,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:22,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1983639321, now seen corresponding path program 1 times [2025-02-05 21:33:22,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:22,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862946737] [2025-02-05 21:33:22,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:22,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:22,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-02-05 21:33:22,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-02-05 21:33:22,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:22,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:22,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:33:22,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:22,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862946737] [2025-02-05 21:33:22,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862946737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:22,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:22,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:33:22,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836231844] [2025-02-05 21:33:22,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:22,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:33:22,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:22,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:33:22,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:33:22,782 INFO L87 Difference]: Start difference. First operand 362 states and 603 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:33:22,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:22,927 INFO L93 Difference]: Finished difference Result 1080 states and 1803 transitions. [2025-02-05 21:33:22,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:33:22,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 459 [2025-02-05 21:33:22,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:22,942 INFO L225 Difference]: With dead ends: 1080 [2025-02-05 21:33:22,943 INFO L226 Difference]: Without dead ends: 721 [2025-02-05 21:33:22,945 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-02-05 21:33:22,945 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 248 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:22,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 715 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:33:22,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-02-05 21:33:23,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 715. [2025-02-05 21:33:23,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 544 states have (on average 1.5808823529411764) internal successors, (860), 546 states have internal predecessors, (860), 166 states have call successors, (166), 4 states have call predecessors, (166), 4 states have return successors, (166), 164 states have call predecessors, (166), 166 states have call successors, (166) [2025-02-05 21:33:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1192 transitions. [2025-02-05 21:33:23,109 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1192 transitions. Word has length 459 [2025-02-05 21:33:23,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:23,114 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1192 transitions. [2025-02-05 21:33:23,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:33:23,115 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1192 transitions. [2025-02-05 21:33:23,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-02-05 21:33:23,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:23,124 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:33:23,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:33:23,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:23,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:23,126 INFO L85 PathProgramCache]: Analyzing trace with hash 282898842, now seen corresponding path program 1 times [2025-02-05 21:33:23,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:23,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085549998] [2025-02-05 21:33:23,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:23,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:23,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-02-05 21:33:23,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-02-05 21:33:23,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:23,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:33:23,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:23,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085549998] [2025-02-05 21:33:23,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085549998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:23,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:23,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:33:23,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708179815] [2025-02-05 21:33:23,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:23,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:33:23,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:23,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:33:23,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:33:23,682 INFO L87 Difference]: Start difference. First operand 715 states and 1192 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:33:24,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:24,074 INFO L93 Difference]: Finished difference Result 1435 states and 2394 transitions. [2025-02-05 21:33:24,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:33:24,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 459 [2025-02-05 21:33:24,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:24,081 INFO L225 Difference]: With dead ends: 1435 [2025-02-05 21:33:24,082 INFO L226 Difference]: Without dead ends: 723 [2025-02-05 21:33:24,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:33:24,084 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 237 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:24,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1081 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:33:24,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-02-05 21:33:24,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 717. [2025-02-05 21:33:24,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 546 states have (on average 1.5787545787545787) internal successors, (862), 548 states have internal predecessors, (862), 166 states have call successors, (166), 4 states have call predecessors, (166), 4 states have return successors, (166), 164 states have call predecessors, (166), 166 states have call successors, (166) [2025-02-05 21:33:24,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1194 transitions. [2025-02-05 21:33:24,170 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1194 transitions. Word has length 459 [2025-02-05 21:33:24,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:24,171 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 1194 transitions. [2025-02-05 21:33:24,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:33:24,171 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1194 transitions. [2025-02-05 21:33:24,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-02-05 21:33:24,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:24,175 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:33:24,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:33:24,175 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:24,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:24,176 INFO L85 PathProgramCache]: Analyzing trace with hash 355390598, now seen corresponding path program 1 times [2025-02-05 21:33:24,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:24,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604350296] [2025-02-05 21:33:24,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:24,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:24,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-02-05 21:33:24,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-02-05 21:33:24,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:24,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:33:24,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:24,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604350296] [2025-02-05 21:33:24,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604350296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:24,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:24,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:33:24,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634935616] [2025-02-05 21:33:24,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:24,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:33:24,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:24,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:33:24,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:33:24,459 INFO L87 Difference]: Start difference. First operand 717 states and 1194 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:33:24,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:24,646 INFO L93 Difference]: Finished difference Result 1814 states and 2986 transitions. [2025-02-05 21:33:24,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:33:24,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 460 [2025-02-05 21:33:24,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:24,654 INFO L225 Difference]: With dead ends: 1814 [2025-02-05 21:33:24,654 INFO L226 Difference]: Without dead ends: 1100 [2025-02-05 21:33:24,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:33:24,657 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 589 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:24,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 1342 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:33:24,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2025-02-05 21:33:24,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 815. [2025-02-05 21:33:24,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 626 states have (on average 1.5702875399361023) internal successors, (983), 628 states have internal predecessors, (983), 180 states have call successors, (180), 8 states have call predecessors, (180), 8 states have return successors, (180), 178 states have call predecessors, (180), 180 states have call successors, (180) [2025-02-05 21:33:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1343 transitions. [2025-02-05 21:33:24,737 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1343 transitions. Word has length 460 [2025-02-05 21:33:24,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:24,738 INFO L471 AbstractCegarLoop]: Abstraction has 815 states and 1343 transitions. [2025-02-05 21:33:24,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:33:24,739 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1343 transitions. [2025-02-05 21:33:24,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-02-05 21:33:24,744 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:24,745 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:33:24,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:33:24,746 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:24,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:24,749 INFO L85 PathProgramCache]: Analyzing trace with hash 985849223, now seen corresponding path program 1 times [2025-02-05 21:33:24,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:24,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468192854] [2025-02-05 21:33:24,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:24,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:24,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-02-05 21:33:24,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-02-05 21:33:24,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:24,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:33:26,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:26,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468192854] [2025-02-05 21:33:26,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468192854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:26,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:26,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:33:26,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308884149] [2025-02-05 21:33:26,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:26,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:33:26,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:26,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:33:26,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:33:26,114 INFO L87 Difference]: Start difference. First operand 815 states and 1343 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:33:26,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:26,923 INFO L93 Difference]: Finished difference Result 2961 states and 4852 transitions. [2025-02-05 21:33:26,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:33:26,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 460 [2025-02-05 21:33:26,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:26,941 INFO L225 Difference]: With dead ends: 2961 [2025-02-05 21:33:26,941 INFO L226 Difference]: Without dead ends: 2149 [2025-02-05 21:33:26,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:33:26,946 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 553 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:26,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1705 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:33:26,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2149 states. [2025-02-05 21:33:27,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2149 to 2143. [2025-02-05 21:33:27,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2143 states, 1632 states have (on average 1.5514705882352942) internal successors, (2532), 1640 states have internal predecessors, (2532), 486 states have call successors, (486), 24 states have call predecessors, (486), 24 states have return successors, (486), 478 states have call predecessors, (486), 486 states have call successors, (486) [2025-02-05 21:33:27,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2143 states to 2143 states and 3504 transitions. [2025-02-05 21:33:27,118 INFO L78 Accepts]: Start accepts. Automaton has 2143 states and 3504 transitions. Word has length 460 [2025-02-05 21:33:27,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:27,119 INFO L471 AbstractCegarLoop]: Abstraction has 2143 states and 3504 transitions. [2025-02-05 21:33:27,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:33:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 3504 transitions. [2025-02-05 21:33:27,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-02-05 21:33:27,125 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:27,125 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:33:27,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:33:27,126 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:27,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:27,126 INFO L85 PathProgramCache]: Analyzing trace with hash 978089864, now seen corresponding path program 1 times [2025-02-05 21:33:27,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:27,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124873634] [2025-02-05 21:33:27,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:27,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:27,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-02-05 21:33:27,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-02-05 21:33:27,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:27,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:28,395 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:33:28,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:28,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124873634] [2025-02-05 21:33:28,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124873634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:28,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:28,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:33:28,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079601861] [2025-02-05 21:33:28,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:28,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:33:28,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:28,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:33:28,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:33:28,400 INFO L87 Difference]: Start difference. First operand 2143 states and 3504 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:33:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:29,002 INFO L93 Difference]: Finished difference Result 4805 states and 7833 transitions. [2025-02-05 21:33:29,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:33:29,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 460 [2025-02-05 21:33:29,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:29,024 INFO L225 Difference]: With dead ends: 4805 [2025-02-05 21:33:29,024 INFO L226 Difference]: Without dead ends: 2665 [2025-02-05 21:33:29,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:33:29,033 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 485 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:29,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1229 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:33:29,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2025-02-05 21:33:29,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 2659. [2025-02-05 21:33:29,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2659 states, 2014 states have (on average 1.529294935451837) internal successors, (3080), 2026 states have internal predecessors, (3080), 612 states have call successors, (612), 32 states have call predecessors, (612), 32 states have return successors, (612), 600 states have call predecessors, (612), 612 states have call successors, (612) [2025-02-05 21:33:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2659 states to 2659 states and 4304 transitions. [2025-02-05 21:33:29,261 INFO L78 Accepts]: Start accepts. Automaton has 2659 states and 4304 transitions. Word has length 460 [2025-02-05 21:33:29,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:29,263 INFO L471 AbstractCegarLoop]: Abstraction has 2659 states and 4304 transitions. [2025-02-05 21:33:29,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:33:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2659 states and 4304 transitions. [2025-02-05 21:33:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-02-05 21:33:29,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:29,269 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:33:29,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:33:29,269 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:29,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:29,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2057122474, now seen corresponding path program 1 times [2025-02-05 21:33:29,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:29,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904266878] [2025-02-05 21:33:29,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:29,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:29,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-02-05 21:33:29,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-02-05 21:33:29,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:29,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:29,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:33:29,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:29,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904266878] [2025-02-05 21:33:29,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904266878] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:29,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:29,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:33:29,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003750321] [2025-02-05 21:33:29,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:29,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:33:29,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:29,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:33:29,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:33:29,905 INFO L87 Difference]: Start difference. First operand 2659 states and 4304 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:33:30,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:30,419 INFO L93 Difference]: Finished difference Result 5299 states and 8573 transitions. [2025-02-05 21:33:30,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:33:30,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 461 [2025-02-05 21:33:30,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:30,437 INFO L225 Difference]: With dead ends: 5299 [2025-02-05 21:33:30,438 INFO L226 Difference]: Without dead ends: 2643 [2025-02-05 21:33:30,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-02-05 21:33:30,446 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 377 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:30,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 707 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:33:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2025-02-05 21:33:30,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 2643. [2025-02-05 21:33:30,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2643 states, 1998 states have (on average 1.5015015015015014) internal successors, (3000), 2010 states have internal predecessors, (3000), 612 states have call successors, (612), 32 states have call predecessors, (612), 32 states have return successors, (612), 600 states have call predecessors, (612), 612 states have call successors, (612) [2025-02-05 21:33:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 4224 transitions. [2025-02-05 21:33:30,663 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 4224 transitions. Word has length 461 [2025-02-05 21:33:30,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:30,664 INFO L471 AbstractCegarLoop]: Abstraction has 2643 states and 4224 transitions. [2025-02-05 21:33:30,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-02-05 21:33:30,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 4224 transitions. [2025-02-05 21:33:30,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-02-05 21:33:30,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:30,670 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:33:30,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:33:30,671 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:30,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:30,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1237943341, now seen corresponding path program 1 times [2025-02-05 21:33:30,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:30,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667524803] [2025-02-05 21:33:30,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:30,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:30,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-02-05 21:33:30,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-02-05 21:33:30,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:30,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:41,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:33:41,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:41,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667524803] [2025-02-05 21:33:41,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667524803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:41,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:41,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 21:33:41,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332596799] [2025-02-05 21:33:41,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:41,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 21:33:41,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:41,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 21:33:41,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:33:41,031 INFO L87 Difference]: Start difference. First operand 2643 states and 4224 transitions. Second operand has 11 states, 11 states have (on average 10.0) internal successors, (110), 11 states have internal predecessors, (110), 3 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2025-02-05 21:33:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:44,558 INFO L93 Difference]: Finished difference Result 9717 states and 15376 transitions. [2025-02-05 21:33:44,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:33:44,559 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 11 states have internal predecessors, (110), 3 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) Word has length 462 [2025-02-05 21:33:44,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:44,606 INFO L225 Difference]: With dead ends: 9717 [2025-02-05 21:33:44,606 INFO L226 Difference]: Without dead ends: 7077 [2025-02-05 21:33:44,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2025-02-05 21:33:44,620 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 1798 mSDsluCounter, 2161 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 1536 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1798 SdHoareTripleChecker+Valid, 2716 SdHoareTripleChecker+Invalid, 2509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1536 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:44,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1798 Valid, 2716 Invalid, 2509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1536 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 21:33:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7077 states. [2025-02-05 21:33:45,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7077 to 6286. [2025-02-05 21:33:45,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6286 states, 4671 states have (on average 1.4799828730464568) internal successors, (6913), 4704 states have internal predecessors, (6913), 1530 states have call successors, (1530), 84 states have call predecessors, (1530), 84 states have return successors, (1530), 1497 states have call predecessors, (1530), 1530 states have call successors, (1530) [2025-02-05 21:33:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6286 states to 6286 states and 9973 transitions. [2025-02-05 21:33:45,290 INFO L78 Accepts]: Start accepts. Automaton has 6286 states and 9973 transitions. Word has length 462 [2025-02-05 21:33:45,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:45,292 INFO L471 AbstractCegarLoop]: Abstraction has 6286 states and 9973 transitions. [2025-02-05 21:33:45,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 11 states have internal predecessors, (110), 3 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2025-02-05 21:33:45,296 INFO L276 IsEmpty]: Start isEmpty. Operand 6286 states and 9973 transitions. [2025-02-05 21:33:45,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-02-05 21:33:45,306 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:45,306 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:33:45,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:33:45,307 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:45,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:45,308 INFO L85 PathProgramCache]: Analyzing trace with hash -2031531956, now seen corresponding path program 1 times [2025-02-05 21:33:45,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:45,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623082050] [2025-02-05 21:33:45,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:45,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:45,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-02-05 21:33:45,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-02-05 21:33:45,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:45,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:33:59,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:59,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623082050] [2025-02-05 21:33:59,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623082050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:59,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:59,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 21:33:59,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076588188] [2025-02-05 21:33:59,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:59,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 21:33:59,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:59,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 21:33:59,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:33:59,531 INFO L87 Difference]: Start difference. First operand 6286 states and 9973 transitions. Second operand has 15 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 3 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2025-02-05 21:34:07,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:07,003 INFO L93 Difference]: Finished difference Result 14422 states and 22769 transitions. [2025-02-05 21:34:07,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 21:34:07,004 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 3 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) Word has length 462 [2025-02-05 21:34:07,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:07,081 INFO L225 Difference]: With dead ends: 14422 [2025-02-05 21:34:07,081 INFO L226 Difference]: Without dead ends: 12592 [2025-02-05 21:34:07,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2025-02-05 21:34:07,095 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 4146 mSDsluCounter, 2802 mSDsCounter, 0 mSdLazyCounter, 2845 mSolverCounterSat, 2596 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4146 SdHoareTripleChecker+Valid, 3244 SdHoareTripleChecker+Invalid, 5441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2596 IncrementalHoareTripleChecker+Valid, 2845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:07,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4146 Valid, 3244 Invalid, 5441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2596 Valid, 2845 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-02-05 21:34:07,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12592 states. [2025-02-05 21:34:08,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12592 to 11500. [2025-02-05 21:34:08,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11500 states, 8572 states have (on average 1.4776014932337844) internal successors, (12666), 8637 states have internal predecessors, (12666), 2768 states have call successors, (2768), 159 states have call predecessors, (2768), 159 states have return successors, (2768), 2703 states have call predecessors, (2768), 2768 states have call successors, (2768) [2025-02-05 21:34:08,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11500 states to 11500 states and 18202 transitions. [2025-02-05 21:34:08,298 INFO L78 Accepts]: Start accepts. Automaton has 11500 states and 18202 transitions. Word has length 462 [2025-02-05 21:34:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:08,299 INFO L471 AbstractCegarLoop]: Abstraction has 11500 states and 18202 transitions. [2025-02-05 21:34:08,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 3 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2025-02-05 21:34:08,300 INFO L276 IsEmpty]: Start isEmpty. Operand 11500 states and 18202 transitions. [2025-02-05 21:34:08,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-02-05 21:34:08,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:08,311 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:34:08,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:34:08,311 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:08,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:08,312 INFO L85 PathProgramCache]: Analyzing trace with hash -786767475, now seen corresponding path program 1 times [2025-02-05 21:34:08,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:08,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749774920] [2025-02-05 21:34:08,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:08,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:08,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-02-05 21:34:08,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-02-05 21:34:08,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:08,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-02-05 21:34:11,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:11,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749774920] [2025-02-05 21:34:11,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749774920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:11,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:11,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 21:34:11,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423857923] [2025-02-05 21:34:11,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:11,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 21:34:11,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:11,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 21:34:11,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:34:11,200 INFO L87 Difference]: Start difference. First operand 11500 states and 18202 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71)