./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.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_loopvsstraightlinecode_25-1loop_file-32.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 d4efba5d8035d5b89a6fee2af18255a7435db1834e066c2b81c99247161e78c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:10:29,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:10:29,928 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 01:10:29,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:10:29,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:10:29,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:10:29,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:10:29,953 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:10:29,953 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:10:29,953 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:10:29,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:10:29,954 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:10:29,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:10:29,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:10:29,955 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:10:29,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:10:29,955 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:10:29,955 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:10:29,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:10:29,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:10:29,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:10:29,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:10:29,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:10:29,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:10:29,955 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:10:29,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:10:29,955 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:10:29,955 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:10:29,955 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:10:29,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:10:29,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:10:29,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:10:29,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:10:29,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:10:29,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:10:29,956 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:10:29,956 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:10:29,957 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:10:29,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:10:29,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:10:29,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:10:29,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:10:29,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:10:29,957 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 -> d4efba5d8035d5b89a6fee2af18255a7435db1834e066c2b81c99247161e78c7 [2025-02-06 01:10:30,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:10:30,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:10:30,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:10:30,202 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:10:30,202 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:10:30,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i [2025-02-06 01:10:31,444 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5fe22d132/3dbd287661d84281abbbad48090c7e27/FLAGef3bfa21a [2025-02-06 01:10:31,714 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:10:31,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i [2025-02-06 01:10:31,723 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5fe22d132/3dbd287661d84281abbbad48090c7e27/FLAGef3bfa21a [2025-02-06 01:10:32,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5fe22d132/3dbd287661d84281abbbad48090c7e27 [2025-02-06 01:10:32,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:10:32,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:10:32,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:10:32,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:10:32,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:10:32,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:10:32" (1/1) ... [2025-02-06 01:10:32,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5038219f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:32, skipping insertion in model container [2025-02-06 01:10:32,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:10:32" (1/1) ... [2025-02-06 01:10:32,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:10:32,153 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_loopvsstraightlinecode_25-1loop_file-32.i[915,928] [2025-02-06 01:10:32,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:10:32,209 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:10:32,216 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_loopvsstraightlinecode_25-1loop_file-32.i[915,928] [2025-02-06 01:10:32,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:10:32,258 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:10:32,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:32 WrapperNode [2025-02-06 01:10:32,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:10:32,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:10:32,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:10:32,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:10:32,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:32" (1/1) ... [2025-02-06 01:10:32,272 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:32" (1/1) ... [2025-02-06 01:10:32,295 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2025-02-06 01:10:32,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:10:32,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:10:32,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:10:32,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:10:32,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:32" (1/1) ... [2025-02-06 01:10:32,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:32" (1/1) ... [2025-02-06 01:10:32,309 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:32" (1/1) ... [2025-02-06 01:10:32,326 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-06 01:10:32,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:32" (1/1) ... [2025-02-06 01:10:32,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:32" (1/1) ... [2025-02-06 01:10:32,332 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:32" (1/1) ... [2025-02-06 01:10:32,333 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:32" (1/1) ... [2025-02-06 01:10:32,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:32" (1/1) ... [2025-02-06 01:10:32,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:32" (1/1) ... [2025-02-06 01:10:32,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:10:32,338 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:10:32,338 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:10:32,338 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:10:32,339 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:32" (1/1) ... [2025-02-06 01:10:32,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:10:32,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:10:32,368 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-06 01:10:32,371 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-06 01:10:32,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:10:32,388 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:10:32,388 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:10:32,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:10:32,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:10:32,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:10:32,440 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:10:32,442 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:10:32,697 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L90: havoc property_#t~bitwise16#1;havoc property_#t~bitwise17#1;havoc property_#t~bitwise18#1;havoc property_#t~short19#1;havoc property_#t~ite21#1;havoc property_#t~bitwise20#1;havoc property_#t~short22#1; [2025-02-06 01:10:32,719 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-02-06 01:10:32,720 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:10:32,732 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:10:32,732 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 01:10:32,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:10:32 BoogieIcfgContainer [2025-02-06 01:10:32,733 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:10:32,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:10:32,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:10:32,738 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:10:32,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:10:32" (1/3) ... [2025-02-06 01:10:32,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d96d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:10:32, skipping insertion in model container [2025-02-06 01:10:32,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:32" (2/3) ... [2025-02-06 01:10:32,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d96d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:10:32, skipping insertion in model container [2025-02-06 01:10:32,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:10:32" (3/3) ... [2025-02-06 01:10:32,740 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-32.i [2025-02-06 01:10:32,751 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:10:32,752 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-32.i that has 2 procedures, 78 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:10:32,801 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:10:32,810 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;@7ce8b509, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:10:32,811 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:10:32,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 01:10:32,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 01:10:32,822 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:32,822 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:32,823 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:32,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:32,827 INFO L85 PathProgramCache]: Analyzing trace with hash -886028478, now seen corresponding path program 1 times [2025-02-06 01:10:32,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:32,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106973364] [2025-02-06 01:10:32,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:32,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:32,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 01:10:32,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 01:10:32,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:32,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:33,033 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 01:10:33,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:33,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106973364] [2025-02-06 01:10:33,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106973364] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:10:33,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461247748] [2025-02-06 01:10:33,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:33,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:10:33,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:10:33,042 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-06 01:10:33,045 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-06 01:10:33,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 01:10:33,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 01:10:33,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:33,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:33,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:10:33,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:10:33,194 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 01:10:33,194 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:10:33,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461247748] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:33,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:10:33,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:10:33,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773383140] [2025-02-06 01:10:33,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:33,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:10:33,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:33,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:10:33,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:10:33,218 INFO L87 Difference]: Start difference. First operand has 78 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 01:10:33,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:33,253 INFO L93 Difference]: Finished difference Result 153 states and 247 transitions. [2025-02-06 01:10:33,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:10:33,259 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 110 [2025-02-06 01:10:33,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:33,266 INFO L225 Difference]: With dead ends: 153 [2025-02-06 01:10:33,269 INFO L226 Difference]: Without dead ends: 75 [2025-02-06 01:10:33,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 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-06 01:10:33,278 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:33,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:10:33,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-06 01:10:33,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-02-06 01:10:33,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 01:10:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 112 transitions. [2025-02-06 01:10:33,325 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 112 transitions. Word has length 110 [2025-02-06 01:10:33,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:33,325 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 112 transitions. [2025-02-06 01:10:33,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 01:10:33,325 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 112 transitions. [2025-02-06 01:10:33,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 01:10:33,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:33,327 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:33,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 01:10:33,531 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-06 01:10:33,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:33,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:33,532 INFO L85 PathProgramCache]: Analyzing trace with hash -523520190, now seen corresponding path program 1 times [2025-02-06 01:10:33,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:33,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27378991] [2025-02-06 01:10:33,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:33,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:33,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 01:10:33,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 01:10:33,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:33,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:33,957 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:10:33,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:33,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27378991] [2025-02-06 01:10:33,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27378991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:33,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:10:33,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 01:10:33,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59829738] [2025-02-06 01:10:33,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:33,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 01:10:33,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:33,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 01:10:33,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 01:10:33,959 INFO L87 Difference]: Start difference. First operand 75 states and 112 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:34,093 INFO L93 Difference]: Finished difference Result 255 states and 383 transitions. [2025-02-06 01:10:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 01:10:34,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2025-02-06 01:10:34,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:34,095 INFO L225 Difference]: With dead ends: 255 [2025-02-06 01:10:34,095 INFO L226 Difference]: Without dead ends: 183 [2025-02-06 01:10:34,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:10:34,096 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 142 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:34,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 335 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:10:34,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-06 01:10:34,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 145. [2025-02-06 01:10:34,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 01:10:34,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 219 transitions. [2025-02-06 01:10:34,110 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 219 transitions. Word has length 110 [2025-02-06 01:10:34,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:34,111 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 219 transitions. [2025-02-06 01:10:34,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:34,111 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2025-02-06 01:10:34,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 01:10:34,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:34,112 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:34,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 01:10:34,113 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:34,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:34,113 INFO L85 PathProgramCache]: Analyzing trace with hash 829789507, now seen corresponding path program 1 times [2025-02-06 01:10:34,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:34,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385817827] [2025-02-06 01:10:34,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:34,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:34,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 01:10:34,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 01:10:34,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:34,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:10:34,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:34,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385817827] [2025-02-06 01:10:34,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385817827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:34,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:10:34,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 01:10:34,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937917049] [2025-02-06 01:10:34,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:34,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 01:10:34,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:34,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 01:10:34,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:10:34,306 INFO L87 Difference]: Start difference. First operand 145 states and 219 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:34,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:34,452 INFO L93 Difference]: Finished difference Result 406 states and 616 transitions. [2025-02-06 01:10:34,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 01:10:34,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2025-02-06 01:10:34,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:34,455 INFO L225 Difference]: With dead ends: 406 [2025-02-06 01:10:34,457 INFO L226 Difference]: Without dead ends: 264 [2025-02-06 01:10:34,458 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-06 01:10:34,459 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 125 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:34,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 376 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:10:34,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-02-06 01:10:34,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 192. [2025-02-06 01:10:34,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 140 states have (on average 1.3928571428571428) internal successors, (195), 140 states have internal predecessors, (195), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 01:10:34,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 291 transitions. [2025-02-06 01:10:34,480 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 291 transitions. Word has length 110 [2025-02-06 01:10:34,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:34,481 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 291 transitions. [2025-02-06 01:10:34,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:34,481 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 291 transitions. [2025-02-06 01:10:34,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 01:10:34,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:34,482 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:34,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 01:10:34,483 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:34,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:34,483 INFO L85 PathProgramCache]: Analyzing trace with hash -671767837, now seen corresponding path program 1 times [2025-02-06 01:10:34,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:34,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536053462] [2025-02-06 01:10:34,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:34,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:34,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 01:10:34,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 01:10:34,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:34,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:34,959 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:10:34,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:34,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536053462] [2025-02-06 01:10:34,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536053462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:34,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:10:34,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 01:10:34,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941554686] [2025-02-06 01:10:34,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:34,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 01:10:34,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:34,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 01:10:34,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 01:10:34,963 INFO L87 Difference]: Start difference. First operand 192 states and 291 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:35,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:35,237 INFO L93 Difference]: Finished difference Result 422 states and 633 transitions. [2025-02-06 01:10:35,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 01:10:35,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2025-02-06 01:10:35,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:35,239 INFO L225 Difference]: With dead ends: 422 [2025-02-06 01:10:35,239 INFO L226 Difference]: Without dead ends: 276 [2025-02-06 01:10:35,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:10:35,240 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 107 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:35,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 338 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 01:10:35,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-02-06 01:10:35,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 248. [2025-02-06 01:10:35,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 196 states have (on average 1.4234693877551021) internal successors, (279), 196 states have internal predecessors, (279), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 01:10:35,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 375 transitions. [2025-02-06 01:10:35,259 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 375 transitions. Word has length 111 [2025-02-06 01:10:35,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:35,260 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 375 transitions. [2025-02-06 01:10:35,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:35,260 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 375 transitions. [2025-02-06 01:10:35,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 01:10:35,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:35,265 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:35,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 01:10:35,265 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:35,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:35,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1240276576, now seen corresponding path program 1 times [2025-02-06 01:10:35,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:35,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811763766] [2025-02-06 01:10:35,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:35,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:35,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 01:10:35,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 01:10:35,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:35,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:10:35,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:35,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811763766] [2025-02-06 01:10:35,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811763766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:35,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:10:35,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 01:10:35,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093433096] [2025-02-06 01:10:35,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:35,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 01:10:35,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:35,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 01:10:35,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:10:35,770 INFO L87 Difference]: Start difference. First operand 248 states and 375 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:36,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:36,055 INFO L93 Difference]: Finished difference Result 472 states and 711 transitions. [2025-02-06 01:10:36,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 01:10:36,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2025-02-06 01:10:36,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:36,059 INFO L225 Difference]: With dead ends: 472 [2025-02-06 01:10:36,060 INFO L226 Difference]: Without dead ends: 283 [2025-02-06 01:10:36,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 01:10:36,062 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 52 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:36,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 340 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 01:10:36,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-02-06 01:10:36,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 248. [2025-02-06 01:10:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 196 states have (on average 1.413265306122449) internal successors, (277), 196 states have internal predecessors, (277), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 01:10:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 373 transitions. [2025-02-06 01:10:36,094 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 373 transitions. Word has length 112 [2025-02-06 01:10:36,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:36,094 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 373 transitions. [2025-02-06 01:10:36,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:36,094 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 373 transitions. [2025-02-06 01:10:36,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 01:10:36,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:36,095 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:36,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 01:10:36,095 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:36,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:36,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1407597283, now seen corresponding path program 1 times [2025-02-06 01:10:36,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:36,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138072649] [2025-02-06 01:10:36,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:36,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:36,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 01:10:36,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 01:10:36,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:36,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:10:36,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:36,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138072649] [2025-02-06 01:10:36,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138072649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:36,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:10:36,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 01:10:36,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967346244] [2025-02-06 01:10:36,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:36,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 01:10:36,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:36,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 01:10:36,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:10:36,245 INFO L87 Difference]: Start difference. First operand 248 states and 373 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:36,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:36,387 INFO L93 Difference]: Finished difference Result 571 states and 859 transitions. [2025-02-06 01:10:36,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 01:10:36,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2025-02-06 01:10:36,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:36,390 INFO L225 Difference]: With dead ends: 571 [2025-02-06 01:10:36,391 INFO L226 Difference]: Without dead ends: 382 [2025-02-06 01:10:36,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:10:36,392 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 108 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:36,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 369 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:10:36,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-02-06 01:10:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 304. [2025-02-06 01:10:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 252 states have (on average 1.4325396825396826) internal successors, (361), 252 states have internal predecessors, (361), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 01:10:36,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 457 transitions. [2025-02-06 01:10:36,416 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 457 transitions. Word has length 115 [2025-02-06 01:10:36,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:36,416 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 457 transitions. [2025-02-06 01:10:36,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:36,417 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 457 transitions. [2025-02-06 01:10:36,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 01:10:36,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:36,418 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:36,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 01:10:36,418 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:36,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:36,419 INFO L85 PathProgramCache]: Analyzing trace with hash -335162376, now seen corresponding path program 1 times [2025-02-06 01:10:36,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:36,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269093590] [2025-02-06 01:10:36,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:36,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:36,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 01:10:36,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 01:10:36,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:36,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:37,753 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:10:37,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:37,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269093590] [2025-02-06 01:10:37,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269093590] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:37,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:10:37,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 01:10:37,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557770282] [2025-02-06 01:10:37,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:37,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 01:10:37,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:37,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 01:10:37,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 01:10:37,756 INFO L87 Difference]: Start difference. First operand 304 states and 457 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:38,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:38,958 INFO L93 Difference]: Finished difference Result 675 states and 1015 transitions. [2025-02-06 01:10:38,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 01:10:38,959 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2025-02-06 01:10:38,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:38,961 INFO L225 Difference]: With dead ends: 675 [2025-02-06 01:10:38,961 INFO L226 Difference]: Without dead ends: 486 [2025-02-06 01:10:38,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 01:10:38,962 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 52 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:38,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 576 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 01:10:38,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-02-06 01:10:38,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 396. [2025-02-06 01:10:38,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 344 states have (on average 1.4563953488372092) internal successors, (501), 344 states have internal predecessors, (501), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 01:10:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 597 transitions. [2025-02-06 01:10:38,998 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 597 transitions. Word has length 116 [2025-02-06 01:10:38,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:38,998 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 597 transitions. [2025-02-06 01:10:38,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:38,998 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 597 transitions. [2025-02-06 01:10:38,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 01:10:38,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:39,000 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:39,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 01:10:39,000 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:39,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:39,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2007076759, now seen corresponding path program 1 times [2025-02-06 01:10:39,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:39,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307272858] [2025-02-06 01:10:39,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:39,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:39,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 01:10:39,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 01:10:39,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:39,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:10:39,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:39,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307272858] [2025-02-06 01:10:39,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307272858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:39,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:10:39,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:10:39,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991064034] [2025-02-06 01:10:39,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:39,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:10:39,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:39,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:10:39,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:10:39,051 INFO L87 Difference]: Start difference. First operand 396 states and 597 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:39,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:39,090 INFO L93 Difference]: Finished difference Result 755 states and 1135 transitions. [2025-02-06 01:10:39,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:10:39,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2025-02-06 01:10:39,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:39,093 INFO L225 Difference]: With dead ends: 755 [2025-02-06 01:10:39,093 INFO L226 Difference]: Without dead ends: 506 [2025-02-06 01:10:39,093 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-06 01:10:39,093 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 40 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:39,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 189 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:10:39,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-02-06 01:10:39,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 444. [2025-02-06 01:10:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 392 states have (on average 1.4209183673469388) internal successors, (557), 392 states have internal predecessors, (557), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 01:10:39,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 653 transitions. [2025-02-06 01:10:39,122 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 653 transitions. Word has length 116 [2025-02-06 01:10:39,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:39,125 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 653 transitions. [2025-02-06 01:10:39,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:39,126 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 653 transitions. [2025-02-06 01:10:39,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 01:10:39,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:39,127 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:39,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 01:10:39,127 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:39,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:39,127 INFO L85 PathProgramCache]: Analyzing trace with hash -840721001, now seen corresponding path program 1 times [2025-02-06 01:10:39,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:39,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910032478] [2025-02-06 01:10:39,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:39,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:39,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 01:10:39,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 01:10:39,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:39,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:40,149 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:10:40,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:40,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910032478] [2025-02-06 01:10:40,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910032478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:40,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:10:40,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 01:10:40,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823234375] [2025-02-06 01:10:40,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:40,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 01:10:40,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:40,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 01:10:40,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 01:10:40,152 INFO L87 Difference]: Start difference. First operand 444 states and 653 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:41,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:41,441 INFO L93 Difference]: Finished difference Result 827 states and 1203 transitions. [2025-02-06 01:10:41,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 01:10:41,442 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2025-02-06 01:10:41,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:41,445 INFO L225 Difference]: With dead ends: 827 [2025-02-06 01:10:41,445 INFO L226 Difference]: Without dead ends: 554 [2025-02-06 01:10:41,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 01:10:41,449 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 41 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:41,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 736 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 01:10:41,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-02-06 01:10:41,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 444. [2025-02-06 01:10:41,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 392 states have (on average 1.4209183673469388) internal successors, (557), 392 states have internal predecessors, (557), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 01:10:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 653 transitions. [2025-02-06 01:10:41,488 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 653 transitions. Word has length 116 [2025-02-06 01:10:41,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:41,489 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 653 transitions. [2025-02-06 01:10:41,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 653 transitions. [2025-02-06 01:10:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 01:10:41,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:41,490 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:41,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 01:10:41,490 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:41,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:41,490 INFO L85 PathProgramCache]: Analyzing trace with hash 254252112, now seen corresponding path program 1 times [2025-02-06 01:10:41,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:41,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79623049] [2025-02-06 01:10:41,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:41,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:41,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 01:10:41,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 01:10:41,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:41,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:41,551 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:10:41,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:41,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79623049] [2025-02-06 01:10:41,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79623049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:41,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:10:41,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:10:41,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907795242] [2025-02-06 01:10:41,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:41,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:10:41,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:41,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:10:41,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:10:41,552 INFO L87 Difference]: Start difference. First operand 444 states and 653 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:41,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:41,608 INFO L93 Difference]: Finished difference Result 791 states and 1163 transitions. [2025-02-06 01:10:41,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:10:41,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2025-02-06 01:10:41,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:41,613 INFO L225 Difference]: With dead ends: 791 [2025-02-06 01:10:41,613 INFO L226 Difference]: Without dead ends: 506 [2025-02-06 01:10:41,613 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-06 01:10:41,614 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 40 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:41,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 219 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:10:41,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-02-06 01:10:41,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 400. [2025-02-06 01:10:41,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 348 states have (on average 1.3936781609195403) internal successors, (485), 348 states have internal predecessors, (485), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 01:10:41,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 581 transitions. [2025-02-06 01:10:41,628 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 581 transitions. Word has length 116 [2025-02-06 01:10:41,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:41,629 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 581 transitions. [2025-02-06 01:10:41,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:41,629 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 581 transitions. [2025-02-06 01:10:41,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 01:10:41,629 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:41,630 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:41,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 01:10:41,630 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:41,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:41,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1417662271, now seen corresponding path program 1 times [2025-02-06 01:10:41,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:41,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954455911] [2025-02-06 01:10:41,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:41,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:41,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 01:10:41,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 01:10:41,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:41,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:41,710 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:10:41,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:41,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954455911] [2025-02-06 01:10:41,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954455911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:41,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:10:41,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:10:41,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954197973] [2025-02-06 01:10:41,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:41,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:10:41,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:41,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:10:41,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:10:41,714 INFO L87 Difference]: Start difference. First operand 400 states and 581 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:41,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:41,779 INFO L93 Difference]: Finished difference Result 763 states and 1116 transitions. [2025-02-06 01:10:41,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:10:41,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2025-02-06 01:10:41,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:41,782 INFO L225 Difference]: With dead ends: 763 [2025-02-06 01:10:41,782 INFO L226 Difference]: Without dead ends: 490 [2025-02-06 01:10:41,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:10:41,783 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 72 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:41,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 186 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:10:41,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-02-06 01:10:41,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 488. [2025-02-06 01:10:41,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 419 states have (on average 1.3794749403341289) internal successors, (578), 419 states have internal predecessors, (578), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-06 01:10:41,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 706 transitions. [2025-02-06 01:10:41,798 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 706 transitions. Word has length 116 [2025-02-06 01:10:41,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:41,799 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 706 transitions. [2025-02-06 01:10:41,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 706 transitions. [2025-02-06 01:10:41,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 01:10:41,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:41,799 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:41,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 01:10:41,800 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:41,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:41,800 INFO L85 PathProgramCache]: Analyzing trace with hash -386666662, now seen corresponding path program 1 times [2025-02-06 01:10:41,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:41,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321839485] [2025-02-06 01:10:41,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:41,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:41,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 01:10:41,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 01:10:41,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:41,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:41,972 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:10:41,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:41,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321839485] [2025-02-06 01:10:41,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321839485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:41,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:10:41,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 01:10:41,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852296751] [2025-02-06 01:10:41,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:41,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 01:10:41,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:41,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 01:10:41,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 01:10:41,973 INFO L87 Difference]: Start difference. First operand 488 states and 706 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:42,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:42,346 INFO L93 Difference]: Finished difference Result 1029 states and 1478 transitions. [2025-02-06 01:10:42,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 01:10:42,347 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2025-02-06 01:10:42,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:42,350 INFO L225 Difference]: With dead ends: 1029 [2025-02-06 01:10:42,350 INFO L226 Difference]: Without dead ends: 668 [2025-02-06 01:10:42,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-02-06 01:10:42,351 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 172 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:42,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 571 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 01:10:42,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-02-06 01:10:42,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 524. [2025-02-06 01:10:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 455 states have (on average 1.3758241758241758) internal successors, (626), 455 states have internal predecessors, (626), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-06 01:10:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 754 transitions. [2025-02-06 01:10:42,393 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 754 transitions. Word has length 117 [2025-02-06 01:10:42,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:42,393 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 754 transitions. [2025-02-06 01:10:42,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:42,393 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 754 transitions. [2025-02-06 01:10:42,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 01:10:42,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:42,395 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:42,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 01:10:42,395 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:42,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:42,395 INFO L85 PathProgramCache]: Analyzing trace with hash 170186779, now seen corresponding path program 1 times [2025-02-06 01:10:42,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:42,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919370804] [2025-02-06 01:10:42,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:42,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:42,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 01:10:42,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 01:10:42,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:42,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:10:42,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:42,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919370804] [2025-02-06 01:10:42,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919370804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:42,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:10:42,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 01:10:42,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538071150] [2025-02-06 01:10:42,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:42,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 01:10:42,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:42,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 01:10:42,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 01:10:42,516 INFO L87 Difference]: Start difference. First operand 524 states and 754 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:42,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:42,769 INFO L93 Difference]: Finished difference Result 1087 states and 1562 transitions. [2025-02-06 01:10:42,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 01:10:42,769 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2025-02-06 01:10:42,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:42,772 INFO L225 Difference]: With dead ends: 1087 [2025-02-06 01:10:42,772 INFO L226 Difference]: Without dead ends: 726 [2025-02-06 01:10:42,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-02-06 01:10:42,773 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 174 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:42,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 864 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 01:10:42,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-02-06 01:10:42,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 644. [2025-02-06 01:10:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 557 states have (on average 1.3644524236983842) internal successors, (760), 559 states have internal predecessors, (760), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-06 01:10:42,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 920 transitions. [2025-02-06 01:10:42,795 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 920 transitions. Word has length 117 [2025-02-06 01:10:42,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:42,796 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 920 transitions. [2025-02-06 01:10:42,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:42,796 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 920 transitions. [2025-02-06 01:10:42,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 01:10:42,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:42,797 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:42,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 01:10:42,797 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:42,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:42,797 INFO L85 PathProgramCache]: Analyzing trace with hash -794895370, now seen corresponding path program 1 times [2025-02-06 01:10:42,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:42,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796682574] [2025-02-06 01:10:42,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:42,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:42,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 01:10:42,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 01:10:42,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:42,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:43,074 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:10:43,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:43,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796682574] [2025-02-06 01:10:43,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796682574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:43,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:10:43,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 01:10:43,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93975537] [2025-02-06 01:10:43,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:43,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 01:10:43,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:43,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 01:10:43,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:10:43,076 INFO L87 Difference]: Start difference. First operand 644 states and 920 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:43,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:43,253 INFO L93 Difference]: Finished difference Result 860 states and 1219 transitions. [2025-02-06 01:10:43,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 01:10:43,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2025-02-06 01:10:43,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:43,257 INFO L225 Difference]: With dead ends: 860 [2025-02-06 01:10:43,257 INFO L226 Difference]: Without dead ends: 858 [2025-02-06 01:10:43,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 01:10:43,258 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 65 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:43,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 690 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:10:43,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2025-02-06 01:10:43,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 854. [2025-02-06 01:10:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 732 states have (on average 1.349726775956284) internal successors, (988), 737 states have internal predecessors, (988), 112 states have call successors, (112), 9 states have call predecessors, (112), 9 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-06 01:10:43,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1212 transitions. [2025-02-06 01:10:43,288 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1212 transitions. Word has length 118 [2025-02-06 01:10:43,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:43,288 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1212 transitions. [2025-02-06 01:10:43,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1212 transitions. [2025-02-06 01:10:43,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 01:10:43,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:43,290 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:43,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 01:10:43,290 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:43,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:43,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2021929447, now seen corresponding path program 1 times [2025-02-06 01:10:43,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:43,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297626492] [2025-02-06 01:10:43,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:43,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:43,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 01:10:43,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 01:10:43,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:43,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:43,331 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:10:43,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:43,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297626492] [2025-02-06 01:10:43,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297626492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:43,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:10:43,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:10:43,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809280834] [2025-02-06 01:10:43,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:43,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:10:43,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:43,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:10:43,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:10:43,332 INFO L87 Difference]: Start difference. First operand 854 states and 1212 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:43,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:43,391 INFO L93 Difference]: Finished difference Result 1884 states and 2659 transitions. [2025-02-06 01:10:43,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:10:43,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2025-02-06 01:10:43,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:43,396 INFO L225 Difference]: With dead ends: 1884 [2025-02-06 01:10:43,396 INFO L226 Difference]: Without dead ends: 1243 [2025-02-06 01:10:43,397 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-06 01:10:43,397 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 51 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:43,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 189 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:10:43,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2025-02-06 01:10:43,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1236. [2025-02-06 01:10:43,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 1085 states have (on average 1.3317972350230414) internal successors, (1445), 1095 states have internal predecessors, (1445), 132 states have call successors, (132), 18 states have call predecessors, (132), 18 states have return successors, (132), 122 states have call predecessors, (132), 132 states have call successors, (132) [2025-02-06 01:10:43,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1709 transitions. [2025-02-06 01:10:43,469 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1709 transitions. Word has length 118 [2025-02-06 01:10:43,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:43,470 INFO L471 AbstractCegarLoop]: Abstraction has 1236 states and 1709 transitions. [2025-02-06 01:10:43,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:43,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1709 transitions. [2025-02-06 01:10:43,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 01:10:43,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:43,471 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:43,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 01:10:43,471 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:43,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:43,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1900712041, now seen corresponding path program 1 times [2025-02-06 01:10:43,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:43,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288916921] [2025-02-06 01:10:43,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:43,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:43,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 01:10:43,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 01:10:43,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:43,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:10:44,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:44,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288916921] [2025-02-06 01:10:44,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288916921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:44,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:10:44,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 01:10:44,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579852530] [2025-02-06 01:10:44,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:44,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 01:10:44,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:44,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 01:10:44,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:10:44,135 INFO L87 Difference]: Start difference. First operand 1236 states and 1709 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:45,183 INFO L93 Difference]: Finished difference Result 2791 states and 3825 transitions. [2025-02-06 01:10:45,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 01:10:45,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2025-02-06 01:10:45,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:45,190 INFO L225 Difference]: With dead ends: 2791 [2025-02-06 01:10:45,190 INFO L226 Difference]: Without dead ends: 1876 [2025-02-06 01:10:45,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 01:10:45,192 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 39 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:45,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 651 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 01:10:45,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2025-02-06 01:10:45,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1861. [2025-02-06 01:10:45,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1861 states, 1671 states have (on average 1.305804907241173) internal successors, (2182), 1694 states have internal predecessors, (2182), 158 states have call successors, (158), 31 states have call predecessors, (158), 31 states have return successors, (158), 135 states have call predecessors, (158), 158 states have call successors, (158) [2025-02-06 01:10:45,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1861 states to 1861 states and 2498 transitions. [2025-02-06 01:10:45,309 INFO L78 Accepts]: Start accepts. Automaton has 1861 states and 2498 transitions. Word has length 118 [2025-02-06 01:10:45,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:45,310 INFO L471 AbstractCegarLoop]: Abstraction has 1861 states and 2498 transitions. [2025-02-06 01:10:45,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:45,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1861 states and 2498 transitions. [2025-02-06 01:10:45,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 01:10:45,311 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:45,311 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:45,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 01:10:45,312 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:45,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:45,312 INFO L85 PathProgramCache]: Analyzing trace with hash -393160232, now seen corresponding path program 1 times [2025-02-06 01:10:45,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:45,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883457258] [2025-02-06 01:10:45,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:45,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:45,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 01:10:45,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 01:10:45,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:45,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:45,835 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:10:45,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:45,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883457258] [2025-02-06 01:10:45,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883457258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:45,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:10:45,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 01:10:45,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998059049] [2025-02-06 01:10:45,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:45,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 01:10:45,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:45,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 01:10:45,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:10:45,837 INFO L87 Difference]: Start difference. First operand 1861 states and 2498 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:46,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:46,688 INFO L93 Difference]: Finished difference Result 3870 states and 5223 transitions. [2025-02-06 01:10:46,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 01:10:46,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2025-02-06 01:10:46,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:46,697 INFO L225 Difference]: With dead ends: 3870 [2025-02-06 01:10:46,697 INFO L226 Difference]: Without dead ends: 2495 [2025-02-06 01:10:46,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 01:10:46,699 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 64 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:46,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 776 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 01:10:46,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2025-02-06 01:10:46,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2239. [2025-02-06 01:10:46,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2239 states, 2022 states have (on average 1.2982195845697329) internal successors, (2625), 2046 states have internal predecessors, (2625), 180 states have call successors, (180), 36 states have call predecessors, (180), 36 states have return successors, (180), 156 states have call predecessors, (180), 180 states have call successors, (180) [2025-02-06 01:10:46,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2239 states to 2239 states and 2985 transitions. [2025-02-06 01:10:46,811 INFO L78 Accepts]: Start accepts. Automaton has 2239 states and 2985 transitions. Word has length 118 [2025-02-06 01:10:46,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:46,812 INFO L471 AbstractCegarLoop]: Abstraction has 2239 states and 2985 transitions. [2025-02-06 01:10:46,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:46,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2239 states and 2985 transitions. [2025-02-06 01:10:46,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 01:10:46,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:46,814 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:46,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 01:10:46,814 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:46,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:46,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1626704646, now seen corresponding path program 1 times [2025-02-06 01:10:46,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:46,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506833076] [2025-02-06 01:10:46,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:46,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:46,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 01:10:46,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 01:10:46,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:46,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:46,920 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:10:46,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:46,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506833076] [2025-02-06 01:10:46,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506833076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:46,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:10:46,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 01:10:46,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431606452] [2025-02-06 01:10:46,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:46,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 01:10:46,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:46,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 01:10:46,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 01:10:46,923 INFO L87 Difference]: Start difference. First operand 2239 states and 2985 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:47,193 INFO L93 Difference]: Finished difference Result 4424 states and 5942 transitions. [2025-02-06 01:10:47,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 01:10:47,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2025-02-06 01:10:47,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:47,202 INFO L225 Difference]: With dead ends: 4424 [2025-02-06 01:10:47,203 INFO L226 Difference]: Without dead ends: 2812 [2025-02-06 01:10:47,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 01:10:47,205 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 61 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:47,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 492 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:10:47,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2025-02-06 01:10:47,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2670. [2025-02-06 01:10:47,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2670 states, 2407 states have (on average 1.2924802658911507) internal successors, (3111), 2440 states have internal predecessors, (3111), 214 states have call successors, (214), 48 states have call predecessors, (214), 48 states have return successors, (214), 181 states have call predecessors, (214), 214 states have call successors, (214) [2025-02-06 01:10:47,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 3539 transitions. [2025-02-06 01:10:47,334 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 3539 transitions. Word has length 118 [2025-02-06 01:10:47,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:47,334 INFO L471 AbstractCegarLoop]: Abstraction has 2670 states and 3539 transitions. [2025-02-06 01:10:47,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:47,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 3539 transitions. [2025-02-06 01:10:47,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 01:10:47,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:47,337 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:47,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 01:10:47,337 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:47,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:47,337 INFO L85 PathProgramCache]: Analyzing trace with hash 188340256, now seen corresponding path program 1 times [2025-02-06 01:10:47,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:47,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640019647] [2025-02-06 01:10:47,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:47,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:47,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 01:10:47,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 01:10:47,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:47,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:10:47,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:47,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640019647] [2025-02-06 01:10:47,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640019647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:47,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:10:47,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:10:47,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886768444] [2025-02-06 01:10:47,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:47,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:10:47,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:47,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:10:47,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:10:47,375 INFO L87 Difference]: Start difference. First operand 2670 states and 3539 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:47,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:47,523 INFO L93 Difference]: Finished difference Result 4596 states and 6114 transitions. [2025-02-06 01:10:47,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:10:47,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2025-02-06 01:10:47,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:47,531 INFO L225 Difference]: With dead ends: 4596 [2025-02-06 01:10:47,531 INFO L226 Difference]: Without dead ends: 2408 [2025-02-06 01:10:47,533 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-06 01:10:47,534 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 50 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:47,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 242 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:10:47,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2025-02-06 01:10:47,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2199. [2025-02-06 01:10:47,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2199 states, 1975 states have (on average 1.2551898734177216) internal successors, (2479), 1997 states have internal predecessors, (2479), 180 states have call successors, (180), 43 states have call predecessors, (180), 43 states have return successors, (180), 158 states have call predecessors, (180), 180 states have call successors, (180) [2025-02-06 01:10:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2199 states to 2199 states and 2839 transitions. [2025-02-06 01:10:47,701 INFO L78 Accepts]: Start accepts. Automaton has 2199 states and 2839 transitions. Word has length 118 [2025-02-06 01:10:47,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:47,701 INFO L471 AbstractCegarLoop]: Abstraction has 2199 states and 2839 transitions. [2025-02-06 01:10:47,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:47,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2199 states and 2839 transitions. [2025-02-06 01:10:47,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 01:10:47,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:47,703 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:47,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 01:10:47,704 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:47,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:47,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1118124734, now seen corresponding path program 1 times [2025-02-06 01:10:47,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:47,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480671617] [2025-02-06 01:10:47,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:47,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:47,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 01:10:47,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 01:10:47,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:47,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:10:48,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:48,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480671617] [2025-02-06 01:10:48,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480671617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:48,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:10:48,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 01:10:48,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480230831] [2025-02-06 01:10:48,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:48,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 01:10:48,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:48,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 01:10:48,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 01:10:48,052 INFO L87 Difference]: Start difference. First operand 2199 states and 2839 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:48,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:48,464 INFO L93 Difference]: Finished difference Result 4331 states and 5630 transitions. [2025-02-06 01:10:48,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 01:10:48,465 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2025-02-06 01:10:48,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:48,474 INFO L225 Difference]: With dead ends: 4331 [2025-02-06 01:10:48,474 INFO L226 Difference]: Without dead ends: 2518 [2025-02-06 01:10:48,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-02-06 01:10:48,478 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 130 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:48,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 710 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 01:10:48,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2518 states. [2025-02-06 01:10:48,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2518 to 2186. [2025-02-06 01:10:48,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2186 states, 1962 states have (on average 1.2512742099898064) internal successors, (2455), 1984 states have internal predecessors, (2455), 180 states have call successors, (180), 43 states have call predecessors, (180), 43 states have return successors, (180), 158 states have call predecessors, (180), 180 states have call successors, (180) [2025-02-06 01:10:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 2186 states and 2815 transitions. [2025-02-06 01:10:48,595 INFO L78 Accepts]: Start accepts. Automaton has 2186 states and 2815 transitions. Word has length 119 [2025-02-06 01:10:48,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:48,595 INFO L471 AbstractCegarLoop]: Abstraction has 2186 states and 2815 transitions. [2025-02-06 01:10:48,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:48,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 2815 transitions. [2025-02-06 01:10:48,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 01:10:48,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:48,597 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:48,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 01:10:48,597 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:48,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:48,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1769771368, now seen corresponding path program 1 times [2025-02-06 01:10:48,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:48,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277055445] [2025-02-06 01:10:48,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:48,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:48,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 01:10:48,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 01:10:48,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:48,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:48,935 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:10:48,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:48,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277055445] [2025-02-06 01:10:48,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277055445] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:48,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:10:48,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 01:10:48,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426191085] [2025-02-06 01:10:48,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:48,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 01:10:48,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:48,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 01:10:48,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 01:10:48,936 INFO L87 Difference]: Start difference. First operand 2186 states and 2815 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:49,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:49,544 INFO L93 Difference]: Finished difference Result 4281 states and 5558 transitions. [2025-02-06 01:10:49,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 01:10:49,545 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2025-02-06 01:10:49,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:49,552 INFO L225 Difference]: With dead ends: 4281 [2025-02-06 01:10:49,553 INFO L226 Difference]: Without dead ends: 2564 [2025-02-06 01:10:49,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-02-06 01:10:49,556 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 187 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:49,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 698 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 01:10:49,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2025-02-06 01:10:49,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2196. [2025-02-06 01:10:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2196 states, 1972 states have (on average 1.25) internal successors, (2465), 1994 states have internal predecessors, (2465), 180 states have call successors, (180), 43 states have call predecessors, (180), 43 states have return successors, (180), 158 states have call predecessors, (180), 180 states have call successors, (180) [2025-02-06 01:10:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 2825 transitions. [2025-02-06 01:10:49,663 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 2825 transitions. Word has length 119 [2025-02-06 01:10:49,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:49,663 INFO L471 AbstractCegarLoop]: Abstraction has 2196 states and 2825 transitions. [2025-02-06 01:10:49,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:49,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 2825 transitions. [2025-02-06 01:10:49,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 01:10:49,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:49,666 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:49,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 01:10:49,666 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:49,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:49,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1627692575, now seen corresponding path program 1 times [2025-02-06 01:10:49,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:49,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822987088] [2025-02-06 01:10:49,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:49,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:49,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 01:10:49,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 01:10:49,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:49,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 75 proven. 9 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-02-06 01:10:49,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:49,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822987088] [2025-02-06 01:10:49,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822987088] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:10:49,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272633414] [2025-02-06 01:10:49,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:49,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:10:49,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:10:49,787 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:10:49,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 01:10:49,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 01:10:49,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 01:10:49,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:49,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:49,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 01:10:49,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:10:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 194 proven. 9 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-02-06 01:10:49,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:10:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 75 proven. 12 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2025-02-06 01:10:50,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272633414] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 01:10:50,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 01:10:50,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 12 [2025-02-06 01:10:50,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126065229] [2025-02-06 01:10:50,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 01:10:50,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 01:10:50,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:50,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 01:10:50,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-06 01:10:50,101 INFO L87 Difference]: Start difference. First operand 2196 states and 2825 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-02-06 01:10:50,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:50,414 INFO L93 Difference]: Finished difference Result 4463 states and 5698 transitions. [2025-02-06 01:10:50,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 01:10:50,415 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 119 [2025-02-06 01:10:50,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:50,422 INFO L225 Difference]: With dead ends: 4463 [2025-02-06 01:10:50,422 INFO L226 Difference]: Without dead ends: 2312 [2025-02-06 01:10:50,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2025-02-06 01:10:50,427 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 360 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:50,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 178 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:10:50,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2025-02-06 01:10:50,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 2228. [2025-02-06 01:10:50,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 1996 states have (on average 1.2349699398797596) internal successors, (2465), 2018 states have internal predecessors, (2465), 180 states have call successors, (180), 51 states have call predecessors, (180), 51 states have return successors, (180), 158 states have call predecessors, (180), 180 states have call successors, (180) [2025-02-06 01:10:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2825 transitions. [2025-02-06 01:10:50,559 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2825 transitions. Word has length 119 [2025-02-06 01:10:50,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:50,559 INFO L471 AbstractCegarLoop]: Abstraction has 2228 states and 2825 transitions. [2025-02-06 01:10:50,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-02-06 01:10:50,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2825 transitions. [2025-02-06 01:10:50,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 01:10:50,560 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:50,560 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:50,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 01:10:50,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:10:50,761 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:50,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:50,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1382316806, now seen corresponding path program 1 times [2025-02-06 01:10:50,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:50,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581915532] [2025-02-06 01:10:50,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:50,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:50,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 01:10:50,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 01:10:50,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:50,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 01:10:50,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1442462534] [2025-02-06 01:10:50,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:50,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:10:50,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:10:50,798 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:10:50,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 01:10:50,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 01:10:50,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 01:10:50,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:50,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:10:50,865 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 01:10:50,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 01:10:50,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 01:10:50,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:50,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:10:50,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 01:10:50,956 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 01:10:50,957 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 01:10:50,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 01:10:51,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:10:51,162 INFO L422 BasicCegarLoop]: Path program histogram: [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-06 01:10:51,231 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 01:10:51,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:10:51 BoogieIcfgContainer [2025-02-06 01:10:51,233 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 01:10:51,234 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 01:10:51,234 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 01:10:51,234 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 01:10:51,235 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:10:32" (3/4) ... [2025-02-06 01:10:51,236 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 01:10:51,237 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 01:10:51,237 INFO L158 Benchmark]: Toolchain (without parser) took 19204.43ms. Allocated memory was 167.8MB in the beginning and 671.1MB in the end (delta: 503.3MB). Free memory was 125.4MB in the beginning and 363.9MB in the end (delta: -238.5MB). Peak memory consumption was 261.6MB. Max. memory is 16.1GB. [2025-02-06 01:10:51,238 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:10:51,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.81ms. Allocated memory is still 167.8MB. Free memory was 125.4MB in the beginning and 112.2MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:10:51,238 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.95ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 108.8MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:10:51,238 INFO L158 Benchmark]: Boogie Preprocessor took 40.83ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 104.4MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:10:51,239 INFO L158 Benchmark]: IcfgBuilder took 394.80ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 78.7MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 01:10:51,239 INFO L158 Benchmark]: TraceAbstraction took 18498.83ms. Allocated memory was 167.8MB in the beginning and 671.1MB in the end (delta: 503.3MB). Free memory was 78.1MB in the beginning and 364.1MB in the end (delta: -286.0MB). Peak memory consumption was 219.6MB. Max. memory is 16.1GB. [2025-02-06 01:10:51,239 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 671.1MB. Free memory was 364.1MB in the beginning and 363.9MB in the end (delta: 141.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:10:51,240 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.81ms. Allocated memory is still 167.8MB. Free memory was 125.4MB in the beginning and 112.2MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.95ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 108.8MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.83ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 104.4MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 394.80ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 78.7MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18498.83ms. Allocated memory was 167.8MB in the beginning and 671.1MB in the end (delta: 503.3MB). Free memory was 78.1MB in the beginning and 364.1MB in the end (delta: -286.0MB). Peak memory consumption was 219.6MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 671.1MB. Free memory was 364.1MB in the beginning and 363.9MB in the end (delta: 141.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 53, overapproximation of shiftLeft at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_3 = 128; [L24] unsigned short int var_1_4 = 4; [L25] unsigned short int var_1_5 = 0; [L26] signed short int var_1_6 = 0; [L27] unsigned char var_1_7 = 1; [L28] signed short int var_1_8 = -2; [L29] signed short int var_1_9 = 500; [L30] unsigned long int var_1_10 = 10; [L31] unsigned char var_1_11 = 2; [L32] unsigned char var_1_12 = 64; [L33] unsigned long int var_1_13 = 1; [L34] unsigned long int last_1_var_1_10 = 10; [L35] unsigned long int last_1_var_1_13 = 1; VAL [isInitial=0, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=128, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L94] isInitial = 1 [L95] FCALL initially() [L96] int k_loop; [L97] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=128, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L97] COND TRUE k_loop < 1 [L98] CALL updateLastVariables() [L86] last_1_var_1_10 = var_1_10 [L87] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=128, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L98] RET updateLastVariables() [L99] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_ushort() [L61] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L61] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L62] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L62] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L63] var_1_4 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L64] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L65] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L65] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L66] var_1_5 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L67] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L68] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L68] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L69] var_1_7 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L70] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L71] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L71] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L72] var_1_8 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_8 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=500] [L73] RET assume_abort_if_not(var_1_8 >= -16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=500] [L74] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=500] [L74] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=500] [L75] var_1_9 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_9 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L76] RET assume_abort_if_not(var_1_9 >= -16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L77] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L77] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L78] var_1_11 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L79] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L80] CALL assume_abort_if_not(var_1_11 <= 128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L80] RET assume_abort_if_not(var_1_11 <= 128) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L81] var_1_12 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L82] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L83] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L83] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L99] RET updateVariables() [L100] CALL step() [L39] COND FALSE !(last_1_var_1_13 >= -50) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L42] EXPR var_1_11 & var_1_12 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L42] signed long int stepLocal_0 = var_1_11 & var_1_12; [L43] COND TRUE \read(var_1_7) [L44] var_1_13 = ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=2, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L50] COND TRUE \read(var_1_7) [L51] var_1_6 = (var_1_8 + var_1_9) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=2, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=-1, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L53] EXPR last_1_var_1_10 >> var_1_1 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=2, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=-1, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L53] EXPR var_1_8 << var_1_5 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=2, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=-1, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L53] EXPR (last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=2, var_1_10=10, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=-1, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L53] COND TRUE (var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5)) [L54] var_1_10 = ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=2, var_1_10=0, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=-1, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L100] RET step() [L101] CALL, EXPR property() [L90] EXPR (((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=-1, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L90] EXPR last_1_var_1_10 >> var_1_1 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=-1, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L90] EXPR var_1_8 << var_1_5 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=-1, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L90] EXPR (last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=-1, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L90] EXPR (((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=-1, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L90] EXPR ((((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11)))) && (var_1_7 ? (var_1_13 == ((unsigned long int) ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))))) : (((var_1_11 & var_1_12) != var_1_1) ? (var_1_13 == ((unsigned long int) var_1_12)) : 1)) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=-1, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L90-L91] return ((((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11)))) && (var_1_7 ? (var_1_13 == ((unsigned long int) ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))))) : (((var_1_11 & var_1_12) != var_1_1) ? (var_1_13 == ((unsigned long int) var_1_12)) : 1)) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=-1, var_1_7=1, var_1_8=-16383, var_1_9=16382] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=-510, var_1_12=2, var_1_13=2, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=-1, var_1_7=1, var_1_8=-16383, var_1_9=16382] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.4s, OverallIterations: 23, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2145 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2132 mSDsluCounter, 9832 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7356 mSDsCounter, 494 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3532 IncrementalHoareTripleChecker+Invalid, 4026 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 494 mSolverCounterUnsat, 2476 mSDtfsCounter, 3532 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 550 GetRequests, 399 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2670occurred in iteration=18, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 2264 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 3016 NumberOfCodeBlocks, 3016 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2870 ConstructedInterpolants, 0 QuantifiedInterpolants, 10724 SizeOfPredicates, 1 NumberOfNonLiveVariables, 530 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 11940/12000 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 01:10:51,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_loopvsstraightlinecode_25-1loop_file-32.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 d4efba5d8035d5b89a6fee2af18255a7435db1834e066c2b81c99247161e78c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:10:53,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:10:53,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 01:10:53,339 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:10:53,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:10:53,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:10:53,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:10:53,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:10:53,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:10:53,353 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:10:53,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:10:53,354 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:10:53,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:10:53,354 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:10:53,354 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:10:53,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:10:53,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:10:53,354 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:10:53,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:10:53,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:10:53,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:10:53,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:10:53,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:10:53,354 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 01:10:53,354 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 01:10:53,354 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 01:10:53,355 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:10:53,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:10:53,355 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:10:53,355 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:10:53,355 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:10:53,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:10:53,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:10:53,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:10:53,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:10:53,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:10:53,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:10:53,355 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:10:53,355 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:10:53,355 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 01:10:53,355 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 01:10:53,355 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:10:53,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:10:53,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:10:53,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:10:53,356 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 -> d4efba5d8035d5b89a6fee2af18255a7435db1834e066c2b81c99247161e78c7 [2025-02-06 01:10:53,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:10:53,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:10:53,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:10:53,579 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:10:53,579 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:10:53,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i [2025-02-06 01:10:54,790 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b44a2215a/2df4b698e3fc4104a1fab64b3b9aa455/FLAG6bbc83a53 [2025-02-06 01:10:55,028 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:10:55,029 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i [2025-02-06 01:10:55,035 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b44a2215a/2df4b698e3fc4104a1fab64b3b9aa455/FLAG6bbc83a53 [2025-02-06 01:10:55,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b44a2215a/2df4b698e3fc4104a1fab64b3b9aa455 [2025-02-06 01:10:55,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:10:55,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:10:55,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:10:55,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:10:55,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:10:55,378 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:10:55" (1/1) ... [2025-02-06 01:10:55,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ebdc28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:55, skipping insertion in model container [2025-02-06 01:10:55,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:10:55" (1/1) ... [2025-02-06 01:10:55,389 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:10:55,467 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_loopvsstraightlinecode_25-1loop_file-32.i[915,928] [2025-02-06 01:10:55,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:10:55,497 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:10:55,504 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_loopvsstraightlinecode_25-1loop_file-32.i[915,928] [2025-02-06 01:10:55,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:10:55,527 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:10:55,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:55 WrapperNode [2025-02-06 01:10:55,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:10:55,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:10:55,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:10:55,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:10:55,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:55" (1/1) ... [2025-02-06 01:10:55,538 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:55" (1/1) ... [2025-02-06 01:10:55,550 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-02-06 01:10:55,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:10:55,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:10:55,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:10:55,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:10:55,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:55" (1/1) ... [2025-02-06 01:10:55,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:55" (1/1) ... [2025-02-06 01:10:55,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:55" (1/1) ... [2025-02-06 01:10:55,565 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-06 01:10:55,565 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:55" (1/1) ... [2025-02-06 01:10:55,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:55" (1/1) ... [2025-02-06 01:10:55,569 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:55" (1/1) ... [2025-02-06 01:10:55,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:55" (1/1) ... [2025-02-06 01:10:55,570 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:55" (1/1) ... [2025-02-06 01:10:55,571 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:55" (1/1) ... [2025-02-06 01:10:55,572 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:10:55,573 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:10:55,573 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:10:55,573 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:10:55,573 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:55" (1/1) ... [2025-02-06 01:10:55,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:10:55,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:10:55,596 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-06 01:10:55,601 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-06 01:10:55,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:10:55,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 01:10:55,616 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:10:55,616 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:10:55,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:10:55,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:10:55,663 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:10:55,664 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:10:55,829 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-02-06 01:10:55,829 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:10:55,838 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:10:55,838 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:10:55,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:10:55 BoogieIcfgContainer [2025-02-06 01:10:55,838 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:10:55,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:10:55,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:10:55,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:10:55,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:10:55" (1/3) ... [2025-02-06 01:10:55,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403fcd50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:10:55, skipping insertion in model container [2025-02-06 01:10:55,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:55" (2/3) ... [2025-02-06 01:10:55,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403fcd50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:10:55, skipping insertion in model container [2025-02-06 01:10:55,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:10:55" (3/3) ... [2025-02-06 01:10:55,844 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-32.i [2025-02-06 01:10:55,858 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:10:55,859 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-32.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:10:55,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:10:55,907 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;@39dca827, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:10:55,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:10:55,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 01:10:55,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 01:10:55,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:55,920 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:55,921 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:55,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:55,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1988874552, now seen corresponding path program 1 times [2025-02-06 01:10:55,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:10:55,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [701199812] [2025-02-06 01:10:55,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:55,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:10:55,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:10:55,936 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-06 01:10:55,938 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-06 01:10:56,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 01:10:56,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 01:10:56,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:56,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:56,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:10:56,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:10:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 01:10:56,109 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:10:56,109 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:10:56,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701199812] [2025-02-06 01:10:56,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701199812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:56,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:10:56,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 01:10:56,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896962337] [2025-02-06 01:10:56,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:56,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:10:56,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:10:56,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:10:56,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:10:56,131 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 01:10:56,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:56,148 INFO L93 Difference]: Finished difference Result 93 states and 153 transitions. [2025-02-06 01:10:56,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:10:56,151 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2025-02-06 01:10:56,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:56,156 INFO L225 Difference]: With dead ends: 93 [2025-02-06 01:10:56,156 INFO L226 Difference]: Without dead ends: 45 [2025-02-06 01:10:56,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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-06 01:10:56,161 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:56,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:10:56,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-06 01:10:56,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-06 01:10:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 01:10:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2025-02-06 01:10:56,206 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 102 [2025-02-06 01:10:56,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:56,207 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2025-02-06 01:10:56,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 01:10:56,207 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2025-02-06 01:10:56,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 01:10:56,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:56,208 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:56,219 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-06 01:10:56,413 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 [2025-02-06 01:10:56,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:56,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:56,414 INFO L85 PathProgramCache]: Analyzing trace with hash -377512248, now seen corresponding path program 1 times [2025-02-06 01:10:56,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:10:56,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2049233235] [2025-02-06 01:10:56,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:56,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:10:56,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:10:56,421 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:10:56,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 01:10:56,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 01:10:56,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 01:10:56,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:56,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:56,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 01:10:56,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:10:56,692 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:10:56,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:10:56,693 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:10:56,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049233235] [2025-02-06 01:10:56,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049233235] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:56,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:10:56,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:10:56,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156536327] [2025-02-06 01:10:56,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:56,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 01:10:56,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:10:56,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 01:10:56,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 01:10:56,695 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:56,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:56,842 INFO L93 Difference]: Finished difference Result 138 states and 200 transitions. [2025-02-06 01:10:56,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 01:10:56,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102 [2025-02-06 01:10:56,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:56,847 INFO L225 Difference]: With dead ends: 138 [2025-02-06 01:10:56,849 INFO L226 Difference]: Without dead ends: 96 [2025-02-06 01:10:56,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 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-06 01:10:56,850 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 45 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:56,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 187 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:10:56,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-06 01:10:56,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 85. [2025-02-06 01:10:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 01:10:56,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 125 transitions. [2025-02-06 01:10:56,874 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 125 transitions. Word has length 102 [2025-02-06 01:10:56,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:56,875 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 125 transitions. [2025-02-06 01:10:56,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:10:56,875 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 125 transitions. [2025-02-06 01:10:56,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 01:10:56,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:56,877 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:10:56,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 01:10:57,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:10:57,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:57,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:57,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2110000585, now seen corresponding path program 1 times [2025-02-06 01:10:57,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:10:57,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1349094452] [2025-02-06 01:10:57,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:57,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:10:57,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:10:57,084 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:10:57,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 01:10:57,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 01:10:57,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 01:10:57,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:57,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:57,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 01:10:57,184 INFO L279 TraceCheckSpWp]: Computing forward predicates...