./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-13.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-250_file-13.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 3aed15da12260a7de82b1d58a50eef3670797f2722612a66426441482ea1c194 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:39:19,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:39:19,126 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:39:19,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:39:19,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:39:19,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:39:19,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:39:19,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:39:19,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:39:19,168 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:39:19,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:39:19,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:39:19,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:39:19,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:39:19,170 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:39:19,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:39:19,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:39:19,170 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:39:19,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:39:19,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:39:19,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:39:19,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:39:19,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:39:19,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:39:19,171 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:39:19,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:39:19,171 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:39:19,171 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:39:19,171 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:39:19,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:39:19,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:39:19,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:39:19,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:39:19,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:39:19,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:39:19,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:39:19,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:39:19,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:39:19,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:39:19,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:39:19,172 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:39:19,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:39:19,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:39:19,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:39:19,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:39:19,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:39:19,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:39:19,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:39:19,172 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 -> 3aed15da12260a7de82b1d58a50eef3670797f2722612a66426441482ea1c194 [2025-01-09 09:39:19,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:39:19,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:39:19,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:39:19,539 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:39:19,540 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:39:19,543 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-13.i [2025-01-09 09:39:20,947 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7ac2e87d/67409269c0cd434c977d29e829d3ae96/FLAG228ef1611 [2025-01-09 09:39:21,253 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:39:21,254 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-13.i [2025-01-09 09:39:21,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7ac2e87d/67409269c0cd434c977d29e829d3ae96/FLAG228ef1611 [2025-01-09 09:39:21,279 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7ac2e87d/67409269c0cd434c977d29e829d3ae96 [2025-01-09 09:39:21,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:39:21,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:39:21,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:39:21,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:39:21,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:39:21,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:39:21" (1/1) ... [2025-01-09 09:39:21,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ed6cccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:21, skipping insertion in model container [2025-01-09 09:39:21,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:39:21" (1/1) ... [2025-01-09 09:39:21,335 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:39:21,460 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-13.i[916,929] [2025-01-09 09:39:21,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:39:21,608 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:39:21,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-13.i[916,929] [2025-01-09 09:39:21,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:39:21,733 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:39:21,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:21 WrapperNode [2025-01-09 09:39:21,734 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:39:21,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:39:21,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:39:21,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:39:21,741 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:39:21" (1/1) ... [2025-01-09 09:39:21,755 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:39:21" (1/1) ... [2025-01-09 09:39:21,824 INFO L138 Inliner]: procedures = 26, calls = 96, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 577 [2025-01-09 09:39:21,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:39:21,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:39:21,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:39:21,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:39:21,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:21" (1/1) ... [2025-01-09 09:39:21,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:21" (1/1) ... [2025-01-09 09:39:21,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:21" (1/1) ... [2025-01-09 09:39:21,893 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:39:21,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:21" (1/1) ... [2025-01-09 09:39:21,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:21" (1/1) ... [2025-01-09 09:39:21,921 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:21" (1/1) ... [2025-01-09 09:39:21,930 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:21" (1/1) ... [2025-01-09 09:39:21,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:21" (1/1) ... [2025-01-09 09:39:21,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:21" (1/1) ... [2025-01-09 09:39:21,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:21" (1/1) ... [2025-01-09 09:39:21,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:39:21,970 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:39:21,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:39:21,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:39:21,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:21" (1/1) ... [2025-01-09 09:39:21,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:39:21,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:39:22,011 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:39:22,016 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:39:22,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:39:22,040 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:39:22,040 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:39:22,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:39:22,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:39:22,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:39:22,190 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:39:22,192 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:39:23,203 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-09 09:39:23,204 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:39:23,226 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:39:23,230 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:39:23,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:23 BoogieIcfgContainer [2025-01-09 09:39:23,230 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:39:23,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:39:23,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:39:23,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:39:23,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:39:21" (1/3) ... [2025-01-09 09:39:23,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e95d61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:39:23, skipping insertion in model container [2025-01-09 09:39:23,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:21" (2/3) ... [2025-01-09 09:39:23,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e95d61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:39:23, skipping insertion in model container [2025-01-09 09:39:23,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:23" (3/3) ... [2025-01-09 09:39:23,241 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-13.i [2025-01-09 09:39:23,256 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:39:23,259 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-13.i that has 2 procedures, 240 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:39:23,336 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:39:23,350 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;@4c80c2d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:39:23,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:39:23,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 154 states have (on average 1.5129870129870129) internal successors, (233), 155 states have internal predecessors, (233), 83 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 09:39:23,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2025-01-09 09:39:23,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:23,388 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:23,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:23,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:23,395 INFO L85 PathProgramCache]: Analyzing trace with hash -122475395, now seen corresponding path program 1 times [2025-01-09 09:39:23,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:23,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079463434] [2025-01-09 09:39:23,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:23,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:23,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-01-09 09:39:23,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-01-09 09:39:23,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:23,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:24,113 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 13448 trivial. 0 not checked. [2025-01-09 09:39:24,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:24,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079463434] [2025-01-09 09:39:24,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079463434] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:39:24,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118035810] [2025-01-09 09:39:24,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:24,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:39:24,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:39:24,119 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:39:24,121 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:39:24,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-01-09 09:39:24,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-01-09 09:39:24,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:24,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:24,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:39:24,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:39:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 13448 trivial. 0 not checked. [2025-01-09 09:39:24,631 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:39:24,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118035810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:39:24,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:39:24,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:39:24,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270681482] [2025-01-09 09:39:24,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:39:24,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:39:24,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:24,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:39:24,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:39:24,667 INFO L87 Difference]: Start difference. First operand has 240 states, 154 states have (on average 1.5129870129870129) internal successors, (233), 155 states have internal predecessors, (233), 83 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) Second operand has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (83), 2 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 2 states have call successors, (83) [2025-01-09 09:39:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:24,720 INFO L93 Difference]: Finished difference Result 473 states and 874 transitions. [2025-01-09 09:39:24,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:39:24,722 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (83), 2 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 2 states have call successors, (83) Word has length 525 [2025-01-09 09:39:24,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:24,734 INFO L225 Difference]: With dead ends: 473 [2025-01-09 09:39:24,734 INFO L226 Difference]: Without dead ends: 236 [2025-01-09 09:39:24,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 526 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:39:24,742 INFO L435 NwaCegarLoop]: 390 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, 390 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:39:24,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:39:24,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-01-09 09:39:24,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-01-09 09:39:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 151 states have (on average 1.4834437086092715) internal successors, (224), 151 states have internal predecessors, (224), 83 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 09:39:24,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 390 transitions. [2025-01-09 09:39:24,835 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 390 transitions. Word has length 525 [2025-01-09 09:39:24,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:24,838 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 390 transitions. [2025-01-09 09:39:24,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (83), 2 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 2 states have call successors, (83) [2025-01-09 09:39:24,839 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 390 transitions. [2025-01-09 09:39:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2025-01-09 09:39:24,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:24,854 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:24,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 09:39:25,058 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:39:25,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:25,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:25,060 INFO L85 PathProgramCache]: Analyzing trace with hash -958930829, now seen corresponding path program 1 times [2025-01-09 09:39:25,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:25,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879962388] [2025-01-09 09:39:25,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:25,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:25,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-01-09 09:39:25,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-01-09 09:39:25,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:25,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:25,622 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-01-09 09:39:25,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:25,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879962388] [2025-01-09 09:39:25,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879962388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:39:25,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:39:25,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:39:25,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817627913] [2025-01-09 09:39:25,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:39:25,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:39:25,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:25,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:39:25,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:39:25,631 INFO L87 Difference]: Start difference. First operand 236 states and 390 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 09:39:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:25,761 INFO L93 Difference]: Finished difference Result 693 states and 1148 transitions. [2025-01-09 09:39:25,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:39:25,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 525 [2025-01-09 09:39:25,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:25,772 INFO L225 Difference]: With dead ends: 693 [2025-01-09 09:39:25,772 INFO L226 Difference]: Without dead ends: 460 [2025-01-09 09:39:25,775 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:39:25,776 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 348 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:39:25,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 770 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:39:25,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-01-09 09:39:25,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 458. [2025-01-09 09:39:25,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 289 states have (on average 1.4567474048442905) internal successors, (421), 289 states have internal predecessors, (421), 166 states have call successors, (166), 2 states have call predecessors, (166), 2 states have return successors, (166), 166 states have call predecessors, (166), 166 states have call successors, (166) [2025-01-09 09:39:25,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 753 transitions. [2025-01-09 09:39:25,873 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 753 transitions. Word has length 525 [2025-01-09 09:39:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:25,876 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 753 transitions. [2025-01-09 09:39:25,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 09:39:25,877 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 753 transitions. [2025-01-09 09:39:25,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2025-01-09 09:39:25,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:25,888 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:25,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:39:25,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:25,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:25,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1934036072, now seen corresponding path program 1 times [2025-01-09 09:39:25,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:25,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535989746] [2025-01-09 09:39:25,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:25,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:25,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 526 statements into 1 equivalence classes. [2025-01-09 09:39:26,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 526 of 526 statements. [2025-01-09 09:39:26,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:26,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:26,357 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-01-09 09:39:26,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:26,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535989746] [2025-01-09 09:39:26,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535989746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:39:26,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:39:26,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:39:26,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914064873] [2025-01-09 09:39:26,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:39:26,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:39:26,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:26,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:39:26,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:39:26,361 INFO L87 Difference]: Start difference. First operand 458 states and 753 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 09:39:26,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:26,442 INFO L93 Difference]: Finished difference Result 979 states and 1594 transitions. [2025-01-09 09:39:26,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:39:26,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 526 [2025-01-09 09:39:26,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:26,455 INFO L225 Difference]: With dead ends: 979 [2025-01-09 09:39:26,455 INFO L226 Difference]: Without dead ends: 524 [2025-01-09 09:39:26,457 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:39:26,457 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 39 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:39:26,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 803 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:39:26,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-01-09 09:39:26,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 520. [2025-01-09 09:39:26,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 337 states have (on average 1.4332344213649852) internal successors, (483), 339 states have internal predecessors, (483), 178 states have call successors, (178), 4 states have call predecessors, (178), 4 states have return successors, (178), 176 states have call predecessors, (178), 178 states have call successors, (178) [2025-01-09 09:39:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 839 transitions. [2025-01-09 09:39:26,547 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 839 transitions. Word has length 526 [2025-01-09 09:39:26,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:26,549 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 839 transitions. [2025-01-09 09:39:26,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 09:39:26,550 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 839 transitions. [2025-01-09 09:39:26,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2025-01-09 09:39:26,562 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:26,563 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:26,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:39:26,563 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:26,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:26,564 INFO L85 PathProgramCache]: Analyzing trace with hash 654172394, now seen corresponding path program 1 times [2025-01-09 09:39:26,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:26,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140347155] [2025-01-09 09:39:26,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:26,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:26,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 526 statements into 1 equivalence classes. [2025-01-09 09:39:26,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 526 of 526 statements. [2025-01-09 09:39:26,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:26,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:27,730 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-01-09 09:39:27,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:27,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140347155] [2025-01-09 09:39:27,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140347155] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:39:27,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:39:27,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:39:27,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457269013] [2025-01-09 09:39:27,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:39:27,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:39:27,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:27,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:39:27,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:39:27,744 INFO L87 Difference]: Start difference. First operand 520 states and 839 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 09:39:28,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:28,856 INFO L93 Difference]: Finished difference Result 1392 states and 2257 transitions. [2025-01-09 09:39:28,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:39:28,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 526 [2025-01-09 09:39:28,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:28,868 INFO L225 Difference]: With dead ends: 1392 [2025-01-09 09:39:28,868 INFO L226 Difference]: Without dead ends: 875 [2025-01-09 09:39:28,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:39:28,873 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 336 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:39:28,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1551 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 09:39:28,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-01-09 09:39:29,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 793. [2025-01-09 09:39:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 526 states have (on average 1.4828897338403042) internal successors, (780), 528 states have internal predecessors, (780), 261 states have call successors, (261), 5 states have call predecessors, (261), 5 states have return successors, (261), 259 states have call predecessors, (261), 261 states have call successors, (261) [2025-01-09 09:39:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1302 transitions. [2025-01-09 09:39:29,047 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1302 transitions. Word has length 526 [2025-01-09 09:39:29,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:29,048 INFO L471 AbstractCegarLoop]: Abstraction has 793 states and 1302 transitions. [2025-01-09 09:39:29,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 09:39:29,048 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1302 transitions. [2025-01-09 09:39:29,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-01-09 09:39:29,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:29,058 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:29,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:39:29,058 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:29,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:29,059 INFO L85 PathProgramCache]: Analyzing trace with hash 908282588, now seen corresponding path program 1 times [2025-01-09 09:39:29,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:29,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419545901] [2025-01-09 09:39:29,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:29,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:29,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-01-09 09:39:29,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-01-09 09:39:29,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:29,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-01-09 09:39:30,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:30,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419545901] [2025-01-09 09:39:30,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419545901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:39:30,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:39:30,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:39:30,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354040586] [2025-01-09 09:39:30,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:39:30,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:39:30,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:30,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:39:30,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:39:30,108 INFO L87 Difference]: Start difference. First operand 793 states and 1302 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 09:39:30,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:30,417 INFO L93 Difference]: Finished difference Result 1839 states and 3024 transitions. [2025-01-09 09:39:30,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:39:30,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 527 [2025-01-09 09:39:30,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:30,433 INFO L225 Difference]: With dead ends: 1839 [2025-01-09 09:39:30,433 INFO L226 Difference]: Without dead ends: 1215 [2025-01-09 09:39:30,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:39:30,439 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 389 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:39:30,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1224 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:39:30,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2025-01-09 09:39:30,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1157. [2025-01-09 09:39:30,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 829 states have (on average 1.5102533172496984) internal successors, (1252), 835 states have internal predecessors, (1252), 317 states have call successors, (317), 10 states have call predecessors, (317), 10 states have return successors, (317), 311 states have call predecessors, (317), 317 states have call successors, (317) [2025-01-09 09:39:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1886 transitions. [2025-01-09 09:39:30,617 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1886 transitions. Word has length 527 [2025-01-09 09:39:30,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:30,619 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1886 transitions. [2025-01-09 09:39:30,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 09:39:30,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1886 transitions. [2025-01-09 09:39:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-01-09 09:39:30,626 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:30,627 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:30,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:39:30,627 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:30,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:30,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1592425512, now seen corresponding path program 1 times [2025-01-09 09:39:30,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:30,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597946730] [2025-01-09 09:39:30,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:30,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:30,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-01-09 09:39:30,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-01-09 09:39:30,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:30,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-01-09 09:39:33,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:33,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597946730] [2025-01-09 09:39:33,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597946730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:39:33,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:39:33,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 09:39:33,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123029760] [2025-01-09 09:39:33,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:39:33,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 09:39:33,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:33,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 09:39:33,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:39:33,352 INFO L87 Difference]: Start difference. First operand 1157 states and 1886 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 3 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 3 states have call predecessors, (83), 3 states have call successors, (83) [2025-01-09 09:39:36,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:36,911 INFO L93 Difference]: Finished difference Result 6419 states and 10251 transitions. [2025-01-09 09:39:36,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 09:39:36,912 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 3 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 3 states have call predecessors, (83), 3 states have call successors, (83) Word has length 527 [2025-01-09 09:39:36,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:36,950 INFO L225 Difference]: With dead ends: 6419 [2025-01-09 09:39:36,950 INFO L226 Difference]: Without dead ends: 5538 [2025-01-09 09:39:36,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:39:36,957 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 2490 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 1176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2490 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1176 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:39:36,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2490 Valid, 1063 Invalid, 2003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1176 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 09:39:36,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5538 states. [2025-01-09 09:39:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5538 to 2583. [2025-01-09 09:39:37,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2583 states, 1947 states have (on average 1.5249101181304572) internal successors, (2969), 1969 states have internal predecessors, (2969), 605 states have call successors, (605), 30 states have call predecessors, (605), 30 states have return successors, (605), 583 states have call predecessors, (605), 605 states have call successors, (605) [2025-01-09 09:39:37,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2583 states and 4179 transitions. [2025-01-09 09:39:37,352 INFO L78 Accepts]: Start accepts. Automaton has 2583 states and 4179 transitions. Word has length 527 [2025-01-09 09:39:37,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:37,353 INFO L471 AbstractCegarLoop]: Abstraction has 2583 states and 4179 transitions. [2025-01-09 09:39:37,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 3 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 3 states have call predecessors, (83), 3 states have call successors, (83) [2025-01-09 09:39:37,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 4179 transitions. [2025-01-09 09:39:37,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-01-09 09:39:37,359 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:37,359 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:37,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:39:37,360 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:37,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:37,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1615057766, now seen corresponding path program 1 times [2025-01-09 09:39:37,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:37,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478501365] [2025-01-09 09:39:37,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:37,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:37,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-01-09 09:39:37,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-01-09 09:39:37,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:37,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:38,158 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-01-09 09:39:38,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:38,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478501365] [2025-01-09 09:39:38,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478501365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:39:38,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:39:38,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:39:38,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801909812] [2025-01-09 09:39:38,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:39:38,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:39:38,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:38,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:39:38,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:39:38,161 INFO L87 Difference]: Start difference. First operand 2583 states and 4179 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 3 states have call predecessors, (83), 3 states have call successors, (83) [2025-01-09 09:39:39,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:39,327 INFO L93 Difference]: Finished difference Result 6399 states and 10373 transitions. [2025-01-09 09:39:39,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:39:39,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 3 states have call predecessors, (83), 3 states have call successors, (83) Word has length 527 [2025-01-09 09:39:39,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:39,359 INFO L225 Difference]: With dead ends: 6399 [2025-01-09 09:39:39,360 INFO L226 Difference]: Without dead ends: 4225 [2025-01-09 09:39:39,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:39:39,371 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 640 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:39:39,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 986 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 09:39:39,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4225 states. [2025-01-09 09:39:39,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4225 to 2862. [2025-01-09 09:39:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2862 states, 2226 states have (on average 1.560197663971249) internal successors, (3473), 2248 states have internal predecessors, (3473), 605 states have call successors, (605), 30 states have call predecessors, (605), 30 states have return successors, (605), 583 states have call predecessors, (605), 605 states have call successors, (605) [2025-01-09 09:39:39,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2862 states and 4683 transitions. [2025-01-09 09:39:39,800 INFO L78 Accepts]: Start accepts. Automaton has 2862 states and 4683 transitions. Word has length 527 [2025-01-09 09:39:39,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:39,800 INFO L471 AbstractCegarLoop]: Abstraction has 2862 states and 4683 transitions. [2025-01-09 09:39:39,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 3 states have call predecessors, (83), 3 states have call successors, (83) [2025-01-09 09:39:39,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2862 states and 4683 transitions. [2025-01-09 09:39:39,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-01-09 09:39:39,806 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:39,806 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:39,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:39:39,806 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:39,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:39,807 INFO L85 PathProgramCache]: Analyzing trace with hash -890825638, now seen corresponding path program 1 times [2025-01-09 09:39:39,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:39,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531285675] [2025-01-09 09:39:39,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:39,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:39,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-01-09 09:39:39,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-01-09 09:39:39,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:39,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:41,368 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-01-09 09:39:41,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:41,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531285675] [2025-01-09 09:39:41,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531285675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:39:41,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:39:41,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:39:41,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281739411] [2025-01-09 09:39:41,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:39:41,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:39:41,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:41,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:39:41,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:39:41,371 INFO L87 Difference]: Start difference. First operand 2862 states and 4683 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 09:39:45,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:45,542 INFO L93 Difference]: Finished difference Result 11998 states and 19402 transitions. [2025-01-09 09:39:45,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 09:39:45,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 527 [2025-01-09 09:39:45,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:45,609 INFO L225 Difference]: With dead ends: 11998 [2025-01-09 09:39:45,610 INFO L226 Difference]: Without dead ends: 9785 [2025-01-09 09:39:45,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:39:45,622 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 1697 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 952 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 952 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:39:45,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1697 Valid, 1528 Invalid, 1572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [952 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 09:39:45,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9785 states. [2025-01-09 09:39:46,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9785 to 6418. [2025-01-09 09:39:46,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6418 states, 5159 states have (on average 1.584997092459779) internal successors, (8177), 5213 states have internal predecessors, (8177), 1189 states have call successors, (1189), 69 states have call predecessors, (1189), 69 states have return successors, (1189), 1135 states have call predecessors, (1189), 1189 states have call successors, (1189) [2025-01-09 09:39:46,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6418 states to 6418 states and 10555 transitions. [2025-01-09 09:39:46,728 INFO L78 Accepts]: Start accepts. Automaton has 6418 states and 10555 transitions. Word has length 527 [2025-01-09 09:39:46,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:46,730 INFO L471 AbstractCegarLoop]: Abstraction has 6418 states and 10555 transitions. [2025-01-09 09:39:46,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 09:39:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 6418 states and 10555 transitions. [2025-01-09 09:39:46,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-01-09 09:39:46,741 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:46,742 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:46,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:39:46,742 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:46,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:46,743 INFO L85 PathProgramCache]: Analyzing trace with hash -913457892, now seen corresponding path program 1 times [2025-01-09 09:39:46,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:46,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950874558] [2025-01-09 09:39:46,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:46,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:46,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-01-09 09:39:47,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-01-09 09:39:47,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:47,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:48,494 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 426 proven. 294 refuted. 0 times theorem prover too weak. 12892 trivial. 0 not checked. [2025-01-09 09:39:48,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:48,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950874558] [2025-01-09 09:39:48,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950874558] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:39:48,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585552396] [2025-01-09 09:39:48,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:48,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:39:48,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:39:48,497 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:39:48,499 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:39:48,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-01-09 09:39:48,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-01-09 09:39:48,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:48,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:48,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 1181 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-01-09 09:39:48,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:39:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 9490 proven. 759 refuted. 0 times theorem prover too weak. 3363 trivial. 0 not checked. [2025-01-09 09:39:56,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:40:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 309 proven. 180 refuted. 0 times theorem prover too weak. 13123 trivial. 0 not checked. [2025-01-09 09:40:03,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585552396] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:40:03,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:40:03,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 35, 17] total 60 [2025-01-09 09:40:03,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345325494] [2025-01-09 09:40:03,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:40:03,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-01-09 09:40:03,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:03,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-01-09 09:40:03,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=808, Invalid=2732, Unknown=0, NotChecked=0, Total=3540 [2025-01-09 09:40:03,152 INFO L87 Difference]: Start difference. First operand 6418 states and 10555 transitions. Second operand has 60 states, 60 states have (on average 5.1) internal successors, (306), 58 states have internal predecessors, (306), 16 states have call successors, (204), 11 states have call predecessors, (204), 19 states have return successors, (205), 16 states have call predecessors, (205), 16 states have call successors, (205)