./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-69.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_fillercode_fillercodesize_ps-cn-100_file-69.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 7f7f9de4935e98a5cc03247cc1638e041ed42f1ff608f0c98afb88091964fc6c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:22:36,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:22:36,793 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:22:36,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:22:36,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:22:36,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:22:36,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:22:36,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:22:36,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:22:36,818 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:22:36,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:22:36,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:22:36,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:22:36,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:22:36,819 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:22:36,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:22:36,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:22:36,819 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:22:36,819 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:22:36,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:22:36,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:22:36,819 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:22:36,819 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:22:36,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:22:36,821 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:22:36,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:22:36,821 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:22:36,821 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:22:36,821 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:22:36,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:22:36,821 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:22:36,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:22:36,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:22:36,822 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:22:36,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:22:36,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:22:36,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:22:36,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:22:36,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:22:36,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:22:36,822 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:22:36,822 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:22:36,822 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:22:36,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:22:36,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:22:36,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:22:36,823 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:22:36,823 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:22:36,823 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 -> 7f7f9de4935e98a5cc03247cc1638e041ed42f1ff608f0c98afb88091964fc6c [2025-01-09 09:22:37,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:22:37,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:22:37,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:22:37,068 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:22:37,068 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:22:37,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-69.i [2025-01-09 09:22:38,391 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20888f18c/403f08907e2d4132bb147263e33d5ae3/FLAG01e697f5e [2025-01-09 09:22:38,691 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:22:38,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-69.i [2025-01-09 09:22:38,707 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20888f18c/403f08907e2d4132bb147263e33d5ae3/FLAG01e697f5e [2025-01-09 09:22:38,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20888f18c/403f08907e2d4132bb147263e33d5ae3 [2025-01-09 09:22:38,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:22:38,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:22:38,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:22:38,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:22:38,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:22:38,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:38" (1/1) ... [2025-01-09 09:22:38,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:38, skipping insertion in model container [2025-01-09 09:22:38,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:38" (1/1) ... [2025-01-09 09:22:38,755 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:22:38,876 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-69.i[916,929] [2025-01-09 09:22:39,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:22:39,024 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:22:39,031 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-69.i[916,929] [2025-01-09 09:22:39,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:22:39,083 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:22:39,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:39 WrapperNode [2025-01-09 09:22:39,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:22:39,086 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:22:39,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:22:39,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:22:39,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:39" (1/1) ... [2025-01-09 09:22:39,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:39" (1/1) ... [2025-01-09 09:22:39,134 INFO L138 Inliner]: procedures = 26, calls = 85, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 393 [2025-01-09 09:22:39,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:22:39,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:22:39,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:22:39,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:22:39,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:39" (1/1) ... [2025-01-09 09:22:39,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:39" (1/1) ... [2025-01-09 09:22:39,150 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:39" (1/1) ... [2025-01-09 09:22:39,182 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 09:22:39,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:39" (1/1) ... [2025-01-09 09:22:39,182 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:39" (1/1) ... [2025-01-09 09:22:39,198 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:39" (1/1) ... [2025-01-09 09:22:39,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:39" (1/1) ... [2025-01-09 09:22:39,206 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:39" (1/1) ... [2025-01-09 09:22:39,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:39" (1/1) ... [2025-01-09 09:22:39,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:39" (1/1) ... [2025-01-09 09:22:39,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:22:39,224 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:22:39,225 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:22:39,225 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:22:39,226 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:39" (1/1) ... [2025-01-09 09:22:39,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:22:39,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:22:39,252 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 09:22:39,261 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 09:22:39,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:22:39,276 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:22:39,276 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:22:39,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:22:39,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:22:39,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:22:39,368 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:22:39,369 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:22:39,804 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-01-09 09:22:39,805 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:22:39,813 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:22:39,813 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:22:39,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:39 BoogieIcfgContainer [2025-01-09 09:22:39,814 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:22:39,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:22:39,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:22:39,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:22:39,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:22:38" (1/3) ... [2025-01-09 09:22:39,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5687b1e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:22:39, skipping insertion in model container [2025-01-09 09:22:39,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:39" (2/3) ... [2025-01-09 09:22:39,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5687b1e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:22:39, skipping insertion in model container [2025-01-09 09:22:39,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:39" (3/3) ... [2025-01-09 09:22:39,821 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-69.i [2025-01-09 09:22:39,831 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:22:39,834 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-69.i that has 2 procedures, 173 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:22:39,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:22:39,881 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;@bcdabbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:22:39,881 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:22:39,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 173 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 99 states have internal predecessors, (137), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 09:22:39,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-01-09 09:22:39,900 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:22:39,900 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:22:39,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:22:39,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:22:39,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1695453004, now seen corresponding path program 1 times [2025-01-09 09:22:39,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:22:39,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902402782] [2025-01-09 09:22:39,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:22:39,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:22:40,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-01-09 09:22:40,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-01-09 09:22:40,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:22:40,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:22:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2025-01-09 09:22:40,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:22:40,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902402782] [2025-01-09 09:22:40,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902402782] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:22:40,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764474155] [2025-01-09 09:22:40,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:22:40,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:22:40,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:22:40,298 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 09:22:40,299 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 09:22:40,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-01-09 09:22:40,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-01-09 09:22:40,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:22:40,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:22:40,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:22:40,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:22:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2025-01-09 09:22:40,629 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:22:40,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764474155] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:22:40,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:22:40,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:22:40,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915560923] [2025-01-09 09:22:40,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:22:40,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:22:40,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:22:40,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:22:40,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:22:40,686 INFO L87 Difference]: Start difference. First operand has 173 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 99 states have internal predecessors, (137), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) [2025-01-09 09:22:40,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:22:40,760 INFO L93 Difference]: Finished difference Result 340 states and 629 transitions. [2025-01-09 09:22:40,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:22:40,762 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) Word has length 434 [2025-01-09 09:22:40,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:22:40,776 INFO L225 Difference]: With dead ends: 340 [2025-01-09 09:22:40,777 INFO L226 Difference]: Without dead ends: 170 [2025-01-09 09:22:40,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 435 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 09:22:40,787 INFO L435 NwaCegarLoop]: 276 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, 276 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 09:22:40,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:22:40,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-09 09:22:40,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-01-09 09:22:40,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 96 states have (on average 1.375) internal successors, (132), 96 states have internal predecessors, (132), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 09:22:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 276 transitions. [2025-01-09 09:22:40,881 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 276 transitions. Word has length 434 [2025-01-09 09:22:40,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:22:40,881 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 276 transitions. [2025-01-09 09:22:40,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) [2025-01-09 09:22:40,884 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 276 transitions. [2025-01-09 09:22:40,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-01-09 09:22:40,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:22:40,896 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:22:40,905 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 09:22:41,097 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 09:22:41,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:22:41,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:22:41,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1510365236, now seen corresponding path program 1 times [2025-01-09 09:22:41,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:22:41,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676945963] [2025-01-09 09:22:41,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:22:41,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:22:41,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-01-09 09:22:41,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-01-09 09:22:41,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:22:41,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:22:41,481 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 09:22:41,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:22:41,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676945963] [2025-01-09 09:22:41,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676945963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:22:41,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:22:41,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:22:41,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859971858] [2025-01-09 09:22:41,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:22:41,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:22:41,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:22:41,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:22:41,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:22:41,486 INFO L87 Difference]: Start difference. First operand 170 states and 276 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:22:41,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:22:41,588 INFO L93 Difference]: Finished difference Result 437 states and 711 transitions. [2025-01-09 09:22:41,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:22:41,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 434 [2025-01-09 09:22:41,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:22:41,597 INFO L225 Difference]: With dead ends: 437 [2025-01-09 09:22:41,597 INFO L226 Difference]: Without dead ends: 270 [2025-01-09 09:22:41,598 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 09:22:41,601 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 153 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:22:41,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 681 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:22:41,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-01-09 09:22:41,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2025-01-09 09:22:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 163 states have (on average 1.4171779141104295) internal successors, (231), 164 states have internal predecessors, (231), 101 states have call successors, (101), 2 states have call predecessors, (101), 2 states have return successors, (101), 100 states have call predecessors, (101), 101 states have call successors, (101) [2025-01-09 09:22:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 433 transitions. [2025-01-09 09:22:41,651 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 433 transitions. Word has length 434 [2025-01-09 09:22:41,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:22:41,651 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 433 transitions. [2025-01-09 09:22:41,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:22:41,652 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 433 transitions. [2025-01-09 09:22:41,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-01-09 09:22:41,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:22:41,667 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:22:41,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:22:41,668 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:22:41,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:22:41,668 INFO L85 PathProgramCache]: Analyzing trace with hash -808765362, now seen corresponding path program 1 times [2025-01-09 09:22:41,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:22:41,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614418794] [2025-01-09 09:22:41,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:22:41,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:22:41,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-01-09 09:22:41,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-01-09 09:22:41,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:22:41,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:22:42,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 09:22:42,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:22:42,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614418794] [2025-01-09 09:22:42,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614418794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:22:42,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:22:42,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:22:42,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030036474] [2025-01-09 09:22:42,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:22:42,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:22:42,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:22:42,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:22:42,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:22:42,164 INFO L87 Difference]: Start difference. First operand 267 states and 433 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:22:42,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:22:42,344 INFO L93 Difference]: Finished difference Result 728 states and 1182 transitions. [2025-01-09 09:22:42,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:22:42,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 434 [2025-01-09 09:22:42,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:22:42,358 INFO L225 Difference]: With dead ends: 728 [2025-01-09 09:22:42,359 INFO L226 Difference]: Without dead ends: 464 [2025-01-09 09:22:42,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:22:42,362 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 165 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:22:42,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 713 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:22:42,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-01-09 09:22:42,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 461. [2025-01-09 09:22:42,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 293 states have (on average 1.4402730375426622) internal successors, (422), 296 states have internal predecessors, (422), 163 states have call successors, (163), 4 states have call predecessors, (163), 4 states have return successors, (163), 160 states have call predecessors, (163), 163 states have call successors, (163) [2025-01-09 09:22:42,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 748 transitions. [2025-01-09 09:22:42,431 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 748 transitions. Word has length 434 [2025-01-09 09:22:42,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:22:42,432 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 748 transitions. [2025-01-09 09:22:42,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:22:42,433 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 748 transitions. [2025-01-09 09:22:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-01-09 09:22:42,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:22:42,440 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:22:42,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:22:42,441 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:22:42,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:22:42,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1318238452, now seen corresponding path program 1 times [2025-01-09 09:22:42,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:22:42,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393869479] [2025-01-09 09:22:42,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:22:42,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:22:42,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-01-09 09:22:42,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-01-09 09:22:42,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:22:42,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:22:43,026 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 09:22:43,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:22:43,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393869479] [2025-01-09 09:22:43,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393869479] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:22:43,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:22:43,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 09:22:43,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419914366] [2025-01-09 09:22:43,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:22:43,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 09:22:43,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:22:43,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 09:22:43,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:22:43,028 INFO L87 Difference]: Start difference. First operand 461 states and 748 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:22:43,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:22:43,737 INFO L93 Difference]: Finished difference Result 1261 states and 2036 transitions. [2025-01-09 09:22:43,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:22:43,738 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 434 [2025-01-09 09:22:43,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:22:43,742 INFO L225 Difference]: With dead ends: 1261 [2025-01-09 09:22:43,742 INFO L226 Difference]: Without dead ends: 803 [2025-01-09 09:22:43,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:22:43,744 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 435 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:22:43,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1282 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 09:22:43,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-01-09 09:22:43,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 626. [2025-01-09 09:22:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 396 states have (on average 1.4318181818181819) internal successors, (567), 401 states have internal predecessors, (567), 223 states have call successors, (223), 6 states have call predecessors, (223), 6 states have return successors, (223), 218 states have call predecessors, (223), 223 states have call successors, (223) [2025-01-09 09:22:43,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 1013 transitions. [2025-01-09 09:22:43,808 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 1013 transitions. Word has length 434 [2025-01-09 09:22:43,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:22:43,809 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 1013 transitions. [2025-01-09 09:22:43,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:22:43,809 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 1013 transitions. [2025-01-09 09:22:43,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-01-09 09:22:43,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:22:43,813 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:22:43,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:22:43,813 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:22:43,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:22:43,814 INFO L85 PathProgramCache]: Analyzing trace with hash 982584138, now seen corresponding path program 1 times [2025-01-09 09:22:43,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:22:43,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779865693] [2025-01-09 09:22:43,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:22:43,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:22:43,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-01-09 09:22:43,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-01-09 09:22:43,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:22:43,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:22:44,109 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 09:22:44,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:22:44,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779865693] [2025-01-09 09:22:44,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779865693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:22:44,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:22:44,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:22:44,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865150330] [2025-01-09 09:22:44,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:22:44,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:22:44,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:22:44,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:22:44,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:22:44,111 INFO L87 Difference]: Start difference. First operand 626 states and 1013 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:22:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:22:44,593 INFO L93 Difference]: Finished difference Result 2126 states and 3439 transitions. [2025-01-09 09:22:44,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:22:44,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 434 [2025-01-09 09:22:44,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:22:44,606 INFO L225 Difference]: With dead ends: 2126 [2025-01-09 09:22:44,606 INFO L226 Difference]: Without dead ends: 1503 [2025-01-09 09:22:44,608 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 09:22:44,609 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 331 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:22:44,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 624 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:22:44,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2025-01-09 09:22:44,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 863. [2025-01-09 09:22:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 571 states have (on average 1.4728546409807355) internal successors, (841), 578 states have internal predecessors, (841), 283 states have call successors, (283), 8 states have call predecessors, (283), 8 states have return successors, (283), 276 states have call predecessors, (283), 283 states have call successors, (283) [2025-01-09 09:22:44,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1407 transitions. [2025-01-09 09:22:44,719 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1407 transitions. Word has length 434 [2025-01-09 09:22:44,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:22:44,719 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1407 transitions. [2025-01-09 09:22:44,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:22:44,722 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1407 transitions. [2025-01-09 09:22:44,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-01-09 09:22:44,729 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:22:44,729 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:22:44,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:22:44,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:22:44,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:22:44,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1201438856, now seen corresponding path program 1 times [2025-01-09 09:22:44,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:22:44,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686573360] [2025-01-09 09:22:44,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:22:44,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:22:44,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-01-09 09:22:44,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-01-09 09:22:44,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:22:44,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:22:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 09:22:44,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:22:44,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686573360] [2025-01-09 09:22:44,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686573360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:22:44,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:22:44,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:22:44,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997631580] [2025-01-09 09:22:44,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:22:44,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:22:44,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:22:44,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:22:44,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:22:44,964 INFO L87 Difference]: Start difference. First operand 863 states and 1407 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) [2025-01-09 09:22:45,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:22:45,151 INFO L93 Difference]: Finished difference Result 2583 states and 4215 transitions. [2025-01-09 09:22:45,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:22:45,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) Word has length 434 [2025-01-09 09:22:45,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:22:45,161 INFO L225 Difference]: With dead ends: 2583 [2025-01-09 09:22:45,161 INFO L226 Difference]: Without dead ends: 1723 [2025-01-09 09:22:45,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:22:45,164 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 221 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:22:45,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 851 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:22:45,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2025-01-09 09:22:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1721. [2025-01-09 09:22:45,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1138 states have (on average 1.4657293497363797) internal successors, (1668), 1152 states have internal predecessors, (1668), 566 states have call successors, (566), 16 states have call predecessors, (566), 16 states have return successors, (566), 552 states have call predecessors, (566), 566 states have call successors, (566) [2025-01-09 09:22:45,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2800 transitions. [2025-01-09 09:22:45,370 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2800 transitions. Word has length 434 [2025-01-09 09:22:45,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:22:45,371 INFO L471 AbstractCegarLoop]: Abstraction has 1721 states and 2800 transitions. [2025-01-09 09:22:45,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) [2025-01-09 09:22:45,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2800 transitions. [2025-01-09 09:22:45,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-01-09 09:22:45,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:22:45,374 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:22:45,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:22:45,375 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:22:45,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:22:45,375 INFO L85 PathProgramCache]: Analyzing trace with hash 158907714, now seen corresponding path program 1 times [2025-01-09 09:22:45,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:22:45,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746402169] [2025-01-09 09:22:45,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:22:45,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:22:45,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-01-09 09:22:45,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-01-09 09:22:45,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:22:45,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:22:45,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 09:22:45,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:22:45,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746402169] [2025-01-09 09:22:45,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746402169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:22:45,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:22:45,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:22:45,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671943993] [2025-01-09 09:22:45,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:22:45,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:22:45,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:22:45,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:22:45,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:22:45,858 INFO L87 Difference]: Start difference. First operand 1721 states and 2800 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:22:46,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:22:46,236 INFO L93 Difference]: Finished difference Result 3327 states and 5377 transitions. [2025-01-09 09:22:46,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:22:46,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 435 [2025-01-09 09:22:46,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:22:46,253 INFO L225 Difference]: With dead ends: 3327 [2025-01-09 09:22:46,254 INFO L226 Difference]: Without dead ends: 2467 [2025-01-09 09:22:46,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 09:22:46,259 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 169 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:22:46,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 524 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:22:46,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2025-01-09 09:22:46,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2457. [2025-01-09 09:22:46,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2457 states, 1598 states have (on average 1.4267834793491865) internal successors, (2280), 1620 states have internal predecessors, (2280), 826 states have call successors, (826), 32 states have call predecessors, (826), 32 states have return successors, (826), 804 states have call predecessors, (826), 826 states have call successors, (826) [2025-01-09 09:22:46,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3932 transitions. [2025-01-09 09:22:46,530 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3932 transitions. Word has length 435 [2025-01-09 09:22:46,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:22:46,531 INFO L471 AbstractCegarLoop]: Abstraction has 2457 states and 3932 transitions. [2025-01-09 09:22:46,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:22:46,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3932 transitions. [2025-01-09 09:22:46,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-01-09 09:22:46,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:22:46,534 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:22:46,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:22:46,534 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:22:46,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:22:46,535 INFO L85 PathProgramCache]: Analyzing trace with hash 33393081, now seen corresponding path program 1 times [2025-01-09 09:22:46,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:22:46,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904542827] [2025-01-09 09:22:46,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:22:46,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:22:46,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-01-09 09:22:46,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-01-09 09:22:46,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:22:46,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:22:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 09:22:46,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:22:46,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904542827] [2025-01-09 09:22:46,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904542827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:22:46,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:22:46,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 09:22:46,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406940968] [2025-01-09 09:22:46,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:22:46,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 09:22:46,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:22:46,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 09:22:46,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:22:46,997 INFO L87 Difference]: Start difference. First operand 2457 states and 3932 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:22:48,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:22:48,270 INFO L93 Difference]: Finished difference Result 7773 states and 12414 transitions. [2025-01-09 09:22:48,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:22:48,271 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 435 [2025-01-09 09:22:48,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:22:48,306 INFO L225 Difference]: With dead ends: 7773 [2025-01-09 09:22:48,306 INFO L226 Difference]: Without dead ends: 5319 [2025-01-09 09:22:48,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:22:48,318 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 544 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:22:48,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1085 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 09:22:48,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5319 states. [2025-01-09 09:22:48,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5319 to 5297. [2025-01-09 09:22:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5297 states, 3438 states have (on average 1.4223385689354275) internal successors, (4890), 3486 states have internal predecessors, (4890), 1784 states have call successors, (1784), 74 states have call predecessors, (1784), 74 states have return successors, (1784), 1736 states have call predecessors, (1784), 1784 states have call successors, (1784) [2025-01-09 09:22:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5297 states to 5297 states and 8458 transitions. [2025-01-09 09:22:48,985 INFO L78 Accepts]: Start accepts. Automaton has 5297 states and 8458 transitions. Word has length 435 [2025-01-09 09:22:48,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:22:48,985 INFO L471 AbstractCegarLoop]: Abstraction has 5297 states and 8458 transitions. [2025-01-09 09:22:48,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:22:48,985 INFO L276 IsEmpty]: Start isEmpty. Operand 5297 states and 8458 transitions. [2025-01-09 09:22:48,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-01-09 09:22:48,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:22:48,990 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:22:48,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:22:48,990 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:22:48,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:22:48,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1316528003, now seen corresponding path program 1 times [2025-01-09 09:22:48,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:22:48,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407805409] [2025-01-09 09:22:48,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:22:48,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:22:49,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-01-09 09:22:49,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-01-09 09:22:49,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:22:49,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:22:49,299 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 09:22:49,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:22:49,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407805409] [2025-01-09 09:22:49,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407805409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:22:49,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:22:49,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:22:49,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068185186] [2025-01-09 09:22:49,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:22:49,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:22:49,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:22:49,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:22:49,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:22:49,301 INFO L87 Difference]: Start difference. First operand 5297 states and 8458 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:22:50,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:22:50,578 INFO L93 Difference]: Finished difference Result 11062 states and 17594 transitions. [2025-01-09 09:22:50,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:22:50,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 435 [2025-01-09 09:22:50,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:22:50,615 INFO L225 Difference]: With dead ends: 11062 [2025-01-09 09:22:50,615 INFO L226 Difference]: Without dead ends: 8608 [2025-01-09 09:22:50,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:22:50,621 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 302 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:22:50,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 1368 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:22:50,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8608 states. [2025-01-09 09:22:51,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8608 to 5894. [2025-01-09 09:22:51,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5894 states, 3773 states have (on average 1.4102835939570633) internal successors, (5321), 3829 states have internal predecessors, (5321), 2032 states have call successors, (2032), 88 states have call predecessors, (2032), 88 states have return successors, (2032), 1976 states have call predecessors, (2032), 2032 states have call successors, (2032) [2025-01-09 09:22:51,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5894 states to 5894 states and 9385 transitions. [2025-01-09 09:22:51,191 INFO L78 Accepts]: Start accepts. Automaton has 5894 states and 9385 transitions. Word has length 435 [2025-01-09 09:22:51,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:22:51,192 INFO L471 AbstractCegarLoop]: Abstraction has 5894 states and 9385 transitions. [2025-01-09 09:22:51,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:22:51,193 INFO L276 IsEmpty]: Start isEmpty. Operand 5894 states and 9385 transitions. [2025-01-09 09:22:51,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-01-09 09:22:51,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:22:51,201 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:22:51,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:22:51,202 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:22:51,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:22:51,202 INFO L85 PathProgramCache]: Analyzing trace with hash 984294587, now seen corresponding path program 1 times [2025-01-09 09:22:51,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:22:51,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350283825] [2025-01-09 09:22:51,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:22:51,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:22:51,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-01-09 09:22:51,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-01-09 09:22:51,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:22:51,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:22:51,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 09:22:51,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:22:51,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350283825] [2025-01-09 09:22:51,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350283825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:22:51,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:22:51,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:22:51,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744969743] [2025-01-09 09:22:51,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:22:51,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:22:51,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:22:51,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:22:51,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:22:51,552 INFO L87 Difference]: Start difference. First operand 5894 states and 9385 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:22:52,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:22:52,376 INFO L93 Difference]: Finished difference Result 11811 states and 18803 transitions. [2025-01-09 09:22:52,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:22:52,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 435 [2025-01-09 09:22:52,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:22:52,428 INFO L225 Difference]: With dead ends: 11811 [2025-01-09 09:22:52,429 INFO L226 Difference]: Without dead ends: 5920 [2025-01-09 09:22:52,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 09:22:52,450 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 385 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:22:52,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 902 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:22:52,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5920 states. [2025-01-09 09:22:53,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5920 to 5789. [2025-01-09 09:22:53,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5789 states, 3668 states have (on average 1.401308615049073) internal successors, (5140), 3724 states have internal predecessors, (5140), 2032 states have call successors, (2032), 88 states have call predecessors, (2032), 88 states have return successors, (2032), 1976 states have call predecessors, (2032), 2032 states have call successors, (2032) [2025-01-09 09:22:53,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5789 states to 5789 states and 9204 transitions. [2025-01-09 09:22:53,156 INFO L78 Accepts]: Start accepts. Automaton has 5789 states and 9204 transitions. Word has length 435 [2025-01-09 09:22:53,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:22:53,157 INFO L471 AbstractCegarLoop]: Abstraction has 5789 states and 9204 transitions. [2025-01-09 09:22:53,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:22:53,158 INFO L276 IsEmpty]: Start isEmpty. Operand 5789 states and 9204 transitions. [2025-01-09 09:22:53,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-01-09 09:22:53,162 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:22:53,162 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:22:53,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:22:53,162 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:22:53,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:22:53,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1464547069, now seen corresponding path program 1 times [2025-01-09 09:22:53,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:22:53,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055361281] [2025-01-09 09:22:53,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:22:53,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:22:53,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-01-09 09:22:53,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-01-09 09:22:53,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:22:53,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:22:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 156 proven. 57 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-01-09 09:22:54,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:22:54,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055361281] [2025-01-09 09:22:54,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055361281] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:22:54,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341594870] [2025-01-09 09:22:54,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:22:54,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:22:54,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:22:54,282 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 09:22:54,283 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 09:22:54,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-01-09 09:22:54,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-01-09 09:22:54,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:22:54,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:22:54,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 09:22:54,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:22:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 5502 proven. 324 refuted. 0 times theorem prover too weak. 4398 trivial. 0 not checked. [2025-01-09 09:22:56,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:22:58,895 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 297 proven. 333 refuted. 0 times theorem prover too weak. 9594 trivial. 0 not checked. [2025-01-09 09:22:58,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341594870] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:22:58,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:22:58,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 18] total 37 [2025-01-09 09:22:58,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064032545] [2025-01-09 09:22:58,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:22:58,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 09:22:58,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:22:58,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 09:22:58,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 09:22:58,898 INFO L87 Difference]: Start difference. First operand 5789 states and 9204 transitions. Second operand has 37 states, 37 states have (on average 5.513513513513513) internal successors, (204), 37 states have internal predecessors, (204), 11 states have call successors, (183), 4 states have call predecessors, (183), 10 states have return successors, (184), 11 states have call predecessors, (184), 11 states have call successors, (184) [2025-01-09 09:23:25,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:23:25,946 INFO L93 Difference]: Finished difference Result 37110 states and 57768 transitions. [2025-01-09 09:23:25,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2025-01-09 09:23:25,947 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 5.513513513513513) internal successors, (204), 37 states have internal predecessors, (204), 11 states have call successors, (183), 4 states have call predecessors, (183), 10 states have return successors, (184), 11 states have call predecessors, (184), 11 states have call successors, (184) Word has length 436 [2025-01-09 09:23:25,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:23:26,061 INFO L225 Difference]: With dead ends: 37110 [2025-01-09 09:23:26,062 INFO L226 Difference]: Without dead ends: 31324 [2025-01-09 09:23:26,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1149 GetRequests, 889 SyntacticMatches, 0 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27988 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=12377, Invalid=56005, Unknown=0, NotChecked=0, Total=68382 [2025-01-09 09:23:26,097 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 5490 mSDsluCounter, 4286 mSDsCounter, 0 mSdLazyCounter, 6966 mSolverCounterSat, 4380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5552 SdHoareTripleChecker+Valid, 4846 SdHoareTripleChecker+Invalid, 11346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4380 IncrementalHoareTripleChecker+Valid, 6966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:23:26,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5552 Valid, 4846 Invalid, 11346 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4380 Valid, 6966 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2025-01-09 09:23:26,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31324 states. [2025-01-09 09:23:27,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31324 to 4312. [2025-01-09 09:23:27,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4312 states, 3187 states have (on average 1.474427361154691) internal successors, (4699), 3203 states have internal predecessors, (4699), 1056 states have call successors, (1056), 68 states have call predecessors, (1056), 68 states have return successors, (1056), 1040 states have call predecessors, (1056), 1056 states have call successors, (1056) [2025-01-09 09:23:27,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4312 states to 4312 states and 6811 transitions. [2025-01-09 09:23:27,545 INFO L78 Accepts]: Start accepts. Automaton has 4312 states and 6811 transitions. Word has length 436 [2025-01-09 09:23:27,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:23:27,546 INFO L471 AbstractCegarLoop]: Abstraction has 4312 states and 6811 transitions. [2025-01-09 09:23:27,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.513513513513513) internal successors, (204), 37 states have internal predecessors, (204), 11 states have call successors, (183), 4 states have call predecessors, (183), 10 states have return successors, (184), 11 states have call predecessors, (184), 11 states have call successors, (184) [2025-01-09 09:23:27,546 INFO L276 IsEmpty]: Start isEmpty. Operand 4312 states and 6811 transitions. [2025-01-09 09:23:27,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-01-09 09:23:27,549 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:23:27,549 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:23:27,558 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 09:23:27,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:23:27,754 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:23:27,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:23:27,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1908565181, now seen corresponding path program 1 times [2025-01-09 09:23:27,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:23:27,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934355015] [2025-01-09 09:23:27,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:23:27,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:23:27,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-01-09 09:23:27,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-01-09 09:23:27,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:23:27,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:23:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 09:23:28,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:23:28,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934355015] [2025-01-09 09:23:28,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934355015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:23:28,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:23:28,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 09:23:28,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998142729] [2025-01-09 09:23:28,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:23:28,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 09:23:28,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:23:28,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 09:23:28,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:23:28,287 INFO L87 Difference]: Start difference. First operand 4312 states and 6811 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:23:32,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:23:32,137 INFO L93 Difference]: Finished difference Result 12934 states and 20427 transitions. [2025-01-09 09:23:32,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 09:23:32,138 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 436 [2025-01-09 09:23:32,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:23:32,210 INFO L225 Difference]: With dead ends: 12934 [2025-01-09 09:23:32,211 INFO L226 Difference]: Without dead ends: 10857 [2025-01-09 09:23:32,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:23:32,225 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 809 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:23:32,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1767 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 09:23:32,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10857 states. [2025-01-09 09:23:33,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10857 to 6456. [2025-01-09 09:23:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6456 states, 4771 states have (on average 1.4877384196185286) internal successors, (7098), 4795 states have internal predecessors, (7098), 1584 states have call successors, (1584), 100 states have call predecessors, (1584), 100 states have return successors, (1584), 1560 states have call predecessors, (1584), 1584 states have call successors, (1584) [2025-01-09 09:23:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6456 states to 6456 states and 10266 transitions. [2025-01-09 09:23:33,708 INFO L78 Accepts]: Start accepts. Automaton has 6456 states and 10266 transitions. Word has length 436 [2025-01-09 09:23:33,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:23:33,712 INFO L471 AbstractCegarLoop]: Abstraction has 6456 states and 10266 transitions. [2025-01-09 09:23:33,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:23:33,713 INFO L276 IsEmpty]: Start isEmpty. Operand 6456 states and 10266 transitions. [2025-01-09 09:23:33,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-01-09 09:23:33,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:23:33,720 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:23:33,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 09:23:33,721 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:23:33,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:23:33,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1330802254, now seen corresponding path program 1 times [2025-01-09 09:23:33,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:23:33,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067906698] [2025-01-09 09:23:33,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:23:33,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:23:33,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-01-09 09:23:33,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-01-09 09:23:33,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:23:33,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:23:33,986 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 09:23:33,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:23:33,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067906698] [2025-01-09 09:23:33,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067906698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:23:33,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:23:33,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:23:33,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124477620] [2025-01-09 09:23:33,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:23:33,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:23:33,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:23:33,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:23:33,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:23:33,988 INFO L87 Difference]: Start difference. First operand 6456 states and 10266 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:23:36,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:23:36,819 INFO L93 Difference]: Finished difference Result 16019 states and 25464 transitions. [2025-01-09 09:23:36,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:23:36,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 436 [2025-01-09 09:23:36,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:23:36,849 INFO L225 Difference]: With dead ends: 16019 [2025-01-09 09:23:36,849 INFO L226 Difference]: Without dead ends: 9566 [2025-01-09 09:23:36,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 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 09:23:36,861 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 468 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:23:36,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 663 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:23:36,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9566 states. [2025-01-09 09:23:38,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9566 to 6512. [2025-01-09 09:23:38,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6512 states, 4827 states have (on average 1.4866376631448104) internal successors, (7176), 4851 states have internal predecessors, (7176), 1584 states have call successors, (1584), 100 states have call predecessors, (1584), 100 states have return successors, (1584), 1560 states have call predecessors, (1584), 1584 states have call successors, (1584) [2025-01-09 09:23:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 10344 transitions. [2025-01-09 09:23:38,565 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 10344 transitions. Word has length 436 [2025-01-09 09:23:38,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:23:38,565 INFO L471 AbstractCegarLoop]: Abstraction has 6512 states and 10344 transitions. [2025-01-09 09:23:38,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:23:38,567 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 10344 transitions. [2025-01-09 09:23:38,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-01-09 09:23:38,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:23:38,571 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:23:38,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 09:23:38,571 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:23:38,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:23:38,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1799577729, now seen corresponding path program 1 times [2025-01-09 09:23:38,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:23:38,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195139853] [2025-01-09 09:23:38,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:23:38,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:23:38,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-01-09 09:23:38,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-01-09 09:23:38,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:23:38,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:23:39,040 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 09:23:39,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:23:39,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195139853] [2025-01-09 09:23:39,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195139853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:23:39,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:23:39,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 09:23:39,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598634781] [2025-01-09 09:23:39,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:23:39,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:23:39,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:23:39,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:23:39,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:23:39,043 INFO L87 Difference]: Start difference. First operand 6512 states and 10344 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:23:42,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:23:42,186 INFO L93 Difference]: Finished difference Result 13229 states and 20929 transitions. [2025-01-09 09:23:42,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 09:23:42,186 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 436 [2025-01-09 09:23:42,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:23:42,238 INFO L225 Difference]: With dead ends: 13229 [2025-01-09 09:23:42,241 INFO L226 Difference]: Without dead ends: 10095 [2025-01-09 09:23:42,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:23:42,258 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 633 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:23:42,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 1676 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 09:23:42,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10095 states. [2025-01-09 09:23:44,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10095 to 6544. [2025-01-09 09:23:44,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6544 states, 4859 states have (on average 1.4859024490635933) internal successors, (7220), 4883 states have internal predecessors, (7220), 1584 states have call successors, (1584), 100 states have call predecessors, (1584), 100 states have return successors, (1584), 1560 states have call predecessors, (1584), 1584 states have call successors, (1584) [2025-01-09 09:23:44,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6544 states to 6544 states and 10388 transitions. [2025-01-09 09:23:44,158 INFO L78 Accepts]: Start accepts. Automaton has 6544 states and 10388 transitions. Word has length 436 [2025-01-09 09:23:44,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:23:44,159 INFO L471 AbstractCegarLoop]: Abstraction has 6544 states and 10388 transitions. [2025-01-09 09:23:44,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:23:44,159 INFO L276 IsEmpty]: Start isEmpty. Operand 6544 states and 10388 transitions. [2025-01-09 09:23:44,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-01-09 09:23:44,162 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:23:44,162 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:23:44,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 09:23:44,162 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:23:44,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:23:44,163 INFO L85 PathProgramCache]: Analyzing trace with hash -142568059, now seen corresponding path program 1 times [2025-01-09 09:23:44,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:23:44,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282377029] [2025-01-09 09:23:44,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:23:44,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:23:44,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-01-09 09:23:44,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-01-09 09:23:44,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:23:44,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:23:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 402 proven. 414 refuted. 0 times theorem prover too weak. 9408 trivial. 0 not checked. [2025-01-09 09:23:45,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:23:45,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282377029] [2025-01-09 09:23:45,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282377029] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:23:45,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708671670] [2025-01-09 09:23:45,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:23:45,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:23:45,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:23:45,194 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 09:23:45,196 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 09:23:45,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-01-09 09:23:45,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-01-09 09:23:45,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:23:45,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:23:45,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 09:23:45,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:23:47,266 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 5679 proven. 414 refuted. 0 times theorem prover too weak. 4131 trivial. 0 not checked. [2025-01-09 09:23:47,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:23:51,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 402 proven. 432 refuted. 0 times theorem prover too weak. 9390 trivial. 0 not checked. [2025-01-09 09:23:51,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708671670] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:23:51,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:23:51,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 20] total 40 [2025-01-09 09:23:51,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511072206] [2025-01-09 09:23:51,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:23:51,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-01-09 09:23:51,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:23:51,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-01-09 09:23:51,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=1244, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 09:23:51,359 INFO L87 Difference]: Start difference. First operand 6544 states and 10388 transitions. Second operand has 40 states, 40 states have (on average 4.8) internal successors, (192), 40 states have internal predecessors, (192), 11 states have call successors, (150), 5 states have call predecessors, (150), 13 states have return successors, (151), 11 states have call predecessors, (151), 11 states have call successors, (151)