./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-6.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-6.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 cec5185ce7c24944b55ad80283733eba2f5aa0d5d2e63517a5d5bc6bcf21ed8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:45:00,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:45:00,775 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:45:00,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:45:00,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:45:00,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:45:00,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:45:00,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:45:00,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:45:00,808 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:45:00,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:45:00,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:45:00,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:45:00,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:45:00,808 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:45:00,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:45:00,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:45:00,809 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:45:00,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:45:00,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:45:00,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:45:00,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:45:00,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:45:00,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:45:00,809 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:45:00,809 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:45:00,809 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:45:00,809 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:45:00,809 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:45:00,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:45:00,809 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:45:00,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:45:00,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:45:00,809 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:45:00,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:45:00,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:45:00,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:45:00,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:45:00,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:45:00,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:45:00,810 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:45:00,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:45:00,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:45:00,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:45:00,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:45:00,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:45:00,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:45:00,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:45:00,811 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 -> cec5185ce7c24944b55ad80283733eba2f5aa0d5d2e63517a5d5bc6bcf21ed8e [2025-01-09 09:45:01,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:45:01,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:45:01,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:45:01,053 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:45:01,054 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:45:01,054 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-6.i [2025-01-09 09:45:02,334 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/077eca1ad/df37c559739044e68a36c5043efd487b/FLAGa608b8f00 [2025-01-09 09:45:02,653 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:45:02,654 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-6.i [2025-01-09 09:45:02,667 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/077eca1ad/df37c559739044e68a36c5043efd487b/FLAGa608b8f00 [2025-01-09 09:45:02,926 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/077eca1ad/df37c559739044e68a36c5043efd487b [2025-01-09 09:45:02,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:45:02,929 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:45:02,931 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:45:02,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:45:02,935 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:45:02,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:45:02" (1/1) ... [2025-01-09 09:45:02,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@626e5a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:02, skipping insertion in model container [2025-01-09 09:45:02,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:45:02" (1/1) ... [2025-01-09 09:45:02,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:45:03,078 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-6.i[915,928] [2025-01-09 09:45:03,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:45:03,231 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:45:03,240 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-6.i[915,928] [2025-01-09 09:45:03,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:45:03,323 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:45:03,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:03 WrapperNode [2025-01-09 09:45:03,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:45:03,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:45:03,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:45:03,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:45:03,335 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:45:03" (1/1) ... [2025-01-09 09:45:03,350 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:45:03" (1/1) ... [2025-01-09 09:45:03,407 INFO L138 Inliner]: procedures = 26, calls = 84, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 519 [2025-01-09 09:45:03,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:45:03,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:45:03,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:45:03,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:45:03,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:03" (1/1) ... [2025-01-09 09:45:03,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:03" (1/1) ... [2025-01-09 09:45:03,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:03" (1/1) ... [2025-01-09 09:45:03,455 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:45:03,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:03" (1/1) ... [2025-01-09 09:45:03,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:03" (1/1) ... [2025-01-09 09:45:03,475 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:03" (1/1) ... [2025-01-09 09:45:03,482 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:03" (1/1) ... [2025-01-09 09:45:03,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:03" (1/1) ... [2025-01-09 09:45:03,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:03" (1/1) ... [2025-01-09 09:45:03,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:03" (1/1) ... [2025-01-09 09:45:03,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:45:03,517 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:45:03,517 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:45:03,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:45:03,521 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:03" (1/1) ... [2025-01-09 09:45:03,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:45:03,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:45:03,548 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:45:03,556 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:45:03,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:45:03,575 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:45:03,575 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:45:03,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:45:03,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:45:03,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:45:03,692 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:45:03,698 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:45:04,331 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-01-09 09:45:04,332 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:45:04,341 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:45:04,341 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:45:04,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:45:04 BoogieIcfgContainer [2025-01-09 09:45:04,342 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:45:04,343 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:45:04,343 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:45:04,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:45:04,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:45:02" (1/3) ... [2025-01-09 09:45:04,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142350dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:45:04, skipping insertion in model container [2025-01-09 09:45:04,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:03" (2/3) ... [2025-01-09 09:45:04,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142350dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:45:04, skipping insertion in model container [2025-01-09 09:45:04,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:45:04" (3/3) ... [2025-01-09 09:45:04,348 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-6.i [2025-01-09 09:45:04,358 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:45:04,360 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-6.i that has 2 procedures, 216 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:45:04,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:45:04,406 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;@6285cb59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:45:04,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:45:04,409 INFO L276 IsEmpty]: Start isEmpty. Operand has 216 states, 142 states have (on average 1.5211267605633803) internal successors, (216), 143 states have internal predecessors, (216), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-01-09 09:45:04,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-01-09 09:45:04,425 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:04,426 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:45:04,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:04,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:04,430 INFO L85 PathProgramCache]: Analyzing trace with hash 368438946, now seen corresponding path program 1 times [2025-01-09 09:45:04,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:04,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15688085] [2025-01-09 09:45:04,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:04,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:04,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-01-09 09:45:04,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-01-09 09:45:04,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:04,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2025-01-09 09:45:04,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:04,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15688085] [2025-01-09 09:45:04,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15688085] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:45:04,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857574554] [2025-01-09 09:45:04,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:04,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:45:04,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:45:04,974 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:45:04,980 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:45:05,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-01-09 09:45:05,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-01-09 09:45:05,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:05,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:05,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 1012 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:45:05,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:45:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2025-01-09 09:45:05,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:45:05,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857574554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:05,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:45:05,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:45:05,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695972176] [2025-01-09 09:45:05,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:05,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:45:05,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:05,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:45:05,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:45:05,324 INFO L87 Difference]: Start difference. First operand has 216 states, 142 states have (on average 1.5211267605633803) internal successors, (216), 143 states have internal predecessors, (216), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) [2025-01-09 09:45:05,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:05,373 INFO L93 Difference]: Finished difference Result 426 states and 782 transitions. [2025-01-09 09:45:05,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:45:05,374 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) Word has length 448 [2025-01-09 09:45:05,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:05,383 INFO L225 Difference]: With dead ends: 426 [2025-01-09 09:45:05,386 INFO L226 Difference]: Without dead ends: 213 [2025-01-09 09:45:05,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 449 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:45:05,395 INFO L435 NwaCegarLoop]: 349 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, 349 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:45:05,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:45:05,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-01-09 09:45:05,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2025-01-09 09:45:05,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 140 states have (on average 1.4785714285714286) internal successors, (207), 140 states have internal predecessors, (207), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-01-09 09:45:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 349 transitions. [2025-01-09 09:45:05,477 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 349 transitions. Word has length 448 [2025-01-09 09:45:05,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:05,477 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 349 transitions. [2025-01-09 09:45:05,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) [2025-01-09 09:45:05,478 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 349 transitions. [2025-01-09 09:45:05,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-01-09 09:45:05,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:05,488 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:45:05,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 09:45:05,693 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:45:05,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:05,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:05,694 INFO L85 PathProgramCache]: Analyzing trace with hash -2125379070, now seen corresponding path program 1 times [2025-01-09 09:45:05,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:05,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251523920] [2025-01-09 09:45:05,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:05,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:05,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-01-09 09:45:05,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-01-09 09:45:05,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:05,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-01-09 09:45:06,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:06,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251523920] [2025-01-09 09:45:06,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251523920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:06,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:06,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:45:06,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406116880] [2025-01-09 09:45:06,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:06,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:45:06,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:06,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:45:06,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:45:06,099 INFO L87 Difference]: Start difference. First operand 213 states and 349 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 09:45:06,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:06,170 INFO L93 Difference]: Finished difference Result 529 states and 870 transitions. [2025-01-09 09:45:06,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:45:06,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 449 [2025-01-09 09:45:06,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:06,174 INFO L225 Difference]: With dead ends: 529 [2025-01-09 09:45:06,174 INFO L226 Difference]: Without dead ends: 319 [2025-01-09 09:45:06,177 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:45:06,178 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 165 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:06,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 757 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:45:06,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-01-09 09:45:06,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2025-01-09 09:45:06,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 229 states have (on average 1.519650655021834) internal successors, (348), 230 states have internal predecessors, (348), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 09:45:06,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 516 transitions. [2025-01-09 09:45:06,217 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 516 transitions. Word has length 449 [2025-01-09 09:45:06,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:06,219 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 516 transitions. [2025-01-09 09:45:06,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 09:45:06,220 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 516 transitions. [2025-01-09 09:45:06,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-01-09 09:45:06,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:06,226 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:45:06,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:45:06,228 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:06,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:06,229 INFO L85 PathProgramCache]: Analyzing trace with hash -816531771, now seen corresponding path program 1 times [2025-01-09 09:45:06,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:06,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116267425] [2025-01-09 09:45:06,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:06,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:06,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-01-09 09:45:06,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-01-09 09:45:06,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:06,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:06,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-01-09 09:45:06,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:06,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116267425] [2025-01-09 09:45:06,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116267425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:06,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:06,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:45:06,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755708739] [2025-01-09 09:45:06,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:06,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:45:06,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:06,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:45:06,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:45:06,468 INFO L87 Difference]: Start difference. First operand 316 states and 516 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 09:45:06,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:06,532 INFO L93 Difference]: Finished difference Result 826 states and 1344 transitions. [2025-01-09 09:45:06,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:45:06,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 451 [2025-01-09 09:45:06,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:06,540 INFO L225 Difference]: With dead ends: 826 [2025-01-09 09:45:06,540 INFO L226 Difference]: Without dead ends: 513 [2025-01-09 09:45:06,541 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:45:06,543 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 203 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:06,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 848 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:45:06,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-01-09 09:45:06,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 510. [2025-01-09 09:45:06,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 363 states have (on average 1.4820936639118458) internal successors, (538), 366 states have internal predecessors, (538), 142 states have call successors, (142), 4 states have call predecessors, (142), 4 states have return successors, (142), 139 states have call predecessors, (142), 142 states have call successors, (142) [2025-01-09 09:45:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 822 transitions. [2025-01-09 09:45:06,599 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 822 transitions. Word has length 451 [2025-01-09 09:45:06,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:06,601 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 822 transitions. [2025-01-09 09:45:06,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 09:45:06,602 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 822 transitions. [2025-01-09 09:45:06,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-01-09 09:45:06,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:06,606 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:45:06,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:45:06,607 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:06,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:06,607 INFO L85 PathProgramCache]: Analyzing trace with hash 197485264, now seen corresponding path program 1 times [2025-01-09 09:45:06,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:06,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475668847] [2025-01-09 09:45:06,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:06,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:06,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-01-09 09:45:06,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-01-09 09:45:06,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:06,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:06,833 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-01-09 09:45:06,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:06,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475668847] [2025-01-09 09:45:06,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475668847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:06,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:06,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:45:06,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728032157] [2025-01-09 09:45:06,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:06,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:45:06,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:06,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:45:06,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:45:06,836 INFO L87 Difference]: Start difference. First operand 510 states and 822 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 09:45:06,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:06,900 INFO L93 Difference]: Finished difference Result 1420 states and 2285 transitions. [2025-01-09 09:45:06,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:45:06,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 452 [2025-01-09 09:45:06,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:06,906 INFO L225 Difference]: With dead ends: 1420 [2025-01-09 09:45:06,906 INFO L226 Difference]: Without dead ends: 913 [2025-01-09 09:45:06,908 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:45:06,908 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 231 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:06,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 841 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:45:06,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2025-01-09 09:45:06,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 910. [2025-01-09 09:45:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 633 states have (on average 1.4533965244865719) internal successors, (920), 640 states have internal predecessors, (920), 268 states have call successors, (268), 8 states have call predecessors, (268), 8 states have return successors, (268), 261 states have call predecessors, (268), 268 states have call successors, (268) [2025-01-09 09:45:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1456 transitions. [2025-01-09 09:45:06,979 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1456 transitions. Word has length 452 [2025-01-09 09:45:06,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:06,980 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1456 transitions. [2025-01-09 09:45:06,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 09:45:06,980 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1456 transitions. [2025-01-09 09:45:06,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-01-09 09:45:06,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:06,984 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:45:06,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:45:06,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:06,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:06,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1015133714, now seen corresponding path program 1 times [2025-01-09 09:45:06,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:06,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582490515] [2025-01-09 09:45:06,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:06,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:07,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-01-09 09:45:07,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-01-09 09:45:07,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:07,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-01-09 09:45:07,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:07,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582490515] [2025-01-09 09:45:07,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582490515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:07,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:07,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:45:07,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032544447] [2025-01-09 09:45:07,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:07,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:45:07,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:07,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:45:07,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:45:07,407 INFO L87 Difference]: Start difference. First operand 910 states and 1456 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 09:45:07,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:07,714 INFO L93 Difference]: Finished difference Result 2377 states and 3824 transitions. [2025-01-09 09:45:07,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:45:07,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 452 [2025-01-09 09:45:07,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:07,723 INFO L225 Difference]: With dead ends: 2377 [2025-01-09 09:45:07,724 INFO L226 Difference]: Without dead ends: 1470 [2025-01-09 09:45:07,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:45:07,728 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 310 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:07,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1028 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:45:07,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2025-01-09 09:45:07,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1340. [2025-01-09 09:45:07,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 990 states have (on average 1.498989898989899) internal successors, (1484), 997 states have internal predecessors, (1484), 339 states have call successors, (339), 10 states have call predecessors, (339), 10 states have return successors, (339), 332 states have call predecessors, (339), 339 states have call successors, (339) [2025-01-09 09:45:07,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 2162 transitions. [2025-01-09 09:45:07,821 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 2162 transitions. Word has length 452 [2025-01-09 09:45:07,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:07,822 INFO L471 AbstractCegarLoop]: Abstraction has 1340 states and 2162 transitions. [2025-01-09 09:45:07,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 09:45:07,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 2162 transitions. [2025-01-09 09:45:07,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-01-09 09:45:07,826 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:07,827 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:45:07,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:45:07,828 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:07,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:07,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1194286042, now seen corresponding path program 1 times [2025-01-09 09:45:07,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:07,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126898871] [2025-01-09 09:45:07,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:07,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:07,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-01-09 09:45:07,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-01-09 09:45:07,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:07,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-01-09 09:45:08,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:08,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126898871] [2025-01-09 09:45:08,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126898871] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:08,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:08,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:45:08,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713953530] [2025-01-09 09:45:08,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:08,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:45:08,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:08,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:45:08,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:45:08,164 INFO L87 Difference]: Start difference. First operand 1340 states and 2162 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 09:45:08,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:08,250 INFO L93 Difference]: Finished difference Result 2851 states and 4590 transitions. [2025-01-09 09:45:08,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:45:08,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 453 [2025-01-09 09:45:08,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:08,260 INFO L225 Difference]: With dead ends: 2851 [2025-01-09 09:45:08,261 INFO L226 Difference]: Without dead ends: 1884 [2025-01-09 09:45:08,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:45:08,264 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 339 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:08,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 960 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:45:08,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2025-01-09 09:45:08,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1744. [2025-01-09 09:45:08,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1744 states, 1247 states have (on average 1.466720128307939) internal successors, (1829), 1258 states have internal predecessors, (1829), 481 states have call successors, (481), 15 states have call predecessors, (481), 15 states have return successors, (481), 470 states have call predecessors, (481), 481 states have call successors, (481) [2025-01-09 09:45:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2791 transitions. [2025-01-09 09:45:08,357 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 2791 transitions. Word has length 453 [2025-01-09 09:45:08,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:08,358 INFO L471 AbstractCegarLoop]: Abstraction has 1744 states and 2791 transitions. [2025-01-09 09:45:08,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 09:45:08,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2791 transitions. [2025-01-09 09:45:08,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-01-09 09:45:08,361 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:08,361 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:45:08,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:45:08,361 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:08,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:08,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1328299548, now seen corresponding path program 1 times [2025-01-09 09:45:08,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:08,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23303184] [2025-01-09 09:45:08,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:08,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:08,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-01-09 09:45:08,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-01-09 09:45:08,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:08,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:09,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-01-09 09:45:09,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:09,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23303184] [2025-01-09 09:45:09,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23303184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:09,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:09,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:45:09,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566592435] [2025-01-09 09:45:09,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:09,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:45:09,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:09,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:45:09,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:45:09,563 INFO L87 Difference]: Start difference. First operand 1744 states and 2791 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 09:45:10,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:10,035 INFO L93 Difference]: Finished difference Result 4702 states and 7526 transitions. [2025-01-09 09:45:10,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:45:10,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 453 [2025-01-09 09:45:10,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:10,052 INFO L225 Difference]: With dead ends: 4702 [2025-01-09 09:45:10,052 INFO L226 Difference]: Without dead ends: 3339 [2025-01-09 09:45:10,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:45:10,056 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 197 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:10,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 869 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:45:10,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2025-01-09 09:45:10,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3337. [2025-01-09 09:45:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 2417 states have (on average 1.4584195283409185) internal successors, (3525), 2439 states have internal predecessors, (3525), 891 states have call successors, (891), 28 states have call predecessors, (891), 28 states have return successors, (891), 869 states have call predecessors, (891), 891 states have call successors, (891) [2025-01-09 09:45:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 5307 transitions. [2025-01-09 09:45:10,293 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 5307 transitions. Word has length 453 [2025-01-09 09:45:10,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:10,294 INFO L471 AbstractCegarLoop]: Abstraction has 3337 states and 5307 transitions. [2025-01-09 09:45:10,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 09:45:10,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 5307 transitions. [2025-01-09 09:45:10,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-01-09 09:45:10,297 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:10,298 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:45:10,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:45:10,298 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:10,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:10,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1277724006, now seen corresponding path program 1 times [2025-01-09 09:45:10,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:10,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994537358] [2025-01-09 09:45:10,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:10,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:10,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-01-09 09:45:10,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-01-09 09:45:10,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:10,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-01-09 09:45:10,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:10,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994537358] [2025-01-09 09:45:10,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994537358] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:10,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:10,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:45:10,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525912392] [2025-01-09 09:45:10,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:10,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:45:10,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:10,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:45:10,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:45:10,853 INFO L87 Difference]: Start difference. First operand 3337 states and 5307 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 09:45:11,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:11,503 INFO L93 Difference]: Finished difference Result 12872 states and 20548 transitions. [2025-01-09 09:45:11,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:45:11,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 453 [2025-01-09 09:45:11,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:11,543 INFO L225 Difference]: With dead ends: 12872 [2025-01-09 09:45:11,543 INFO L226 Difference]: Without dead ends: 9683 [2025-01-09 09:45:11,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:45:11,558 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 609 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 1902 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:11,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 1902 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:45:11,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9683 states. [2025-01-09 09:45:11,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9683 to 5744. [2025-01-09 09:45:11,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5744 states, 4464 states have (on average 1.4937275985663083) internal successors, (6668), 4510 states have internal predecessors, (6668), 1227 states have call successors, (1227), 52 states have call predecessors, (1227), 52 states have return successors, (1227), 1181 states have call predecessors, (1227), 1227 states have call successors, (1227) [2025-01-09 09:45:11,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5744 states to 5744 states and 9122 transitions. [2025-01-09 09:45:11,928 INFO L78 Accepts]: Start accepts. Automaton has 5744 states and 9122 transitions. Word has length 453 [2025-01-09 09:45:11,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:11,929 INFO L471 AbstractCegarLoop]: Abstraction has 5744 states and 9122 transitions. [2025-01-09 09:45:11,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-01-09 09:45:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand 5744 states and 9122 transitions. [2025-01-09 09:45:11,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-01-09 09:45:11,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:11,934 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:45:11,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:45:11,934 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:11,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:11,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1701370728, now seen corresponding path program 1 times [2025-01-09 09:45:11,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:11,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544995745] [2025-01-09 09:45:11,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:11,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:11,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-01-09 09:45:12,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-01-09 09:45:12,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:12,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:12,563 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 33 proven. 177 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-01-09 09:45:12,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:12,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544995745] [2025-01-09 09:45:12,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544995745] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:45:12,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599905570] [2025-01-09 09:45:12,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:12,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:45:12,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:45:12,567 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:45:12,568 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:45:12,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-01-09 09:45:12,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-01-09 09:45:12,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:12,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:12,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 09:45:12,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:45:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 3984 proven. 153 refuted. 0 times theorem prover too weak. 5803 trivial. 0 not checked. [2025-01-09 09:45:13,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:45:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 57 proven. 153 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-01-09 09:45:13,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599905570] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:45:13,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:45:13,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-09 09:45:13,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820714561] [2025-01-09 09:45:13,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:45:13,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 09:45:13,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:13,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 09:45:13,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:45:13,670 INFO L87 Difference]: Start difference. First operand 5744 states and 9122 transitions. Second operand has 11 states, 11 states have (on average 17.818181818181817) internal successors, (196), 11 states have internal predecessors, (196), 3 states have call successors, (181), 2 states have call predecessors, (181), 4 states have return successors, (183), 3 states have call predecessors, (183), 3 states have call successors, (183) [2025-01-09 09:45:15,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:15,331 INFO L93 Difference]: Finished difference Result 16960 states and 26214 transitions. [2025-01-09 09:45:15,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-01-09 09:45:15,332 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 17.818181818181817) internal successors, (196), 11 states have internal predecessors, (196), 3 states have call successors, (181), 2 states have call predecessors, (181), 4 states have return successors, (183), 3 states have call predecessors, (183), 3 states have call successors, (183) Word has length 453 [2025-01-09 09:45:15,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:15,371 INFO L225 Difference]: With dead ends: 16960 [2025-01-09 09:45:15,371 INFO L226 Difference]: Without dead ends: 11387 [2025-01-09 09:45:15,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 908 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=456, Invalid=1266, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 09:45:15,383 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 1533 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:15,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 1280 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 09:45:15,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11387 states. [2025-01-09 09:45:15,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11387 to 7826. [2025-01-09 09:45:15,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7826 states, 5907 states have (on average 1.4294904350770272) internal successors, (8444), 6001 states have internal predecessors, (8444), 1755 states have call successors, (1755), 163 states have call predecessors, (1755), 163 states have return successors, (1755), 1661 states have call predecessors, (1755), 1755 states have call successors, (1755) [2025-01-09 09:45:15,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7826 states to 7826 states and 11954 transitions. [2025-01-09 09:45:15,953 INFO L78 Accepts]: Start accepts. Automaton has 7826 states and 11954 transitions. Word has length 453 [2025-01-09 09:45:15,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:15,953 INFO L471 AbstractCegarLoop]: Abstraction has 7826 states and 11954 transitions. [2025-01-09 09:45:15,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.818181818181817) internal successors, (196), 11 states have internal predecessors, (196), 3 states have call successors, (181), 2 states have call predecessors, (181), 4 states have return successors, (183), 3 states have call predecessors, (183), 3 states have call successors, (183) [2025-01-09 09:45:15,955 INFO L276 IsEmpty]: Start isEmpty. Operand 7826 states and 11954 transitions. [2025-01-09 09:45:15,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-01-09 09:45:15,966 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:15,966 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:45:15,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 09:45:16,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:45:16,171 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:16,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:16,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1391886782, now seen corresponding path program 1 times [2025-01-09 09:45:16,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:16,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276339826] [2025-01-09 09:45:16,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:16,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:16,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-01-09 09:45:16,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-01-09 09:45:16,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:16,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:17,292 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 186 proven. 24 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-01-09 09:45:17,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:17,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276339826] [2025-01-09 09:45:17,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276339826] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:45:17,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627271459] [2025-01-09 09:45:17,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:17,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:45:17,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:45:17,296 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:45:17,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 09:45:17,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-01-09 09:45:17,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-01-09 09:45:17,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:17,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:17,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 09:45:17,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:45:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 2399 proven. 48 refuted. 0 times theorem prover too weak. 7493 trivial. 0 not checked. [2025-01-09 09:45:19,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:45:21,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627271459] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:45:21,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 09:45:21,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2025-01-09 09:45:21,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694027497] [2025-01-09 09:45:21,760 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 09:45:21,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 09:45:21,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:21,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 09:45:21,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-01-09 09:45:21,762 INFO L87 Difference]: Start difference. First operand 7826 states and 11954 transitions. Second operand has 16 states, 15 states have (on average 13.133333333333333) internal successors, (197), 14 states have internal predecessors, (197), 6 states have call successors, (142), 4 states have call predecessors, (142), 6 states have return successors, (142), 6 states have call predecessors, (142), 6 states have call successors, (142) [2025-01-09 09:45:24,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:24,284 INFO L93 Difference]: Finished difference Result 22554 states and 34255 transitions. [2025-01-09 09:45:24,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 09:45:24,288 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 13.133333333333333) internal successors, (197), 14 states have internal predecessors, (197), 6 states have call successors, (142), 4 states have call predecessors, (142), 6 states have return successors, (142), 6 states have call predecessors, (142), 6 states have call successors, (142) Word has length 454 [2025-01-09 09:45:24,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:24,336 INFO L225 Difference]: With dead ends: 22554 [2025-01-09 09:45:24,336 INFO L226 Difference]: Without dead ends: 15972 [2025-01-09 09:45:24,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2025-01-09 09:45:24,352 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 1254 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 1541 mSolverCounterSat, 549 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1316 SdHoareTripleChecker+Valid, 2256 SdHoareTripleChecker+Invalid, 2090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 549 IncrementalHoareTripleChecker+Valid, 1541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:24,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1316 Valid, 2256 Invalid, 2090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [549 Valid, 1541 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 09:45:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15972 states. [2025-01-09 09:45:25,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15972 to 14984. [2025-01-09 09:45:25,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14984 states, 11111 states have (on average 1.4031140311403114) internal successors, (15590), 11299 states have internal predecessors, (15590), 3531 states have call successors, (3531), 341 states have call predecessors, (3531), 341 states have return successors, (3531), 3343 states have call predecessors, (3531), 3531 states have call successors, (3531) [2025-01-09 09:45:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14984 states to 14984 states and 22652 transitions. [2025-01-09 09:45:25,301 INFO L78 Accepts]: Start accepts. Automaton has 14984 states and 22652 transitions. Word has length 454 [2025-01-09 09:45:25,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:25,302 INFO L471 AbstractCegarLoop]: Abstraction has 14984 states and 22652 transitions. [2025-01-09 09:45:25,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 13.133333333333333) internal successors, (197), 14 states have internal predecessors, (197), 6 states have call successors, (142), 4 states have call predecessors, (142), 6 states have return successors, (142), 6 states have call predecessors, (142), 6 states have call successors, (142) [2025-01-09 09:45:25,303 INFO L276 IsEmpty]: Start isEmpty. Operand 14984 states and 22652 transitions. [2025-01-09 09:45:25,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-01-09 09:45:25,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:25,313 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:45:25,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 09:45:25,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:45:25,514 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:25,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:25,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1417712319, now seen corresponding path program 1 times [2025-01-09 09:45:25,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:25,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618370529] [2025-01-09 09:45:25,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:25,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:25,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-01-09 09:45:25,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-01-09 09:45:25,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:25,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:27,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 381 proven. 33 refuted. 0 times theorem prover too weak. 9526 trivial. 0 not checked. [2025-01-09 09:45:27,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:27,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618370529] [2025-01-09 09:45:27,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618370529] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:45:27,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31120789] [2025-01-09 09:45:27,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:27,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:45:27,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:45:27,189 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:45:27,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 09:45:27,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-01-09 09:45:27,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-01-09 09:45:27,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:27,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:27,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 09:45:27,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:45:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 2471 proven. 63 refuted. 0 times theorem prover too weak. 7406 trivial. 0 not checked. [2025-01-09 09:45:29,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:45:41,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 576 proven. 45 refuted. 0 times theorem prover too weak. 9319 trivial. 0 not checked. [2025-01-09 09:45:41,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31120789] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:45:41,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:45:41,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 16] total 39 [2025-01-09 09:45:41,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145985447] [2025-01-09 09:45:41,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:45:41,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 09:45:41,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:41,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 09:45:41,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=1032, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 09:45:41,493 INFO L87 Difference]: Start difference. First operand 14984 states and 22652 transitions. Second operand has 39 states, 37 states have (on average 8.108108108108109) internal successors, (300), 35 states have internal predecessors, (300), 15 states have call successors, (213), 7 states have call predecessors, (213), 13 states have return successors, (213), 15 states have call predecessors, (213), 15 states have call successors, (213) [2025-01-09 09:46:20,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []