./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-75.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-500_file-75.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 5f27064a0b5796ba4fcefa469388f6a0b44b51572a6c95971fa540335b609a62 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:07:57,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:07:57,853 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:07:57,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:07:57,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:07:57,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:07:57,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:07:57,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:07:57,883 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:07:57,883 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:07:57,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:07:57,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:07:57,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:07:57,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:07:57,884 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:07:57,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:07:57,884 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:07:57,884 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:07:57,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:07:57,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:07:57,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:07:57,885 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:07:57,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:07:57,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:07:57,885 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:07:57,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:07:57,885 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:07:57,885 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:07:57,885 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:07:57,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:07:57,886 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:07:57,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:07:57,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:07:57,886 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:07:57,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:07:57,886 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:07:57,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:07:57,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:07:57,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:07:57,887 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:07:57,887 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:07:57,887 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:07:57,887 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:07:57,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:07:57,887 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:07:57,887 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:07:57,887 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:07:57,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:07:57,887 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 -> 5f27064a0b5796ba4fcefa469388f6a0b44b51572a6c95971fa540335b609a62 [2025-01-09 10:07:58,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:07:58,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:07:58,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:07:58,117 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:07:58,117 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:07:58,118 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-500_file-75.i [2025-01-09 10:07:59,212 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7752a3b84/68d4e2a830c046efafcfe61f80672660/FLAG7c431a97c [2025-01-09 10:07:59,531 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:07:59,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-75.i [2025-01-09 10:07:59,551 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7752a3b84/68d4e2a830c046efafcfe61f80672660/FLAG7c431a97c [2025-01-09 10:07:59,562 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7752a3b84/68d4e2a830c046efafcfe61f80672660 [2025-01-09 10:07:59,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:07:59,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:07:59,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:07:59,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:07:59,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:07:59,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:07:59" (1/1) ... [2025-01-09 10:07:59,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c621b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:59, skipping insertion in model container [2025-01-09 10:07:59,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:07:59" (1/1) ... [2025-01-09 10:07:59,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:07:59,690 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-500_file-75.i[916,929] [2025-01-09 10:07:59,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:07:59,831 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:07:59,840 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-500_file-75.i[916,929] [2025-01-09 10:07:59,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:07:59,940 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:07:59,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:59 WrapperNode [2025-01-09 10:07:59,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:07:59,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:07:59,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:07:59,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:07:59,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:59" (1/1) ... [2025-01-09 10:07:59,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:59" (1/1) ... [2025-01-09 10:08:00,030 INFO L138 Inliner]: procedures = 26, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 1113 [2025-01-09 10:08:00,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:08:00,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:08:00,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:08:00,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:08:00,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:59" (1/1) ... [2025-01-09 10:08:00,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:59" (1/1) ... [2025-01-09 10:08:00,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:59" (1/1) ... [2025-01-09 10:08:00,089 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 10:08:00,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:59" (1/1) ... [2025-01-09 10:08:00,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:59" (1/1) ... [2025-01-09 10:08:00,121 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:59" (1/1) ... [2025-01-09 10:08:00,127 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:59" (1/1) ... [2025-01-09 10:08:00,139 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:59" (1/1) ... [2025-01-09 10:08:00,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:59" (1/1) ... [2025-01-09 10:08:00,160 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:59" (1/1) ... [2025-01-09 10:08:00,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:08:00,177 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:08:00,177 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:08:00,177 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:08:00,178 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:59" (1/1) ... [2025-01-09 10:08:00,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:08:00,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:08:00,213 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 10:08:00,221 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 10:08:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:08:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:08:00,238 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:08:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:08:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:08:00,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:08:00,363 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:08:00,369 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:08:01,479 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-01-09 10:08:01,479 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:08:01,495 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:08:01,497 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:08:01,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:08:01 BoogieIcfgContainer [2025-01-09 10:08:01,498 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:08:01,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:08:01,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:08:01,502 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:08:01,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:07:59" (1/3) ... [2025-01-09 10:08:01,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3238f337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:08:01, skipping insertion in model container [2025-01-09 10:08:01,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:59" (2/3) ... [2025-01-09 10:08:01,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3238f337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:08:01, skipping insertion in model container [2025-01-09 10:08:01,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:08:01" (3/3) ... [2025-01-09 10:08:01,503 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-75.i [2025-01-09 10:08:01,514 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:08:01,516 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-75.i that has 2 procedures, 444 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:08:01,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:08:01,586 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;@524232ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:08:01,587 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:08:01,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 444 states, 318 states have (on average 1.5628930817610063) internal successors, (497), 319 states have internal predecessors, (497), 123 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 123 states have call predecessors, (123), 123 states have call successors, (123) [2025-01-09 10:08:01,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2025-01-09 10:08:01,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:01,631 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:08:01,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:01,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:01,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2069788806, now seen corresponding path program 1 times [2025-01-09 10:08:01,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:01,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809796825] [2025-01-09 10:08:01,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:01,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:01,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 787 statements into 1 equivalence classes. [2025-01-09 10:08:01,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 787 of 787 statements. [2025-01-09 10:08:01,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:01,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 29768 trivial. 0 not checked. [2025-01-09 10:08:02,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:02,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809796825] [2025-01-09 10:08:02,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809796825] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:08:02,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674821856] [2025-01-09 10:08:02,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:02,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:08:02,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:08:02,310 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 10:08:02,311 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 10:08:02,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 787 statements into 1 equivalence classes. [2025-01-09 10:08:02,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 787 of 787 statements. [2025-01-09 10:08:02,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:02,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:02,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 1773 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:08:02,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:08:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 29768 trivial. 0 not checked. [2025-01-09 10:08:02,850 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:08:02,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674821856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:02,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:08:02,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:08:02,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632708963] [2025-01-09 10:08:02,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:02,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:08:02,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:02,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:08:02,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:08:02,877 INFO L87 Difference]: Start difference. First operand has 444 states, 318 states have (on average 1.5628930817610063) internal successors, (497), 319 states have internal predecessors, (497), 123 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 123 states have call predecessors, (123), 123 states have call successors, (123) Second operand has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 2 states have call successors, (123), 2 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 2 states have call successors, (123) [2025-01-09 10:08:02,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:02,948 INFO L93 Difference]: Finished difference Result 882 states and 1604 transitions. [2025-01-09 10:08:02,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:08:02,949 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 2 states have call successors, (123), 2 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 2 states have call successors, (123) Word has length 787 [2025-01-09 10:08:02,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:02,961 INFO L225 Difference]: With dead ends: 882 [2025-01-09 10:08:02,961 INFO L226 Difference]: Without dead ends: 441 [2025-01-09 10:08:02,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 788 GetRequests, 788 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 10:08:02,974 INFO L435 NwaCegarLoop]: 737 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, 737 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 10:08:02,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:02,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-01-09 10:08:03,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2025-01-09 10:08:03,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 316 states have (on average 1.5537974683544304) internal successors, (491), 316 states have internal predecessors, (491), 123 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 123 states have call predecessors, (123), 123 states have call successors, (123) [2025-01-09 10:08:03,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 737 transitions. [2025-01-09 10:08:03,074 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 737 transitions. Word has length 787 [2025-01-09 10:08:03,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:03,077 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 737 transitions. [2025-01-09 10:08:03,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 2 states have call successors, (123), 2 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 2 states have call successors, (123) [2025-01-09 10:08:03,078 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 737 transitions. [2025-01-09 10:08:03,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 789 [2025-01-09 10:08:03,111 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:03,111 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:08:03,121 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 10:08:03,316 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 10:08:03,316 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:03,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:03,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1227056760, now seen corresponding path program 1 times [2025-01-09 10:08:03,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:03,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586081207] [2025-01-09 10:08:03,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:03,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:03,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 788 statements into 1 equivalence classes. [2025-01-09 10:08:03,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 788 of 788 statements. [2025-01-09 10:08:03,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:03,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:08:04,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:04,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586081207] [2025-01-09 10:08:04,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586081207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:04,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:04,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:04,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667051871] [2025-01-09 10:08:04,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:04,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:04,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:04,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:04,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:04,232 INFO L87 Difference]: Start difference. First operand 441 states and 737 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:04,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:04,285 INFO L93 Difference]: Finished difference Result 880 states and 1473 transitions. [2025-01-09 10:08:04,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:04,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 788 [2025-01-09 10:08:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:04,294 INFO L225 Difference]: With dead ends: 880 [2025-01-09 10:08:04,295 INFO L226 Difference]: Without dead ends: 442 [2025-01-09 10:08:04,296 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 10:08:04,297 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 0 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:04,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1464 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:04,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-01-09 10:08:04,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2025-01-09 10:08:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 317 states have (on average 1.5520504731861198) internal successors, (492), 317 states have internal predecessors, (492), 123 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 123 states have call predecessors, (123), 123 states have call successors, (123) [2025-01-09 10:08:04,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 738 transitions. [2025-01-09 10:08:04,345 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 738 transitions. Word has length 788 [2025-01-09 10:08:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:04,349 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 738 transitions. [2025-01-09 10:08:04,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:04,350 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 738 transitions. [2025-01-09 10:08:04,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 790 [2025-01-09 10:08:04,357 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:04,358 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:08:04,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:08:04,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:04,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:04,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1088433735, now seen corresponding path program 1 times [2025-01-09 10:08:04,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:04,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393347139] [2025-01-09 10:08:04,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:04,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:04,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 789 statements into 1 equivalence classes. [2025-01-09 10:08:04,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 789 of 789 statements. [2025-01-09 10:08:04,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:04,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:08:04,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:04,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393347139] [2025-01-09 10:08:04,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393347139] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:04,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:04,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:04,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267062951] [2025-01-09 10:08:04,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:04,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:04,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:04,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:04,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:04,717 INFO L87 Difference]: Start difference. First operand 442 states and 738 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:04,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:04,791 INFO L93 Difference]: Finished difference Result 1090 states and 1822 transitions. [2025-01-09 10:08:04,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:04,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 789 [2025-01-09 10:08:04,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:04,796 INFO L225 Difference]: With dead ends: 1090 [2025-01-09 10:08:04,797 INFO L226 Difference]: Without dead ends: 651 [2025-01-09 10:08:04,798 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 10:08:04,798 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 333 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:04,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1488 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:04,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-01-09 10:08:04,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 648. [2025-01-09 10:08:04,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 494 states have (on average 1.5769230769230769) internal successors, (779), 495 states have internal predecessors, (779), 151 states have call successors, (151), 2 states have call predecessors, (151), 2 states have return successors, (151), 150 states have call predecessors, (151), 151 states have call successors, (151) [2025-01-09 10:08:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1081 transitions. [2025-01-09 10:08:04,846 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1081 transitions. Word has length 789 [2025-01-09 10:08:04,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:04,848 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 1081 transitions. [2025-01-09 10:08:04,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:04,848 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1081 transitions. [2025-01-09 10:08:04,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 790 [2025-01-09 10:08:04,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:04,853 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:08:04,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:08:04,854 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:04,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:04,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1284457397, now seen corresponding path program 1 times [2025-01-09 10:08:04,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:04,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722488282] [2025-01-09 10:08:04,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:04,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:04,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 789 statements into 1 equivalence classes. [2025-01-09 10:08:04,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 789 of 789 statements. [2025-01-09 10:08:04,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:04,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:05,158 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:08:05,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:05,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722488282] [2025-01-09 10:08:05,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722488282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:05,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:05,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:05,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841719507] [2025-01-09 10:08:05,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:05,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:05,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:05,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:05,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:05,162 INFO L87 Difference]: Start difference. First operand 648 states and 1081 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:05,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:05,232 INFO L93 Difference]: Finished difference Result 1934 states and 3229 transitions. [2025-01-09 10:08:05,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:05,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 789 [2025-01-09 10:08:05,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:05,242 INFO L225 Difference]: With dead ends: 1934 [2025-01-09 10:08:05,242 INFO L226 Difference]: Without dead ends: 1289 [2025-01-09 10:08:05,244 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 10:08:05,244 INFO L435 NwaCegarLoop]: 1194 mSDtfsCounter, 687 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:05,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 1922 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:05,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2025-01-09 10:08:05,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1281. [2025-01-09 10:08:05,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 974 states have (on average 1.570841889117043) internal successors, (1530), 976 states have internal predecessors, (1530), 302 states have call successors, (302), 4 states have call predecessors, (302), 4 states have return successors, (302), 300 states have call predecessors, (302), 302 states have call successors, (302) [2025-01-09 10:08:05,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 2134 transitions. [2025-01-09 10:08:05,409 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 2134 transitions. Word has length 789 [2025-01-09 10:08:05,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:05,410 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 2134 transitions. [2025-01-09 10:08:05,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:05,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 2134 transitions. [2025-01-09 10:08:05,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 790 [2025-01-09 10:08:05,416 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:05,417 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:08:05,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:08:05,417 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:05,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:05,418 INFO L85 PathProgramCache]: Analyzing trace with hash -87349901, now seen corresponding path program 1 times [2025-01-09 10:08:05,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:05,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519117000] [2025-01-09 10:08:05,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:05,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:05,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 789 statements into 1 equivalence classes. [2025-01-09 10:08:05,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 789 of 789 statements. [2025-01-09 10:08:05,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:05,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:08:05,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:05,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519117000] [2025-01-09 10:08:05,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519117000] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:05,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:05,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:05,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805292060] [2025-01-09 10:08:05,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:05,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:05,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:05,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:05,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:05,686 INFO L87 Difference]: Start difference. First operand 1281 states and 2134 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:05,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:05,836 INFO L93 Difference]: Finished difference Result 3319 states and 5522 transitions. [2025-01-09 10:08:05,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:05,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 789 [2025-01-09 10:08:05,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:05,849 INFO L225 Difference]: With dead ends: 3319 [2025-01-09 10:08:05,849 INFO L226 Difference]: Without dead ends: 2041 [2025-01-09 10:08:05,852 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 10:08:05,853 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 303 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:05,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1589 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:08:05,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2041 states. [2025-01-09 10:08:05,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2041 to 2037. [2025-01-09 10:08:05,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2037 states, 1610 states have (on average 1.5776397515527951) internal successors, (2540), 1616 states have internal predecessors, (2540), 418 states have call successors, (418), 8 states have call predecessors, (418), 8 states have return successors, (418), 412 states have call predecessors, (418), 418 states have call successors, (418) [2025-01-09 10:08:05,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 3376 transitions. [2025-01-09 10:08:05,964 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 3376 transitions. Word has length 789 [2025-01-09 10:08:05,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:05,965 INFO L471 AbstractCegarLoop]: Abstraction has 2037 states and 3376 transitions. [2025-01-09 10:08:05,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:05,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 3376 transitions. [2025-01-09 10:08:05,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 790 [2025-01-09 10:08:05,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:05,972 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:08:05,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:08:05,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:05,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:05,974 INFO L85 PathProgramCache]: Analyzing trace with hash 730298549, now seen corresponding path program 1 times [2025-01-09 10:08:05,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:05,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16053623] [2025-01-09 10:08:05,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:05,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:06,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 789 statements into 1 equivalence classes. [2025-01-09 10:08:06,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 789 of 789 statements. [2025-01-09 10:08:06,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:06,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:08:06,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:06,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16053623] [2025-01-09 10:08:06,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16053623] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:06,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:06,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:08:06,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524314951] [2025-01-09 10:08:06,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:06,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:08:06,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:06,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:08:06,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:08:06,522 INFO L87 Difference]: Start difference. First operand 2037 states and 3376 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:06,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:06,879 INFO L93 Difference]: Finished difference Result 6105 states and 10122 transitions. [2025-01-09 10:08:06,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:08:06,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 789 [2025-01-09 10:08:06,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:06,904 INFO L225 Difference]: With dead ends: 6105 [2025-01-09 10:08:06,905 INFO L226 Difference]: Without dead ends: 4071 [2025-01-09 10:08:06,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:08:06,913 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 912 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 2166 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:06,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 2166 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:08:06,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4071 states. [2025-01-09 10:08:07,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4071 to 4037. [2025-01-09 10:08:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4037 states, 3184 states have (on average 1.574748743718593) internal successors, (5014), 3196 states have internal predecessors, (5014), 836 states have call successors, (836), 16 states have call predecessors, (836), 16 states have return successors, (836), 824 states have call predecessors, (836), 836 states have call successors, (836) [2025-01-09 10:08:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4037 states to 4037 states and 6686 transitions. [2025-01-09 10:08:07,212 INFO L78 Accepts]: Start accepts. Automaton has 4037 states and 6686 transitions. Word has length 789 [2025-01-09 10:08:07,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:07,214 INFO L471 AbstractCegarLoop]: Abstraction has 4037 states and 6686 transitions. [2025-01-09 10:08:07,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 4037 states and 6686 transitions. [2025-01-09 10:08:07,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 790 [2025-01-09 10:08:07,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:07,222 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:08:07,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:08:07,222 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:07,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:07,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1830564297, now seen corresponding path program 1 times [2025-01-09 10:08:07,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:07,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299782286] [2025-01-09 10:08:07,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:07,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:07,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 789 statements into 1 equivalence classes. [2025-01-09 10:08:07,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 789 of 789 statements. [2025-01-09 10:08:07,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:07,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:07,859 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:08:07,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:07,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299782286] [2025-01-09 10:08:07,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299782286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:07,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:07,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:07,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215949626] [2025-01-09 10:08:07,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:07,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:07,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:07,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:07,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:07,862 INFO L87 Difference]: Start difference. First operand 4037 states and 6686 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:08,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:08,035 INFO L93 Difference]: Finished difference Result 10141 states and 16808 transitions. [2025-01-09 10:08:08,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:08,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 789 [2025-01-09 10:08:08,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:08,069 INFO L225 Difference]: With dead ends: 10141 [2025-01-09 10:08:08,070 INFO L226 Difference]: Without dead ends: 6107 [2025-01-09 10:08:08,080 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 10:08:08,081 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 513 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:08,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1460 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:08,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6107 states. [2025-01-09 10:08:08,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6107 to 6093. [2025-01-09 10:08:08,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6093 states, 4814 states have (on average 1.573743248857499) internal successors, (7576), 4832 states have internal predecessors, (7576), 1254 states have call successors, (1254), 24 states have call predecessors, (1254), 24 states have return successors, (1254), 1236 states have call predecessors, (1254), 1254 states have call successors, (1254) [2025-01-09 10:08:08,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6093 states to 6093 states and 10084 transitions. [2025-01-09 10:08:08,619 INFO L78 Accepts]: Start accepts. Automaton has 6093 states and 10084 transitions. Word has length 789 [2025-01-09 10:08:08,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:08,620 INFO L471 AbstractCegarLoop]: Abstraction has 6093 states and 10084 transitions. [2025-01-09 10:08:08,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:08,624 INFO L276 IsEmpty]: Start isEmpty. Operand 6093 states and 10084 transitions. [2025-01-09 10:08:08,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-01-09 10:08:08,638 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:08,639 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:08:08,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:08:08,639 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:08,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:08,640 INFO L85 PathProgramCache]: Analyzing trace with hash -888335930, now seen corresponding path program 1 times [2025-01-09 10:08:08,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:08,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016510487] [2025-01-09 10:08:08,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:08,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:08,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-01-09 10:08:08,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-01-09 10:08:08,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:08,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:08:08,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:08,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016510487] [2025-01-09 10:08:08,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016510487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:08,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:08,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:08,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662721827] [2025-01-09 10:08:08,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:08,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:08,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:08,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:08,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:08,907 INFO L87 Difference]: Start difference. First operand 6093 states and 10084 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:09,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:09,147 INFO L93 Difference]: Finished difference Result 12219 states and 20198 transitions. [2025-01-09 10:08:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:09,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 790 [2025-01-09 10:08:09,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:09,186 INFO L225 Difference]: With dead ends: 12219 [2025-01-09 10:08:09,186 INFO L226 Difference]: Without dead ends: 6129 [2025-01-09 10:08:09,203 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 10:08:09,204 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 340 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:09,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1457 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:09,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6129 states. [2025-01-09 10:08:09,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6129 to 5071. [2025-01-09 10:08:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5071 states, 4146 states have (on average 1.6005788712011577) internal successors, (6636), 4152 states have internal predecessors, (6636), 906 states have call successors, (906), 18 states have call predecessors, (906), 18 states have return successors, (906), 900 states have call predecessors, (906), 906 states have call successors, (906) [2025-01-09 10:08:09,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5071 states to 5071 states and 8448 transitions. [2025-01-09 10:08:09,623 INFO L78 Accepts]: Start accepts. Automaton has 5071 states and 8448 transitions. Word has length 790 [2025-01-09 10:08:09,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:09,624 INFO L471 AbstractCegarLoop]: Abstraction has 5071 states and 8448 transitions. [2025-01-09 10:08:09,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:09,625 INFO L276 IsEmpty]: Start isEmpty. Operand 5071 states and 8448 transitions. [2025-01-09 10:08:09,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-01-09 10:08:09,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:09,634 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:08:09,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:08:09,634 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:09,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:09,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1933528968, now seen corresponding path program 1 times [2025-01-09 10:08:09,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:09,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492024610] [2025-01-09 10:08:09,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:09,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:09,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-01-09 10:08:09,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-01-09 10:08:09,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:09,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:08:11,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:11,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492024610] [2025-01-09 10:08:11,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492024610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:11,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:11,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 10:08:11,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016178998] [2025-01-09 10:08:11,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:11,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:08:11,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:11,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:08:11,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:08:11,433 INFO L87 Difference]: Start difference. First operand 5071 states and 8448 transitions. Second operand has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 3 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 3 states have call predecessors, (123), 3 states have call successors, (123) [2025-01-09 10:08:13,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:13,652 INFO L93 Difference]: Finished difference Result 14422 states and 24004 transitions. [2025-01-09 10:08:13,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:08:13,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 3 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 3 states have call predecessors, (123), 3 states have call successors, (123) Word has length 790 [2025-01-09 10:08:13,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:13,699 INFO L225 Difference]: With dead ends: 14422 [2025-01-09 10:08:13,699 INFO L226 Difference]: Without dead ends: 9354 [2025-01-09 10:08:13,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:08:13,715 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 2509 mSDsluCounter, 2679 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 600 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2509 SdHoareTripleChecker+Valid, 4219 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 600 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:13,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2509 Valid, 4219 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [600 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 10:08:13,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9354 states. [2025-01-09 10:08:14,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9354 to 9198. [2025-01-09 10:08:14,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9198 states, 7736 states have (on average 1.6078076525336091) internal successors, (12438), 7754 states have internal predecessors, (12438), 1425 states have call successors, (1425), 36 states have call predecessors, (1425), 36 states have return successors, (1425), 1407 states have call predecessors, (1425), 1425 states have call successors, (1425) [2025-01-09 10:08:14,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9198 states to 9198 states and 15288 transitions. [2025-01-09 10:08:14,294 INFO L78 Accepts]: Start accepts. Automaton has 9198 states and 15288 transitions. Word has length 790 [2025-01-09 10:08:14,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:14,295 INFO L471 AbstractCegarLoop]: Abstraction has 9198 states and 15288 transitions. [2025-01-09 10:08:14,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 3 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 3 states have call predecessors, (123), 3 states have call successors, (123) [2025-01-09 10:08:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand 9198 states and 15288 transitions. [2025-01-09 10:08:14,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-01-09 10:08:14,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:14,314 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:08:14,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:08:14,314 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:14,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:14,315 INFO L85 PathProgramCache]: Analyzing trace with hash -484375098, now seen corresponding path program 1 times [2025-01-09 10:08:14,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:14,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705670596] [2025-01-09 10:08:14,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:14,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:14,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-01-09 10:08:14,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-01-09 10:08:14,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:14,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:14,631 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:08:14,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:14,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705670596] [2025-01-09 10:08:14,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705670596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:14,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:14,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:14,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31998896] [2025-01-09 10:08:14,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:14,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:14,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:14,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:14,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:14,634 INFO L87 Difference]: Start difference. First operand 9198 states and 15288 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:15,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:15,118 INFO L93 Difference]: Finished difference Result 27537 states and 45771 transitions. [2025-01-09 10:08:15,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:15,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 790 [2025-01-09 10:08:15,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:15,179 INFO L225 Difference]: With dead ends: 27537 [2025-01-09 10:08:15,179 INFO L226 Difference]: Without dead ends: 18342 [2025-01-09 10:08:15,203 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 10:08:15,204 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 521 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:15,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1508 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:15,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18342 states. [2025-01-09 10:08:15,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18342 to 18340. [2025-01-09 10:08:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18340 states, 15417 states have (on average 1.606667963935915) internal successors, (24770), 15453 states have internal predecessors, (24770), 2850 states have call successors, (2850), 72 states have call predecessors, (2850), 72 states have return successors, (2850), 2814 states have call predecessors, (2850), 2850 states have call successors, (2850) [2025-01-09 10:08:16,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18340 states to 18340 states and 30470 transitions. [2025-01-09 10:08:16,044 INFO L78 Accepts]: Start accepts. Automaton has 18340 states and 30470 transitions. Word has length 790 [2025-01-09 10:08:16,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:16,045 INFO L471 AbstractCegarLoop]: Abstraction has 18340 states and 30470 transitions. [2025-01-09 10:08:16,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:16,045 INFO L276 IsEmpty]: Start isEmpty. Operand 18340 states and 30470 transitions. [2025-01-09 10:08:16,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2025-01-09 10:08:16,065 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:16,066 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:08:16,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:08:16,066 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:16,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:16,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1489845355, now seen corresponding path program 1 times [2025-01-09 10:08:16,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:16,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597619735] [2025-01-09 10:08:16,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:16,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:16,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 791 statements into 1 equivalence classes. [2025-01-09 10:08:16,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 791 of 791 statements. [2025-01-09 10:08:16,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:16,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:16,675 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:08:16,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:16,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597619735] [2025-01-09 10:08:16,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597619735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:16,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:16,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:16,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325412581] [2025-01-09 10:08:16,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:16,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:16,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:16,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:16,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:16,678 INFO L87 Difference]: Start difference. First operand 18340 states and 30470 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:17,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:17,129 INFO L93 Difference]: Finished difference Result 36725 states and 61033 transitions. [2025-01-09 10:08:17,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:17,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 791 [2025-01-09 10:08:17,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:17,174 INFO L225 Difference]: With dead ends: 36725 [2025-01-09 10:08:17,174 INFO L226 Difference]: Without dead ends: 18388 [2025-01-09 10:08:17,197 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 10:08:17,198 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 0 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:17,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1439 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:17,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18388 states. [2025-01-09 10:08:17,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18388 to 18388. [2025-01-09 10:08:17,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18388 states, 15465 states have (on average 1.6047849983834466) internal successors, (24818), 15501 states have internal predecessors, (24818), 2850 states have call successors, (2850), 72 states have call predecessors, (2850), 72 states have return successors, (2850), 2814 states have call predecessors, (2850), 2850 states have call successors, (2850) [2025-01-09 10:08:17,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18388 states to 18388 states and 30518 transitions. [2025-01-09 10:08:17,998 INFO L78 Accepts]: Start accepts. Automaton has 18388 states and 30518 transitions. Word has length 791 [2025-01-09 10:08:17,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:17,999 INFO L471 AbstractCegarLoop]: Abstraction has 18388 states and 30518 transitions. [2025-01-09 10:08:18,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:18,000 INFO L276 IsEmpty]: Start isEmpty. Operand 18388 states and 30518 transitions. [2025-01-09 10:08:18,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2025-01-09 10:08:18,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:18,025 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:08:18,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:08:18,026 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:18,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:18,027 INFO L85 PathProgramCache]: Analyzing trace with hash 441207809, now seen corresponding path program 1 times [2025-01-09 10:08:18,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:18,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518449827] [2025-01-09 10:08:18,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:18,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:18,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 792 statements into 1 equivalence classes. [2025-01-09 10:08:18,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 792 of 792 statements. [2025-01-09 10:08:18,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:18,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:08:19,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:19,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518449827] [2025-01-09 10:08:19,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518449827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:19,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:19,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:08:19,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265149491] [2025-01-09 10:08:19,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:19,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:08:19,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:19,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:08:19,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:08:19,026 INFO L87 Difference]: Start difference. First operand 18388 states and 30518 transitions. Second operand has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:20,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:20,116 INFO L93 Difference]: Finished difference Result 51778 states and 85817 transitions. [2025-01-09 10:08:20,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:08:20,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 792 [2025-01-09 10:08:20,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:20,212 INFO L225 Difference]: With dead ends: 51778 [2025-01-09 10:08:20,212 INFO L226 Difference]: Without dead ends: 33393 [2025-01-09 10:08:20,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:08:20,245 INFO L435 NwaCegarLoop]: 1053 mSDtfsCounter, 1269 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 2536 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:20,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 2536 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:08:20,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33393 states. [2025-01-09 10:08:21,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33393 to 20141. [2025-01-09 10:08:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20141 states, 17170 states have (on average 1.6041933605125218) internal successors, (27544), 17206 states have internal predecessors, (27544), 2850 states have call successors, (2850), 120 states have call predecessors, (2850), 120 states have return successors, (2850), 2814 states have call predecessors, (2850), 2850 states have call successors, (2850) [2025-01-09 10:08:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20141 states to 20141 states and 33244 transitions. [2025-01-09 10:08:21,171 INFO L78 Accepts]: Start accepts. Automaton has 20141 states and 33244 transitions. Word has length 792 [2025-01-09 10:08:21,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:21,172 INFO L471 AbstractCegarLoop]: Abstraction has 20141 states and 33244 transitions. [2025-01-09 10:08:21,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:21,172 INFO L276 IsEmpty]: Start isEmpty. Operand 20141 states and 33244 transitions. [2025-01-09 10:08:21,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2025-01-09 10:08:21,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:21,192 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:08:21,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:08:21,193 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:21,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:21,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1792593027, now seen corresponding path program 1 times [2025-01-09 10:08:21,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:21,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611845339] [2025-01-09 10:08:21,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:21,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:21,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 792 statements into 1 equivalence classes. [2025-01-09 10:08:21,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 792 of 792 statements. [2025-01-09 10:08:21,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:21,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:08:21,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:21,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611845339] [2025-01-09 10:08:21,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611845339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:21,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:21,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:08:21,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287180399] [2025-01-09 10:08:21,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:21,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:08:21,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:22,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:08:22,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:08:22,001 INFO L87 Difference]: Start difference. First operand 20141 states and 33244 transitions. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:22,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:22,885 INFO L93 Difference]: Finished difference Result 60469 states and 99776 transitions. [2025-01-09 10:08:22,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:08:22,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 792 [2025-01-09 10:08:22,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:23,015 INFO L225 Difference]: With dead ends: 60469 [2025-01-09 10:08:23,016 INFO L226 Difference]: Without dead ends: 40331 [2025-01-09 10:08:23,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 10:08:23,071 INFO L435 NwaCegarLoop]: 1331 mSDtfsCounter, 1462 mSDsluCounter, 2199 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 3530 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:23,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1462 Valid, 3530 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:08:23,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40331 states. [2025-01-09 10:08:25,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40331 to 40277. [2025-01-09 10:08:25,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40277 states, 34336 states have (on average 1.6014678471575023) internal successors, (54988), 34408 states have internal predecessors, (54988), 5700 states have call successors, (5700), 240 states have call predecessors, (5700), 240 states have return successors, (5700), 5628 states have call predecessors, (5700), 5700 states have call successors, (5700) [2025-01-09 10:08:25,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40277 states to 40277 states and 66388 transitions. [2025-01-09 10:08:25,263 INFO L78 Accepts]: Start accepts. Automaton has 40277 states and 66388 transitions. Word has length 792 [2025-01-09 10:08:25,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:25,264 INFO L471 AbstractCegarLoop]: Abstraction has 40277 states and 66388 transitions. [2025-01-09 10:08:25,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:25,264 INFO L276 IsEmpty]: Start isEmpty. Operand 40277 states and 66388 transitions. [2025-01-09 10:08:25,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2025-01-09 10:08:25,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:25,286 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:08:25,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:08:25,286 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:25,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:25,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1720206469, now seen corresponding path program 1 times [2025-01-09 10:08:25,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:25,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692011599] [2025-01-09 10:08:25,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:25,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:25,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 792 statements into 1 equivalence classes. [2025-01-09 10:08:25,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 792 of 792 statements. [2025-01-09 10:08:25,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:25,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 84 proven. 282 refuted. 0 times theorem prover too weak. 29646 trivial. 0 not checked. [2025-01-09 10:08:26,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:26,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692011599] [2025-01-09 10:08:26,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692011599] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:08:26,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148427684] [2025-01-09 10:08:26,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:26,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:08:26,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:08:26,627 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 10:08:26,628 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 10:08:26,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 792 statements into 1 equivalence classes. [2025-01-09 10:08:27,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 792 of 792 statements. [2025-01-09 10:08:27,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:27,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:27,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 1775 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 10:08:27,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:08:27,675 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 12476 proven. 105 refuted. 0 times theorem prover too weak. 17431 trivial. 0 not checked. [2025-01-09 10:08:27,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:08:28,458 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 261 proven. 105 refuted. 0 times theorem prover too weak. 29646 trivial. 0 not checked. [2025-01-09 10:08:28,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148427684] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:08:28,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:08:28,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 10:08:28,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228851776] [2025-01-09 10:08:28,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:08:28,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 10:08:28,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:28,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 10:08:28,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:08:28,463 INFO L87 Difference]: Start difference. First operand 40277 states and 66388 transitions. Second operand has 8 states, 8 states have (on average 39.125) internal successors, (313), 8 states have internal predecessors, (313), 3 states have call successors, (252), 2 states have call predecessors, (252), 4 states have return successors, (254), 3 states have call predecessors, (254), 3 states have call successors, (254) [2025-01-09 10:08:30,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:30,085 INFO L93 Difference]: Finished difference Result 65570 states and 107922 transitions. [2025-01-09 10:08:30,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 10:08:30,087 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 39.125) internal successors, (313), 8 states have internal predecessors, (313), 3 states have call successors, (252), 2 states have call predecessors, (252), 4 states have return successors, (254), 3 states have call predecessors, (254), 3 states have call successors, (254) Word has length 792 [2025-01-09 10:08:30,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:30,269 INFO L225 Difference]: With dead ends: 65570 [2025-01-09 10:08:30,270 INFO L226 Difference]: Without dead ends: 25296 [2025-01-09 10:08:30,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1598 GetRequests, 1581 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2025-01-09 10:08:30,325 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 1614 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 635 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 635 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:30,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1643 Valid, 1650 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [635 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 10:08:30,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25296 states. [2025-01-09 10:08:31,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25296 to 22985. [2025-01-09 10:08:31,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22985 states, 18382 states have (on average 1.5402023718855402) internal successors, (28312), 18407 states have internal predecessors, (28312), 4384 states have call successors, (4384), 218 states have call predecessors, (4384), 218 states have return successors, (4384), 4359 states have call predecessors, (4384), 4384 states have call successors, (4384) [2025-01-09 10:08:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22985 states to 22985 states and 37080 transitions. [2025-01-09 10:08:31,945 INFO L78 Accepts]: Start accepts. Automaton has 22985 states and 37080 transitions. Word has length 792 [2025-01-09 10:08:31,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:31,946 INFO L471 AbstractCegarLoop]: Abstraction has 22985 states and 37080 transitions. [2025-01-09 10:08:31,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 39.125) internal successors, (313), 8 states have internal predecessors, (313), 3 states have call successors, (252), 2 states have call predecessors, (252), 4 states have return successors, (254), 3 states have call predecessors, (254), 3 states have call successors, (254) [2025-01-09 10:08:31,947 INFO L276 IsEmpty]: Start isEmpty. Operand 22985 states and 37080 transitions. [2025-01-09 10:08:31,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 798 [2025-01-09 10:08:31,956 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:31,957 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:08:31,968 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 10:08:32,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:08:32,158 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:32,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:32,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1210912090, now seen corresponding path program 1 times [2025-01-09 10:08:32,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:32,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578979912] [2025-01-09 10:08:32,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:32,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:32,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 797 statements into 1 equivalence classes. [2025-01-09 10:08:32,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 797 of 797 statements. [2025-01-09 10:08:32,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:32,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:32,573 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:08:32,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:32,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578979912] [2025-01-09 10:08:32,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578979912] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:32,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:32,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:08:32,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139196032] [2025-01-09 10:08:32,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:32,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:08:32,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:32,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:08:32,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:08:32,576 INFO L87 Difference]: Start difference. First operand 22985 states and 37080 transitions. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:34,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:34,601 INFO L93 Difference]: Finished difference Result 75455 states and 120587 transitions. [2025-01-09 10:08:34,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:08:34,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 797 [2025-01-09 10:08:34,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:34,783 INFO L225 Difference]: With dead ends: 75455 [2025-01-09 10:08:34,784 INFO L226 Difference]: Without dead ends: 52527 [2025-01-09 10:08:34,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:08:34,829 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 726 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 2354 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:34,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 2354 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:08:34,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52527 states. [2025-01-09 10:08:37,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52527 to 41627. [2025-01-09 10:08:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41627 states, 34720 states have (on average 1.554032258064516) internal successors, (53956), 34793 states have internal predecessors, (53956), 6496 states have call successors, (6496), 410 states have call predecessors, (6496), 410 states have return successors, (6496), 6423 states have call predecessors, (6496), 6496 states have call successors, (6496) [2025-01-09 10:08:37,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41627 states to 41627 states and 66948 transitions. [2025-01-09 10:08:37,399 INFO L78 Accepts]: Start accepts. Automaton has 41627 states and 66948 transitions. Word has length 797 [2025-01-09 10:08:37,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:37,400 INFO L471 AbstractCegarLoop]: Abstraction has 41627 states and 66948 transitions. [2025-01-09 10:08:37,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:37,401 INFO L276 IsEmpty]: Start isEmpty. Operand 41627 states and 66948 transitions. [2025-01-09 10:08:37,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 798 [2025-01-09 10:08:37,418 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:37,421 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:08:37,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 10:08:37,425 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:37,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:37,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1691992348, now seen corresponding path program 1 times [2025-01-09 10:08:37,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:37,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009651117] [2025-01-09 10:08:37,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:37,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:37,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 797 statements into 1 equivalence classes. [2025-01-09 10:08:37,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 797 of 797 statements. [2025-01-09 10:08:37,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:37,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:38,141 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:08:38,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:38,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009651117] [2025-01-09 10:08:38,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009651117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:38,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:38,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:08:38,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916610624] [2025-01-09 10:08:38,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:38,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:08:38,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:38,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:08:38,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:08:38,144 INFO L87 Difference]: Start difference. First operand 41627 states and 66948 transitions. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:40,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:40,992 INFO L93 Difference]: Finished difference Result 94400 states and 150535 transitions. [2025-01-09 10:08:40,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:08:40,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 797 [2025-01-09 10:08:40,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:41,122 INFO L225 Difference]: With dead ends: 94400 [2025-01-09 10:08:41,122 INFO L226 Difference]: Without dead ends: 52830 [2025-01-09 10:08:41,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:08:41,174 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 809 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:41,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1611 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:08:41,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52830 states. [2025-01-09 10:08:43,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52830 to 41957. [2025-01-09 10:08:43,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41957 states, 34984 states have (on average 1.5471072490281272) internal successors, (54124), 35056 states have internal predecessors, (54124), 6468 states have call successors, (6468), 504 states have call predecessors, (6468), 504 states have return successors, (6468), 6396 states have call predecessors, (6468), 6468 states have call successors, (6468) [2025-01-09 10:08:43,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41957 states to 41957 states and 67060 transitions. [2025-01-09 10:08:43,821 INFO L78 Accepts]: Start accepts. Automaton has 41957 states and 67060 transitions. Word has length 797 [2025-01-09 10:08:43,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:43,823 INFO L471 AbstractCegarLoop]: Abstraction has 41957 states and 67060 transitions. [2025-01-09 10:08:43,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:08:43,823 INFO L276 IsEmpty]: Start isEmpty. Operand 41957 states and 67060 transitions. [2025-01-09 10:08:43,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 798 [2025-01-09 10:08:43,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:43,871 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:08:43,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 10:08:43,871 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:43,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:43,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1032460826, now seen corresponding path program 1 times [2025-01-09 10:08:43,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:43,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647103026] [2025-01-09 10:08:43,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:43,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:43,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 797 statements into 1 equivalence classes. [2025-01-09 10:08:44,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 797 of 797 statements. [2025-01-09 10:08:44,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:44,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:45,111 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 45 proven. 321 refuted. 0 times theorem prover too weak. 29646 trivial. 0 not checked. [2025-01-09 10:08:45,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:45,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647103026] [2025-01-09 10:08:45,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647103026] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:08:45,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038264422] [2025-01-09 10:08:45,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:45,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:08:45,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:08:45,114 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 10:08:45,119 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 10:08:45,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 797 statements into 1 equivalence classes. [2025-01-09 10:08:45,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 797 of 797 statements. [2025-01-09 10:08:45,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:45,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:45,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 1795 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 10:08:45,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:08:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 14748 proven. 153 refuted. 0 times theorem prover too weak. 15111 trivial. 0 not checked. [2025-01-09 10:08:46,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:08:46,646 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 213 proven. 153 refuted. 0 times theorem prover too weak. 29646 trivial. 0 not checked. [2025-01-09 10:08:46,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038264422] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:08:46,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:08:46,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-01-09 10:08:46,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211058978] [2025-01-09 10:08:46,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:08:46,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 10:08:46,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:46,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 10:08:46,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:08:46,650 INFO L87 Difference]: Start difference. First operand 41957 states and 67060 transitions. Second operand has 10 states, 10 states have (on average 41.4) internal successors, (414), 10 states have internal predecessors, (414), 4 states have call successors, (281), 2 states have call predecessors, (281), 4 states have return successors, (283), 4 states have call predecessors, (283), 4 states have call successors, (283) [2025-01-09 10:08:50,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:50,363 INFO L93 Difference]: Finished difference Result 96496 states and 153774 transitions. [2025-01-09 10:08:50,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 10:08:50,364 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 41.4) internal successors, (414), 10 states have internal predecessors, (414), 4 states have call successors, (281), 2 states have call predecessors, (281), 4 states have return successors, (283), 4 states have call predecessors, (283), 4 states have call successors, (283) Word has length 797 [2025-01-09 10:08:50,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:50,537 INFO L225 Difference]: With dead ends: 96496 [2025-01-09 10:08:50,537 INFO L226 Difference]: Without dead ends: 54542 [2025-01-09 10:08:50,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1620 GetRequests, 1594 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=538, Unknown=0, NotChecked=0, Total=756 [2025-01-09 10:08:50,615 INFO L435 NwaCegarLoop]: 1105 mSDtfsCounter, 2005 mSDsluCounter, 2262 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 820 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2006 SdHoareTripleChecker+Valid, 3367 SdHoareTripleChecker+Invalid, 2286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 820 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:50,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2006 Valid, 3367 Invalid, 2286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [820 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 10:08:50,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54542 states. [2025-01-09 10:08:53,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54542 to 42574. [2025-01-09 10:08:53,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42574 states, 35349 states have (on average 1.5088687091572606) internal successors, (53337), 35422 states have internal predecessors, (53337), 6591 states have call successors, (6591), 633 states have call predecessors, (6591), 633 states have return successors, (6591), 6518 states have call predecessors, (6591), 6591 states have call successors, (6591) [2025-01-09 10:08:53,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42574 states to 42574 states and 66519 transitions. [2025-01-09 10:08:53,428 INFO L78 Accepts]: Start accepts. Automaton has 42574 states and 66519 transitions. Word has length 797 [2025-01-09 10:08:53,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:53,429 INFO L471 AbstractCegarLoop]: Abstraction has 42574 states and 66519 transitions. [2025-01-09 10:08:53,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 41.4) internal successors, (414), 10 states have internal predecessors, (414), 4 states have call successors, (281), 2 states have call predecessors, (281), 4 states have return successors, (283), 4 states have call predecessors, (283), 4 states have call successors, (283) [2025-01-09 10:08:53,429 INFO L276 IsEmpty]: Start isEmpty. Operand 42574 states and 66519 transitions. [2025-01-09 10:08:53,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 801 [2025-01-09 10:08:53,445 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:53,445 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:08:53,455 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 10:08:53,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:08:53,650 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:53,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:53,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1723933909, now seen corresponding path program 1 times [2025-01-09 10:08:53,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:53,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141882605] [2025-01-09 10:08:53,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:53,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:53,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 800 statements into 1 equivalence classes. [2025-01-09 10:08:53,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 800 of 800 statements. [2025-01-09 10:08:53,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:53,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:56,219 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:08:56,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:56,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141882605] [2025-01-09 10:08:56,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141882605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:56,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:56,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 10:08:56,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033234921] [2025-01-09 10:08:56,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:56,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 10:08:56,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:56,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 10:08:56,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:08:56,221 INFO L87 Difference]: Start difference. First operand 42574 states and 66519 transitions. Second operand has 9 states, 9 states have (on average 20.88888888888889) internal successors, (188), 9 states have internal predecessors, (188), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:09:06,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:06,082 INFO L93 Difference]: Finished difference Result 177942 states and 273315 transitions. [2025-01-09 10:09:06,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 10:09:06,082 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.88888888888889) internal successors, (188), 9 states have internal predecessors, (188), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 800 [2025-01-09 10:09:06,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:06,388 INFO L225 Difference]: With dead ends: 177942 [2025-01-09 10:09:06,389 INFO L226 Difference]: Without dead ends: 135604 [2025-01-09 10:09:06,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:09:06,470 INFO L435 NwaCegarLoop]: 1163 mSDtfsCounter, 1769 mSDsluCounter, 4138 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 790 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1769 SdHoareTripleChecker+Valid, 5301 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 790 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:06,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1769 Valid, 5301 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [790 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 10:09:06,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135604 states.