./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_operatoramount_amount500_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 1f5e85e440e40555a271f0da01bc4c69c14579acca3c1363299655e98dc377d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:45:41,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:45:41,452 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:45:41,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:45:41,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:45:41,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:45:41,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:45:41,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:45:41,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:45:41,470 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:45:41,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:45:41,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:45:41,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:45:41,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:45:41,471 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:45:41,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:45:41,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:45:41,471 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:45:41,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:45:41,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:45:41,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:45:41,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:45:41,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:45:41,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:45:41,471 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:45:41,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:45:41,472 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:45:41,472 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:45:41,472 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:45:41,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:45:41,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:45:41,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:45:41,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:45:41,472 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:45:41,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:45:41,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:45:41,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:45:41,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:45:41,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:45:41,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:45:41,472 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:45:41,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:45:41,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:45:41,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:45:41,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:45:41,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:45:41,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:45:41,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:45:41,473 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 -> 1f5e85e440e40555a271f0da01bc4c69c14579acca3c1363299655e98dc377d7 [2025-01-09 14:45:41,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:45:41,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:45:41,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:45:41,707 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:45:41,707 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:45:41,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-32.i [2025-01-09 14:45:42,893 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8bf37bc8a/5279afdc19e74c2b85f420a1e8ba090d/FLAG214b77f04 [2025-01-09 14:45:43,177 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:45:43,178 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-32.i [2025-01-09 14:45:43,188 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8bf37bc8a/5279afdc19e74c2b85f420a1e8ba090d/FLAG214b77f04 [2025-01-09 14:45:43,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8bf37bc8a/5279afdc19e74c2b85f420a1e8ba090d [2025-01-09 14:45:43,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:45:43,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:45:43,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:45:43,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:45:43,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:45:43,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,211 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@635c9a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43, skipping insertion in model container [2025-01-09 14:45:43,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,249 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:45:43,364 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_operatoramount_amount500_file-32.i[916,929] [2025-01-09 14:45:43,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:45:43,511 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:45:43,521 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_operatoramount_amount500_file-32.i[916,929] [2025-01-09 14:45:43,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:45:43,614 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:45:43,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43 WrapperNode [2025-01-09 14:45:43,615 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:45:43,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:45:43,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:45:43,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:45:43,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,721 INFO L138 Inliner]: procedures = 26, calls = 78, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 662 [2025-01-09 14:45:43,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:45:43,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:45:43,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:45:43,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:45:43,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,741 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,781 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-01-09 14:45:43,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,782 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,808 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,812 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:45:43,856 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:45:43,856 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:45:43,856 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:45:43,857 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:45:43,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:45:43,882 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-01-09 14:45:43,887 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-01-09 14:45:43,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:45:43,923 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:45:43,923 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:45:43,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:45:43,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:45:43,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:45:44,035 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:45:44,037 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:45:44,891 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2025-01-09 14:45:44,892 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:45:44,905 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:45:44,905 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:45:44,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:45:44 BoogieIcfgContainer [2025-01-09 14:45:44,906 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:45:44,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:45:44,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:45:44,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:45:44,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:45:43" (1/3) ... [2025-01-09 14:45:44,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62037723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:45:44, skipping insertion in model container [2025-01-09 14:45:44,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (2/3) ... [2025-01-09 14:45:44,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62037723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:45:44, skipping insertion in model container [2025-01-09 14:45:44,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:45:44" (3/3) ... [2025-01-09 14:45:44,916 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-32.i [2025-01-09 14:45:44,927 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:45:44,930 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-32.i that has 2 procedures, 263 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:45:44,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:45:44,986 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;@48fe036, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:45:44,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:45:44,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 263 states, 195 states have (on average 1.564102564102564) internal successors, (305), 196 states have internal predecessors, (305), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 14:45:45,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:45:45,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:45,011 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:45:45,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:45,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:45,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1317203987, now seen corresponding path program 1 times [2025-01-09 14:45:45,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:45,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162662280] [2025-01-09 14:45:45,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:45,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:45,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:45:45,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:45:45,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:45,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:45,648 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2025-01-09 14:45:45,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:45,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162662280] [2025-01-09 14:45:45,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162662280] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:45:45,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654906409] [2025-01-09 14:45:45,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:45,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:45:45,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:45:45,653 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-01-09 14:45:45,655 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-01-09 14:45:45,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:45:45,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:45:45,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:45,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:45,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:45:45,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:45:46,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2025-01-09 14:45:46,034 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:45:46,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654906409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:46,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:45:46,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:45:46,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42870168] [2025-01-09 14:45:46,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:46,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:45:46,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:46,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:45:46,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:45:46,061 INFO L87 Difference]: Start difference. First operand has 263 states, 195 states have (on average 1.564102564102564) internal successors, (305), 196 states have internal predecessors, (305), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) Second operand has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) [2025-01-09 14:45:46,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:46,096 INFO L93 Difference]: Finished difference Result 520 states and 930 transitions. [2025-01-09 14:45:46,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:45:46,098 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) Word has length 456 [2025-01-09 14:45:46,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:46,107 INFO L225 Difference]: With dead ends: 520 [2025-01-09 14:45:46,107 INFO L226 Difference]: Without dead ends: 260 [2025-01-09 14:45:46,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 457 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-01-09 14:45:46,115 INFO L435 NwaCegarLoop]: 430 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, 430 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-01-09 14:45:46,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:45:46,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-01-09 14:45:46,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2025-01-09 14:45:46,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 193 states have (on average 1.5544041450777202) internal successors, (300), 193 states have internal predecessors, (300), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 14:45:46,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 430 transitions. [2025-01-09 14:45:46,185 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 430 transitions. Word has length 456 [2025-01-09 14:45:46,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:46,186 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 430 transitions. [2025-01-09 14:45:46,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) [2025-01-09 14:45:46,188 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 430 transitions. [2025-01-09 14:45:46,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:45:46,201 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:46,201 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:45:46,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-01-09 14:45:46,402 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-01-09 14:45:46,402 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:46,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:46,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1854278105, now seen corresponding path program 1 times [2025-01-09 14:45:46,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:46,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155361645] [2025-01-09 14:45:46,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:46,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:46,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:45:46,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:45:46,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:46,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:45:46,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:46,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155361645] [2025-01-09 14:45:46,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155361645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:46,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:46,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:45:46,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111434517] [2025-01-09 14:45:46,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:46,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:45:46,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:46,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:45:46,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:46,946 INFO L87 Difference]: Start difference. First operand 260 states and 430 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:45:47,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:47,052 INFO L93 Difference]: Finished difference Result 763 states and 1265 transitions. [2025-01-09 14:45:47,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:45:47,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 456 [2025-01-09 14:45:47,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:47,057 INFO L225 Difference]: With dead ends: 763 [2025-01-09 14:45:47,057 INFO L226 Difference]: Without dead ends: 506 [2025-01-09 14:45:47,058 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-01-09 14:45:47,059 INFO L435 NwaCegarLoop]: 760 mSDtfsCounter, 379 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:47,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1178 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:45:47,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-01-09 14:45:47,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 350. [2025-01-09 14:45:47,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 283 states have (on average 1.6289752650176679) internal successors, (461), 283 states have internal predecessors, (461), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 14:45:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 591 transitions. [2025-01-09 14:45:47,082 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 591 transitions. Word has length 456 [2025-01-09 14:45:47,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:47,083 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 591 transitions. [2025-01-09 14:45:47,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:45:47,084 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 591 transitions. [2025-01-09 14:45:47,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:45:47,088 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:47,088 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:45:47,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:45:47,089 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:47,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:47,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1761416937, now seen corresponding path program 1 times [2025-01-09 14:45:47,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:47,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116936642] [2025-01-09 14:45:47,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:47,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:47,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:45:47,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:45:47,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:47,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:47,452 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:45:47,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:47,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116936642] [2025-01-09 14:45:47,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116936642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:47,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:47,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:45:47,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013282795] [2025-01-09 14:45:47,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:47,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:45:47,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:47,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:45:47,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:47,456 INFO L87 Difference]: Start difference. First operand 350 states and 591 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:45:47,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:47,515 INFO L93 Difference]: Finished difference Result 974 states and 1650 transitions. [2025-01-09 14:45:47,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:45:47,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 456 [2025-01-09 14:45:47,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:47,520 INFO L225 Difference]: With dead ends: 974 [2025-01-09 14:45:47,520 INFO L226 Difference]: Without dead ends: 627 [2025-01-09 14:45:47,521 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-01-09 14:45:47,521 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 277 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:47,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 944 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:45:47,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2025-01-09 14:45:47,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 624. [2025-01-09 14:45:47,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 516 states have (on average 1.6395348837209303) internal successors, (846), 517 states have internal predecessors, (846), 105 states have call successors, (105), 2 states have call predecessors, (105), 2 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 14:45:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 1056 transitions. [2025-01-09 14:45:47,552 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 1056 transitions. Word has length 456 [2025-01-09 14:45:47,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:47,553 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 1056 transitions. [2025-01-09 14:45:47,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:45:47,553 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 1056 transitions. [2025-01-09 14:45:47,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:45:47,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:47,557 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:45:47,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:45:47,558 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:47,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:47,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1059817063, now seen corresponding path program 1 times [2025-01-09 14:45:47,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:47,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885421497] [2025-01-09 14:45:47,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:47,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:47,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:45:47,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:45:47,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:47,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:47,803 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:45:47,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:47,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885421497] [2025-01-09 14:45:47,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885421497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:47,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:47,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:45:47,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826158126] [2025-01-09 14:45:47,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:47,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:45:47,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:47,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:45:47,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:47,806 INFO L87 Difference]: Start difference. First operand 624 states and 1056 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:45:47,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:47,889 INFO L93 Difference]: Finished difference Result 1637 states and 2784 transitions. [2025-01-09 14:45:47,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:45:47,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 456 [2025-01-09 14:45:47,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:47,898 INFO L225 Difference]: With dead ends: 1637 [2025-01-09 14:45:47,898 INFO L226 Difference]: Without dead ends: 1016 [2025-01-09 14:45:47,900 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-01-09 14:45:47,901 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 152 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:47,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 885 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:45:47,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-01-09 14:45:47,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 952. [2025-01-09 14:45:47,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 844 states have (on average 1.6824644549763033) internal successors, (1420), 845 states have internal predecessors, (1420), 105 states have call successors, (105), 2 states have call predecessors, (105), 2 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 14:45:47,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1630 transitions. [2025-01-09 14:45:47,962 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1630 transitions. Word has length 456 [2025-01-09 14:45:47,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:47,962 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1630 transitions. [2025-01-09 14:45:47,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:45:47,963 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1630 transitions. [2025-01-09 14:45:47,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:45:47,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:47,970 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:45:47,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:45:47,971 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:47,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:47,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1405621605, now seen corresponding path program 1 times [2025-01-09 14:45:47,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:47,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185509608] [2025-01-09 14:45:47,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:47,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:48,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:45:48,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:45:48,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:48,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:45:48,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:48,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185509608] [2025-01-09 14:45:48,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185509608] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:48,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:48,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:45:48,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928883787] [2025-01-09 14:45:48,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:48,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:45:48,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:48,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:45:48,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:45:48,978 INFO L87 Difference]: Start difference. First operand 952 states and 1630 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:45:49,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:49,257 INFO L93 Difference]: Finished difference Result 2783 states and 4778 transitions. [2025-01-09 14:45:49,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:45:49,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 456 [2025-01-09 14:45:49,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:49,268 INFO L225 Difference]: With dead ends: 2783 [2025-01-09 14:45:49,269 INFO L226 Difference]: Without dead ends: 1834 [2025-01-09 14:45:49,271 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-01-09 14:45:49,273 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 315 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:49,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1263 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:45:49,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2025-01-09 14:45:49,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1074. [2025-01-09 14:45:49,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 900 states have (on average 1.65) internal successors, (1485), 901 states have internal predecessors, (1485), 170 states have call successors, (170), 3 states have call predecessors, (170), 3 states have return successors, (170), 169 states have call predecessors, (170), 170 states have call successors, (170) [2025-01-09 14:45:49,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1825 transitions. [2025-01-09 14:45:49,353 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1825 transitions. Word has length 456 [2025-01-09 14:45:49,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:49,354 INFO L471 AbstractCegarLoop]: Abstraction has 1074 states and 1825 transitions. [2025-01-09 14:45:49,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:45:49,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1825 transitions. [2025-01-09 14:45:49,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:45:49,359 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:49,360 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:45:49,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:45:49,360 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:49,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:49,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1831507613, now seen corresponding path program 1 times [2025-01-09 14:45:49,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:49,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391331299] [2025-01-09 14:45:49,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:49,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:49,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:45:49,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:45:49,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:49,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:50,634 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:45:50,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:50,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391331299] [2025-01-09 14:45:50,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391331299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:50,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:50,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:45:50,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030802571] [2025-01-09 14:45:50,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:50,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:45:50,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:50,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:45:50,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:45:50,637 INFO L87 Difference]: Start difference. First operand 1074 states and 1825 transitions. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 3 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2025-01-09 14:45:52,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:52,068 INFO L93 Difference]: Finished difference Result 4517 states and 7744 transitions. [2025-01-09 14:45:52,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:45:52,070 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 3 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) Word has length 456 [2025-01-09 14:45:52,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:52,084 INFO L225 Difference]: With dead ends: 4517 [2025-01-09 14:45:52,084 INFO L226 Difference]: Without dead ends: 3568 [2025-01-09 14:45:52,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:45:52,088 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 1752 mSDsluCounter, 2987 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1752 SdHoareTripleChecker+Valid, 3443 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:52,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1752 Valid, 3443 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:45:52,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3568 states. [2025-01-09 14:45:52,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3568 to 2048. [2025-01-09 14:45:52,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 1844 states have (on average 1.6925162689804771) internal successors, (3121), 1847 states have internal predecessors, (3121), 198 states have call successors, (198), 5 states have call predecessors, (198), 5 states have return successors, (198), 195 states have call predecessors, (198), 198 states have call successors, (198) [2025-01-09 14:45:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 3517 transitions. [2025-01-09 14:45:52,171 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 3517 transitions. Word has length 456 [2025-01-09 14:45:52,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:52,172 INFO L471 AbstractCegarLoop]: Abstraction has 2048 states and 3517 transitions. [2025-01-09 14:45:52,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 3 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2025-01-09 14:45:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 3517 transitions. [2025-01-09 14:45:52,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:45:52,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:52,179 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:45:52,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:45:52,179 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:52,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:52,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1155962781, now seen corresponding path program 1 times [2025-01-09 14:45:52,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:52,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530333582] [2025-01-09 14:45:52,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:52,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:52,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:45:52,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:45:52,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:52,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:53,129 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:45:53,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:53,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530333582] [2025-01-09 14:45:53,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530333582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:53,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:53,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:45:53,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163535772] [2025-01-09 14:45:53,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:53,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:45:53,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:53,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:45:53,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:45:53,133 INFO L87 Difference]: Start difference. First operand 2048 states and 3517 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:45:53,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:53,553 INFO L93 Difference]: Finished difference Result 4687 states and 8079 transitions. [2025-01-09 14:45:53,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:45:53,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 456 [2025-01-09 14:45:53,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:53,565 INFO L225 Difference]: With dead ends: 4687 [2025-01-09 14:45:53,565 INFO L226 Difference]: Without dead ends: 2754 [2025-01-09 14:45:53,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-01-09 14:45:53,569 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 374 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:53,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1562 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:45:53,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2754 states. [2025-01-09 14:45:53,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2048. [2025-01-09 14:45:53,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 1844 states have (on average 1.6919739696312364) internal successors, (3120), 1847 states have internal predecessors, (3120), 198 states have call successors, (198), 5 states have call predecessors, (198), 5 states have return successors, (198), 195 states have call predecessors, (198), 198 states have call successors, (198) [2025-01-09 14:45:53,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 3516 transitions. [2025-01-09 14:45:53,664 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 3516 transitions. Word has length 456 [2025-01-09 14:45:53,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:53,664 INFO L471 AbstractCegarLoop]: Abstraction has 2048 states and 3516 transitions. [2025-01-09 14:45:53,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:45:53,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 3516 transitions. [2025-01-09 14:45:53,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-01-09 14:45:53,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:53,671 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:45:53,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:45:53,672 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:53,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:53,673 INFO L85 PathProgramCache]: Analyzing trace with hash 178307321, now seen corresponding path program 1 times [2025-01-09 14:45:53,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:53,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343689728] [2025-01-09 14:45:53,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:53,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:53,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-01-09 14:45:54,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-01-09 14:45:54,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:54,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:45:54,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:54,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343689728] [2025-01-09 14:45:54,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343689728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:54,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:54,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:45:54,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505004583] [2025-01-09 14:45:54,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:54,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:45:54,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:54,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:45:54,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:45:54,728 INFO L87 Difference]: Start difference. First operand 2048 states and 3516 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:45:55,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:55,077 INFO L93 Difference]: Finished difference Result 6530 states and 11255 transitions. [2025-01-09 14:45:55,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:45:55,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 457 [2025-01-09 14:45:55,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:55,097 INFO L225 Difference]: With dead ends: 6530 [2025-01-09 14:45:55,097 INFO L226 Difference]: Without dead ends: 4645 [2025-01-09 14:45:55,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:45:55,103 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 617 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:55,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 1107 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:45:55,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4645 states. [2025-01-09 14:45:55,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4645 to 3758. [2025-01-09 14:45:55,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3758 states, 3445 states have (on average 1.6978229317851958) internal successors, (5849), 3452 states have internal predecessors, (5849), 302 states have call successors, (302), 10 states have call predecessors, (302), 10 states have return successors, (302), 295 states have call predecessors, (302), 302 states have call successors, (302) [2025-01-09 14:45:55,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3758 states to 3758 states and 6453 transitions. [2025-01-09 14:45:55,223 INFO L78 Accepts]: Start accepts. Automaton has 3758 states and 6453 transitions. Word has length 457 [2025-01-09 14:45:55,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:55,253 INFO L471 AbstractCegarLoop]: Abstraction has 3758 states and 6453 transitions. [2025-01-09 14:45:55,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:45:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3758 states and 6453 transitions. [2025-01-09 14:45:55,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-01-09 14:45:55,259 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:55,259 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:45:55,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:45:55,259 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:55,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:55,260 INFO L85 PathProgramCache]: Analyzing trace with hash 380131255, now seen corresponding path program 1 times [2025-01-09 14:45:55,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:55,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102254714] [2025-01-09 14:45:55,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:55,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:55,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-01-09 14:45:55,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-01-09 14:45:55,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:55,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:56,236 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:45:56,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:56,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102254714] [2025-01-09 14:45:56,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102254714] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:56,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:56,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:45:56,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21447236] [2025-01-09 14:45:56,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:56,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:45:56,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:56,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:45:56,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:45:56,241 INFO L87 Difference]: Start difference. First operand 3758 states and 6453 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:45:56,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:56,451 INFO L93 Difference]: Finished difference Result 13098 states and 22603 transitions. [2025-01-09 14:45:56,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:45:56,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 457 [2025-01-09 14:45:56,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:56,493 INFO L225 Difference]: With dead ends: 13098 [2025-01-09 14:45:56,493 INFO L226 Difference]: Without dead ends: 9778 [2025-01-09 14:45:56,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:45:56,506 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 559 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:56,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 1066 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:45:56,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9778 states. [2025-01-09 14:45:56,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9778 to 7606. [2025-01-09 14:45:56,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7606 states, 7269 states have (on average 1.7113770807538864) internal successors, (12440), 7284 states have internal predecessors, (12440), 318 states have call successors, (318), 18 states have call predecessors, (318), 18 states have return successors, (318), 303 states have call predecessors, (318), 318 states have call successors, (318) [2025-01-09 14:45:56,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 13076 transitions. [2025-01-09 14:45:56,711 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 13076 transitions. Word has length 457 [2025-01-09 14:45:56,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:56,712 INFO L471 AbstractCegarLoop]: Abstraction has 7606 states and 13076 transitions. [2025-01-09 14:45:56,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:45:56,714 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 13076 transitions. [2025-01-09 14:45:56,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-01-09 14:45:56,725 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:56,725 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:45:56,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:45:56,725 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:56,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:56,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1635146309, now seen corresponding path program 1 times [2025-01-09 14:45:56,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:56,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924714844] [2025-01-09 14:45:56,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:56,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:56,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-01-09 14:45:56,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-01-09 14:45:56,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:56,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:45:57,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:57,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924714844] [2025-01-09 14:45:57,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924714844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:57,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:57,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:45:57,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710943246] [2025-01-09 14:45:57,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:57,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:45:57,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:57,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:45:57,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:45:57,003 INFO L87 Difference]: Start difference. First operand 7606 states and 13076 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:45:57,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:57,534 INFO L93 Difference]: Finished difference Result 18755 states and 32012 transitions. [2025-01-09 14:45:57,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:45:57,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 457 [2025-01-09 14:45:57,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:57,575 INFO L225 Difference]: With dead ends: 18755 [2025-01-09 14:45:57,576 INFO L226 Difference]: Without dead ends: 14328 [2025-01-09 14:45:57,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:45:57,588 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 1387 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 2065 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:57,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1387 Valid, 2065 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:45:57,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14328 states. [2025-01-09 14:45:57,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14328 to 8282. [2025-01-09 14:45:57,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8282 states, 7945 states have (on average 1.716551290119572) internal successors, (13638), 7960 states have internal predecessors, (13638), 318 states have call successors, (318), 18 states have call predecessors, (318), 18 states have return successors, (318), 303 states have call predecessors, (318), 318 states have call successors, (318) [2025-01-09 14:45:57,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8282 states to 8282 states and 14274 transitions. [2025-01-09 14:45:57,931 INFO L78 Accepts]: Start accepts. Automaton has 8282 states and 14274 transitions. Word has length 457 [2025-01-09 14:45:57,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:57,932 INFO L471 AbstractCegarLoop]: Abstraction has 8282 states and 14274 transitions. [2025-01-09 14:45:57,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:45:57,935 INFO L276 IsEmpty]: Start isEmpty. Operand 8282 states and 14274 transitions. [2025-01-09 14:45:57,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-01-09 14:45:57,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:57,950 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:45:57,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:45:57,952 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:57,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:57,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1379957309, now seen corresponding path program 1 times [2025-01-09 14:45:57,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:57,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357405806] [2025-01-09 14:45:57,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:57,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:57,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-01-09 14:45:58,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-01-09 14:45:58,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:58,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:45:58,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:58,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357405806] [2025-01-09 14:45:58,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357405806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:58,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:58,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:45:58,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026818705] [2025-01-09 14:45:58,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:58,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:45:58,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:58,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:45:58,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:45:58,878 INFO L87 Difference]: Start difference. First operand 8282 states and 14274 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:45:59,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:59,157 INFO L93 Difference]: Finished difference Result 18304 states and 31430 transitions. [2025-01-09 14:45:59,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:45:59,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 457 [2025-01-09 14:45:59,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:59,190 INFO L225 Difference]: With dead ends: 18304 [2025-01-09 14:45:59,190 INFO L226 Difference]: Without dead ends: 11930 [2025-01-09 14:45:59,201 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-01-09 14:45:59,202 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 432 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:59,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1548 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:45:59,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11930 states. [2025-01-09 14:45:59,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11930 to 9214. [2025-01-09 14:45:59,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9214 states, 8877 states have (on average 1.6850287259209191) internal successors, (14958), 8892 states have internal predecessors, (14958), 318 states have call successors, (318), 18 states have call predecessors, (318), 18 states have return successors, (318), 303 states have call predecessors, (318), 318 states have call successors, (318) [2025-01-09 14:45:59,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9214 states to 9214 states and 15594 transitions. [2025-01-09 14:45:59,433 INFO L78 Accepts]: Start accepts. Automaton has 9214 states and 15594 transitions. Word has length 457 [2025-01-09 14:45:59,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:59,434 INFO L471 AbstractCegarLoop]: Abstraction has 9214 states and 15594 transitions. [2025-01-09 14:45:59,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:45:59,434 INFO L276 IsEmpty]: Start isEmpty. Operand 9214 states and 15594 transitions. [2025-01-09 14:45:59,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-01-09 14:45:59,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:59,448 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:45:59,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:45:59,448 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:59,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:59,449 INFO L85 PathProgramCache]: Analyzing trace with hash -553036671, now seen corresponding path program 1 times [2025-01-09 14:45:59,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:59,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550871349] [2025-01-09 14:45:59,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:59,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:59,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-01-09 14:45:59,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-01-09 14:45:59,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:59,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:59,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:45:59,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:59,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550871349] [2025-01-09 14:45:59,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550871349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:59,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:59,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:45:59,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435863979] [2025-01-09 14:45:59,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:59,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:45:59,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:59,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:45:59,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:59,596 INFO L87 Difference]: Start difference. First operand 9214 states and 15594 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:45:59,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:59,802 INFO L93 Difference]: Finished difference Result 22243 states and 37615 transitions. [2025-01-09 14:45:59,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:45:59,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 458 [2025-01-09 14:45:59,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:59,828 INFO L225 Difference]: With dead ends: 22243 [2025-01-09 14:45:59,828 INFO L226 Difference]: Without dead ends: 13370 [2025-01-09 14:45:59,835 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-01-09 14:45:59,836 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 179 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:59,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 846 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:45:59,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13370 states. [2025-01-09 14:46:00,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13370 to 13364. [2025-01-09 14:46:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13364 states, 12991 states have (on average 1.676545300592718) internal successors, (21780), 13014 states have internal predecessors, (21780), 342 states have call successors, (342), 30 states have call predecessors, (342), 30 states have return successors, (342), 319 states have call predecessors, (342), 342 states have call successors, (342) [2025-01-09 14:46:00,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13364 states to 13364 states and 22464 transitions. [2025-01-09 14:46:00,109 INFO L78 Accepts]: Start accepts. Automaton has 13364 states and 22464 transitions. Word has length 458 [2025-01-09 14:46:00,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:00,110 INFO L471 AbstractCegarLoop]: Abstraction has 13364 states and 22464 transitions. [2025-01-09 14:46:00,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:46:00,110 INFO L276 IsEmpty]: Start isEmpty. Operand 13364 states and 22464 transitions. [2025-01-09 14:46:00,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-01-09 14:46:00,131 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:00,132 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:00,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:46:00,132 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:00,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:00,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1465549279, now seen corresponding path program 1 times [2025-01-09 14:46:00,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:00,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878627085] [2025-01-09 14:46:00,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:00,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:00,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-01-09 14:46:00,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-01-09 14:46:00,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:00,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:46:00,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:00,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878627085] [2025-01-09 14:46:00,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878627085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:00,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:00,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:46:00,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837732829] [2025-01-09 14:46:00,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:00,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:46:00,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:00,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:46:00,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:46:00,843 INFO L87 Difference]: Start difference. First operand 13364 states and 22464 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:46:01,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:01,061 INFO L93 Difference]: Finished difference Result 26466 states and 43911 transitions. [2025-01-09 14:46:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:46:01,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 458 [2025-01-09 14:46:01,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:01,095 INFO L225 Difference]: With dead ends: 26466 [2025-01-09 14:46:01,095 INFO L226 Difference]: Without dead ends: 18324 [2025-01-09 14:46:01,108 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-01-09 14:46:01,109 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 379 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:01,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1425 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:46:01,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18324 states. [2025-01-09 14:46:01,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18324 to 14324. [2025-01-09 14:46:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14324 states, 13951 states have (on average 1.6570855135832556) internal successors, (23118), 13974 states have internal predecessors, (23118), 342 states have call successors, (342), 30 states have call predecessors, (342), 30 states have return successors, (342), 319 states have call predecessors, (342), 342 states have call successors, (342) [2025-01-09 14:46:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14324 states to 14324 states and 23802 transitions. [2025-01-09 14:46:01,337 INFO L78 Accepts]: Start accepts. Automaton has 14324 states and 23802 transitions. Word has length 458 [2025-01-09 14:46:01,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:01,338 INFO L471 AbstractCegarLoop]: Abstraction has 14324 states and 23802 transitions. [2025-01-09 14:46:01,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:46:01,339 INFO L276 IsEmpty]: Start isEmpty. Operand 14324 states and 23802 transitions. [2025-01-09 14:46:01,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-01-09 14:46:01,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:01,362 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:01,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:46:01,363 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:01,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:01,363 INFO L85 PathProgramCache]: Analyzing trace with hash 956076189, now seen corresponding path program 1 times [2025-01-09 14:46:01,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:01,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610357156] [2025-01-09 14:46:01,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:01,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:01,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-01-09 14:46:03,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-01-09 14:46:03,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:03,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:03,591 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 9 proven. 183 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-01-09 14:46:03,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:03,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610357156] [2025-01-09 14:46:03,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610357156] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:46:03,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816212317] [2025-01-09 14:46:03,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:03,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:03,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:03,594 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-01-09 14:46:03,598 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-01-09 14:46:03,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-01-09 14:46:03,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-01-09 14:46:03,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:03,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:03,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 1165 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:46:03,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:46:04,048 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 1774 proven. 21 refuted. 0 times theorem prover too weak. 6525 trivial. 0 not checked. [2025-01-09 14:46:04,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:46:04,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 171 proven. 21 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-01-09 14:46:04,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816212317] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:46:04,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:46:04,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 14:46:04,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507058203] [2025-01-09 14:46:04,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:46:04,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:46:04,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:04,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:46:04,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:46:04,346 INFO L87 Difference]: Start difference. First operand 14324 states and 23802 transitions. Second operand has 8 states, 8 states have (on average 27.0) internal successors, (216), 8 states have internal predecessors, (216), 3 states have call successors, (133), 2 states have call predecessors, (133), 4 states have return successors, (135), 3 states have call predecessors, (135), 3 states have call successors, (135) [2025-01-09 14:46:04,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:04,817 INFO L93 Difference]: Finished difference Result 19881 states and 33043 transitions. [2025-01-09 14:46:04,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 14:46:04,819 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 27.0) internal successors, (216), 8 states have internal predecessors, (216), 3 states have call successors, (133), 2 states have call predecessors, (133), 4 states have return successors, (135), 3 states have call predecessors, (135), 3 states have call successors, (135) Word has length 458 [2025-01-09 14:46:04,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:04,832 INFO L225 Difference]: With dead ends: 19881 [2025-01-09 14:46:04,833 INFO L226 Difference]: Without dead ends: 5858 [2025-01-09 14:46:04,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 930 GetRequests, 913 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:46:04,921 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 524 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:04,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 903 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:46:04,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5858 states. [2025-01-09 14:46:05,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5858 to 5768. [2025-01-09 14:46:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5768 states, 5428 states have (on average 1.6361459100957996) internal successors, (8881), 5439 states have internal predecessors, (8881), 310 states have call successors, (310), 29 states have call predecessors, (310), 29 states have return successors, (310), 299 states have call predecessors, (310), 310 states have call successors, (310) [2025-01-09 14:46:05,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5768 states to 5768 states and 9501 transitions. [2025-01-09 14:46:05,047 INFO L78 Accepts]: Start accepts. Automaton has 5768 states and 9501 transitions. Word has length 458 [2025-01-09 14:46:05,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:05,084 INFO L471 AbstractCegarLoop]: Abstraction has 5768 states and 9501 transitions. [2025-01-09 14:46:05,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.0) internal successors, (216), 8 states have internal predecessors, (216), 3 states have call successors, (133), 2 states have call predecessors, (133), 4 states have return successors, (135), 3 states have call predecessors, (135), 3 states have call successors, (135) [2025-01-09 14:46:05,084 INFO L276 IsEmpty]: Start isEmpty. Operand 5768 states and 9501 transitions. [2025-01-09 14:46:05,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-01-09 14:46:05,091 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:05,091 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:05,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 14:46:05,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:05,292 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:05,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:05,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1778744432, now seen corresponding path program 1 times [2025-01-09 14:46:05,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:05,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660163694] [2025-01-09 14:46:05,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:05,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:05,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-01-09 14:46:05,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-01-09 14:46:05,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:05,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:06,074 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:46:06,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:06,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660163694] [2025-01-09 14:46:06,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660163694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:06,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:06,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:46:06,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93542309] [2025-01-09 14:46:06,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:06,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:46:06,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:06,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:46:06,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:46:06,076 INFO L87 Difference]: Start difference. First operand 5768 states and 9501 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:46:06,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:06,513 INFO L93 Difference]: Finished difference Result 16053 states and 26523 transitions. [2025-01-09 14:46:06,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:46:06,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 459 [2025-01-09 14:46:06,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:06,532 INFO L225 Difference]: With dead ends: 16053 [2025-01-09 14:46:06,532 INFO L226 Difference]: Without dead ends: 10442 [2025-01-09 14:46:06,537 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-01-09 14:46:06,537 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 708 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:06,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 1400 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:46:06,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10442 states. [2025-01-09 14:46:06,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10442 to 6306. [2025-01-09 14:46:06,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6306 states, 5969 states have (on average 1.6413134528396716) internal successors, (9797), 5978 states have internal predecessors, (9797), 306 states have call successors, (306), 30 states have call predecessors, (306), 30 states have return successors, (306), 297 states have call predecessors, (306), 306 states have call successors, (306) [2025-01-09 14:46:06,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6306 states to 6306 states and 10409 transitions. [2025-01-09 14:46:06,656 INFO L78 Accepts]: Start accepts. Automaton has 6306 states and 10409 transitions. Word has length 459 [2025-01-09 14:46:06,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:06,656 INFO L471 AbstractCegarLoop]: Abstraction has 6306 states and 10409 transitions. [2025-01-09 14:46:06,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:46:06,657 INFO L276 IsEmpty]: Start isEmpty. Operand 6306 states and 10409 transitions. [2025-01-09 14:46:06,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-01-09 14:46:06,662 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:06,663 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:06,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:46:06,663 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:06,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:06,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1855645230, now seen corresponding path program 1 times [2025-01-09 14:46:06,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:06,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251202270] [2025-01-09 14:46:06,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:06,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:06,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-01-09 14:46:06,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-01-09 14:46:06,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:06,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:07,305 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:46:07,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:07,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251202270] [2025-01-09 14:46:07,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251202270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:07,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:07,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:46:07,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318576560] [2025-01-09 14:46:07,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:07,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:46:07,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:07,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:46:07,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:07,306 INFO L87 Difference]: Start difference. First operand 6306 states and 10409 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:46:07,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:07,508 INFO L93 Difference]: Finished difference Result 13626 states and 22410 transitions. [2025-01-09 14:46:07,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:46:07,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 459 [2025-01-09 14:46:07,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:07,528 INFO L225 Difference]: With dead ends: 13626 [2025-01-09 14:46:07,528 INFO L226 Difference]: Without dead ends: 9380 [2025-01-09 14:46:07,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:07,536 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 680 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:07,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1316 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:46:07,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9380 states. [2025-01-09 14:46:07,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9380 to 6953. [2025-01-09 14:46:07,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6953 states, 6616 states have (on average 1.6348246674727933) internal successors, (10816), 6625 states have internal predecessors, (10816), 306 states have call successors, (306), 30 states have call predecessors, (306), 30 states have return successors, (306), 297 states have call predecessors, (306), 306 states have call successors, (306) [2025-01-09 14:46:07,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6953 states to 6953 states and 11428 transitions. [2025-01-09 14:46:07,670 INFO L78 Accepts]: Start accepts. Automaton has 6953 states and 11428 transitions. Word has length 459 [2025-01-09 14:46:07,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:07,670 INFO L471 AbstractCegarLoop]: Abstraction has 6953 states and 11428 transitions. [2025-01-09 14:46:07,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:46:07,671 INFO L276 IsEmpty]: Start isEmpty. Operand 6953 states and 11428 transitions. [2025-01-09 14:46:07,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-01-09 14:46:07,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:07,677 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:07,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 14:46:07,677 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:07,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:07,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1346172140, now seen corresponding path program 1 times [2025-01-09 14:46:07,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:07,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754524516] [2025-01-09 14:46:07,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:07,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:07,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-01-09 14:46:07,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-01-09 14:46:07,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:07,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:08,427 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:46:08,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:08,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754524516] [2025-01-09 14:46:08,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754524516] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:08,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:08,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:46:08,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148197559] [2025-01-09 14:46:08,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:08,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:46:08,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:08,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:46:08,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:08,429 INFO L87 Difference]: Start difference. First operand 6953 states and 11428 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:46:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:09,098 INFO L93 Difference]: Finished difference Result 15693 states and 25807 transitions. [2025-01-09 14:46:09,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:46:09,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 459 [2025-01-09 14:46:09,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:09,120 INFO L225 Difference]: With dead ends: 15693 [2025-01-09 14:46:09,120 INFO L226 Difference]: Without dead ends: 11338 [2025-01-09 14:46:09,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:46:09,128 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 733 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:09,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 1624 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:46:09,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11338 states. [2025-01-09 14:46:09,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11338 to 9476. [2025-01-09 14:46:09,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9476 states, 9139 states have (on average 1.6414268519531678) internal successors, (15001), 9148 states have internal predecessors, (15001), 306 states have call successors, (306), 30 states have call predecessors, (306), 30 states have return successors, (306), 297 states have call predecessors, (306), 306 states have call successors, (306) [2025-01-09 14:46:09,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9476 states to 9476 states and 15613 transitions. [2025-01-09 14:46:09,306 INFO L78 Accepts]: Start accepts. Automaton has 9476 states and 15613 transitions. Word has length 459 [2025-01-09 14:46:09,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:09,306 INFO L471 AbstractCegarLoop]: Abstraction has 9476 states and 15613 transitions. [2025-01-09 14:46:09,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:46:09,307 INFO L276 IsEmpty]: Start isEmpty. Operand 9476 states and 15613 transitions. [2025-01-09 14:46:09,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-01-09 14:46:09,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:09,313 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:09,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 14:46:09,313 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:09,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:09,314 INFO L85 PathProgramCache]: Analyzing trace with hash 325991594, now seen corresponding path program 1 times [2025-01-09 14:46:09,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:09,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724823897] [2025-01-09 14:46:09,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:09,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:09,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-01-09 14:46:10,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-01-09 14:46:10,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:10,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 42 proven. 150 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-01-09 14:46:11,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:11,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724823897] [2025-01-09 14:46:11,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724823897] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:46:11,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660346258] [2025-01-09 14:46:11,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:11,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:11,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:11,191 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-01-09 14:46:11,198 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-01-09 14:46:11,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-01-09 14:46:11,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-01-09 14:46:11,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:11,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:11,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:46:11,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:46:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 2818 proven. 39 refuted. 0 times theorem prover too weak. 5463 trivial. 0 not checked. [2025-01-09 14:46:11,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:46:11,944 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 153 proven. 39 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-01-09 14:46:11,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660346258] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:46:11,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:46:11,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2025-01-09 14:46:11,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394868242] [2025-01-09 14:46:11,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:46:11,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:46:11,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:11,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:46:11,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:46:11,947 INFO L87 Difference]: Start difference. First operand 9476 states and 15613 transitions. Second operand has 10 states, 10 states have (on average 24.4) internal successors, (244), 10 states have internal predecessors, (244), 4 states have call successors, (143), 2 states have call predecessors, (143), 4 states have return successors, (144), 4 states have call predecessors, (144), 4 states have call successors, (144) [2025-01-09 14:46:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:12,979 INFO L93 Difference]: Finished difference Result 18099 states and 29862 transitions. [2025-01-09 14:46:12,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 14:46:12,980 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 24.4) internal successors, (244), 10 states have internal predecessors, (244), 4 states have call successors, (143), 2 states have call predecessors, (143), 4 states have return successors, (144), 4 states have call predecessors, (144), 4 states have call successors, (144) Word has length 459 [2025-01-09 14:46:12,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:12,998 INFO L225 Difference]: With dead ends: 18099 [2025-01-09 14:46:12,998 INFO L226 Difference]: Without dead ends: 8880 [2025-01-09 14:46:13,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 942 GetRequests, 916 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=220, Invalid=536, Unknown=0, NotChecked=0, Total=756 [2025-01-09 14:46:13,010 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 1199 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:13,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1248 Valid, 1724 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:46:13,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8880 states. [2025-01-09 14:46:13,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8880 to 7674. [2025-01-09 14:46:13,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7674 states, 7402 states have (on average 1.638205890299919) internal successors, (12126), 7407 states have internal predecessors, (12126), 250 states have call successors, (250), 21 states have call predecessors, (250), 21 states have return successors, (250), 245 states have call predecessors, (250), 250 states have call successors, (250) [2025-01-09 14:46:13,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7674 states to 7674 states and 12626 transitions. [2025-01-09 14:46:13,205 INFO L78 Accepts]: Start accepts. Automaton has 7674 states and 12626 transitions. Word has length 459 [2025-01-09 14:46:13,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:13,205 INFO L471 AbstractCegarLoop]: Abstraction has 7674 states and 12626 transitions. [2025-01-09 14:46:13,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.4) internal successors, (244), 10 states have internal predecessors, (244), 4 states have call successors, (143), 2 states have call predecessors, (143), 4 states have return successors, (144), 4 states have call predecessors, (144), 4 states have call successors, (144) [2025-01-09 14:46:13,206 INFO L276 IsEmpty]: Start isEmpty. Operand 7674 states and 12626 transitions. [2025-01-09 14:46:13,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-01-09 14:46:13,211 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:13,211 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:13,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 14:46:13,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:13,416 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:13,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:13,417 INFO L85 PathProgramCache]: Analyzing trace with hash -980091665, now seen corresponding path program 1 times [2025-01-09 14:46:13,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:13,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336703523] [2025-01-09 14:46:13,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:13,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:13,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-01-09 14:46:13,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-01-09 14:46:13,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:13,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:46:14,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:14,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336703523] [2025-01-09 14:46:14,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336703523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:14,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:14,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:46:14,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966475930] [2025-01-09 14:46:14,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:14,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:46:14,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:14,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:46:14,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:46:14,003 INFO L87 Difference]: Start difference. First operand 7674 states and 12626 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:46:14,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:14,409 INFO L93 Difference]: Finished difference Result 13521 states and 22191 transitions. [2025-01-09 14:46:14,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:46:14,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 462 [2025-01-09 14:46:14,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:14,437 INFO L225 Difference]: With dead ends: 13521 [2025-01-09 14:46:14,437 INFO L226 Difference]: Without dead ends: 7106 [2025-01-09 14:46:14,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:46:14,444 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 757 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:14,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 910 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:46:14,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7106 states. [2025-01-09 14:46:14,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7106 to 6034. [2025-01-09 14:46:14,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6034 states, 5762 states have (on average 1.6339812565081568) internal successors, (9415), 5767 states have internal predecessors, (9415), 250 states have call successors, (250), 21 states have call predecessors, (250), 21 states have return successors, (250), 245 states have call predecessors, (250), 250 states have call successors, (250) [2025-01-09 14:46:14,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6034 states to 6034 states and 9915 transitions. [2025-01-09 14:46:14,551 INFO L78 Accepts]: Start accepts. Automaton has 6034 states and 9915 transitions. Word has length 462 [2025-01-09 14:46:14,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:14,553 INFO L471 AbstractCegarLoop]: Abstraction has 6034 states and 9915 transitions. [2025-01-09 14:46:14,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:46:14,554 INFO L276 IsEmpty]: Start isEmpty. Operand 6034 states and 9915 transitions. [2025-01-09 14:46:14,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-01-09 14:46:14,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:14,556 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:14,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 14:46:14,557 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:14,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:14,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1712059091, now seen corresponding path program 1 times [2025-01-09 14:46:14,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:14,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168394173] [2025-01-09 14:46:14,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:14,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:14,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-01-09 14:46:15,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-01-09 14:46:15,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:15,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:15,763 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 36 proven. 156 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-01-09 14:46:15,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:15,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168394173] [2025-01-09 14:46:15,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168394173] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:46:15,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384893505] [2025-01-09 14:46:15,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:15,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:15,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:15,766 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:46:15,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:46:15,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-01-09 14:46:16,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-01-09 14:46:16,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:16,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:16,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 1167 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 14:46:16,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:46:16,500 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 2584 proven. 156 refuted. 0 times theorem prover too weak. 5580 trivial. 0 not checked. [2025-01-09 14:46:16,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:46:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 36 proven. 156 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-01-09 14:46:16,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384893505] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:46:16,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:46:16,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-09 14:46:16,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870673164] [2025-01-09 14:46:16,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:46:16,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:46:16,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:16,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:46:16,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:46:16,807 INFO L87 Difference]: Start difference. First operand 6034 states and 9915 transitions. Second operand has 11 states, 11 states have (on average 21.90909090909091) internal successors, (241), 11 states have internal predecessors, (241), 3 states have call successors, (169), 2 states have call predecessors, (169), 4 states have return successors, (170), 3 states have call predecessors, (170), 3 states have call successors, (170) [2025-01-09 14:46:17,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:17,322 INFO L93 Difference]: Finished difference Result 11409 states and 18735 transitions. [2025-01-09 14:46:17,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:46:17,324 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 21.90909090909091) internal successors, (241), 11 states have internal predecessors, (241), 3 states have call successors, (169), 2 states have call predecessors, (169), 4 states have return successors, (170), 3 states have call predecessors, (170), 3 states have call successors, (170) Word has length 462 [2025-01-09 14:46:17,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:17,334 INFO L225 Difference]: With dead ends: 11409 [2025-01-09 14:46:17,335 INFO L226 Difference]: Without dead ends: 6090 [2025-01-09 14:46:17,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 931 GetRequests, 919 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:46:17,340 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 212 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:17,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1361 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:46:17,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6090 states. [2025-01-09 14:46:17,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6090 to 6054. [2025-01-09 14:46:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6054 states, 5777 states have (on average 1.6157175004327506) internal successors, (9334), 5782 states have internal predecessors, (9334), 250 states have call successors, (250), 26 states have call predecessors, (250), 26 states have return successors, (250), 245 states have call predecessors, (250), 250 states have call successors, (250) [2025-01-09 14:46:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6054 states to 6054 states and 9834 transitions. [2025-01-09 14:46:17,446 INFO L78 Accepts]: Start accepts. Automaton has 6054 states and 9834 transitions. Word has length 462 [2025-01-09 14:46:17,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:17,447 INFO L471 AbstractCegarLoop]: Abstraction has 6054 states and 9834 transitions. [2025-01-09 14:46:17,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.90909090909091) internal successors, (241), 11 states have internal predecessors, (241), 3 states have call successors, (169), 2 states have call predecessors, (169), 4 states have return successors, (170), 3 states have call predecessors, (170), 3 states have call successors, (170) [2025-01-09 14:46:17,447 INFO L276 IsEmpty]: Start isEmpty. Operand 6054 states and 9834 transitions. [2025-01-09 14:46:17,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-01-09 14:46:17,450 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:17,450 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:17,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 14:46:17,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:17,654 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:17,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:17,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1928292378, now seen corresponding path program 1 times [2025-01-09 14:46:17,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:17,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224773508] [2025-01-09 14:46:17,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:17,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:17,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-01-09 14:46:19,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-01-09 14:46:19,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:19,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:19,571 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 66 proven. 126 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-01-09 14:46:19,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:19,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224773508] [2025-01-09 14:46:19,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224773508] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:46:19,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581167354] [2025-01-09 14:46:19,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:19,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:19,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:19,574 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:46:19,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 14:46:19,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-01-09 14:46:19,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-01-09 14:46:19,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:19,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:19,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 1168 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:46:19,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:46:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 3804 proven. 126 refuted. 0 times theorem prover too weak. 4390 trivial. 0 not checked. [2025-01-09 14:46:20,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:46:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 66 proven. 126 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-01-09 14:46:20,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581167354] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:46:20,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:46:20,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 14:46:20,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314568494] [2025-01-09 14:46:20,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:46:20,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:46:20,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:20,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:46:20,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:46:20,604 INFO L87 Difference]: Start difference. First operand 6054 states and 9834 transitions. Second operand has 8 states, 8 states have (on average 29.5) internal successors, (236), 8 states have internal predecessors, (236), 3 states have call successors, (149), 2 states have call predecessors, (149), 4 states have return successors, (150), 3 states have call predecessors, (150), 3 states have call successors, (150) [2025-01-09 14:46:20,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:20,992 INFO L93 Difference]: Finished difference Result 12004 states and 19491 transitions. [2025-01-09 14:46:20,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:46:20,993 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.5) internal successors, (236), 8 states have internal predecessors, (236), 3 states have call successors, (149), 2 states have call predecessors, (149), 4 states have return successors, (150), 3 states have call predecessors, (150), 3 states have call successors, (150) Word has length 463 [2025-01-09 14:46:20,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:21,002 INFO L225 Difference]: With dead ends: 12004 [2025-01-09 14:46:21,003 INFO L226 Difference]: Without dead ends: 6110 [2025-01-09 14:46:21,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 932 GetRequests, 923 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:46:21,008 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 626 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:21,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 877 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:46:21,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6110 states. [2025-01-09 14:46:21,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6110 to 6074. [2025-01-09 14:46:21,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6074 states, 5792 states have (on average 1.5961671270718232) internal successors, (9245), 5797 states have internal predecessors, (9245), 250 states have call successors, (250), 31 states have call predecessors, (250), 31 states have return successors, (250), 245 states have call predecessors, (250), 250 states have call successors, (250) [2025-01-09 14:46:21,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6074 states to 6074 states and 9745 transitions. [2025-01-09 14:46:21,173 INFO L78 Accepts]: Start accepts. Automaton has 6074 states and 9745 transitions. Word has length 463 [2025-01-09 14:46:21,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:21,174 INFO L471 AbstractCegarLoop]: Abstraction has 6074 states and 9745 transitions. [2025-01-09 14:46:21,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.5) internal successors, (236), 8 states have internal predecessors, (236), 3 states have call successors, (149), 2 states have call predecessors, (149), 4 states have return successors, (150), 3 states have call predecessors, (150), 3 states have call successors, (150) [2025-01-09 14:46:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand 6074 states and 9745 transitions. [2025-01-09 14:46:21,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-01-09 14:46:21,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:21,179 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:21,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 14:46:21,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:21,380 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:21,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:21,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1707143396, now seen corresponding path program 1 times [2025-01-09 14:46:21,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:21,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794605514] [2025-01-09 14:46:21,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:21,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:21,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-01-09 14:46:24,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-01-09 14:46:24,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:24,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:25,287 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 162 proven. 216 refuted. 0 times theorem prover too weak. 7942 trivial. 0 not checked. [2025-01-09 14:46:25,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:25,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794605514] [2025-01-09 14:46:25,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794605514] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:46:25,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420610686] [2025-01-09 14:46:25,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:25,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:25,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:25,290 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:46:25,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 14:46:25,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-01-09 14:46:25,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-01-09 14:46:25,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:25,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:25,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 1168 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 14:46:25,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:46:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 4258 proven. 186 refuted. 0 times theorem prover too weak. 3876 trivial. 0 not checked. [2025-01-09 14:46:26,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:46:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 192 proven. 189 refuted. 0 times theorem prover too weak. 7939 trivial. 0 not checked. [2025-01-09 14:46:26,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420610686] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:46:26,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:46:26,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 22 [2025-01-09 14:46:26,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363131473] [2025-01-09 14:46:26,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:46:26,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 14:46:26,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:26,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 14:46:26,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2025-01-09 14:46:26,627 INFO L87 Difference]: Start difference. First operand 6074 states and 9745 transitions. Second operand has 22 states, 20 states have (on average 16.05) internal successors, (321), 20 states have internal predecessors, (321), 8 states have call successors, (154), 3 states have call predecessors, (154), 6 states have return successors, (155), 7 states have call predecessors, (155), 8 states have call successors, (155) [2025-01-09 14:46:29,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:29,966 INFO L93 Difference]: Finished difference Result 20255 states and 32307 transitions. [2025-01-09 14:46:29,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-01-09 14:46:29,967 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 16.05) internal successors, (321), 20 states have internal predecessors, (321), 8 states have call successors, (154), 3 states have call predecessors, (154), 6 states have return successors, (155), 7 states have call predecessors, (155), 8 states have call successors, (155) Word has length 463 [2025-01-09 14:46:29,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:29,988 INFO L225 Difference]: With dead ends: 20255 [2025-01-09 14:46:29,988 INFO L226 Difference]: Without dead ends: 14823 [2025-01-09 14:46:29,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1016 GetRequests, 924 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2708 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1997, Invalid=6745, Unknown=0, NotChecked=0, Total=8742 [2025-01-09 14:46:30,000 INFO L435 NwaCegarLoop]: 968 mSDtfsCounter, 3333 mSDsluCounter, 3092 mSDsCounter, 0 mSdLazyCounter, 2617 mSolverCounterSat, 847 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3333 SdHoareTripleChecker+Valid, 4060 SdHoareTripleChecker+Invalid, 3464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 847 IncrementalHoareTripleChecker+Valid, 2617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:30,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3333 Valid, 4060 Invalid, 3464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [847 Valid, 2617 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 14:46:30,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14823 states. [2025-01-09 14:46:30,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14823 to 14447. [2025-01-09 14:46:30,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14447 states, 13708 states have (on average 1.5707615990662387) internal successors, (21532), 13725 states have internal predecessors, (21532), 609 states have call successors, (609), 129 states have call predecessors, (609), 129 states have return successors, (609), 592 states have call predecessors, (609), 609 states have call successors, (609) [2025-01-09 14:46:30,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14447 states to 14447 states and 22750 transitions. [2025-01-09 14:46:30,315 INFO L78 Accepts]: Start accepts. Automaton has 14447 states and 22750 transitions. Word has length 463 [2025-01-09 14:46:30,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:30,316 INFO L471 AbstractCegarLoop]: Abstraction has 14447 states and 22750 transitions. [2025-01-09 14:46:30,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 16.05) internal successors, (321), 20 states have internal predecessors, (321), 8 states have call successors, (154), 3 states have call predecessors, (154), 6 states have return successors, (155), 7 states have call predecessors, (155), 8 states have call successors, (155) [2025-01-09 14:46:30,316 INFO L276 IsEmpty]: Start isEmpty. Operand 14447 states and 22750 transitions. [2025-01-09 14:46:30,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-01-09 14:46:30,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:30,321 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:30,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 14:46:30,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-09 14:46:30,526 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:30,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:30,527 INFO L85 PathProgramCache]: Analyzing trace with hash -867399336, now seen corresponding path program 1 times [2025-01-09 14:46:30,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:30,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121191402] [2025-01-09 14:46:30,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:30,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:30,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-01-09 14:46:30,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-01-09 14:46:30,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:30,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:46:30,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:30,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121191402] [2025-01-09 14:46:30,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121191402] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:30,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:30,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:46:30,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900267566] [2025-01-09 14:46:30,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:30,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:46:30,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:30,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:46:30,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:46:30,781 INFO L87 Difference]: Start difference. First operand 14447 states and 22750 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:46:31,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:31,165 INFO L93 Difference]: Finished difference Result 32603 states and 51364 transitions. [2025-01-09 14:46:31,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:46:31,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 464 [2025-01-09 14:46:31,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:31,196 INFO L225 Difference]: With dead ends: 32603 [2025-01-09 14:46:31,197 INFO L226 Difference]: Without dead ends: 20247 [2025-01-09 14:46:31,212 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-01-09 14:46:31,213 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 254 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:31,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 1045 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:46:31,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20247 states. [2025-01-09 14:46:31,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20247 to 20245. [2025-01-09 14:46:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20245 states, 19156 states have (on average 1.5659323449571936) internal successors, (29997), 19181 states have internal predecessors, (29997), 899 states have call successors, (899), 189 states have call predecessors, (899), 189 states have return successors, (899), 874 states have call predecessors, (899), 899 states have call successors, (899) [2025-01-09 14:46:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20245 states to 20245 states and 31795 transitions. [2025-01-09 14:46:31,665 INFO L78 Accepts]: Start accepts. Automaton has 20245 states and 31795 transitions. Word has length 464 [2025-01-09 14:46:31,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:31,665 INFO L471 AbstractCegarLoop]: Abstraction has 20245 states and 31795 transitions. [2025-01-09 14:46:31,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:46:31,665 INFO L276 IsEmpty]: Start isEmpty. Operand 20245 states and 31795 transitions. [2025-01-09 14:46:31,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-01-09 14:46:31,670 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:31,670 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:31,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 14:46:31,671 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:31,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:31,671 INFO L85 PathProgramCache]: Analyzing trace with hash 268139278, now seen corresponding path program 1 times [2025-01-09 14:46:31,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:31,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479364294] [2025-01-09 14:46:31,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:31,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:31,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-01-09 14:46:33,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-01-09 14:46:33,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:33,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 120 proven. 72 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-01-09 14:46:33,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:33,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479364294] [2025-01-09 14:46:33,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479364294] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:46:33,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218420440] [2025-01-09 14:46:33,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:33,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:33,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:33,701 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:46:33,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 14:46:33,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-01-09 14:46:34,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-01-09 14:46:34,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:34,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:34,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:46:34,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:46:34,213 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 3984 proven. 72 refuted. 0 times theorem prover too weak. 4264 trivial. 0 not checked. [2025-01-09 14:46:34,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:46:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 120 proven. 72 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-01-09 14:46:34,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218420440] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:46:34,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:46:34,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 14:46:34,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777440028] [2025-01-09 14:46:34,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:46:34,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:46:34,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:34,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:46:34,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:46:34,467 INFO L87 Difference]: Start difference. First operand 20245 states and 31795 transitions. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 2 states have call successors, (89), 2 states have call predecessors, (89), 4 states have return successors, (90), 2 states have call predecessors, (90), 2 states have call successors, (90) [2025-01-09 14:46:34,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:34,852 INFO L93 Difference]: Finished difference Result 27809 states and 43573 transitions. [2025-01-09 14:46:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:46:34,856 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 2 states have call successors, (89), 2 states have call predecessors, (89), 4 states have return successors, (90), 2 states have call predecessors, (90), 2 states have call successors, (90) Word has length 465 [2025-01-09 14:46:34,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:34,869 INFO L225 Difference]: With dead ends: 27809 [2025-01-09 14:46:34,869 INFO L226 Difference]: Without dead ends: 8929 [2025-01-09 14:46:34,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 927 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:46:34,886 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 523 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:34,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 882 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:46:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8929 states. [2025-01-09 14:46:35,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8929 to 6218. [2025-01-09 14:46:35,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6218 states, 5779 states have (on average 1.5175635923170099) internal successors, (8770), 5786 states have internal predecessors, (8770), 362 states have call successors, (362), 76 states have call predecessors, (362), 76 states have return successors, (362), 355 states have call predecessors, (362), 362 states have call successors, (362) [2025-01-09 14:46:35,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 9494 transitions. [2025-01-09 14:46:35,058 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 9494 transitions. Word has length 465 [2025-01-09 14:46:35,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:35,058 INFO L471 AbstractCegarLoop]: Abstraction has 6218 states and 9494 transitions. [2025-01-09 14:46:35,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 2 states have call successors, (89), 2 states have call predecessors, (89), 4 states have return successors, (90), 2 states have call predecessors, (90), 2 states have call successors, (90) [2025-01-09 14:46:35,059 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 9494 transitions. [2025-01-09 14:46:35,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-01-09 14:46:35,062 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:35,062 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:35,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 14:46:35,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:35,268 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:35,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:35,269 INFO L85 PathProgramCache]: Analyzing trace with hash -2145882960, now seen corresponding path program 1 times [2025-01-09 14:46:35,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:35,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829025066] [2025-01-09 14:46:35,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:35,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:35,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-01-09 14:46:37,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-01-09 14:46:37,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:37,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:39,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 120 proven. 258 refuted. 0 times theorem prover too weak. 7942 trivial. 0 not checked. [2025-01-09 14:46:39,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:39,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829025066] [2025-01-09 14:46:39,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829025066] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:46:39,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261498485] [2025-01-09 14:46:39,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:39,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:39,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:39,686 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:46:39,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 14:46:39,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-01-09 14:46:40,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-01-09 14:46:40,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:40,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:40,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 1164 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 14:46:40,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:46:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 3762 proven. 540 refuted. 0 times theorem prover too weak. 4018 trivial. 0 not checked. [2025-01-09 14:46:43,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:46:44,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261498485] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:46:44,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 14:46:44,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2025-01-09 14:46:44,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355007102] [2025-01-09 14:46:44,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 14:46:44,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 14:46:44,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:44,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 14:46:44,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1803, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 14:46:44,903 INFO L87 Difference]: Start difference. First operand 6218 states and 9494 transitions. Second operand has 34 states, 33 states have (on average 8.272727272727273) internal successors, (273), 31 states have internal predecessors, (273), 10 states have call successors, (130), 6 states have call predecessors, (130), 9 states have return successors, (130), 10 states have call predecessors, (130), 10 states have call successors, (130) [2025-01-09 14:46:49,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:49,703 INFO L93 Difference]: Finished difference Result 24459 states and 37130 transitions. [2025-01-09 14:46:49,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-01-09 14:46:49,703 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 8.272727272727273) internal successors, (273), 31 states have internal predecessors, (273), 10 states have call successors, (130), 6 states have call predecessors, (130), 9 states have return successors, (130), 10 states have call predecessors, (130), 10 states have call successors, (130) Word has length 465 [2025-01-09 14:46:49,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:49,731 INFO L225 Difference]: With dead ends: 24459 [2025-01-09 14:46:49,732 INFO L226 Difference]: Without dead ends: 18664 [2025-01-09 14:46:49,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 875 GetRequests, 796 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1546 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1258, Invalid=5222, Unknown=0, NotChecked=0, Total=6480 [2025-01-09 14:46:49,746 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 3892 mSDsluCounter, 5263 mSDsCounter, 0 mSdLazyCounter, 4030 mSolverCounterSat, 698 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3906 SdHoareTripleChecker+Valid, 5569 SdHoareTripleChecker+Invalid, 4728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 698 IncrementalHoareTripleChecker+Valid, 4030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:49,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3906 Valid, 5569 Invalid, 4728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [698 Valid, 4030 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-09 14:46:49,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18664 states. [2025-01-09 14:46:50,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18664 to 14004. [2025-01-09 14:46:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14004 states, 12978 states have (on average 1.5014640160271229) internal successors, (19486), 13001 states have internal predecessors, (19486), 791 states have call successors, (791), 234 states have call predecessors, (791), 234 states have return successors, (791), 768 states have call predecessors, (791), 791 states have call successors, (791) [2025-01-09 14:46:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14004 states to 14004 states and 21068 transitions. [2025-01-09 14:46:50,256 INFO L78 Accepts]: Start accepts. Automaton has 14004 states and 21068 transitions. Word has length 465 [2025-01-09 14:46:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:50,256 INFO L471 AbstractCegarLoop]: Abstraction has 14004 states and 21068 transitions. [2025-01-09 14:46:50,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 8.272727272727273) internal successors, (273), 31 states have internal predecessors, (273), 10 states have call successors, (130), 6 states have call predecessors, (130), 9 states have return successors, (130), 10 states have call predecessors, (130), 10 states have call successors, (130) [2025-01-09 14:46:50,256 INFO L276 IsEmpty]: Start isEmpty. Operand 14004 states and 21068 transitions. [2025-01-09 14:46:50,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-01-09 14:46:50,260 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:50,261 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:50,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 14:46:50,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:50,465 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:50,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:50,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1712153874, now seen corresponding path program 1 times [2025-01-09 14:46:50,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:50,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053594653] [2025-01-09 14:46:50,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:50,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:50,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-01-09 14:46:54,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-01-09 14:46:54,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:54,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:46:54,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [439796856] [2025-01-09 14:46:54,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:54,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:54,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:54,701 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:46:54,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 14:46:54,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-01-09 14:46:55,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-01-09 14:46:55,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:55,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:55,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 1162 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 14:46:55,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:46:55,471 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:46:55,472 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:46:55,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:55,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053594653] [2025-01-09 14:46:55,472 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 14:46:55,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439796856] [2025-01-09 14:46:55,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439796856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:55,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:55,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:46:55,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193062899] [2025-01-09 14:46:55,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:55,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:46:55,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:55,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:46:55,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:46:55,473 INFO L87 Difference]: Start difference. First operand 14004 states and 21068 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:46:56,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:56,041 INFO L93 Difference]: Finished difference Result 33256 states and 50267 transitions. [2025-01-09 14:46:56,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:46:56,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 465 [2025-01-09 14:46:56,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:56,075 INFO L225 Difference]: With dead ends: 33256 [2025-01-09 14:46:56,076 INFO L226 Difference]: Without dead ends: 19799 [2025-01-09 14:46:56,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 462 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-01-09 14:46:56,093 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 196 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:56,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1234 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:46:56,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19799 states. [2025-01-09 14:46:56,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19799 to 19797. [2025-01-09 14:46:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19797 states, 18413 states have (on average 1.5029055558572748) internal successors, (27673), 18443 states have internal predecessors, (27673), 1088 states have call successors, (1088), 295 states have call predecessors, (1088), 295 states have return successors, (1088), 1058 states have call predecessors, (1088), 1088 states have call successors, (1088) [2025-01-09 14:46:56,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19797 states to 19797 states and 29849 transitions. [2025-01-09 14:46:56,779 INFO L78 Accepts]: Start accepts. Automaton has 19797 states and 29849 transitions. Word has length 465 [2025-01-09 14:46:56,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:56,780 INFO L471 AbstractCegarLoop]: Abstraction has 19797 states and 29849 transitions. [2025-01-09 14:46:56,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:46:56,780 INFO L276 IsEmpty]: Start isEmpty. Operand 19797 states and 29849 transitions. [2025-01-09 14:46:56,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-01-09 14:46:56,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:56,794 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:56,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 14:46:56,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:56,999 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:56,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:56,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1671479124, now seen corresponding path program 1 times [2025-01-09 14:46:57,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:57,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046258074] [2025-01-09 14:46:57,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:57,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:57,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-01-09 14:46:57,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-01-09 14:46:57,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:57,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:57,646 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-01-09 14:46:57,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:57,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046258074] [2025-01-09 14:46:57,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046258074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:57,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:57,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:46:57,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5665514] [2025-01-09 14:46:57,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:57,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:46:57,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:57,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:46:57,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:46:57,649 INFO L87 Difference]: Start difference. First operand 19797 states and 29849 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-01-09 14:46:59,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:59,151 INFO L93 Difference]: Finished difference Result 72457 states and 109263 transitions. [2025-01-09 14:46:59,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:46:59,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 465 [2025-01-09 14:46:59,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:59,237 INFO L225 Difference]: With dead ends: 72457 [2025-01-09 14:46:59,237 INFO L226 Difference]: Without dead ends: 52931 [2025-01-09 14:46:59,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:46:59,268 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 683 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:59,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 1135 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:46:59,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52931 states.