./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-19.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 5de4c46c7cdadd96e091f691a19e362de9991e387636643426a8b01f7f6942d0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:03:09,162 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:03:09,220 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:03:09,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:03:09,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:03:09,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:03:09,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:03:09,264 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:03:09,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:03:09,265 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:03:09,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:03:09,266 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:03:09,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:03:09,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:03:09,267 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:03:09,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:03:09,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:03:09,267 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:03:09,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:03:09,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:03:09,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:03:09,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:03:09,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:03:09,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:03:09,268 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:03:09,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:03:09,268 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:03:09,268 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:03:09,269 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:03:09,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:03:09,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:03:09,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:03:09,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:03:09,270 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:03:09,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:03:09,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:03:09,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:03:09,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:03:09,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:03:09,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:03:09,271 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:03:09,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:03:09,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:03:09,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:03:09,271 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:03:09,271 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:03:09,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:03:09,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:03:09,271 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 -> 5de4c46c7cdadd96e091f691a19e362de9991e387636643426a8b01f7f6942d0 [2025-01-09 10:03:09,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:03:09,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:03:09,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:03:09,564 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:03:09,564 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:03:09,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-19.i [2025-01-09 10:03:10,845 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9d3146f4/b6681cafe5ac45ddb75cd2f89adc5def/FLAG34447199b [2025-01-09 10:03:11,199 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:03:11,200 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-19.i [2025-01-09 10:03:11,220 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9d3146f4/b6681cafe5ac45ddb75cd2f89adc5def/FLAG34447199b [2025-01-09 10:03:11,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9d3146f4/b6681cafe5ac45ddb75cd2f89adc5def [2025-01-09 10:03:11,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:03:11,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:03:11,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:03:11,245 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:03:11,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:03:11,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:03:11" (1/1) ... [2025-01-09 10:03:11,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dc3957f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:11, skipping insertion in model container [2025-01-09 10:03:11,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:03:11" (1/1) ... [2025-01-09 10:03:11,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:03:11,424 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-19.i[916,929] [2025-01-09 10:03:11,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:03:11,614 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:03:11,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-19.i[916,929] [2025-01-09 10:03:11,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:03:11,751 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:03:11,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:11 WrapperNode [2025-01-09 10:03:11,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:03:11,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:03:11,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:03:11,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:03:11,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:11" (1/1) ... [2025-01-09 10:03:11,787 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:11" (1/1) ... [2025-01-09 10:03:11,883 INFO L138 Inliner]: procedures = 26, calls = 103, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 740 [2025-01-09 10:03:11,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:03:11,884 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:03:11,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:03:11,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:03:11,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:11" (1/1) ... [2025-01-09 10:03:11,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:11" (1/1) ... [2025-01-09 10:03:11,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:11" (1/1) ... [2025-01-09 10:03:11,961 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 10:03:11,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:11" (1/1) ... [2025-01-09 10:03:11,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:11" (1/1) ... [2025-01-09 10:03:11,999 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:11" (1/1) ... [2025-01-09 10:03:12,008 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:11" (1/1) ... [2025-01-09 10:03:12,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:11" (1/1) ... [2025-01-09 10:03:12,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:11" (1/1) ... [2025-01-09 10:03:12,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:11" (1/1) ... [2025-01-09 10:03:12,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:03:12,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:03:12,059 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:03:12,059 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:03:12,060 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:11" (1/1) ... [2025-01-09 10:03:12,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:03:12,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:03:12,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:03:12,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:03:12,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:03:12,116 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:03:12,116 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:03:12,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:03:12,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:03:12,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:03:12,279 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:03:12,281 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:03:13,512 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 10:03:13,512 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:03:13,531 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:03:13,531 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:03:13,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:03:13 BoogieIcfgContainer [2025-01-09 10:03:13,532 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:03:13,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:03:13,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:03:13,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:03:13,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:03:11" (1/3) ... [2025-01-09 10:03:13,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf35853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:03:13, skipping insertion in model container [2025-01-09 10:03:13,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:11" (2/3) ... [2025-01-09 10:03:13,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf35853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:03:13, skipping insertion in model container [2025-01-09 10:03:13,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:03:13" (3/3) ... [2025-01-09 10:03:13,543 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-19.i [2025-01-09 10:03:13,556 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:03:13,560 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-19.i that has 2 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:03:13,625 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:03:13,636 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;@91d088c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:03:13,636 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:03:13,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 209 states have (on average 1.61244019138756) internal successors, (337), 210 states have internal predecessors, (337), 90 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 10:03:13,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-01-09 10:03:13,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:13,673 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:13,674 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:13,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:13,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1494237782, now seen corresponding path program 1 times [2025-01-09 10:03:13,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:13,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150777448] [2025-01-09 10:03:13,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:13,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:13,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-01-09 10:03:13,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-01-09 10:03:13,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:13,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:14,421 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 178 refuted. 0 times theorem prover too weak. 15842 trivial. 0 not checked. [2025-01-09 10:03:14,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:14,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150777448] [2025-01-09 10:03:14,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150777448] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:03:14,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786584782] [2025-01-09 10:03:14,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:14,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:03:14,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:03:14,426 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:03:14,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:03:14,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-01-09 10:03:14,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-01-09 10:03:14,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:14,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:14,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 1392 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:03:14,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:03:14,986 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 15842 trivial. 0 not checked. [2025-01-09 10:03:14,987 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:03:14,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786584782] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:14,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:03:14,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:03:14,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315613994] [2025-01-09 10:03:14,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:14,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:03:14,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:15,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:03:15,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:03:15,022 INFO L87 Difference]: Start difference. First operand has 302 states, 209 states have (on average 1.61244019138756) internal successors, (337), 210 states have internal predecessors, (337), 90 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) Second operand has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 2 states have call successors, (90), 2 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 2 states have call successors, (90) [2025-01-09 10:03:15,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:15,079 INFO L93 Difference]: Finished difference Result 593 states and 1109 transitions. [2025-01-09 10:03:15,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:03:15,082 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 2 states have call successors, (90), 2 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 2 states have call successors, (90) Word has length 594 [2025-01-09 10:03:15,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:15,092 INFO L225 Difference]: With dead ends: 593 [2025-01-09 10:03:15,092 INFO L226 Difference]: Without dead ends: 294 [2025-01-09 10:03:15,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:03:15,104 INFO L435 NwaCegarLoop]: 498 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, 498 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:15,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:15,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-01-09 10:03:15,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2025-01-09 10:03:15,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 202 states have (on average 1.5742574257425743) internal successors, (318), 202 states have internal predecessors, (318), 90 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 10:03:15,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 498 transitions. [2025-01-09 10:03:15,202 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 498 transitions. Word has length 594 [2025-01-09 10:03:15,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:15,204 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 498 transitions. [2025-01-09 10:03:15,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 2 states have call successors, (90), 2 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 2 states have call successors, (90) [2025-01-09 10:03:15,206 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 498 transitions. [2025-01-09 10:03:15,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-01-09 10:03:15,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:15,222 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:15,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:03:15,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:03:15,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:15,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:15,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1408837402, now seen corresponding path program 1 times [2025-01-09 10:03:15,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:15,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986614165] [2025-01-09 10:03:15,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:15,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:15,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-01-09 10:03:15,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-01-09 10:03:15,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:15,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-01-09 10:03:16,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:16,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986614165] [2025-01-09 10:03:16,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986614165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:16,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:16,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:16,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538101084] [2025-01-09 10:03:16,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:16,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:16,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:16,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:16,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:16,220 INFO L87 Difference]: Start difference. First operand 294 states and 498 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 10:03:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:16,346 INFO L93 Difference]: Finished difference Result 870 states and 1477 transitions. [2025-01-09 10:03:16,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:16,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 594 [2025-01-09 10:03:16,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:16,355 INFO L225 Difference]: With dead ends: 870 [2025-01-09 10:03:16,355 INFO L226 Difference]: Without dead ends: 579 [2025-01-09 10:03:16,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:16,357 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 477 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:16,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1405 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:16,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-01-09 10:03:16,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 577. [2025-01-09 10:03:16,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 394 states have (on average 1.5659898477157361) internal successors, (617), 394 states have internal predecessors, (617), 180 states have call successors, (180), 2 states have call predecessors, (180), 2 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2025-01-09 10:03:16,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 977 transitions. [2025-01-09 10:03:16,458 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 977 transitions. Word has length 594 [2025-01-09 10:03:16,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:16,460 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 977 transitions. [2025-01-09 10:03:16,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 10:03:16,461 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 977 transitions. [2025-01-09 10:03:16,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-01-09 10:03:16,470 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:16,470 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:16,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:03:16,470 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:16,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:16,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1782291434, now seen corresponding path program 1 times [2025-01-09 10:03:16,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:16,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779376877] [2025-01-09 10:03:16,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:16,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:16,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-01-09 10:03:16,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-01-09 10:03:16,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:16,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-01-09 10:03:16,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:16,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779376877] [2025-01-09 10:03:16,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779376877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:16,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:16,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:16,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326034291] [2025-01-09 10:03:16,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:16,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:16,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:16,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:16,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:16,875 INFO L87 Difference]: Start difference. First operand 577 states and 977 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 10:03:17,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:17,006 INFO L93 Difference]: Finished difference Result 1533 states and 2589 transitions. [2025-01-09 10:03:17,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:17,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 594 [2025-01-09 10:03:17,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:17,022 INFO L225 Difference]: With dead ends: 1533 [2025-01-09 10:03:17,023 INFO L226 Difference]: Without dead ends: 959 [2025-01-09 10:03:17,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:17,026 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 291 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:17,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1134 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-01-09 10:03:17,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 955. [2025-01-09 10:03:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 658 states have (on average 1.5562310030395137) internal successors, (1024), 660 states have internal predecessors, (1024), 292 states have call successors, (292), 4 states have call predecessors, (292), 4 states have return successors, (292), 290 states have call predecessors, (292), 292 states have call successors, (292) [2025-01-09 10:03:17,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1608 transitions. [2025-01-09 10:03:17,217 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1608 transitions. Word has length 594 [2025-01-09 10:03:17,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:17,218 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1608 transitions. [2025-01-09 10:03:17,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 10:03:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1608 transitions. [2025-01-09 10:03:17,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-01-09 10:03:17,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:17,226 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:17,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:03:17,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:17,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:17,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1126472468, now seen corresponding path program 1 times [2025-01-09 10:03:17,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:17,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486920596] [2025-01-09 10:03:17,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:17,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:17,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-01-09 10:03:17,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-01-09 10:03:17,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:17,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:17,575 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-01-09 10:03:17,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:17,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486920596] [2025-01-09 10:03:17,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486920596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:17,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:17,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:17,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074013522] [2025-01-09 10:03:17,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:17,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:17,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:17,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:17,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:17,580 INFO L87 Difference]: Start difference. First operand 955 states and 1608 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 10:03:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:17,710 INFO L93 Difference]: Finished difference Result 2499 states and 4174 transitions. [2025-01-09 10:03:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:17,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 594 [2025-01-09 10:03:17,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:17,727 INFO L225 Difference]: With dead ends: 2499 [2025-01-09 10:03:17,727 INFO L226 Difference]: Without dead ends: 1547 [2025-01-09 10:03:17,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:17,732 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 273 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:17,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 978 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:17,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2025-01-09 10:03:17,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1543. [2025-01-09 10:03:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 966 states have (on average 1.4679089026915113) internal successors, (1418), 972 states have internal predecessors, (1418), 568 states have call successors, (568), 8 states have call predecessors, (568), 8 states have return successors, (568), 562 states have call predecessors, (568), 568 states have call successors, (568) [2025-01-09 10:03:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2554 transitions. [2025-01-09 10:03:17,984 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2554 transitions. Word has length 594 [2025-01-09 10:03:17,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:17,986 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2554 transitions. [2025-01-09 10:03:17,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 10:03:17,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2554 transitions. [2025-01-09 10:03:17,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-01-09 10:03:17,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:17,993 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:17,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:03:17,994 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:17,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:17,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1841373288, now seen corresponding path program 1 times [2025-01-09 10:03:17,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:17,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553695997] [2025-01-09 10:03:17,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:17,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:18,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-01-09 10:03:18,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-01-09 10:03:18,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:18,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-01-09 10:03:18,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:18,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553695997] [2025-01-09 10:03:18,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553695997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:18,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:18,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:18,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253041994] [2025-01-09 10:03:18,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:18,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:18,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:18,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:18,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:18,305 INFO L87 Difference]: Start difference. First operand 1543 states and 2554 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 10:03:18,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:18,517 INFO L93 Difference]: Finished difference Result 4255 states and 7016 transitions. [2025-01-09 10:03:18,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:18,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 594 [2025-01-09 10:03:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:18,542 INFO L225 Difference]: With dead ends: 4255 [2025-01-09 10:03:18,543 INFO L226 Difference]: Without dead ends: 2715 [2025-01-09 10:03:18,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:18,552 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 265 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:18,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 1166 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:18,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2025-01-09 10:03:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2709. [2025-01-09 10:03:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2709 states, 1668 states have (on average 1.434052757793765) internal successors, (2392), 1682 states have internal predecessors, (2392), 1024 states have call successors, (1024), 16 states have call predecessors, (1024), 16 states have return successors, (1024), 1010 states have call predecessors, (1024), 1024 states have call successors, (1024) [2025-01-09 10:03:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2709 states to 2709 states and 4440 transitions. [2025-01-09 10:03:18,901 INFO L78 Accepts]: Start accepts. Automaton has 2709 states and 4440 transitions. Word has length 594 [2025-01-09 10:03:18,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:18,904 INFO L471 AbstractCegarLoop]: Abstraction has 2709 states and 4440 transitions. [2025-01-09 10:03:18,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 10:03:18,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2709 states and 4440 transitions. [2025-01-09 10:03:18,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-01-09 10:03:18,912 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:18,912 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:18,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:03:18,913 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:18,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:18,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1981921898, now seen corresponding path program 1 times [2025-01-09 10:03:18,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:18,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834210444] [2025-01-09 10:03:18,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:18,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:18,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-01-09 10:03:19,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-01-09 10:03:19,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:19,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:19,841 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-01-09 10:03:19,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:19,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834210444] [2025-01-09 10:03:19,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834210444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:19,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:19,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:03:19,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383128887] [2025-01-09 10:03:19,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:19,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:03:19,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:19,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:03:19,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:03:19,845 INFO L87 Difference]: Start difference. First operand 2709 states and 4440 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 10:03:20,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:20,828 INFO L93 Difference]: Finished difference Result 9090 states and 14867 transitions. [2025-01-09 10:03:20,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:03:20,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 594 [2025-01-09 10:03:20,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:20,877 INFO L225 Difference]: With dead ends: 9090 [2025-01-09 10:03:20,877 INFO L226 Difference]: Without dead ends: 6384 [2025-01-09 10:03:20,888 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 10:03:20,890 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 689 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:20,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1571 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:03:20,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6384 states. [2025-01-09 10:03:21,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6384 to 5343. [2025-01-09 10:03:21,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5343 states, 3422 states have (on average 1.4529514903565166) internal successors, (4972), 3452 states have internal predecessors, (4972), 1888 states have call successors, (1888), 32 states have call predecessors, (1888), 32 states have return successors, (1888), 1858 states have call predecessors, (1888), 1888 states have call successors, (1888) [2025-01-09 10:03:21,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5343 states to 5343 states and 8748 transitions. [2025-01-09 10:03:21,477 INFO L78 Accepts]: Start accepts. Automaton has 5343 states and 8748 transitions. Word has length 594 [2025-01-09 10:03:21,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:21,479 INFO L471 AbstractCegarLoop]: Abstraction has 5343 states and 8748 transitions. [2025-01-09 10:03:21,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 10:03:21,480 INFO L276 IsEmpty]: Start isEmpty. Operand 5343 states and 8748 transitions. [2025-01-09 10:03:21,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-01-09 10:03:21,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:21,488 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:21,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:03:21,488 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:21,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:21,489 INFO L85 PathProgramCache]: Analyzing trace with hash -926259988, now seen corresponding path program 1 times [2025-01-09 10:03:21,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:21,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494882673] [2025-01-09 10:03:21,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:21,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:21,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-01-09 10:03:21,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-01-09 10:03:21,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:21,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-01-09 10:03:22,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:22,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494882673] [2025-01-09 10:03:22,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494882673] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:22,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:22,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:22,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486552513] [2025-01-09 10:03:22,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:22,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:22,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:22,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:22,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:22,171 INFO L87 Difference]: Start difference. First operand 5343 states and 8748 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 10:03:22,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:22,688 INFO L93 Difference]: Finished difference Result 13258 states and 21725 transitions. [2025-01-09 10:03:22,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:22,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 594 [2025-01-09 10:03:22,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:22,766 INFO L225 Difference]: With dead ends: 13258 [2025-01-09 10:03:22,766 INFO L226 Difference]: Without dead ends: 7918 [2025-01-09 10:03:22,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:22,793 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 291 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:22,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1126 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:22,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7918 states. [2025-01-09 10:03:23,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7918 to 7916. [2025-01-09 10:03:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7916 states, 5035 states have (on average 1.4440913604766634) internal successors, (7271), 5080 states have internal predecessors, (7271), 2832 states have call successors, (2832), 48 states have call predecessors, (2832), 48 states have return successors, (2832), 2787 states have call predecessors, (2832), 2832 states have call successors, (2832) [2025-01-09 10:03:23,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7916 states to 7916 states and 12935 transitions. [2025-01-09 10:03:23,675 INFO L78 Accepts]: Start accepts. Automaton has 7916 states and 12935 transitions. Word has length 594 [2025-01-09 10:03:23,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:23,677 INFO L471 AbstractCegarLoop]: Abstraction has 7916 states and 12935 transitions. [2025-01-09 10:03:23,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 10:03:23,678 INFO L276 IsEmpty]: Start isEmpty. Operand 7916 states and 12935 transitions. [2025-01-09 10:03:23,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-01-09 10:03:23,686 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:23,686 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:23,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:03:23,687 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:23,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:23,688 INFO L85 PathProgramCache]: Analyzing trace with hash -404587608, now seen corresponding path program 1 times [2025-01-09 10:03:23,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:23,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896365754] [2025-01-09 10:03:23,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:23,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:23,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-01-09 10:03:23,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-01-09 10:03:23,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:23,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:24,542 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-01-09 10:03:24,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:24,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896365754] [2025-01-09 10:03:24,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896365754] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:24,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:24,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:03:24,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38309328] [2025-01-09 10:03:24,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:24,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:03:24,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:24,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:03:24,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:03:24,545 INFO L87 Difference]: Start difference. First operand 7916 states and 12935 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 10:03:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:26,135 INFO L93 Difference]: Finished difference Result 16663 states and 27065 transitions. [2025-01-09 10:03:26,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:03:26,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 594 [2025-01-09 10:03:26,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:26,228 INFO L225 Difference]: With dead ends: 16663 [2025-01-09 10:03:26,228 INFO L226 Difference]: Without dead ends: 11323 [2025-01-09 10:03:26,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:03:26,260 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 699 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:26,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1861 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 10:03:26,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11323 states. [2025-01-09 10:03:27,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11323 to 5784. [2025-01-09 10:03:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5784 states, 4199 states have (on average 1.5267920933555608) internal successors, (6411), 4220 states have internal predecessors, (6411), 1536 states have call successors, (1536), 48 states have call predecessors, (1536), 48 states have return successors, (1536), 1515 states have call predecessors, (1536), 1536 states have call successors, (1536) [2025-01-09 10:03:27,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5784 states to 5784 states and 9483 transitions. [2025-01-09 10:03:27,129 INFO L78 Accepts]: Start accepts. Automaton has 5784 states and 9483 transitions. Word has length 594 [2025-01-09 10:03:27,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:27,131 INFO L471 AbstractCegarLoop]: Abstraction has 5784 states and 9483 transitions. [2025-01-09 10:03:27,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 10:03:27,132 INFO L276 IsEmpty]: Start isEmpty. Operand 5784 states and 9483 transitions. [2025-01-09 10:03:27,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-01-09 10:03:27,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:27,139 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:27,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:03:27,140 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:27,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:27,141 INFO L85 PathProgramCache]: Analyzing trace with hash -2093531350, now seen corresponding path program 1 times [2025-01-09 10:03:27,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:27,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407732184] [2025-01-09 10:03:27,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:27,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:27,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-01-09 10:03:27,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-01-09 10:03:27,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:27,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-01-09 10:03:27,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:27,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407732184] [2025-01-09 10:03:27,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407732184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:27,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:27,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:03:27,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41764352] [2025-01-09 10:03:27,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:27,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:03:27,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:27,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:03:27,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:03:27,813 INFO L87 Difference]: Start difference. First operand 5784 states and 9483 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 10:03:28,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:28,771 INFO L93 Difference]: Finished difference Result 17660 states and 28924 transitions. [2025-01-09 10:03:28,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:03:28,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 594 [2025-01-09 10:03:28,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:28,837 INFO L225 Difference]: With dead ends: 17660 [2025-01-09 10:03:28,838 INFO L226 Difference]: Without dead ends: 11879 [2025-01-09 10:03:28,866 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 10:03:28,869 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 501 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:28,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1493 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:03:28,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11879 states. [2025-01-09 10:03:30,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11879 to 11563. [2025-01-09 10:03:30,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11563 states, 8394 states have (on average 1.5213247557779366) internal successors, (12770), 8436 states have internal predecessors, (12770), 3072 states have call successors, (3072), 96 states have call predecessors, (3072), 96 states have return successors, (3072), 3030 states have call predecessors, (3072), 3072 states have call successors, (3072) [2025-01-09 10:03:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11563 states to 11563 states and 18914 transitions. [2025-01-09 10:03:30,284 INFO L78 Accepts]: Start accepts. Automaton has 11563 states and 18914 transitions. Word has length 594 [2025-01-09 10:03:30,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:30,285 INFO L471 AbstractCegarLoop]: Abstraction has 11563 states and 18914 transitions. [2025-01-09 10:03:30,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 10:03:30,286 INFO L276 IsEmpty]: Start isEmpty. Operand 11563 states and 18914 transitions. [2025-01-09 10:03:30,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-01-09 10:03:30,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:30,293 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:30,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:03:30,293 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:30,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:30,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1190318696, now seen corresponding path program 1 times [2025-01-09 10:03:30,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:30,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051769755] [2025-01-09 10:03:30,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:30,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:30,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-01-09 10:03:30,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-01-09 10:03:30,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:30,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-01-09 10:03:30,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:30,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051769755] [2025-01-09 10:03:30,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051769755] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:30,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:30,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:30,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441857850] [2025-01-09 10:03:30,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:30,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:30,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:30,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:30,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:30,861 INFO L87 Difference]: Start difference. First operand 11563 states and 18914 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 10:03:31,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:31,822 INFO L93 Difference]: Finished difference Result 28904 states and 47305 transitions. [2025-01-09 10:03:31,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:31,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 594 [2025-01-09 10:03:31,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:31,922 INFO L225 Difference]: With dead ends: 28904 [2025-01-09 10:03:31,922 INFO L226 Difference]: Without dead ends: 17344 [2025-01-09 10:03:31,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:31,970 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 274 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:31,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 984 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:31,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17344 states. [2025-01-09 10:03:33,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17344 to 17342. [2025-01-09 10:03:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17342 states, 12589 states have (on average 1.5156882993089205) internal successors, (19081), 12652 states have internal predecessors, (19081), 4608 states have call successors, (4608), 144 states have call predecessors, (4608), 144 states have return successors, (4608), 4545 states have call predecessors, (4608), 4608 states have call successors, (4608) [2025-01-09 10:03:33,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17342 states to 17342 states and 28297 transitions. [2025-01-09 10:03:33,702 INFO L78 Accepts]: Start accepts. Automaton has 17342 states and 28297 transitions. Word has length 594 [2025-01-09 10:03:33,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:33,703 INFO L471 AbstractCegarLoop]: Abstraction has 17342 states and 28297 transitions. [2025-01-09 10:03:33,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 10:03:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand 17342 states and 28297 transitions. [2025-01-09 10:03:33,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-01-09 10:03:33,715 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:33,715 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:33,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:03:33,716 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:33,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:33,717 INFO L85 PathProgramCache]: Analyzing trace with hash 603512682, now seen corresponding path program 1 times [2025-01-09 10:03:33,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:33,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974289923] [2025-01-09 10:03:33,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:33,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:33,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-01-09 10:03:33,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-01-09 10:03:33,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:33,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:34,118 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-01-09 10:03:34,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:34,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974289923] [2025-01-09 10:03:34,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974289923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:34,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:34,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:34,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458064223] [2025-01-09 10:03:34,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:34,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:34,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:34,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:34,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:34,122 INFO L87 Difference]: Start difference. First operand 17342 states and 28297 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 10:03:36,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:36,122 INFO L93 Difference]: Finished difference Result 52020 states and 84885 transitions. [2025-01-09 10:03:36,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:36,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 594 [2025-01-09 10:03:36,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:36,327 INFO L225 Difference]: With dead ends: 52020 [2025-01-09 10:03:36,328 INFO L226 Difference]: Without dead ends: 34681 [2025-01-09 10:03:36,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:36,400 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 317 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:36,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1136 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:36,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34681 states. [2025-01-09 10:03:39,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34681 to 34679. [2025-01-09 10:03:39,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34679 states, 25174 states have (on average 1.5143401922618576) internal successors, (38122), 25300 states have internal predecessors, (38122), 9216 states have call successors, (9216), 288 states have call predecessors, (9216), 288 states have return successors, (9216), 9090 states have call predecessors, (9216), 9216 states have call successors, (9216) [2025-01-09 10:03:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34679 states to 34679 states and 56554 transitions. [2025-01-09 10:03:39,464 INFO L78 Accepts]: Start accepts. Automaton has 34679 states and 56554 transitions. Word has length 594 [2025-01-09 10:03:39,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:39,465 INFO L471 AbstractCegarLoop]: Abstraction has 34679 states and 56554 transitions. [2025-01-09 10:03:39,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 10:03:39,466 INFO L276 IsEmpty]: Start isEmpty. Operand 34679 states and 56554 transitions. [2025-01-09 10:03:39,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2025-01-09 10:03:39,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:39,480 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:39,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:03:39,481 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:39,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:39,482 INFO L85 PathProgramCache]: Analyzing trace with hash -512618712, now seen corresponding path program 1 times [2025-01-09 10:03:39,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:39,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289942077] [2025-01-09 10:03:39,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:39,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:39,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-01-09 10:03:39,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-01-09 10:03:39,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:39,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:40,932 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-01-09 10:03:40,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:40,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289942077] [2025-01-09 10:03:40,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289942077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:40,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:40,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:03:40,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717454386] [2025-01-09 10:03:40,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:40,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:03:40,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:40,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:03:40,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:03:40,936 INFO L87 Difference]: Start difference. First operand 34679 states and 56554 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 10:03:45,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:45,244 INFO L93 Difference]: Finished difference Result 83463 states and 136224 transitions. [2025-01-09 10:03:45,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 10:03:45,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 595 [2025-01-09 10:03:45,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:45,511 INFO L225 Difference]: With dead ends: 83463 [2025-01-09 10:03:45,511 INFO L226 Difference]: Without dead ends: 48787 [2025-01-09 10:03:45,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:03:45,618 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 965 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:45,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 1242 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 10:03:45,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48787 states. [2025-01-09 10:03:48,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48787 to 48713. [2025-01-09 10:03:48,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48713 states, 36184 states have (on average 1.518848109661729) internal successors, (54958), 36382 states have internal predecessors, (54958), 12168 states have call successors, (12168), 360 states have call predecessors, (12168), 360 states have return successors, (12168), 11970 states have call predecessors, (12168), 12168 states have call successors, (12168) [2025-01-09 10:03:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48713 states to 48713 states and 79294 transitions. [2025-01-09 10:03:48,989 INFO L78 Accepts]: Start accepts. Automaton has 48713 states and 79294 transitions. Word has length 595 [2025-01-09 10:03:48,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:48,990 INFO L471 AbstractCegarLoop]: Abstraction has 48713 states and 79294 transitions. [2025-01-09 10:03:48,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 10:03:48,990 INFO L276 IsEmpty]: Start isEmpty. Operand 48713 states and 79294 transitions. [2025-01-09 10:03:49,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-01-09 10:03:49,003 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:49,003 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:49,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:03:49,004 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:49,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:49,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1920153493, now seen corresponding path program 1 times [2025-01-09 10:03:49,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:49,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983993334] [2025-01-09 10:03:49,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:49,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:49,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-01-09 10:03:49,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-01-09 10:03:49,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:49,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:50,135 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-01-09 10:03:50,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:50,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983993334] [2025-01-09 10:03:50,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983993334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:50,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:50,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:50,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601245669] [2025-01-09 10:03:50,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:50,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:50,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:50,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:50,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:50,139 INFO L87 Difference]: Start difference. First operand 48713 states and 79294 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 10:03:56,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:56,252 INFO L93 Difference]: Finished difference Result 139869 states and 227922 transitions. [2025-01-09 10:03:56,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:56,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 597 [2025-01-09 10:03:56,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:56,790 INFO L225 Difference]: With dead ends: 139869 [2025-01-09 10:03:56,790 INFO L226 Difference]: Without dead ends: 91159 [2025-01-09 10:03:56,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:56,926 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 339 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:56,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 1049 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:03:57,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91159 states.