./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-14.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-14.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 6a5b8f8985922577fd511c19d4504abdec5cee4f39c0b7323776313784fc34a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:02:33,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:02:33,861 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:02:33,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:02:33,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:02:33,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:02:33,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:02:33,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:02:33,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:02:33,879 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:02:33,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:02:33,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:02:33,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:02:33,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:02:33,879 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:02:33,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:02:33,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:02:33,879 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:02:33,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:02:33,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:02:33,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:02:33,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:02:33,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:02:33,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:02:33,880 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:02:33,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:02:33,880 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:02:33,880 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:02:33,880 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:02:33,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:02:33,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:02:33,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:02:33,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:02:33,880 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:02:33,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:02:33,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:02:33,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:02:33,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:02:33,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:02:33,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:02:33,881 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:02:33,881 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:02:33,881 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:02:33,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:02:33,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:02:33,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:02:33,881 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:02:33,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:02:33,881 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 -> 6a5b8f8985922577fd511c19d4504abdec5cee4f39c0b7323776313784fc34a5 [2025-01-09 10:02:34,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:02:34,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:02:34,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:02:34,101 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:02:34,101 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:02:34,101 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-14.i [2025-01-09 10:02:35,236 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9290939f4/e06f1ae5c07e455da6e6b580c9734c7e/FLAG15ddbadcd [2025-01-09 10:02:35,549 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:02:35,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-14.i [2025-01-09 10:02:35,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9290939f4/e06f1ae5c07e455da6e6b580c9734c7e/FLAG15ddbadcd [2025-01-09 10:02:35,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9290939f4/e06f1ae5c07e455da6e6b580c9734c7e [2025-01-09 10:02:35,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:02:35,808 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:02:35,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:02:35,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:02:35,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:02:35,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:02:35" (1/1) ... [2025-01-09 10:02:35,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4df3a61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:35, skipping insertion in model container [2025-01-09 10:02:35,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:02:35" (1/1) ... [2025-01-09 10:02:35,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:02:35,947 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-14.i[916,929] [2025-01-09 10:02:36,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:02:36,094 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:02:36,101 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-14.i[916,929] [2025-01-09 10:02:36,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:02:36,166 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:02:36,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:36 WrapperNode [2025-01-09 10:02:36,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:02:36,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:02:36,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:02:36,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:02:36,171 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:02:36" (1/1) ... [2025-01-09 10:02:36,191 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:02:36" (1/1) ... [2025-01-09 10:02:36,268 INFO L138 Inliner]: procedures = 26, calls = 139, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 868 [2025-01-09 10:02:36,268 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:02:36,269 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:02:36,269 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:02:36,270 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:02:36,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:36" (1/1) ... [2025-01-09 10:02:36,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:36" (1/1) ... [2025-01-09 10:02:36,294 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:36" (1/1) ... [2025-01-09 10:02:36,327 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:02:36,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:36" (1/1) ... [2025-01-09 10:02:36,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:36" (1/1) ... [2025-01-09 10:02:36,356 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:36" (1/1) ... [2025-01-09 10:02:36,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:36" (1/1) ... [2025-01-09 10:02:36,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:36" (1/1) ... [2025-01-09 10:02:36,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:36" (1/1) ... [2025-01-09 10:02:36,385 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:36" (1/1) ... [2025-01-09 10:02:36,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:02:36,401 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:02:36,401 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:02:36,401 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:02:36,402 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:36" (1/1) ... [2025-01-09 10:02:36,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:02:36,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:02:36,436 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:02:36,474 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:02:36,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:02:36,488 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:02:36,488 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:02:36,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:02:36,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:02:36,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:02:36,612 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:02:36,616 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:02:37,698 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 10:02:37,699 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:02:37,715 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:02:37,718 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:02:37,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:02:37 BoogieIcfgContainer [2025-01-09 10:02:37,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:02:37,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:02:37,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:02:37,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:02:37,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:02:35" (1/3) ... [2025-01-09 10:02:37,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3889ee4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:02:37, skipping insertion in model container [2025-01-09 10:02:37,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:36" (2/3) ... [2025-01-09 10:02:37,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3889ee4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:02:37, skipping insertion in model container [2025-01-09 10:02:37,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:02:37" (3/3) ... [2025-01-09 10:02:37,727 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-14.i [2025-01-09 10:02:37,739 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:02:37,742 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-14.i that has 2 procedures, 368 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:02:37,801 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:02:37,811 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;@684ccac4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:02:37,811 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:02:37,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 368 states, 239 states have (on average 1.5857740585774058) internal successors, (379), 240 states have internal predecessors, (379), 126 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-01-09 10:02:37,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2025-01-09 10:02:37,848 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:37,849 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:37,853 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:37,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:37,861 INFO L85 PathProgramCache]: Analyzing trace with hash -144349855, now seen corresponding path program 1 times [2025-01-09 10:02:37,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:37,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187124905] [2025-01-09 10:02:37,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:37,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:37,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 784 statements into 1 equivalence classes. [2025-01-09 10:02:38,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 784 of 784 statements. [2025-01-09 10:02:38,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:38,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:38,464 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 250 refuted. 0 times theorem prover too weak. 31250 trivial. 0 not checked. [2025-01-09 10:02:38,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:38,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187124905] [2025-01-09 10:02:38,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187124905] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:02:38,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052079935] [2025-01-09 10:02:38,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:38,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:02:38,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:02:38,481 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:02:38,482 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:02:38,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 784 statements into 1 equivalence classes. [2025-01-09 10:02:38,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 784 of 784 statements. [2025-01-09 10:02:38,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:38,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:38,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 1750 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:02:38,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:02:39,019 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 31250 trivial. 0 not checked. [2025-01-09 10:02:39,019 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:02:39,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052079935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:39,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:02:39,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:02:39,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016158898] [2025-01-09 10:02:39,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:39,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:02:39,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:39,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:02:39,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:02:39,044 INFO L87 Difference]: Start difference. First operand has 368 states, 239 states have (on average 1.5857740585774058) internal successors, (379), 240 states have internal predecessors, (379), 126 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) Second operand has 2 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 2 states have call successors, (126), 2 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 2 states have call successors, (126) [2025-01-09 10:02:39,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:39,114 INFO L93 Difference]: Finished difference Result 729 states and 1381 transitions. [2025-01-09 10:02:39,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:02:39,116 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 2 states have call successors, (126), 2 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 2 states have call successors, (126) Word has length 784 [2025-01-09 10:02:39,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:39,124 INFO L225 Difference]: With dead ends: 729 [2025-01-09 10:02:39,124 INFO L226 Difference]: Without dead ends: 364 [2025-01-09 10:02:39,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 785 GetRequests, 785 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:02:39,133 INFO L435 NwaCegarLoop]: 620 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, 620 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:02:39,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:02:39,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-01-09 10:02:39,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2025-01-09 10:02:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 236 states have (on average 1.5593220338983051) internal successors, (368), 236 states have internal predecessors, (368), 126 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-01-09 10:02:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 620 transitions. [2025-01-09 10:02:39,225 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 620 transitions. Word has length 784 [2025-01-09 10:02:39,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:39,226 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 620 transitions. [2025-01-09 10:02:39,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 2 states have call successors, (126), 2 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 2 states have call successors, (126) [2025-01-09 10:02:39,226 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 620 transitions. [2025-01-09 10:02:39,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-01-09 10:02:39,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:39,243 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:39,254 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:02:39,444 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:02:39,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:39,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:39,445 INFO L85 PathProgramCache]: Analyzing trace with hash 955390077, now seen corresponding path program 1 times [2025-01-09 10:02:39,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:39,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552647633] [2025-01-09 10:02:39,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:39,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:39,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-01-09 10:02:39,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-01-09 10:02:39,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:39,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31500 trivial. 0 not checked. [2025-01-09 10:02:40,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:40,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552647633] [2025-01-09 10:02:40,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552647633] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:40,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:40,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:02:40,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811851732] [2025-01-09 10:02:40,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:40,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:02:40,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:40,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:02:40,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:02:40,252 INFO L87 Difference]: Start difference. First operand 364 states and 620 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-01-09 10:02:40,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:40,341 INFO L93 Difference]: Finished difference Result 933 states and 1600 transitions. [2025-01-09 10:02:40,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:02:40,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) Word has length 785 [2025-01-09 10:02:40,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:40,350 INFO L225 Difference]: With dead ends: 933 [2025-01-09 10:02:40,351 INFO L226 Difference]: Without dead ends: 572 [2025-01-09 10:02:40,353 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:02:40,353 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 347 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:40,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1323 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:02:40,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-01-09 10:02:40,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 569. [2025-01-09 10:02:40,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 404 states have (on average 1.6212871287128714) internal successors, (655), 405 states have internal predecessors, (655), 162 states have call successors, (162), 2 states have call predecessors, (162), 2 states have return successors, (162), 161 states have call predecessors, (162), 162 states have call successors, (162) [2025-01-09 10:02:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 979 transitions. [2025-01-09 10:02:40,423 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 979 transitions. Word has length 785 [2025-01-09 10:02:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:40,426 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 979 transitions. [2025-01-09 10:02:40,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-01-09 10:02:40,426 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 979 transitions. [2025-01-09 10:02:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-01-09 10:02:40,434 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:40,435 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:40,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:02:40,435 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:40,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:40,437 INFO L85 PathProgramCache]: Analyzing trace with hash -127264387, now seen corresponding path program 1 times [2025-01-09 10:02:40,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:40,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137758815] [2025-01-09 10:02:40,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:40,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:40,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-01-09 10:02:40,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-01-09 10:02:40,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:40,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31500 trivial. 0 not checked. [2025-01-09 10:02:40,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:40,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137758815] [2025-01-09 10:02:40,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137758815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:40,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:40,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:02:40,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193908158] [2025-01-09 10:02:40,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:40,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:02:40,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:40,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:02:40,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:02:40,815 INFO L87 Difference]: Start difference. First operand 569 states and 979 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-01-09 10:02:40,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:40,902 INFO L93 Difference]: Finished difference Result 1559 states and 2694 transitions. [2025-01-09 10:02:40,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:02:40,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) Word has length 785 [2025-01-09 10:02:40,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:40,913 INFO L225 Difference]: With dead ends: 1559 [2025-01-09 10:02:40,915 INFO L226 Difference]: Without dead ends: 993 [2025-01-09 10:02:40,917 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:02:40,918 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 367 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:40,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1370 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:02:40,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2025-01-09 10:02:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 990. [2025-01-09 10:02:40,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 740 states have (on average 1.6432432432432433) internal successors, (1216), 743 states have internal predecessors, (1216), 245 states have call successors, (245), 4 states have call predecessors, (245), 4 states have return successors, (245), 242 states have call predecessors, (245), 245 states have call successors, (245) [2025-01-09 10:02:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1706 transitions. [2025-01-09 10:02:40,999 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1706 transitions. Word has length 785 [2025-01-09 10:02:41,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:41,000 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1706 transitions. [2025-01-09 10:02:41,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-01-09 10:02:41,001 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1706 transitions. [2025-01-09 10:02:41,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-01-09 10:02:41,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:41,046 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:41,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:02:41,046 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:41,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:41,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1849093571, now seen corresponding path program 1 times [2025-01-09 10:02:41,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:41,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940638863] [2025-01-09 10:02:41,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:41,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:41,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-01-09 10:02:41,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-01-09 10:02:41,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:41,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:41,323 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31500 trivial. 0 not checked. [2025-01-09 10:02:41,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:41,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940638863] [2025-01-09 10:02:41,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940638863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:41,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:41,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:02:41,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844915639] [2025-01-09 10:02:41,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:41,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:02:41,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:41,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:02:41,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:02:41,327 INFO L87 Difference]: Start difference. First operand 990 states and 1706 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-01-09 10:02:41,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:41,399 INFO L93 Difference]: Finished difference Result 2702 states and 4650 transitions. [2025-01-09 10:02:41,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:02:41,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) Word has length 785 [2025-01-09 10:02:41,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:41,431 INFO L225 Difference]: With dead ends: 2702 [2025-01-09 10:02:41,431 INFO L226 Difference]: Without dead ends: 1715 [2025-01-09 10:02:41,433 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:02:41,434 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 377 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:41,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1223 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:02:41,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2025-01-09 10:02:41,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1712. [2025-01-09 10:02:41,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1253 states have (on average 1.6256983240223464) internal successors, (2037), 1260 states have internal predecessors, (2037), 450 states have call successors, (450), 8 states have call predecessors, (450), 8 states have return successors, (450), 443 states have call predecessors, (450), 450 states have call successors, (450) [2025-01-09 10:02:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2937 transitions. [2025-01-09 10:02:41,560 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2937 transitions. Word has length 785 [2025-01-09 10:02:41,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:41,562 INFO L471 AbstractCegarLoop]: Abstraction has 1712 states and 2937 transitions. [2025-01-09 10:02:41,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-01-09 10:02:41,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2937 transitions. [2025-01-09 10:02:41,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-01-09 10:02:41,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:41,571 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:41,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:02:41,572 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:41,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:41,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1147493697, now seen corresponding path program 1 times [2025-01-09 10:02:41,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:41,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383351566] [2025-01-09 10:02:41,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:41,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:41,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-01-09 10:02:41,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-01-09 10:02:41,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:41,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:41,820 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31500 trivial. 0 not checked. [2025-01-09 10:02:41,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:41,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383351566] [2025-01-09 10:02:41,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383351566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:41,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:41,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:02:41,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453838102] [2025-01-09 10:02:41,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:41,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:02:41,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:41,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:02:41,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:02:41,823 INFO L87 Difference]: Start difference. First operand 1712 states and 2937 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-01-09 10:02:41,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:41,953 INFO L93 Difference]: Finished difference Result 4476 states and 7615 transitions. [2025-01-09 10:02:41,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:02:41,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) Word has length 785 [2025-01-09 10:02:41,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:41,967 INFO L225 Difference]: With dead ends: 4476 [2025-01-09 10:02:41,967 INFO L226 Difference]: Without dead ends: 2767 [2025-01-09 10:02:41,971 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:02:41,971 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 319 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:41,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1229 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:02:41,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2767 states. [2025-01-09 10:02:42,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2767 to 2764. [2025-01-09 10:02:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 1879 states have (on average 1.5620010643959552) internal successors, (2935), 1894 states have internal predecessors, (2935), 868 states have call successors, (868), 16 states have call predecessors, (868), 16 states have return successors, (868), 853 states have call predecessors, (868), 868 states have call successors, (868) [2025-01-09 10:02:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 4671 transitions. [2025-01-09 10:02:42,113 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 4671 transitions. Word has length 785 [2025-01-09 10:02:42,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:42,114 INFO L471 AbstractCegarLoop]: Abstraction has 2764 states and 4671 transitions. [2025-01-09 10:02:42,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-01-09 10:02:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 4671 transitions. [2025-01-09 10:02:42,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-01-09 10:02:42,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:42,120 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:42,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:02:42,120 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:42,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:42,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1656966787, now seen corresponding path program 1 times [2025-01-09 10:02:42,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:42,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087974741] [2025-01-09 10:02:42,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:42,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:42,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-01-09 10:02:42,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-01-09 10:02:42,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:42,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31500 trivial. 0 not checked. [2025-01-09 10:02:42,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:42,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087974741] [2025-01-09 10:02:42,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087974741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:42,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:42,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:02:42,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391297347] [2025-01-09 10:02:42,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:42,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:02:42,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:42,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:02:42,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:02:42,372 INFO L87 Difference]: Start difference. First operand 2764 states and 4671 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-01-09 10:02:42,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:42,582 INFO L93 Difference]: Finished difference Result 8166 states and 13803 transitions. [2025-01-09 10:02:42,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:02:42,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) Word has length 785 [2025-01-09 10:02:42,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:42,610 INFO L225 Difference]: With dead ends: 8166 [2025-01-09 10:02:42,611 INFO L226 Difference]: Without dead ends: 5405 [2025-01-09 10:02:42,623 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:02:42,624 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 588 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:42,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 1226 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:02:42,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5405 states. [2025-01-09 10:02:43,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5405 to 5403. [2025-01-09 10:02:43,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5403 states, 3634 states have (on average 1.5514584479911944) internal successors, (5638), 3664 states have internal predecessors, (5638), 1736 states have call successors, (1736), 32 states have call predecessors, (1736), 32 states have return successors, (1736), 1706 states have call predecessors, (1736), 1736 states have call successors, (1736) [2025-01-09 10:02:43,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5403 states to 5403 states and 9110 transitions. [2025-01-09 10:02:43,084 INFO L78 Accepts]: Start accepts. Automaton has 5403 states and 9110 transitions. Word has length 785 [2025-01-09 10:02:43,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:43,085 INFO L471 AbstractCegarLoop]: Abstraction has 5403 states and 9110 transitions. [2025-01-09 10:02:43,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-01-09 10:02:43,086 INFO L276 IsEmpty]: Start isEmpty. Operand 5403 states and 9110 transitions. [2025-01-09 10:02:43,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-01-09 10:02:43,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:43,098 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:43,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:02:43,098 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:43,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:43,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1594927173, now seen corresponding path program 1 times [2025-01-09 10:02:43,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:43,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331778835] [2025-01-09 10:02:43,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:43,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:43,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-01-09 10:02:43,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-01-09 10:02:43,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:43,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31500 trivial. 0 not checked. [2025-01-09 10:02:43,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:43,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331778835] [2025-01-09 10:02:43,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331778835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:43,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:43,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:02:43,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800295128] [2025-01-09 10:02:43,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:43,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:02:43,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:43,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:02:43,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:02:43,359 INFO L87 Difference]: Start difference. First operand 5403 states and 9110 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-01-09 10:02:43,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:43,821 INFO L93 Difference]: Finished difference Result 15501 states and 26070 transitions. [2025-01-09 10:02:43,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:02:43,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) Word has length 785 [2025-01-09 10:02:43,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:43,880 INFO L225 Difference]: With dead ends: 15501 [2025-01-09 10:02:43,880 INFO L226 Difference]: Without dead ends: 10101 [2025-01-09 10:02:43,897 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:02:43,897 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 359 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:43,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1501 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:02:43,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10101 states. [2025-01-09 10:02:44,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10101 to 10091. [2025-01-09 10:02:44,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10091 states, 6666 states have (on average 1.5304530453045304) internal successors, (10202), 6728 states have internal predecessors, (10202), 3360 states have call successors, (3360), 64 states have call predecessors, (3360), 64 states have return successors, (3360), 3298 states have call predecessors, (3360), 3360 states have call successors, (3360) [2025-01-09 10:02:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10091 states to 10091 states and 16922 transitions. [2025-01-09 10:02:44,540 INFO L78 Accepts]: Start accepts. Automaton has 10091 states and 16922 transitions. Word has length 785 [2025-01-09 10:02:44,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:44,541 INFO L471 AbstractCegarLoop]: Abstraction has 10091 states and 16922 transitions. [2025-01-09 10:02:44,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-01-09 10:02:44,541 INFO L276 IsEmpty]: Start isEmpty. Operand 10091 states and 16922 transitions. [2025-01-09 10:02:44,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-01-09 10:02:44,551 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:44,551 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:44,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:02:44,552 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:44,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:44,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1882391673, now seen corresponding path program 1 times [2025-01-09 10:02:44,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:44,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915321881] [2025-01-09 10:02:44,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:44,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:44,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-01-09 10:02:44,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-01-09 10:02:44,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:44,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31500 trivial. 0 not checked. [2025-01-09 10:02:44,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:44,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915321881] [2025-01-09 10:02:44,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915321881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:44,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:44,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:02:44,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372821892] [2025-01-09 10:02:44,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:44,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:02:44,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:44,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:02:44,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:02:44,792 INFO L87 Difference]: Start difference. First operand 10091 states and 16922 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-01-09 10:02:45,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:45,601 INFO L93 Difference]: Finished difference Result 30267 states and 50760 transitions. [2025-01-09 10:02:45,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:02:45,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) Word has length 785 [2025-01-09 10:02:45,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:45,708 INFO L225 Difference]: With dead ends: 30267 [2025-01-09 10:02:45,709 INFO L226 Difference]: Without dead ends: 20179 [2025-01-09 10:02:45,754 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:02:45,755 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 598 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:45,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1238 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:02:45,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20179 states. [2025-01-09 10:02:46,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20179 to 20177. [2025-01-09 10:02:46,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20177 states, 13328 states have (on average 1.525810324129652) internal successors, (20336), 13452 states have internal predecessors, (20336), 6720 states have call successors, (6720), 128 states have call predecessors, (6720), 128 states have return successors, (6720), 6596 states have call predecessors, (6720), 6720 states have call successors, (6720) [2025-01-09 10:02:47,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20177 states to 20177 states and 33776 transitions. [2025-01-09 10:02:47,063 INFO L78 Accepts]: Start accepts. Automaton has 20177 states and 33776 transitions. Word has length 785 [2025-01-09 10:02:47,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:47,064 INFO L471 AbstractCegarLoop]: Abstraction has 20177 states and 33776 transitions. [2025-01-09 10:02:47,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-01-09 10:02:47,065 INFO L276 IsEmpty]: Start isEmpty. Operand 20177 states and 33776 transitions. [2025-01-09 10:02:47,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-01-09 10:02:47,081 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:47,081 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:47,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:02:47,081 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:47,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:47,082 INFO L85 PathProgramCache]: Analyzing trace with hash 193447931, now seen corresponding path program 1 times [2025-01-09 10:02:47,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:47,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733203229] [2025-01-09 10:02:47,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:47,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:47,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-01-09 10:02:47,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-01-09 10:02:47,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:47,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31500 trivial. 0 not checked. [2025-01-09 10:02:47,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:47,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733203229] [2025-01-09 10:02:47,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733203229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:47,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:47,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:02:47,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810275993] [2025-01-09 10:02:47,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:47,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:02:47,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:47,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:02:47,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:02:47,294 INFO L87 Difference]: Start difference. First operand 20177 states and 33776 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-01-09 10:02:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:48,750 INFO L93 Difference]: Finished difference Result 58937 states and 98598 transitions. [2025-01-09 10:02:48,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:02:48,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) Word has length 785 [2025-01-09 10:02:48,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:48,948 INFO L225 Difference]: With dead ends: 58937 [2025-01-09 10:02:48,948 INFO L226 Difference]: Without dead ends: 38763 [2025-01-09 10:02:49,027 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:02:49,030 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 371 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:49,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1451 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:02:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38763 states. [2025-01-09 10:02:51,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38763 to 38753. [2025-01-09 10:02:51,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38753 states, 25232 states have (on average 1.4990488268864934) internal successors, (37824), 25484 states have internal predecessors, (37824), 13264 states have call successors, (13264), 256 states have call predecessors, (13264), 256 states have return successors, (13264), 13012 states have call predecessors, (13264), 13264 states have call successors, (13264) [2025-01-09 10:02:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38753 states to 38753 states and 64352 transitions. [2025-01-09 10:02:51,875 INFO L78 Accepts]: Start accepts. Automaton has 38753 states and 64352 transitions. Word has length 785 [2025-01-09 10:02:51,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:51,876 INFO L471 AbstractCegarLoop]: Abstraction has 38753 states and 64352 transitions. [2025-01-09 10:02:51,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-01-09 10:02:51,877 INFO L276 IsEmpty]: Start isEmpty. Operand 38753 states and 64352 transitions. [2025-01-09 10:02:51,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-01-09 10:02:51,895 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:51,896 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:51,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:02:51,896 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:51,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:51,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1781795833, now seen corresponding path program 1 times [2025-01-09 10:02:51,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:51,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274869665] [2025-01-09 10:02:51,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:51,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:51,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-01-09 10:02:51,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-01-09 10:02:51,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:51,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31500 trivial. 0 not checked. [2025-01-09 10:02:52,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:52,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274869665] [2025-01-09 10:02:52,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274869665] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:52,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:52,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:02:52,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700958537] [2025-01-09 10:02:52,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:52,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:02:52,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:52,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:02:52,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:02:52,097 INFO L87 Difference]: Start difference. First operand 38753 states and 64352 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-01-09 10:02:53,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:53,738 INFO L93 Difference]: Finished difference Result 77825 states and 128958 transitions. [2025-01-09 10:02:53,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:02:53,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) Word has length 785 [2025-01-09 10:02:53,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:54,026 INFO L225 Difference]: With dead ends: 77825 [2025-01-09 10:02:54,027 INFO L226 Difference]: Without dead ends: 39075 [2025-01-09 10:02:54,151 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:02:54,151 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 318 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:54,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1402 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:02:54,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39075 states. [2025-01-09 10:02:56,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39075 to 27873. [2025-01-09 10:02:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27873 states, 19728 states have (on average 1.5369018653690187) internal successors, (30320), 19852 states have internal predecessors, (30320), 7952 states have call successors, (7952), 192 states have call predecessors, (7952), 192 states have return successors, (7952), 7828 states have call predecessors, (7952), 7952 states have call successors, (7952) [2025-01-09 10:02:56,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27873 states to 27873 states and 46224 transitions. [2025-01-09 10:02:56,473 INFO L78 Accepts]: Start accepts. Automaton has 27873 states and 46224 transitions. Word has length 785 [2025-01-09 10:02:56,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:56,474 INFO L471 AbstractCegarLoop]: Abstraction has 27873 states and 46224 transitions. [2025-01-09 10:02:56,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-01-09 10:02:56,474 INFO L276 IsEmpty]: Start isEmpty. Operand 27873 states and 46224 transitions. [2025-01-09 10:02:56,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-01-09 10:02:56,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:56,491 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:56,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:02:56,492 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:56,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:56,493 INFO L85 PathProgramCache]: Analyzing trace with hash 770678583, now seen corresponding path program 1 times [2025-01-09 10:02:56,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:56,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892363593] [2025-01-09 10:02:56,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:56,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:56,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-01-09 10:02:56,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-01-09 10:02:56,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:56,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31500 trivial. 0 not checked. [2025-01-09 10:02:56,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:56,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892363593] [2025-01-09 10:02:56,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892363593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:56,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:56,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:02:56,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873810651] [2025-01-09 10:02:56,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:56,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:02:56,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:56,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:02:56,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:02:56,792 INFO L87 Difference]: Start difference. First operand 27873 states and 46224 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-01-09 10:02:58,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:58,196 INFO L93 Difference]: Finished difference Result 69679 states and 115492 transitions. [2025-01-09 10:02:58,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:02:58,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) Word has length 785 [2025-01-09 10:02:58,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:58,412 INFO L225 Difference]: With dead ends: 69679 [2025-01-09 10:02:58,413 INFO L226 Difference]: Without dead ends: 41809 [2025-01-09 10:02:58,489 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:02:58,490 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 376 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:58,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1219 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:02:58,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41809 states. [2025-01-09 10:03:00,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41809 to 41807. [2025-01-09 10:03:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41807 states, 29590 states have (on average 1.5326123690435958) internal successors, (45350), 29776 states have internal predecessors, (45350), 11928 states have call successors, (11928), 288 states have call predecessors, (11928), 288 states have return successors, (11928), 11742 states have call predecessors, (11928), 11928 states have call successors, (11928) [2025-01-09 10:03:01,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41807 states to 41807 states and 69206 transitions. [2025-01-09 10:03:01,314 INFO L78 Accepts]: Start accepts. Automaton has 41807 states and 69206 transitions. Word has length 785 [2025-01-09 10:03:01,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:01,315 INFO L471 AbstractCegarLoop]: Abstraction has 41807 states and 69206 transitions. [2025-01-09 10:03:01,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-01-09 10:03:01,316 INFO L276 IsEmpty]: Start isEmpty. Operand 41807 states and 69206 transitions. [2025-01-09 10:03:01,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-01-09 10:03:01,337 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:01,337 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:03:01,338 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:01,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:01,339 INFO L85 PathProgramCache]: Analyzing trace with hash -601128715, now seen corresponding path program 1 times [2025-01-09 10:03:01,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:01,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050335579] [2025-01-09 10:03:01,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:01,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:01,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-01-09 10:03:01,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-01-09 10:03:01,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:01,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:01,923 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31500 trivial. 0 not checked. [2025-01-09 10:03:01,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:01,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050335579] [2025-01-09 10:03:01,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050335579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:01,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:01,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:03:01,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424112394] [2025-01-09 10:03:01,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:01,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:03:01,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:01,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:03:01,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:03:01,929 INFO L87 Difference]: Start difference. First operand 41807 states and 69206 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 2 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 2 states have call predecessors, (126), 2 states have call successors, (126) [2025-01-09 10:03:07,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:07,188 INFO L93 Difference]: Finished difference Result 167219 states and 276815 transitions. [2025-01-09 10:03:07,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:03:07,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 2 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 2 states have call predecessors, (126), 2 states have call successors, (126) Word has length 785 [2025-01-09 10:03:07,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:07,625 INFO L225 Difference]: With dead ends: 167219 [2025-01-09 10:03:07,625 INFO L226 Difference]: Without dead ends: 125415 [2025-01-09 10:03:07,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:03:07,736 INFO L435 NwaCegarLoop]: 1161 mSDtfsCounter, 937 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:07,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 2710 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 10:03:07,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125415 states.