./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-22.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-22.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 ae10f7a0aac4ff5642a6d224665fe38f2df489ec0407dcdcfbdd7d0fdf46302b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:03:12,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:03:12,429 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:12,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:03:12,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:03:12,460 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:03:12,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:03:12,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:03:12,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:03:12,462 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:03:12,462 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:03:12,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:03:12,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:03:12,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:03:12,463 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:03:12,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:03:12,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:03:12,463 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:03:12,464 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:03:12,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:03:12,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:03:12,464 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:03:12,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:03:12,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:03:12,464 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:03:12,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:03:12,464 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:03:12,464 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:03:12,464 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:03:12,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:03:12,465 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:03:12,465 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:03:12,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:03:12,465 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:03:12,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:03:12,465 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:03:12,465 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:03:12,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:03:12,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:03:12,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:03:12,466 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:03:12,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:03:12,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:03:12,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:03:12,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:03:12,466 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:03:12,466 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:03:12,466 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:03:12,466 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 -> ae10f7a0aac4ff5642a6d224665fe38f2df489ec0407dcdcfbdd7d0fdf46302b [2025-01-09 10:03:12,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:03:12,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:03:12,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:03:12,717 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:03:12,717 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:03:12,718 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-22.i [2025-01-09 10:03:14,612 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45434307c/e8c68fb40e4f4d24a948311d74b2cb28/FLAG26f950d9a [2025-01-09 10:03:14,937 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:03:14,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-22.i [2025-01-09 10:03:14,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45434307c/e8c68fb40e4f4d24a948311d74b2cb28/FLAG26f950d9a [2025-01-09 10:03:14,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45434307c/e8c68fb40e4f4d24a948311d74b2cb28 [2025-01-09 10:03:14,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:03:14,975 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:03:14,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:03:14,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:03:14,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:03:14,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:03:14" (1/1) ... [2025-01-09 10:03:14,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c5c60b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:14, skipping insertion in model container [2025-01-09 10:03:14,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:03:14" (1/1) ... [2025-01-09 10:03:15,015 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:03:15,139 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-22.i[916,929] [2025-01-09 10:03:15,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:03:15,286 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:03:15,296 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-22.i[916,929] [2025-01-09 10:03:15,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:03:15,380 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:03:15,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:15 WrapperNode [2025-01-09 10:03:15,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:03:15,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:03:15,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:03:15,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:03:15,388 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:15" (1/1) ... [2025-01-09 10:03:15,413 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:15" (1/1) ... [2025-01-09 10:03:15,481 INFO L138 Inliner]: procedures = 26, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 942 [2025-01-09 10:03:15,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:03:15,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:03:15,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:03:15,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:03:15,490 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:15" (1/1) ... [2025-01-09 10:03:15,490 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:15" (1/1) ... [2025-01-09 10:03:15,500 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:15" (1/1) ... [2025-01-09 10:03:15,538 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:15,538 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:15" (1/1) ... [2025-01-09 10:03:15,538 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:15" (1/1) ... [2025-01-09 10:03:15,560 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:15" (1/1) ... [2025-01-09 10:03:15,563 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:15" (1/1) ... [2025-01-09 10:03:15,568 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:15" (1/1) ... [2025-01-09 10:03:15,581 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:15" (1/1) ... [2025-01-09 10:03:15,589 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:15" (1/1) ... [2025-01-09 10:03:15,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:03:15,601 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:03:15,602 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:03:15,602 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:03:15,603 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:15" (1/1) ... [2025-01-09 10:03:15,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:03:15,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:03:15,630 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:15,633 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:15,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:03:15,652 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:03:15,652 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:03:15,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:03:15,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:03:15,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:03:15,766 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:03:15,768 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:03:16,970 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-01-09 10:03:16,970 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:03:16,995 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:03:16,996 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:03:16,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:03:16 BoogieIcfgContainer [2025-01-09 10:03:16,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:03:16,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:03:17,000 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:03:17,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:03:17,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:03:14" (1/3) ... [2025-01-09 10:03:17,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f0c7f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:03:17, skipping insertion in model container [2025-01-09 10:03:17,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:15" (2/3) ... [2025-01-09 10:03:17,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f0c7f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:03:17, skipping insertion in model container [2025-01-09 10:03:17,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:03:16" (3/3) ... [2025-01-09 10:03:17,006 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-22.i [2025-01-09 10:03:17,022 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:03:17,025 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-22.i that has 2 procedures, 391 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:03:17,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:03:17,099 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;@20de8e95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:03:17,099 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:03:17,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 391 states, 265 states have (on average 1.5849056603773586) internal successors, (420), 266 states have internal predecessors, (420), 123 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 123 states have call predecessors, (123), 123 states have call successors, (123) [2025-01-09 10:03:17,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-01-09 10:03:17,133 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:17,134 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:17,134 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:17,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:17,138 INFO L85 PathProgramCache]: Analyzing trace with hash -347080746, now seen corresponding path program 1 times [2025-01-09 10:03:17,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:17,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313712140] [2025-01-09 10:03:17,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:17,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:17,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-01-09 10:03:17,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-01-09 10:03:17,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:17,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:17,747 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 29768 trivial. 0 not checked. [2025-01-09 10:03:17,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:17,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313712140] [2025-01-09 10:03:17,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313712140] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:03:17,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989216470] [2025-01-09 10:03:17,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:17,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:03:17,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:03:17,750 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:17,752 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:17,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-01-09 10:03:18,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-01-09 10:03:18,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:18,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:18,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 1727 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:03:18,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:03:18,253 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 29768 trivial. 0 not checked. [2025-01-09 10:03:18,254 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:03:18,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989216470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:18,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:03:18,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:03:18,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754245566] [2025-01-09 10:03:18,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:18,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:03:18,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:18,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:03:18,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:03:18,278 INFO L87 Difference]: Start difference. First operand has 391 states, 265 states have (on average 1.5849056603773586) internal successors, (420), 266 states have internal predecessors, (420), 123 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 123 states have call predecessors, (123), 123 states have call successors, (123) Second operand has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 2 states have call successors, (123), 2 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 2 states have call successors, (123) [2025-01-09 10:03:18,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:18,347 INFO L93 Difference]: Finished difference Result 776 states and 1450 transitions. [2025-01-09 10:03:18,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:03:18,349 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 2 states have call successors, (123), 2 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 2 states have call successors, (123) Word has length 777 [2025-01-09 10:03:18,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:18,356 INFO L225 Difference]: With dead ends: 776 [2025-01-09 10:03:18,356 INFO L226 Difference]: Without dead ends: 388 [2025-01-09 10:03:18,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 778 GetRequests, 778 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:18,362 INFO L435 NwaCegarLoop]: 659 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, 659 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:18,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 659 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:18,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-01-09 10:03:18,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2025-01-09 10:03:18,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 263 states have (on average 1.570342205323194) internal successors, (413), 263 states have internal predecessors, (413), 123 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 123 states have call predecessors, (123), 123 states have call successors, (123) [2025-01-09 10:03:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 659 transitions. [2025-01-09 10:03:18,452 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 659 transitions. Word has length 777 [2025-01-09 10:03:18,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:18,453 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 659 transitions. [2025-01-09 10:03:18,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 2 states have call successors, (123), 2 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 2 states have call successors, (123) [2025-01-09 10:03:18,453 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 659 transitions. [2025-01-09 10:03:18,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-01-09 10:03:18,465 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:18,465 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:18,476 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:18,670 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:18,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:18,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:18,671 INFO L85 PathProgramCache]: Analyzing trace with hash 570419700, now seen corresponding path program 1 times [2025-01-09 10:03:18,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:18,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740503685] [2025-01-09 10:03:18,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:18,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:18,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-01-09 10:03:18,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-01-09 10:03:18,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:18,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:03:19,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:19,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740503685] [2025-01-09 10:03:19,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740503685] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:19,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:19,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:19,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810720444] [2025-01-09 10:03:19,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:19,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:19,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:19,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:19,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:19,439 INFO L87 Difference]: Start difference. First operand 388 states and 659 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:03:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:19,562 INFO L93 Difference]: Finished difference Result 988 states and 1686 transitions. [2025-01-09 10:03:19,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:19,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 777 [2025-01-09 10:03:19,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:19,571 INFO L225 Difference]: With dead ends: 988 [2025-01-09 10:03:19,571 INFO L226 Difference]: Without dead ends: 603 [2025-01-09 10:03:19,573 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:19,574 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 368 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:19,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1277 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:03:19,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-01-09 10:03:19,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 600. [2025-01-09 10:03:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 439 states have (on average 1.6082004555808656) internal successors, (706), 440 states have internal predecessors, (706), 158 states have call successors, (158), 2 states have call predecessors, (158), 2 states have return successors, (158), 157 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 10:03:19,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1022 transitions. [2025-01-09 10:03:19,634 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1022 transitions. Word has length 777 [2025-01-09 10:03:19,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:19,636 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 1022 transitions. [2025-01-09 10:03:19,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:03:19,636 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1022 transitions. [2025-01-09 10:03:19,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-01-09 10:03:19,655 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:19,655 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:19,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:03:19,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:19,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:19,656 INFO L85 PathProgramCache]: Analyzing trace with hash 940096822, now seen corresponding path program 1 times [2025-01-09 10:03:19,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:19,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757144121] [2025-01-09 10:03:19,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:19,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:19,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-01-09 10:03:19,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-01-09 10:03:19,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:19,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:03:20,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:20,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757144121] [2025-01-09 10:03:20,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757144121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:20,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:20,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:20,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483671367] [2025-01-09 10:03:20,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:20,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:20,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:20,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:20,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:20,022 INFO L87 Difference]: Start difference. First operand 600 states and 1022 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:03:20,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:20,108 INFO L93 Difference]: Finished difference Result 1578 states and 2697 transitions. [2025-01-09 10:03:20,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:20,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 777 [2025-01-09 10:03:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:20,121 INFO L225 Difference]: With dead ends: 1578 [2025-01-09 10:03:20,122 INFO L226 Difference]: Without dead ends: 981 [2025-01-09 10:03:20,124 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:20,126 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 326 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:20,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1362 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:20,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2025-01-09 10:03:20,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 977. [2025-01-09 10:03:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 768 states have (on average 1.6380208333333333) internal successors, (1258), 771 states have internal predecessors, (1258), 204 states have call successors, (204), 4 states have call predecessors, (204), 4 states have return successors, (204), 201 states have call predecessors, (204), 204 states have call successors, (204) [2025-01-09 10:03:20,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1666 transitions. [2025-01-09 10:03:20,211 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1666 transitions. Word has length 777 [2025-01-09 10:03:20,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:20,214 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1666 transitions. [2025-01-09 10:03:20,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:03:20,215 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1666 transitions. [2025-01-09 10:03:20,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-01-09 10:03:20,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:20,226 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:20,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:03:20,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:20,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:20,228 INFO L85 PathProgramCache]: Analyzing trace with hash 376230834, now seen corresponding path program 1 times [2025-01-09 10:03:20,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:20,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495500368] [2025-01-09 10:03:20,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:20,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:20,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-01-09 10:03:20,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-01-09 10:03:20,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:20,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:03:20,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:20,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495500368] [2025-01-09 10:03:20,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495500368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:20,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:20,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:03:20,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013570316] [2025-01-09 10:03:20,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:20,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:03:20,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:20,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:03:20,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:03:20,663 INFO L87 Difference]: Start difference. First operand 977 states and 1666 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:03:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:21,523 INFO L93 Difference]: Finished difference Result 3856 states and 6576 transitions. [2025-01-09 10:03:21,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:03:21,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 777 [2025-01-09 10:03:21,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:21,537 INFO L225 Difference]: With dead ends: 3856 [2025-01-09 10:03:21,537 INFO L226 Difference]: Without dead ends: 2882 [2025-01-09 10:03:21,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:03:21,541 INFO L435 NwaCegarLoop]: 1103 mSDtfsCounter, 1004 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 2140 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:21,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 2140 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 10:03:21,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2025-01-09 10:03:21,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2878. [2025-01-09 10:03:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2878 states, 2253 states have (on average 1.6347092765201954) internal successors, (3683), 2262 states have internal predecessors, (3683), 612 states have call successors, (612), 12 states have call predecessors, (612), 12 states have return successors, (612), 603 states have call predecessors, (612), 612 states have call successors, (612) [2025-01-09 10:03:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 4907 transitions. [2025-01-09 10:03:21,740 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 4907 transitions. Word has length 777 [2025-01-09 10:03:21,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:21,741 INFO L471 AbstractCegarLoop]: Abstraction has 2878 states and 4907 transitions. [2025-01-09 10:03:21,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:03:21,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 4907 transitions. [2025-01-09 10:03:21,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-01-09 10:03:21,749 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:21,750 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:21,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:03:21,751 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:21,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:21,752 INFO L85 PathProgramCache]: Analyzing trace with hash -2003238662, now seen corresponding path program 1 times [2025-01-09 10:03:21,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:21,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901917557] [2025-01-09 10:03:21,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:21,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:21,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-01-09 10:03:21,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-01-09 10:03:21,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:21,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:22,027 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:03:22,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:22,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901917557] [2025-01-09 10:03:22,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901917557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:22,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:22,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:22,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365511614] [2025-01-09 10:03:22,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:22,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:22,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:22,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:22,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:22,032 INFO L87 Difference]: Start difference. First operand 2878 states and 4907 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:03:22,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:22,233 INFO L93 Difference]: Finished difference Result 7949 states and 13542 transitions. [2025-01-09 10:03:22,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:22,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 777 [2025-01-09 10:03:22,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:22,265 INFO L225 Difference]: With dead ends: 7949 [2025-01-09 10:03:22,266 INFO L226 Difference]: Without dead ends: 5074 [2025-01-09 10:03:22,276 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:22,277 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 326 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:22,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1290 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:22,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5074 states. [2025-01-09 10:03:22,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5074 to 5069. [2025-01-09 10:03:22,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5069 states, 4078 states have (on average 1.6331535066208926) internal successors, (6660), 4099 states have internal predecessors, (6660), 966 states have call successors, (966), 24 states have call predecessors, (966), 24 states have return successors, (966), 945 states have call predecessors, (966), 966 states have call successors, (966) [2025-01-09 10:03:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5069 states to 5069 states and 8592 transitions. [2025-01-09 10:03:22,593 INFO L78 Accepts]: Start accepts. Automaton has 5069 states and 8592 transitions. Word has length 777 [2025-01-09 10:03:22,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:22,595 INFO L471 AbstractCegarLoop]: Abstraction has 5069 states and 8592 transitions. [2025-01-09 10:03:22,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:03:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 5069 states and 8592 transitions. [2025-01-09 10:03:22,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-01-09 10:03:22,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:22,607 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:22,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:03:22,607 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:22,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:22,608 INFO L85 PathProgramCache]: Analyzing trace with hash 621589246, now seen corresponding path program 1 times [2025-01-09 10:03:22,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:22,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701229018] [2025-01-09 10:03:22,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:22,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:22,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-01-09 10:03:22,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-01-09 10:03:22,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:22,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:22,869 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:03:22,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:22,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701229018] [2025-01-09 10:03:22,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701229018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:22,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:22,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:22,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389688951] [2025-01-09 10:03:22,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:22,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:22,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:22,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:22,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:22,872 INFO L87 Difference]: Start difference. First operand 5069 states and 8592 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:03:23,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:23,210 INFO L93 Difference]: Finished difference Result 15153 states and 25686 transitions. [2025-01-09 10:03:23,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:23,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 777 [2025-01-09 10:03:23,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:23,263 INFO L225 Difference]: With dead ends: 15153 [2025-01-09 10:03:23,264 INFO L226 Difference]: Without dead ends: 10087 [2025-01-09 10:03:23,279 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:23,280 INFO L435 NwaCegarLoop]: 1071 mSDtfsCounter, 608 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:23,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 1717 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:23,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10087 states. [2025-01-09 10:03:23,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10087 to 10085. [2025-01-09 10:03:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10085 states, 8104 states have (on average 1.6268509378084897) internal successors, (13184), 8146 states have internal predecessors, (13184), 1932 states have call successors, (1932), 48 states have call predecessors, (1932), 48 states have return successors, (1932), 1890 states have call predecessors, (1932), 1932 states have call successors, (1932) [2025-01-09 10:03:23,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10085 states to 10085 states and 17048 transitions. [2025-01-09 10:03:23,968 INFO L78 Accepts]: Start accepts. Automaton has 10085 states and 17048 transitions. Word has length 777 [2025-01-09 10:03:23,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:23,969 INFO L471 AbstractCegarLoop]: Abstraction has 10085 states and 17048 transitions. [2025-01-09 10:03:23,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:03:23,969 INFO L276 IsEmpty]: Start isEmpty. Operand 10085 states and 17048 transitions. [2025-01-09 10:03:24,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-01-09 10:03:24,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:24,027 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:24,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:03:24,028 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:24,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:24,028 INFO L85 PathProgramCache]: Analyzing trace with hash 644221500, now seen corresponding path program 1 times [2025-01-09 10:03:24,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:24,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509656434] [2025-01-09 10:03:24,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:24,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:24,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-01-09 10:03:24,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-01-09 10:03:24,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:24,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:03:24,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:24,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509656434] [2025-01-09 10:03:24,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509656434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:24,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:24,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:03:24,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884629204] [2025-01-09 10:03:24,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:24,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:03:24,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:24,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:03:24,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:03:24,375 INFO L87 Difference]: Start difference. First operand 10085 states and 17048 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 2 states have call predecessors, (123), 2 states have call successors, (123) [2025-01-09 10:03:24,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:24,986 INFO L93 Difference]: Finished difference Result 30249 states and 51138 transitions. [2025-01-09 10:03:24,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:24,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 2 states have call predecessors, (123), 2 states have call successors, (123) Word has length 777 [2025-01-09 10:03:24,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:25,076 INFO L225 Difference]: With dead ends: 30249 [2025-01-09 10:03:25,077 INFO L226 Difference]: Without dead ends: 20167 [2025-01-09 10:03:25,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:03:25,108 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 556 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:25,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1903 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:03:25,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20167 states. [2025-01-09 10:03:26,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20167 to 20155. [2025-01-09 10:03:26,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20155 states, 16194 states have (on average 1.6247993083858219) internal successors, (26312), 16278 states have internal predecessors, (26312), 3864 states have call successors, (3864), 96 states have call predecessors, (3864), 96 states have return successors, (3864), 3780 states have call predecessors, (3864), 3864 states have call successors, (3864) [2025-01-09 10:03:26,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20155 states to 20155 states and 34040 transitions. [2025-01-09 10:03:26,296 INFO L78 Accepts]: Start accepts. Automaton has 20155 states and 34040 transitions. Word has length 777 [2025-01-09 10:03:26,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:26,298 INFO L471 AbstractCegarLoop]: Abstraction has 20155 states and 34040 transitions. [2025-01-09 10:03:26,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 2 states have call predecessors, (123), 2 states have call successors, (123) [2025-01-09 10:03:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand 20155 states and 34040 transitions. [2025-01-09 10:03:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-01-09 10:03:26,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:26,326 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:26,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:03:26,326 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:26,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:26,327 INFO L85 PathProgramCache]: Analyzing trace with hash 721122298, now seen corresponding path program 1 times [2025-01-09 10:03:26,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:26,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389494366] [2025-01-09 10:03:26,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:26,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:26,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-01-09 10:03:26,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-01-09 10:03:26,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:26,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:30,539 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:03:30,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:30,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389494366] [2025-01-09 10:03:30,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389494366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:30,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:30,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 10:03:30,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345777578] [2025-01-09 10:03:30,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:30,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 10:03:30,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:30,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 10:03:30,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:03:30,542 INFO L87 Difference]: Start difference. First operand 20155 states and 34040 transitions. Second operand has 8 states, 8 states have (on average 20.625) internal successors, (165), 8 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:03:41,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:41,155 INFO L93 Difference]: Finished difference Result 112549 states and 187010 transitions. [2025-01-09 10:03:41,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 10:03:41,156 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.625) internal successors, (165), 8 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 777 [2025-01-09 10:03:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:41,529 INFO L225 Difference]: With dead ends: 112549 [2025-01-09 10:03:41,529 INFO L226 Difference]: Without dead ends: 92397 [2025-01-09 10:03:41,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:03:41,615 INFO L435 NwaCegarLoop]: 1176 mSDtfsCounter, 2453 mSDsluCounter, 3468 mSDsCounter, 0 mSdLazyCounter, 2890 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2453 SdHoareTripleChecker+Valid, 4644 SdHoareTripleChecker+Invalid, 3272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 2890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:41,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2453 Valid, 4644 Invalid, 3272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 2890 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-01-09 10:03:41,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92397 states. [2025-01-09 10:03:46,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92397 to 44515. [2025-01-09 10:03:46,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44515 states, 36966 states have (on average 1.6398853000054103) internal successors, (60620), 37146 states have internal predecessors, (60620), 7356 states have call successors, (7356), 192 states have call predecessors, (7356), 192 states have return successors, (7356), 7176 states have call predecessors, (7356), 7356 states have call successors, (7356) [2025-01-09 10:03:46,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44515 states to 44515 states and 75332 transitions. [2025-01-09 10:03:46,448 INFO L78 Accepts]: Start accepts. Automaton has 44515 states and 75332 transitions. Word has length 777 [2025-01-09 10:03:46,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:46,449 INFO L471 AbstractCegarLoop]: Abstraction has 44515 states and 75332 transitions. [2025-01-09 10:03:46,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.625) internal successors, (165), 8 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:03:46,449 INFO L276 IsEmpty]: Start isEmpty. Operand 44515 states and 75332 transitions. [2025-01-09 10:03:46,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-01-09 10:03:46,503 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:46,504 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:46,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:03:46,504 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:46,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:46,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1143824124, now seen corresponding path program 1 times [2025-01-09 10:03:46,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:46,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898924649] [2025-01-09 10:03:46,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:46,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:46,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-01-09 10:03:46,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-01-09 10:03:46,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:46,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:03:47,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:47,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898924649] [2025-01-09 10:03:47,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898924649] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:47,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:47,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:03:47,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935703229] [2025-01-09 10:03:47,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:47,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:03:47,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:47,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:03:47,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:03:47,254 INFO L87 Difference]: Start difference. First operand 44515 states and 75332 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:03:51,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:51,615 INFO L93 Difference]: Finished difference Result 109381 states and 185141 transitions. [2025-01-09 10:03:51,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:03:51,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 777 [2025-01-09 10:03:51,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:51,806 INFO L225 Difference]: With dead ends: 109381 [2025-01-09 10:03:51,806 INFO L226 Difference]: Without dead ends: 64869 [2025-01-09 10:03:51,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:03:51,888 INFO L435 NwaCegarLoop]: 708 mSDtfsCounter, 1035 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 2318 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:51,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 2318 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:03:51,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64869 states. [2025-01-09 10:03:55,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64869 to 64807. [2025-01-09 10:03:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64807 states, 54570 states have (on average 1.645299615173172) internal successors, (89784), 54846 states have internal predecessors, (89784), 9948 states have call successors, (9948), 288 states have call predecessors, (9948), 288 states have return successors, (9948), 9672 states have call predecessors, (9948), 9948 states have call successors, (9948) [2025-01-09 10:03:55,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64807 states to 64807 states and 109680 transitions. [2025-01-09 10:03:55,534 INFO L78 Accepts]: Start accepts. Automaton has 64807 states and 109680 transitions. Word has length 777 [2025-01-09 10:03:55,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:55,536 INFO L471 AbstractCegarLoop]: Abstraction has 64807 states and 109680 transitions. [2025-01-09 10:03:55,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:03:55,536 INFO L276 IsEmpty]: Start isEmpty. Operand 64807 states and 109680 transitions. [2025-01-09 10:03:55,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-01-09 10:03:55,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:55,590 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:55,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:03:55,590 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:55,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:55,591 INFO L85 PathProgramCache]: Analyzing trace with hash 651197950, now seen corresponding path program 1 times [2025-01-09 10:03:55,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:55,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722191823] [2025-01-09 10:03:55,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:55,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:55,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-01-09 10:03:55,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-01-09 10:03:55,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:55,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:56,115 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:03:56,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:56,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722191823] [2025-01-09 10:03:56,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722191823] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:56,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:56,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:56,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934070166] [2025-01-09 10:03:56,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:56,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:56,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:56,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:56,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:56,117 INFO L87 Difference]: Start difference. First operand 64807 states and 109680 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:04:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:01,355 INFO L93 Difference]: Finished difference Result 148629 states and 250757 transitions. [2025-01-09 10:04:01,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:01,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 777 [2025-01-09 10:04:01,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:01,618 INFO L225 Difference]: With dead ends: 148629 [2025-01-09 10:04:01,618 INFO L226 Difference]: Without dead ends: 83825 [2025-01-09 10:04:01,732 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:04:01,732 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 435 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:01,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1307 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:01,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83825 states. [2025-01-09 10:04:06,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83825 to 83823. [2025-01-09 10:04:06,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83823 states, 69686 states have (on average 1.6300691674080876) internal successors, (113593), 70022 states have internal predecessors, (113593), 13728 states have call successors, (13728), 408 states have call predecessors, (13728), 408 states have return successors, (13728), 13392 states have call predecessors, (13728), 13728 states have call successors, (13728) [2025-01-09 10:04:06,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83823 states to 83823 states and 141049 transitions. [2025-01-09 10:04:06,918 INFO L78 Accepts]: Start accepts. Automaton has 83823 states and 141049 transitions. Word has length 777 [2025-01-09 10:04:06,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:06,919 INFO L471 AbstractCegarLoop]: Abstraction has 83823 states and 141049 transitions. [2025-01-09 10:04:06,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-01-09 10:04:06,919 INFO L276 IsEmpty]: Start isEmpty. Operand 83823 states and 141049 transitions. [2025-01-09 10:04:06,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-01-09 10:04:06,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:06,981 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:04:06,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:04:06,982 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:06,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:06,983 INFO L85 PathProgramCache]: Analyzing trace with hash 678263552, now seen corresponding path program 1 times [2025-01-09 10:04:06,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:06,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952170032] [2025-01-09 10:04:06,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:06,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:07,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-01-09 10:04:07,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-01-09 10:04:07,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:07,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-01-09 10:04:07,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:07,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952170032] [2025-01-09 10:04:07,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952170032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:07,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:07,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:07,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354557398] [2025-01-09 10:04:07,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:07,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:07,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:07,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:07,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:07,514 INFO L87 Difference]: Start difference. First operand 83823 states and 141049 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123)