./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-51.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 19040c859ca30831fc6cd7ac759a469fd491f693781bcf5be67393e1fb0ba0e1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:43:59,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:43:59,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:43:59,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:43:59,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:43:59,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:43:59,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:43:59,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:43:59,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:43:59,324 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:43:59,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:43:59,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:43:59,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:43:59,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:43:59,324 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:43:59,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:43:59,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:43:59,325 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:43:59,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:43:59,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:43:59,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:43:59,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:43:59,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:43:59,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:43:59,325 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:43:59,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:43:59,325 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:43:59,325 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:43:59,326 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:43:59,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:43:59,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:43:59,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:43:59,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:43:59,326 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:43:59,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:43:59,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:43:59,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:43:59,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:43:59,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:43:59,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:43:59,326 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:43:59,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:43:59,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:43:59,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:43:59,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:43:59,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:43:59,327 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:43:59,327 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:43:59,327 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 -> 19040c859ca30831fc6cd7ac759a469fd491f693781bcf5be67393e1fb0ba0e1 [2025-01-09 09:43:59,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:43:59,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:43:59,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:43:59,563 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:43:59,563 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:43:59,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-51.i [2025-01-09 09:44:00,806 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5092c60a2/9d005aaec04d466cbedfff4af69beac3/FLAGb0f4bdd8c [2025-01-09 09:44:01,119 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:44:01,120 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-51.i [2025-01-09 09:44:01,129 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5092c60a2/9d005aaec04d466cbedfff4af69beac3/FLAGb0f4bdd8c [2025-01-09 09:44:01,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5092c60a2/9d005aaec04d466cbedfff4af69beac3 [2025-01-09 09:44:01,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:44:01,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:44:01,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:44:01,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:44:01,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:44:01,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:44:01" (1/1) ... [2025-01-09 09:44:01,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48e6d047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:01, skipping insertion in model container [2025-01-09 09:44:01,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:44:01" (1/1) ... [2025-01-09 09:44:01,167 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:44:01,277 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-51.i[916,929] [2025-01-09 09:44:01,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:44:01,377 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:44:01,384 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-51.i[916,929] [2025-01-09 09:44:01,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:44:01,450 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:44:01,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:01 WrapperNode [2025-01-09 09:44:01,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:44:01,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:44:01,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:44:01,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:44:01,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:01" (1/1) ... [2025-01-09 09:44:01,467 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:01" (1/1) ... [2025-01-09 09:44:01,505 INFO L138 Inliner]: procedures = 26, calls = 88, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 510 [2025-01-09 09:44:01,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:44:01,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:44:01,506 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:44:01,506 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:44:01,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:01" (1/1) ... [2025-01-09 09:44:01,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:01" (1/1) ... [2025-01-09 09:44:01,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:01" (1/1) ... [2025-01-09 09:44:01,535 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 09:44:01,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:01" (1/1) ... [2025-01-09 09:44:01,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:01" (1/1) ... [2025-01-09 09:44:01,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:01" (1/1) ... [2025-01-09 09:44:01,552 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:01" (1/1) ... [2025-01-09 09:44:01,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:01" (1/1) ... [2025-01-09 09:44:01,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:01" (1/1) ... [2025-01-09 09:44:01,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:01" (1/1) ... [2025-01-09 09:44:01,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:44:01,574 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:44:01,574 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:44:01,574 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:44:01,575 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:01" (1/1) ... [2025-01-09 09:44:01,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:44:01,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:44:01,601 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 09:44:01,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 09:44:01,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:44:01,618 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:44:01,619 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:44:01,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:44:01,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:44:01,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:44:01,694 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:44:01,695 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:44:02,267 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 09:44:02,268 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:44:02,282 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:44:02,284 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:44:02,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:44:02 BoogieIcfgContainer [2025-01-09 09:44:02,285 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:44:02,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:44:02,286 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:44:02,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:44:02,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:44:01" (1/3) ... [2025-01-09 09:44:02,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2abb2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:44:02, skipping insertion in model container [2025-01-09 09:44:02,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:01" (2/3) ... [2025-01-09 09:44:02,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2abb2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:44:02, skipping insertion in model container [2025-01-09 09:44:02,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:44:02" (3/3) ... [2025-01-09 09:44:02,299 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-51.i [2025-01-09 09:44:02,310 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:44:02,311 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-51.i that has 2 procedures, 221 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:44:02,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:44:02,380 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;@23cbd544, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:44:02,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:44:02,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 143 states have (on average 1.5524475524475525) internal successors, (222), 144 states have internal predecessors, (222), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-09 09:44:02,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-01-09 09:44:02,408 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:02,408 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:44:02,409 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:02,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:02,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1252075979, now seen corresponding path program 1 times [2025-01-09 09:44:02,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:02,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251353028] [2025-01-09 09:44:02,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:02,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:02,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-01-09 09:44:02,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-01-09 09:44:02,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:02,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:02,838 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2025-01-09 09:44:02,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:02,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251353028] [2025-01-09 09:44:02,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251353028] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:44:02,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872074675] [2025-01-09 09:44:02,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:02,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:44:02,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:44:02,845 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:44:02,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 09:44:02,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-01-09 09:44:03,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-01-09 09:44:03,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:03,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:03,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:44:03,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:44:03,202 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2025-01-09 09:44:03,203 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:44:03,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872074675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:03,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:44:03,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:44:03,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261422234] [2025-01-09 09:44:03,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:03,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:44:03,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:03,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:44:03,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:44:03,229 INFO L87 Difference]: Start difference. First operand has 221 states, 143 states have (on average 1.5524475524475525) internal successors, (222), 144 states have internal predecessors, (222), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) [2025-01-09 09:44:03,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:03,278 INFO L93 Difference]: Finished difference Result 436 states and 814 transitions. [2025-01-09 09:44:03,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:44:03,283 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) Word has length 473 [2025-01-09 09:44:03,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:03,291 INFO L225 Difference]: With dead ends: 436 [2025-01-09 09:44:03,291 INFO L226 Difference]: Without dead ends: 218 [2025-01-09 09:44:03,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:44:03,296 INFO L435 NwaCegarLoop]: 365 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, 365 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:03,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:44:03,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-01-09 09:44:03,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-01-09 09:44:03,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 141 states have (on average 1.524822695035461) internal successors, (215), 141 states have internal predecessors, (215), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-09 09:44:03,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 365 transitions. [2025-01-09 09:44:03,358 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 365 transitions. Word has length 473 [2025-01-09 09:44:03,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:03,360 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 365 transitions. [2025-01-09 09:44:03,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) [2025-01-09 09:44:03,360 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 365 transitions. [2025-01-09 09:44:03,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-01-09 09:44:03,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:03,368 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:44:03,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 09:44:03,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 09:44:03,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:03,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:03,570 INFO L85 PathProgramCache]: Analyzing trace with hash 753024133, now seen corresponding path program 1 times [2025-01-09 09:44:03,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:03,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797715194] [2025-01-09 09:44:03,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:03,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:03,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-01-09 09:44:03,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-01-09 09:44:03,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:03,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:04,003 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 09:44:04,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:04,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797715194] [2025-01-09 09:44:04,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797715194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:04,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:04,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:44:04,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926370740] [2025-01-09 09:44:04,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:04,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:44:04,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:04,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:44:04,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:44:04,009 INFO L87 Difference]: Start difference. First operand 218 states and 365 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 09:44:04,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:04,085 INFO L93 Difference]: Finished difference Result 588 states and 989 transitions. [2025-01-09 09:44:04,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:44:04,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 473 [2025-01-09 09:44:04,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:04,094 INFO L225 Difference]: With dead ends: 588 [2025-01-09 09:44:04,094 INFO L226 Difference]: Without dead ends: 373 [2025-01-09 09:44:04,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:44:04,097 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 255 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:04,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 710 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:44:04,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-01-09 09:44:04,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 370. [2025-01-09 09:44:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 254 states have (on average 1.5551181102362204) internal successors, (395), 255 states have internal predecessors, (395), 113 states have call successors, (113), 2 states have call predecessors, (113), 2 states have return successors, (113), 112 states have call predecessors, (113), 113 states have call successors, (113) [2025-01-09 09:44:04,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 621 transitions. [2025-01-09 09:44:04,154 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 621 transitions. Word has length 473 [2025-01-09 09:44:04,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:04,155 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 621 transitions. [2025-01-09 09:44:04,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 09:44:04,155 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 621 transitions. [2025-01-09 09:44:04,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-01-09 09:44:04,162 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:04,162 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:44:04,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:44:04,162 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:04,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:04,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1613670461, now seen corresponding path program 1 times [2025-01-09 09:44:04,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:04,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572191580] [2025-01-09 09:44:04,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:04,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:04,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-01-09 09:44:04,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-01-09 09:44:04,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:04,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 09:44:04,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:04,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572191580] [2025-01-09 09:44:04,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572191580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:04,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:04,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:44:04,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910729104] [2025-01-09 09:44:04,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:04,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:44:04,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:04,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:44:04,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:44:04,778 INFO L87 Difference]: Start difference. First operand 370 states and 621 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 09:44:05,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:05,715 INFO L93 Difference]: Finished difference Result 1930 states and 3245 transitions. [2025-01-09 09:44:05,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 09:44:05,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 473 [2025-01-09 09:44:05,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:05,726 INFO L225 Difference]: With dead ends: 1930 [2025-01-09 09:44:05,726 INFO L226 Difference]: Without dead ends: 1563 [2025-01-09 09:44:05,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:44:05,728 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 1241 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 2547 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:05,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 2547 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 09:44:05,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2025-01-09 09:44:05,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1545. [2025-01-09 09:44:05,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1096 states have (on average 1.573905109489051) internal successors, (1725), 1104 states have internal predecessors, (1725), 438 states have call successors, (438), 10 states have call predecessors, (438), 10 states have return successors, (438), 430 states have call predecessors, (438), 438 states have call successors, (438) [2025-01-09 09:44:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2601 transitions. [2025-01-09 09:44:05,928 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2601 transitions. Word has length 473 [2025-01-09 09:44:05,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:05,931 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2601 transitions. [2025-01-09 09:44:05,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 09:44:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2601 transitions. [2025-01-09 09:44:05,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-01-09 09:44:05,939 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:05,940 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:44:05,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:44:05,940 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:05,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:05,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1783903557, now seen corresponding path program 1 times [2025-01-09 09:44:05,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:05,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702641316] [2025-01-09 09:44:05,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:05,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:05,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-01-09 09:44:06,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-01-09 09:44:06,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:06,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 09:44:06,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:06,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702641316] [2025-01-09 09:44:06,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702641316] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:06,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:06,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:44:06,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777859408] [2025-01-09 09:44:06,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:06,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:44:06,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:06,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:44:06,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:44:06,306 INFO L87 Difference]: Start difference. First operand 1545 states and 2601 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 09:44:06,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:06,972 INFO L93 Difference]: Finished difference Result 5731 states and 9591 transitions. [2025-01-09 09:44:06,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:44:06,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 473 [2025-01-09 09:44:06,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:06,991 INFO L225 Difference]: With dead ends: 5731 [2025-01-09 09:44:06,991 INFO L226 Difference]: Without dead ends: 4189 [2025-01-09 09:44:06,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:44:06,996 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 739 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:06,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 1372 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:44:06,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4189 states. [2025-01-09 09:44:07,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4189 to 3078. [2025-01-09 09:44:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3078 states, 2160 states have (on average 1.5537037037037038) internal successors, (3356), 2179 states have internal predecessors, (3356), 895 states have call successors, (895), 22 states have call predecessors, (895), 22 states have return successors, (895), 876 states have call predecessors, (895), 895 states have call successors, (895) [2025-01-09 09:44:07,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 5146 transitions. [2025-01-09 09:44:07,303 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 5146 transitions. Word has length 473 [2025-01-09 09:44:07,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:07,303 INFO L471 AbstractCegarLoop]: Abstraction has 3078 states and 5146 transitions. [2025-01-09 09:44:07,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 09:44:07,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 5146 transitions. [2025-01-09 09:44:07,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-01-09 09:44:07,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:07,310 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:44:07,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:44:07,310 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:07,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:07,311 INFO L85 PathProgramCache]: Analyzing trace with hash 924296463, now seen corresponding path program 1 times [2025-01-09 09:44:07,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:07,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611083834] [2025-01-09 09:44:07,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:07,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:07,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-01-09 09:44:07,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-01-09 09:44:07,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:07,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:07,448 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 09:44:07,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:07,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611083834] [2025-01-09 09:44:07,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611083834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:07,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:07,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:44:07,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337038411] [2025-01-09 09:44:07,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:07,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:44:07,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:07,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:44:07,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:44:07,450 INFO L87 Difference]: Start difference. First operand 3078 states and 5146 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 09:44:07,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:07,667 INFO L93 Difference]: Finished difference Result 6752 states and 11225 transitions. [2025-01-09 09:44:07,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:44:07,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 474 [2025-01-09 09:44:07,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:07,700 INFO L225 Difference]: With dead ends: 6752 [2025-01-09 09:44:07,707 INFO L226 Difference]: Without dead ends: 3677 [2025-01-09 09:44:07,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:44:07,728 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 241 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:07,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 717 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:44:07,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3677 states. [2025-01-09 09:44:08,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3677 to 3664. [2025-01-09 09:44:08,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3664 states, 2504 states have (on average 1.523961661341853) internal successors, (3816), 2528 states have internal predecessors, (3816), 1121 states have call successors, (1121), 38 states have call predecessors, (1121), 38 states have return successors, (1121), 1097 states have call predecessors, (1121), 1121 states have call successors, (1121) [2025-01-09 09:44:08,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3664 states to 3664 states and 6058 transitions. [2025-01-09 09:44:08,032 INFO L78 Accepts]: Start accepts. Automaton has 3664 states and 6058 transitions. Word has length 474 [2025-01-09 09:44:08,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:08,033 INFO L471 AbstractCegarLoop]: Abstraction has 3664 states and 6058 transitions. [2025-01-09 09:44:08,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 09:44:08,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3664 states and 6058 transitions. [2025-01-09 09:44:08,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-01-09 09:44:08,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:08,042 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:44:08,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:44:08,043 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:08,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:08,044 INFO L85 PathProgramCache]: Analyzing trace with hash -863473583, now seen corresponding path program 1 times [2025-01-09 09:44:08,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:08,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949168250] [2025-01-09 09:44:08,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:08,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:08,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-01-09 09:44:08,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-01-09 09:44:08,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:08,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:08,440 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 09:44:08,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:08,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949168250] [2025-01-09 09:44:08,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949168250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:08,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:08,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:44:08,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15080146] [2025-01-09 09:44:08,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:08,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:44:08,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:08,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:44:08,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:44:08,443 INFO L87 Difference]: Start difference. First operand 3664 states and 6058 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 09:44:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:08,845 INFO L93 Difference]: Finished difference Result 8694 states and 14470 transitions. [2025-01-09 09:44:08,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:44:08,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 474 [2025-01-09 09:44:08,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:08,872 INFO L225 Difference]: With dead ends: 8694 [2025-01-09 09:44:08,872 INFO L226 Difference]: Without dead ends: 5087 [2025-01-09 09:44:08,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:44:08,884 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 326 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:08,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1071 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:44:08,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5087 states. [2025-01-09 09:44:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5087 to 4667. [2025-01-09 09:44:09,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4667 states, 3462 states have (on average 1.5811669555170422) internal successors, (5474), 3485 states have internal predecessors, (5474), 1162 states have call successors, (1162), 42 states have call predecessors, (1162), 42 states have return successors, (1162), 1139 states have call predecessors, (1162), 1162 states have call successors, (1162) [2025-01-09 09:44:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4667 states to 4667 states and 7798 transitions. [2025-01-09 09:44:09,300 INFO L78 Accepts]: Start accepts. Automaton has 4667 states and 7798 transitions. Word has length 474 [2025-01-09 09:44:09,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:09,301 INFO L471 AbstractCegarLoop]: Abstraction has 4667 states and 7798 transitions. [2025-01-09 09:44:09,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 09:44:09,302 INFO L276 IsEmpty]: Start isEmpty. Operand 4667 states and 7798 transitions. [2025-01-09 09:44:09,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-01-09 09:44:09,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:09,308 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:44:09,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:44:09,309 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:09,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:09,309 INFO L85 PathProgramCache]: Analyzing trace with hash -109431411, now seen corresponding path program 1 times [2025-01-09 09:44:09,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:09,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424042251] [2025-01-09 09:44:09,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:09,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:09,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-01-09 09:44:09,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-01-09 09:44:09,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:09,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 09:44:09,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:09,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424042251] [2025-01-09 09:44:09,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424042251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:09,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:09,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:44:09,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086991623] [2025-01-09 09:44:09,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:09,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:44:09,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:09,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:44:09,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:44:09,738 INFO L87 Difference]: Start difference. First operand 4667 states and 7798 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 09:44:10,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:10,051 INFO L93 Difference]: Finished difference Result 10588 states and 17611 transitions. [2025-01-09 09:44:10,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:44:10,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 475 [2025-01-09 09:44:10,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:10,096 INFO L225 Difference]: With dead ends: 10588 [2025-01-09 09:44:10,096 INFO L226 Difference]: Without dead ends: 6687 [2025-01-09 09:44:10,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:44:10,109 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 232 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:10,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1040 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:44:10,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6687 states. [2025-01-09 09:44:10,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6687 to 6679. [2025-01-09 09:44:10,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6679 states, 4975 states have (on average 1.5794974874371859) internal successors, (7858), 5010 states have internal predecessors, (7858), 1630 states have call successors, (1630), 73 states have call predecessors, (1630), 73 states have return successors, (1630), 1595 states have call predecessors, (1630), 1630 states have call successors, (1630) [2025-01-09 09:44:10,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6679 states to 6679 states and 11118 transitions. [2025-01-09 09:44:10,455 INFO L78 Accepts]: Start accepts. Automaton has 6679 states and 11118 transitions. Word has length 475 [2025-01-09 09:44:10,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:10,456 INFO L471 AbstractCegarLoop]: Abstraction has 6679 states and 11118 transitions. [2025-01-09 09:44:10,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 09:44:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 6679 states and 11118 transitions. [2025-01-09 09:44:10,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-01-09 09:44:10,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:10,461 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:44:10,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:44:10,461 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:10,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:10,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1941552587, now seen corresponding path program 1 times [2025-01-09 09:44:10,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:10,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893584842] [2025-01-09 09:44:10,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:10,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:10,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-01-09 09:44:10,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-01-09 09:44:10,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:10,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 09:44:10,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:10,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893584842] [2025-01-09 09:44:10,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893584842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:10,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:10,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:44:10,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819922144] [2025-01-09 09:44:10,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:10,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:44:10,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:10,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:44:10,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:44:10,997 INFO L87 Difference]: Start difference. First operand 6679 states and 11118 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 09:44:11,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:11,933 INFO L93 Difference]: Finished difference Result 17301 states and 28509 transitions. [2025-01-09 09:44:11,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:44:11,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 475 [2025-01-09 09:44:11,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:11,979 INFO L225 Difference]: With dead ends: 17301 [2025-01-09 09:44:11,979 INFO L226 Difference]: Without dead ends: 12086 [2025-01-09 09:44:12,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:44:12,001 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 337 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:12,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1290 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:44:12,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12086 states. [2025-01-09 09:44:12,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12086 to 11892. [2025-01-09 09:44:12,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11892 states, 8565 states have (on average 1.5516637478108581) internal successors, (13290), 8635 states have internal predecessors, (13290), 3185 states have call successors, (3185), 141 states have call predecessors, (3185), 141 states have return successors, (3185), 3115 states have call predecessors, (3185), 3185 states have call successors, (3185) [2025-01-09 09:44:12,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11892 states to 11892 states and 19660 transitions. [2025-01-09 09:44:12,885 INFO L78 Accepts]: Start accepts. Automaton has 11892 states and 19660 transitions. Word has length 475 [2025-01-09 09:44:12,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:12,886 INFO L471 AbstractCegarLoop]: Abstraction has 11892 states and 19660 transitions. [2025-01-09 09:44:12,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 09:44:12,887 INFO L276 IsEmpty]: Start isEmpty. Operand 11892 states and 19660 transitions. [2025-01-09 09:44:12,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-01-09 09:44:12,891 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:12,891 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:44:12,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:44:12,892 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:12,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:12,892 INFO L85 PathProgramCache]: Analyzing trace with hash 626846124, now seen corresponding path program 1 times [2025-01-09 09:44:12,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:12,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178548966] [2025-01-09 09:44:12,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:12,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:12,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-01-09 09:44:12,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-01-09 09:44:12,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:12,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 09:44:13,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:13,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178548966] [2025-01-09 09:44:13,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178548966] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:13,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:13,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:44:13,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219423848] [2025-01-09 09:44:13,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:13,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:44:13,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:13,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:44:13,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:44:13,224 INFO L87 Difference]: Start difference. First operand 11892 states and 19660 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) [2025-01-09 09:44:14,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:14,367 INFO L93 Difference]: Finished difference Result 32748 states and 53906 transitions. [2025-01-09 09:44:14,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:44:14,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) Word has length 476 [2025-01-09 09:44:14,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:14,462 INFO L225 Difference]: With dead ends: 32748 [2025-01-09 09:44:14,463 INFO L226 Difference]: Without dead ends: 22320 [2025-01-09 09:44:14,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:44:14,503 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 332 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:14,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1054 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:44:14,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22320 states. [2025-01-09 09:44:16,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22320 to 22318. [2025-01-09 09:44:16,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22318 states, 15745 states have (on average 1.5316608447126072) internal successors, (24116), 15885 states have internal predecessors, (24116), 6295 states have call successors, (6295), 277 states have call predecessors, (6295), 277 states have return successors, (6295), 6155 states have call predecessors, (6295), 6295 states have call successors, (6295) [2025-01-09 09:44:16,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22318 states to 22318 states and 36706 transitions. [2025-01-09 09:44:16,370 INFO L78 Accepts]: Start accepts. Automaton has 22318 states and 36706 transitions. Word has length 476 [2025-01-09 09:44:16,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:16,371 INFO L471 AbstractCegarLoop]: Abstraction has 22318 states and 36706 transitions. [2025-01-09 09:44:16,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) [2025-01-09 09:44:16,371 INFO L276 IsEmpty]: Start isEmpty. Operand 22318 states and 36706 transitions. [2025-01-09 09:44:16,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-01-09 09:44:16,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:16,377 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:44:16,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:44:16,377 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:16,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:16,377 INFO L85 PathProgramCache]: Analyzing trace with hash 233819114, now seen corresponding path program 1 times [2025-01-09 09:44:16,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:16,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478288065] [2025-01-09 09:44:16,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:16,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:16,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-01-09 09:44:16,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-01-09 09:44:16,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:16,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:16,630 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 09:44:16,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:16,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478288065] [2025-01-09 09:44:16,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478288065] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:16,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:16,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:44:16,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284063062] [2025-01-09 09:44:16,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:16,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:44:16,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:16,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:44:16,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:44:16,633 INFO L87 Difference]: Start difference. First operand 22318 states and 36706 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 09:44:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:17,550 INFO L93 Difference]: Finished difference Result 43552 states and 71521 transitions. [2025-01-09 09:44:17,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:44:17,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 476 [2025-01-09 09:44:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:17,653 INFO L225 Difference]: With dead ends: 43552 [2025-01-09 09:44:17,653 INFO L226 Difference]: Without dead ends: 22698 [2025-01-09 09:44:17,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:44:17,705 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 17 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:17,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 733 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:44:17,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22698 states. [2025-01-09 09:44:19,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22698 to 22318. [2025-01-09 09:44:19,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22318 states, 15745 states have (on average 1.5220069863448713) internal successors, (23964), 15885 states have internal predecessors, (23964), 6295 states have call successors, (6295), 277 states have call predecessors, (6295), 277 states have return successors, (6295), 6155 states have call predecessors, (6295), 6295 states have call successors, (6295) [2025-01-09 09:44:19,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22318 states to 22318 states and 36554 transitions. [2025-01-09 09:44:19,312 INFO L78 Accepts]: Start accepts. Automaton has 22318 states and 36554 transitions. Word has length 476 [2025-01-09 09:44:19,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:19,313 INFO L471 AbstractCegarLoop]: Abstraction has 22318 states and 36554 transitions. [2025-01-09 09:44:19,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 09:44:19,314 INFO L276 IsEmpty]: Start isEmpty. Operand 22318 states and 36554 transitions. [2025-01-09 09:44:19,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-01-09 09:44:19,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:19,321 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:44:19,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:44:19,321 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:19,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:19,322 INFO L85 PathProgramCache]: Analyzing trace with hash -305030048, now seen corresponding path program 1 times [2025-01-09 09:44:19,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:19,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866889963] [2025-01-09 09:44:19,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:19,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:19,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-01-09 09:44:19,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-01-09 09:44:19,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:19,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:19,797 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 24 proven. 198 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-01-09 09:44:19,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:19,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866889963] [2025-01-09 09:44:19,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866889963] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:44:19,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115630284] [2025-01-09 09:44:19,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:19,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:44:19,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:44:19,801 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:44:19,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 09:44:19,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-01-09 09:44:20,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-01-09 09:44:20,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:20,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:20,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 09:44:20,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:44:20,546 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 2202 proven. 198 refuted. 0 times theorem prover too weak. 8700 trivial. 0 not checked. [2025-01-09 09:44:20,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:44:21,034 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 24 proven. 198 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-01-09 09:44:21,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115630284] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:44:21,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:44:21,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 09:44:21,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245624990] [2025-01-09 09:44:21,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:44:21,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 09:44:21,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:21,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 09:44:21,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:44:21,037 INFO L87 Difference]: Start difference. First operand 22318 states and 36554 transitions. Second operand has 8 states, 8 states have (on average 24.625) internal successors, (197), 8 states have internal predecessors, (197), 3 states have call successors, (207), 2 states have call predecessors, (207), 4 states have return successors, (208), 3 states have call predecessors, (208), 3 states have call successors, (208) [2025-01-09 09:44:22,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:22,890 INFO L93 Difference]: Finished difference Result 33912 states and 54614 transitions. [2025-01-09 09:44:22,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 09:44:22,891 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 24.625) internal successors, (197), 8 states have internal predecessors, (197), 3 states have call successors, (207), 2 states have call predecessors, (207), 4 states have return successors, (208), 3 states have call predecessors, (208), 3 states have call successors, (208) Word has length 477 [2025-01-09 09:44:22,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:23,006 INFO L225 Difference]: With dead ends: 33912 [2025-01-09 09:44:23,007 INFO L226 Difference]: Without dead ends: 23484 [2025-01-09 09:44:23,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 960 GetRequests, 951 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:44:23,045 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 261 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:23,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 692 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:44:23,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23484 states. [2025-01-09 09:44:24,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23484 to 12200. [2025-01-09 09:44:24,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12200 states, 8796 states have (on average 1.5198954070031834) internal successors, (13369), 8866 states have internal predecessors, (13369), 3185 states have call successors, (3185), 218 states have call predecessors, (3185), 218 states have return successors, (3185), 3115 states have call predecessors, (3185), 3185 states have call successors, (3185) [2025-01-09 09:44:24,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12200 states to 12200 states and 19739 transitions. [2025-01-09 09:44:24,304 INFO L78 Accepts]: Start accepts. Automaton has 12200 states and 19739 transitions. Word has length 477 [2025-01-09 09:44:24,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:24,306 INFO L471 AbstractCegarLoop]: Abstraction has 12200 states and 19739 transitions. [2025-01-09 09:44:24,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.625) internal successors, (197), 8 states have internal predecessors, (197), 3 states have call successors, (207), 2 states have call predecessors, (207), 4 states have return successors, (208), 3 states have call predecessors, (208), 3 states have call successors, (208) [2025-01-09 09:44:24,306 INFO L276 IsEmpty]: Start isEmpty. Operand 12200 states and 19739 transitions. [2025-01-09 09:44:24,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-01-09 09:44:24,311 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:24,311 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:44:24,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 09:44:24,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:44:24,512 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:24,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:24,512 INFO L85 PathProgramCache]: Analyzing trace with hash -698057058, now seen corresponding path program 1 times [2025-01-09 09:44:24,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:24,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644421762] [2025-01-09 09:44:24,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:24,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:24,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-01-09 09:44:24,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-01-09 09:44:24,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:24,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 54 proven. 168 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-01-09 09:44:24,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:24,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644421762] [2025-01-09 09:44:24,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644421762] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:44:24,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645232349] [2025-01-09 09:44:24,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:24,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:44:24,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:44:24,940 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:44:24,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 09:44:25,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-01-09 09:44:25,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-01-09 09:44:25,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:25,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:25,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 1056 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 09:44:25,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:44:25,946 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 5627 proven. 162 refuted. 0 times theorem prover too weak. 5311 trivial. 0 not checked. [2025-01-09 09:44:25,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:44:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 276 proven. 165 refuted. 0 times theorem prover too weak. 10659 trivial. 0 not checked. [2025-01-09 09:44:26,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645232349] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:44:26,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:44:26,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 19 [2025-01-09 09:44:26,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217805404] [2025-01-09 09:44:26,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:44:26,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 09:44:26,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:26,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 09:44:26,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-01-09 09:44:26,736 INFO L87 Difference]: Start difference. First operand 12200 states and 19739 transitions. Second operand has 19 states, 19 states have (on average 11.842105263157896) internal successors, (225), 19 states have internal predecessors, (225), 4 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (162), 4 states have call predecessors, (162), 4 states have call successors, (162) [2025-01-09 09:44:43,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:43,049 INFO L93 Difference]: Finished difference Result 125516 states and 192353 transitions. [2025-01-09 09:44:43,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2025-01-09 09:44:43,050 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 11.842105263157896) internal successors, (225), 19 states have internal predecessors, (225), 4 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (162), 4 states have call predecessors, (162), 4 states have call successors, (162) Word has length 477 [2025-01-09 09:44:43,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:43,552 INFO L225 Difference]: With dead ends: 125516 [2025-01-09 09:44:43,552 INFO L226 Difference]: Without dead ends: 113922 [2025-01-09 09:44:43,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1203 GetRequests, 966 SyntacticMatches, 2 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25080 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6857, Invalid=49075, Unknown=0, NotChecked=0, Total=55932 [2025-01-09 09:44:43,629 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 5758 mSDsluCounter, 4347 mSDsCounter, 0 mSdLazyCounter, 5514 mSolverCounterSat, 3328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5760 SdHoareTripleChecker+Valid, 5217 SdHoareTripleChecker+Invalid, 8842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3328 IncrementalHoareTripleChecker+Valid, 5514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:43,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5760 Valid, 5217 Invalid, 8842 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3328 Valid, 5514 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-01-09 09:44:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113922 states. [2025-01-09 09:44:49,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113922 to 40666. [2025-01-09 09:44:49,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40666 states, 27865 states have (on average 1.4009689574735331) internal successors, (39038), 28253 states have internal predecessors, (39038), 11595 states have call successors, (11595), 1205 states have call predecessors, (11595), 1205 states have return successors, (11595), 11207 states have call predecessors, (11595), 11595 states have call successors, (11595) [2025-01-09 09:44:49,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40666 states to 40666 states and 62228 transitions. [2025-01-09 09:44:50,062 INFO L78 Accepts]: Start accepts. Automaton has 40666 states and 62228 transitions. Word has length 477 [2025-01-09 09:44:50,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:50,063 INFO L471 AbstractCegarLoop]: Abstraction has 40666 states and 62228 transitions. [2025-01-09 09:44:50,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.842105263157896) internal successors, (225), 19 states have internal predecessors, (225), 4 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (162), 4 states have call predecessors, (162), 4 states have call successors, (162) [2025-01-09 09:44:50,064 INFO L276 IsEmpty]: Start isEmpty. Operand 40666 states and 62228 transitions. [2025-01-09 09:44:50,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-01-09 09:44:50,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:50,074 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:44:50,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 09:44:50,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:44:50,351 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:50,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:50,352 INFO L85 PathProgramCache]: Analyzing trace with hash -716240477, now seen corresponding path program 1 times [2025-01-09 09:44:50,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:50,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585631442] [2025-01-09 09:44:50,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:50,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:50,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-01-09 09:44:50,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-01-09 09:44:50,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:50,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:50,609 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 09:44:50,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:50,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585631442] [2025-01-09 09:44:50,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585631442] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:50,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:50,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:44:50,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043174885] [2025-01-09 09:44:50,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:50,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:44:50,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:50,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:44:50,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:44:50,613 INFO L87 Difference]: Start difference. First operand 40666 states and 62228 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 09:44:57,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:57,362 INFO L93 Difference]: Finished difference Result 102980 states and 157006 transitions. [2025-01-09 09:44:57,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:44:57,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 478 [2025-01-09 09:44:57,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:57,622 INFO L225 Difference]: With dead ends: 102980 [2025-01-09 09:44:57,622 INFO L226 Difference]: Without dead ends: 64580 [2025-01-09 09:44:57,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:44:57,737 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 212 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:57,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 701 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:44:57,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64580 states. [2025-01-09 09:45:05,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64580 to 64578. [2025-01-09 09:45:05,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64578 states, 43903 states have (on average 1.3890166958977745) internal successors, (60982), 44533 states have internal predecessors, (60982), 18725 states have call successors, (18725), 1949 states have call predecessors, (18725), 1949 states have return successors, (18725), 18095 states have call predecessors, (18725), 18725 states have call successors, (18725) [2025-01-09 09:45:05,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64578 states to 64578 states and 98432 transitions. [2025-01-09 09:45:05,664 INFO L78 Accepts]: Start accepts. Automaton has 64578 states and 98432 transitions. Word has length 478 [2025-01-09 09:45:05,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:05,664 INFO L471 AbstractCegarLoop]: Abstraction has 64578 states and 98432 transitions. [2025-01-09 09:45:05,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 09:45:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 64578 states and 98432 transitions. [2025-01-09 09:45:05,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-01-09 09:45:05,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:05,676 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:45:05,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 09:45:05,677 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:05,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:05,677 INFO L85 PathProgramCache]: Analyzing trace with hash -156061055, now seen corresponding path program 1 times [2025-01-09 09:45:05,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:05,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104084086] [2025-01-09 09:45:05,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:05,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:05,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-01-09 09:45:05,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-01-09 09:45:05,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:05,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 09:45:06,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:06,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104084086] [2025-01-09 09:45:06,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104084086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:06,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:06,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 09:45:06,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820767770] [2025-01-09 09:45:06,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:06,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:45:06,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:06,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:45:06,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:45:06,519 INFO L87 Difference]: Start difference. First operand 64578 states and 98432 transitions. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75)