./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-74.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-74.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 5c28cf38da1de1456241ac4a939c49e0441da83e6b9d5831b12e3d1a178d244e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:07:47,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:07:47,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:07:47,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:07:47,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:07:47,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:07:47,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:07:47,916 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:07:47,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:07:47,917 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:07:47,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:07:47,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:07:47,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:07:47,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:07:47,917 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:07:47,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:07:47,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:07:47,917 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:07:47,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:07:47,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:07:47,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:07:47,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:07:47,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:07:47,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:07:47,918 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:07:47,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:07:47,918 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:07:47,918 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:07:47,918 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:07:47,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:07:47,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:07:47,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:07:47,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:07:47,919 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:07:47,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:07:47,919 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:07:47,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:07:47,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:07:47,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:07:47,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:07:47,919 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:07:47,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:07:47,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:07:47,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:07:47,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:07:47,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:07:47,922 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:07:47,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:07:47,922 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 -> 5c28cf38da1de1456241ac4a939c49e0441da83e6b9d5831b12e3d1a178d244e [2025-01-09 10:07:48,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:07:48,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:07:48,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:07:48,235 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:07:48,235 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:07:48,236 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-74.i [2025-01-09 10:07:49,598 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3ba1fcff/a260be16799f4b86a426a937c03be21b/FLAG8852c1fbf [2025-01-09 10:07:50,058 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:07:50,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-74.i [2025-01-09 10:07:50,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3ba1fcff/a260be16799f4b86a426a937c03be21b/FLAG8852c1fbf [2025-01-09 10:07:50,101 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3ba1fcff/a260be16799f4b86a426a937c03be21b [2025-01-09 10:07:50,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:07:50,106 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:07:50,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:07:50,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:07:50,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:07:50,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:07:50" (1/1) ... [2025-01-09 10:07:50,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17eeb479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:50, skipping insertion in model container [2025-01-09 10:07:50,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:07:50" (1/1) ... [2025-01-09 10:07:50,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:07:50,287 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-74.i[916,929] [2025-01-09 10:07:50,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:07:50,456 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:07:50,470 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-74.i[916,929] [2025-01-09 10:07:50,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:07:50,600 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:07:50,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:50 WrapperNode [2025-01-09 10:07:50,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:07:50,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:07:50,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:07:50,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:07:50,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:50" (1/1) ... [2025-01-09 10:07:50,646 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:50" (1/1) ... [2025-01-09 10:07:50,739 INFO L138 Inliner]: procedures = 26, calls = 127, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 860 [2025-01-09 10:07:50,740 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:07:50,741 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:07:50,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:07:50,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:07:50,751 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:50" (1/1) ... [2025-01-09 10:07:50,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:50" (1/1) ... [2025-01-09 10:07:50,768 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:50" (1/1) ... [2025-01-09 10:07:50,808 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:07:50,811 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:50" (1/1) ... [2025-01-09 10:07:50,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:50" (1/1) ... [2025-01-09 10:07:50,835 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:50" (1/1) ... [2025-01-09 10:07:50,843 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:50" (1/1) ... [2025-01-09 10:07:50,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:50" (1/1) ... [2025-01-09 10:07:50,872 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:50" (1/1) ... [2025-01-09 10:07:50,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:50" (1/1) ... [2025-01-09 10:07:50,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:07:50,900 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:07:50,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:07:50,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:07:50,902 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:50" (1/1) ... [2025-01-09 10:07:50,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:07:50,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:07:50,930 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:07:50,932 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:07:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:07:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:07:50,950 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:07:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:07:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:07:50,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:07:51,078 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:07:51,080 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:07:52,503 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-01-09 10:07:52,504 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:07:52,531 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:07:52,531 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:07:52,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:07:52 BoogieIcfgContainer [2025-01-09 10:07:52,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:07:52,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:07:52,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:07:52,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:07:52,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:07:50" (1/3) ... [2025-01-09 10:07:52,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7f696b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:07:52, skipping insertion in model container [2025-01-09 10:07:52,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:50" (2/3) ... [2025-01-09 10:07:52,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7f696b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:07:52, skipping insertion in model container [2025-01-09 10:07:52,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:07:52" (3/3) ... [2025-01-09 10:07:52,544 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-74.i [2025-01-09 10:07:52,560 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:07:52,563 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-74.i that has 2 procedures, 359 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:07:52,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:07:52,650 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;@18c6de6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:07:52,650 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:07:52,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 359 states, 242 states have (on average 1.5826446280991735) internal successors, (383), 243 states have internal predecessors, (383), 114 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2025-01-09 10:07:52,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-01-09 10:07:52,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:52,698 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:52,699 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:52,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:52,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1379155295, now seen corresponding path program 1 times [2025-01-09 10:07:52,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:52,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797927107] [2025-01-09 10:07:52,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:52,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:52,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-01-09 10:07:52,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-01-09 10:07:52,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:52,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:53,552 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 25538 trivial. 0 not checked. [2025-01-09 10:07:53,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:53,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797927107] [2025-01-09 10:07:53,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797927107] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:07:53,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476922296] [2025-01-09 10:07:53,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:53,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:07:53,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:07:53,558 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:07:53,560 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:07:53,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-01-09 10:07:54,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-01-09 10:07:54,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:54,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:54,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 1655 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:07:54,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:07:54,155 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 25538 trivial. 0 not checked. [2025-01-09 10:07:54,156 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:07:54,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476922296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:54,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:07:54,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:07:54,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088848344] [2025-01-09 10:07:54,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:54,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:07:54,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:54,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:07:54,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:07:54,201 INFO L87 Difference]: Start difference. First operand has 359 states, 242 states have (on average 1.5826446280991735) internal successors, (383), 243 states have internal predecessors, (383), 114 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) Second operand has 2 states, 2 states have (on average 81.5) internal successors, (163), 2 states have internal predecessors, (163), 2 states have call successors, (114), 2 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 2 states have call successors, (114) [2025-01-09 10:07:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:54,286 INFO L93 Difference]: Finished difference Result 711 states and 1329 transitions. [2025-01-09 10:07:54,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:07:54,288 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 81.5) internal successors, (163), 2 states have internal predecessors, (163), 2 states have call successors, (114), 2 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 2 states have call successors, (114) Word has length 728 [2025-01-09 10:07:54,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:54,300 INFO L225 Difference]: With dead ends: 711 [2025-01-09 10:07:54,301 INFO L226 Difference]: Without dead ends: 355 [2025-01-09 10:07:54,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 729 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:07:54,310 INFO L435 NwaCegarLoop]: 601 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, 601 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:07:54,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:54,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-01-09 10:07:54,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2025-01-09 10:07:54,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 239 states have (on average 1.5606694560669456) internal successors, (373), 239 states have internal predecessors, (373), 114 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2025-01-09 10:07:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 601 transitions. [2025-01-09 10:07:54,425 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 601 transitions. Word has length 728 [2025-01-09 10:07:54,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:54,428 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 601 transitions. [2025-01-09 10:07:54,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 81.5) internal successors, (163), 2 states have internal predecessors, (163), 2 states have call successors, (114), 2 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 2 states have call successors, (114) [2025-01-09 10:07:54,428 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 601 transitions. [2025-01-09 10:07:54,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-01-09 10:07:54,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:54,454 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:54,466 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:07:54,656 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:07:54,657 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:54,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:54,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1243647867, now seen corresponding path program 1 times [2025-01-09 10:07:54,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:54,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403344377] [2025-01-09 10:07:54,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:54,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:54,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-01-09 10:07:54,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-01-09 10:07:54,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:54,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:55,724 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-01-09 10:07:55,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:55,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403344377] [2025-01-09 10:07:55,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403344377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:55,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:55,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:55,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395550722] [2025-01-09 10:07:55,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:55,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:55,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:55,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:55,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:55,729 INFO L87 Difference]: Start difference. First operand 355 states and 601 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:07:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:55,860 INFO L93 Difference]: Finished difference Result 920 states and 1567 transitions. [2025-01-09 10:07:55,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:55,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 728 [2025-01-09 10:07:55,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:55,872 INFO L225 Difference]: With dead ends: 920 [2025-01-09 10:07:55,874 INFO L226 Difference]: Without dead ends: 568 [2025-01-09 10:07:55,876 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:07:55,876 INFO L435 NwaCegarLoop]: 708 mSDtfsCounter, 366 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:55,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1290 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:07:55,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-01-09 10:07:55,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 565. [2025-01-09 10:07:55,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 420 states have (on average 1.619047619047619) internal successors, (680), 421 states have internal predecessors, (680), 142 states have call successors, (142), 2 states have call predecessors, (142), 2 states have return successors, (142), 141 states have call predecessors, (142), 142 states have call successors, (142) [2025-01-09 10:07:55,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 964 transitions. [2025-01-09 10:07:55,952 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 964 transitions. Word has length 728 [2025-01-09 10:07:55,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:55,954 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 964 transitions. [2025-01-09 10:07:55,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:07:55,955 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 964 transitions. [2025-01-09 10:07:55,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-01-09 10:07:55,979 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:55,979 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:55,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:07:55,980 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:55,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:55,981 INFO L85 PathProgramCache]: Analyzing trace with hash -989686533, now seen corresponding path program 1 times [2025-01-09 10:07:55,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:55,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405930205] [2025-01-09 10:07:55,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:55,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:56,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-01-09 10:07:56,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-01-09 10:07:56,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:56,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-01-09 10:07:56,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:56,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405930205] [2025-01-09 10:07:56,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405930205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:56,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:56,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:56,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179225930] [2025-01-09 10:07:56,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:56,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:56,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:56,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:56,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:56,428 INFO L87 Difference]: Start difference. First operand 565 states and 964 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:07:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:56,530 INFO L93 Difference]: Finished difference Result 1134 states and 1930 transitions. [2025-01-09 10:07:56,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:56,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 728 [2025-01-09 10:07:56,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:56,541 INFO L225 Difference]: With dead ends: 1134 [2025-01-09 10:07:56,544 INFO L226 Difference]: Without dead ends: 572 [2025-01-09 10:07:56,546 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:07:56,547 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 357 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:56,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1181 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:56,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-01-09 10:07:56,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 477. [2025-01-09 10:07:56,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 360 states have (on average 1.6416666666666666) internal successors, (591), 360 states have internal predecessors, (591), 114 states have call successors, (114), 2 states have call predecessors, (114), 2 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2025-01-09 10:07:56,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 819 transitions. [2025-01-09 10:07:56,601 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 819 transitions. Word has length 728 [2025-01-09 10:07:56,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:56,604 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 819 transitions. [2025-01-09 10:07:56,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:07:56,605 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 819 transitions. [2025-01-09 10:07:56,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-01-09 10:07:56,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:56,613 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:56,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:07:56,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:56,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:56,614 INFO L85 PathProgramCache]: Analyzing trace with hash -687861317, now seen corresponding path program 1 times [2025-01-09 10:07:56,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:56,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972909014] [2025-01-09 10:07:56,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:56,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:56,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-01-09 10:07:56,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-01-09 10:07:56,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:56,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:57,005 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-01-09 10:07:57,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:57,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972909014] [2025-01-09 10:07:57,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972909014] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:57,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:57,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:57,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839785931] [2025-01-09 10:07:57,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:57,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:57,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:57,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:57,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:57,011 INFO L87 Difference]: Start difference. First operand 477 states and 819 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:07:57,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:57,091 INFO L93 Difference]: Finished difference Result 1405 states and 2415 transitions. [2025-01-09 10:07:57,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:57,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 728 [2025-01-09 10:07:57,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:57,102 INFO L225 Difference]: With dead ends: 1405 [2025-01-09 10:07:57,102 INFO L226 Difference]: Without dead ends: 931 [2025-01-09 10:07:57,105 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:07:57,107 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 575 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:57,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1528 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:57,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-01-09 10:07:57,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 663. [2025-01-09 10:07:57,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 546 states have (on average 1.7142857142857142) internal successors, (936), 546 states have internal predecessors, (936), 114 states have call successors, (114), 2 states have call predecessors, (114), 2 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2025-01-09 10:07:57,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1164 transitions. [2025-01-09 10:07:57,165 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1164 transitions. Word has length 728 [2025-01-09 10:07:57,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:57,166 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 1164 transitions. [2025-01-09 10:07:57,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:07:57,167 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1164 transitions. [2025-01-09 10:07:57,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-01-09 10:07:57,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:57,173 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:57,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:07:57,174 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:57,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:57,175 INFO L85 PathProgramCache]: Analyzing trace with hash -538314050, now seen corresponding path program 1 times [2025-01-09 10:07:57,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:57,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810328688] [2025-01-09 10:07:57,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:57,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:57,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-01-09 10:07:57,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-01-09 10:07:57,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:57,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:57,537 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-01-09 10:07:57,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:57,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810328688] [2025-01-09 10:07:57,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810328688] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:57,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:57,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:57,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711561293] [2025-01-09 10:07:57,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:57,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:57,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:57,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:57,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:57,540 INFO L87 Difference]: Start difference. First operand 663 states and 1164 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:07:57,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:57,623 INFO L93 Difference]: Finished difference Result 1979 states and 3478 transitions. [2025-01-09 10:07:57,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:57,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 729 [2025-01-09 10:07:57,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:57,638 INFO L225 Difference]: With dead ends: 1979 [2025-01-09 10:07:57,638 INFO L226 Difference]: Without dead ends: 1319 [2025-01-09 10:07:57,641 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:07:57,643 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 579 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:57,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1185 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:57,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2025-01-09 10:07:57,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1317. [2025-01-09 10:07:57,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1084 states have (on average 1.7029520295202951) internal successors, (1846), 1084 states have internal predecessors, (1846), 228 states have call successors, (228), 4 states have call predecessors, (228), 4 states have return successors, (228), 228 states have call predecessors, (228), 228 states have call successors, (228) [2025-01-09 10:07:57,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 2302 transitions. [2025-01-09 10:07:57,736 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 2302 transitions. Word has length 729 [2025-01-09 10:07:57,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:57,737 INFO L471 AbstractCegarLoop]: Abstraction has 1317 states and 2302 transitions. [2025-01-09 10:07:57,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:07:57,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 2302 transitions. [2025-01-09 10:07:57,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-01-09 10:07:57,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:57,747 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:57,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:07:57,748 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:57,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:57,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1019394308, now seen corresponding path program 1 times [2025-01-09 10:07:57,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:57,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478384313] [2025-01-09 10:07:57,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:57,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:57,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-01-09 10:07:57,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-01-09 10:07:57,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:57,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:58,094 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-01-09 10:07:58,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:58,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478384313] [2025-01-09 10:07:58,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478384313] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:58,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:58,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:58,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274541214] [2025-01-09 10:07:58,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:58,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:58,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:58,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:58,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:58,099 INFO L87 Difference]: Start difference. First operand 1317 states and 2302 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:07:58,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:58,196 INFO L93 Difference]: Finished difference Result 3623 states and 6358 transitions. [2025-01-09 10:07:58,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:58,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 729 [2025-01-09 10:07:58,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:58,213 INFO L225 Difference]: With dead ends: 3623 [2025-01-09 10:07:58,213 INFO L226 Difference]: Without dead ends: 2309 [2025-01-09 10:07:58,217 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:07:58,219 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 312 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:58,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1290 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:58,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2025-01-09 10:07:58,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2305. [2025-01-09 10:07:58,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2305 states, 1994 states have (on average 1.7261785356068204) internal successors, (3442), 1996 states have internal predecessors, (3442), 302 states have call successors, (302), 8 states have call predecessors, (302), 8 states have return successors, (302), 300 states have call predecessors, (302), 302 states have call successors, (302) [2025-01-09 10:07:58,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 4046 transitions. [2025-01-09 10:07:58,351 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 4046 transitions. Word has length 729 [2025-01-09 10:07:58,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:58,353 INFO L471 AbstractCegarLoop]: Abstraction has 2305 states and 4046 transitions. [2025-01-09 10:07:58,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:07:58,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 4046 transitions. [2025-01-09 10:07:58,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-01-09 10:07:58,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:58,362 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:58,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:07:58,363 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:58,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:58,364 INFO L85 PathProgramCache]: Analyzing trace with hash 366809086, now seen corresponding path program 1 times [2025-01-09 10:07:58,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:58,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004762751] [2025-01-09 10:07:58,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:58,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:58,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-01-09 10:07:58,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-01-09 10:07:58,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:58,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-01-09 10:07:58,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:58,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004762751] [2025-01-09 10:07:58,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004762751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:58,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:58,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:58,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722134147] [2025-01-09 10:07:58,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:58,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:58,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:58,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:58,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:58,691 INFO L87 Difference]: Start difference. First operand 2305 states and 4046 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:07:58,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:58,876 INFO L93 Difference]: Finished difference Result 6405 states and 11212 transitions. [2025-01-09 10:07:58,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:58,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 729 [2025-01-09 10:07:58,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:58,904 INFO L225 Difference]: With dead ends: 6405 [2025-01-09 10:07:58,905 INFO L226 Difference]: Without dead ends: 4103 [2025-01-09 10:07:58,912 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:07:58,913 INFO L435 NwaCegarLoop]: 1056 mSDtfsCounter, 526 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:58,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1650 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2025-01-09 10:07:59,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 2385. [2025-01-09 10:07:59,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2385 states, 2074 states have (on average 1.720347155255545) internal successors, (3568), 2076 states have internal predecessors, (3568), 302 states have call successors, (302), 8 states have call predecessors, (302), 8 states have return successors, (302), 300 states have call predecessors, (302), 302 states have call successors, (302) [2025-01-09 10:07:59,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 4172 transitions. [2025-01-09 10:07:59,098 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 4172 transitions. Word has length 729 [2025-01-09 10:07:59,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:59,099 INFO L471 AbstractCegarLoop]: Abstraction has 2385 states and 4172 transitions. [2025-01-09 10:07:59,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:07:59,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 4172 transitions. [2025-01-09 10:07:59,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-01-09 10:07:59,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:59,107 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:59,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:07:59,108 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:59,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:59,109 INFO L85 PathProgramCache]: Analyzing trace with hash -142664004, now seen corresponding path program 1 times [2025-01-09 10:07:59,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:59,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329161929] [2025-01-09 10:07:59,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:59,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:59,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-01-09 10:07:59,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-01-09 10:07:59,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:59,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-01-09 10:07:59,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:59,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329161929] [2025-01-09 10:07:59,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329161929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:59,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:59,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:59,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847908193] [2025-01-09 10:07:59,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:59,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:59,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:59,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:59,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:59,403 INFO L87 Difference]: Start difference. First operand 2385 states and 4172 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:07:59,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:59,500 INFO L93 Difference]: Finished difference Result 4897 states and 8522 transitions. [2025-01-09 10:07:59,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:59,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 729 [2025-01-09 10:07:59,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:59,520 INFO L225 Difference]: With dead ends: 4897 [2025-01-09 10:07:59,520 INFO L226 Difference]: Without dead ends: 2515 [2025-01-09 10:07:59,527 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:07:59,528 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 46 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:59,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1187 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:59,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2025-01-09 10:07:59,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 2509. [2025-01-09 10:07:59,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2509 states, 2162 states have (on average 1.700277520814061) internal successors, (3676), 2168 states have internal predecessors, (3676), 334 states have call successors, (334), 12 states have call predecessors, (334), 12 states have return successors, (334), 328 states have call predecessors, (334), 334 states have call successors, (334) [2025-01-09 10:07:59,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 4344 transitions. [2025-01-09 10:07:59,661 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 4344 transitions. Word has length 729 [2025-01-09 10:07:59,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:59,662 INFO L471 AbstractCegarLoop]: Abstraction has 2509 states and 4344 transitions. [2025-01-09 10:07:59,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:07:59,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 4344 transitions. [2025-01-09 10:07:59,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-01-09 10:07:59,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:59,672 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:59,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:07:59,673 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:59,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:59,673 INFO L85 PathProgramCache]: Analyzing trace with hash 537394366, now seen corresponding path program 1 times [2025-01-09 10:07:59,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:59,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886304780] [2025-01-09 10:07:59,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:59,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:59,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-01-09 10:07:59,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-01-09 10:07:59,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:59,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-01-09 10:08:00,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:00,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886304780] [2025-01-09 10:08:00,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886304780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:00,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:00,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:08:00,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267173151] [2025-01-09 10:08:00,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:00,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:08:00,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:00,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:08:00,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:08:00,255 INFO L87 Difference]: Start difference. First operand 2509 states and 4344 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:08:01,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:01,180 INFO L93 Difference]: Finished difference Result 6355 states and 10962 transitions. [2025-01-09 10:08:01,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:08:01,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 729 [2025-01-09 10:08:01,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:01,208 INFO L225 Difference]: With dead ends: 6355 [2025-01-09 10:08:01,209 INFO L226 Difference]: Without dead ends: 3849 [2025-01-09 10:08:01,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:08:01,218 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 745 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:01,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 913 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 10:08:01,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3849 states. [2025-01-09 10:08:01,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3849 to 3845. [2025-01-09 10:08:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3845 states, 3276 states have (on average 1.6733821733821734) internal successors, (5482), 3290 states have internal predecessors, (5482), 544 states have call successors, (544), 24 states have call predecessors, (544), 24 states have return successors, (544), 530 states have call predecessors, (544), 544 states have call successors, (544) [2025-01-09 10:08:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 6570 transitions. [2025-01-09 10:08:01,518 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 6570 transitions. Word has length 729 [2025-01-09 10:08:01,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:01,519 INFO L471 AbstractCegarLoop]: Abstraction has 3845 states and 6570 transitions. [2025-01-09 10:08:01,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:08:01,520 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 6570 transitions. [2025-01-09 10:08:01,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-01-09 10:08:01,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:01,531 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:01,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:08:01,531 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:01,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:01,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1880976099, now seen corresponding path program 1 times [2025-01-09 10:08:01,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:01,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022964107] [2025-01-09 10:08:01,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:01,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:01,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-01-09 10:08:01,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-01-09 10:08:01,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:01,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:01,802 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-01-09 10:08:01,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:01,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022964107] [2025-01-09 10:08:01,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022964107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:01,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:01,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:01,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938828245] [2025-01-09 10:08:01,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:01,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:01,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:01,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:01,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:01,806 INFO L87 Difference]: Start difference. First operand 3845 states and 6570 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:08:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:02,179 INFO L93 Difference]: Finished difference Result 9203 states and 15464 transitions. [2025-01-09 10:08:02,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:02,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 730 [2025-01-09 10:08:02,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:02,218 INFO L225 Difference]: With dead ends: 9203 [2025-01-09 10:08:02,219 INFO L226 Difference]: Without dead ends: 5361 [2025-01-09 10:08:02,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:02,233 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 341 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:02,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1462 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:02,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5361 states. [2025-01-09 10:08:02,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5361 to 5357. [2025-01-09 10:08:02,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5357 states, 4236 states have (on average 1.5915958451369216) internal successors, (6742), 4266 states have internal predecessors, (6742), 1072 states have call successors, (1072), 48 states have call predecessors, (1072), 48 states have return successors, (1072), 1042 states have call predecessors, (1072), 1072 states have call successors, (1072) [2025-01-09 10:08:02,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5357 states to 5357 states and 8886 transitions. [2025-01-09 10:08:02,697 INFO L78 Accepts]: Start accepts. Automaton has 5357 states and 8886 transitions. Word has length 730 [2025-01-09 10:08:02,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:02,698 INFO L471 AbstractCegarLoop]: Abstraction has 5357 states and 8886 transitions. [2025-01-09 10:08:02,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:08:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 5357 states and 8886 transitions. [2025-01-09 10:08:02,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-01-09 10:08:02,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:02,758 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:02,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:08:02,758 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:02,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:02,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2099830817, now seen corresponding path program 1 times [2025-01-09 10:08:02,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:02,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223210593] [2025-01-09 10:08:02,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:02,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:02,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-01-09 10:08:02,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-01-09 10:08:02,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:02,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:03,576 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-01-09 10:08:03,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:03,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223210593] [2025-01-09 10:08:03,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223210593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:03,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:03,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:08:03,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933097899] [2025-01-09 10:08:03,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:03,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:08:03,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:03,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:08:03,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:08:03,579 INFO L87 Difference]: Start difference. First operand 5357 states and 8886 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:08:04,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:04,694 INFO L93 Difference]: Finished difference Result 16051 states and 26257 transitions. [2025-01-09 10:08:04,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:08:04,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 730 [2025-01-09 10:08:04,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:04,765 INFO L225 Difference]: With dead ends: 16051 [2025-01-09 10:08:04,765 INFO L226 Difference]: Without dead ends: 10697 [2025-01-09 10:08:04,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:08:04,786 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 681 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:04,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 1509 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:08:04,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10697 states. [2025-01-09 10:08:05,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10697 to 6725. [2025-01-09 10:08:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6725 states, 5604 states have (on average 1.641684511063526) internal successors, (9200), 5634 states have internal predecessors, (9200), 1072 states have call successors, (1072), 48 states have call predecessors, (1072), 48 states have return successors, (1072), 1042 states have call predecessors, (1072), 1072 states have call successors, (1072) [2025-01-09 10:08:05,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6725 states to 6725 states and 11344 transitions. [2025-01-09 10:08:05,402 INFO L78 Accepts]: Start accepts. Automaton has 6725 states and 11344 transitions. Word has length 730 [2025-01-09 10:08:05,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:05,404 INFO L471 AbstractCegarLoop]: Abstraction has 6725 states and 11344 transitions. [2025-01-09 10:08:05,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:08:05,404 INFO L276 IsEmpty]: Start isEmpty. Operand 6725 states and 11344 transitions. [2025-01-09 10:08:05,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-01-09 10:08:05,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:05,422 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:05,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:08:05,422 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:05,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:05,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1771489757, now seen corresponding path program 1 times [2025-01-09 10:08:05,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:05,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261752827] [2025-01-09 10:08:05,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:05,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:05,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-01-09 10:08:05,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-01-09 10:08:05,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:05,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-01-09 10:08:06,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:06,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261752827] [2025-01-09 10:08:06,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261752827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:06,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:06,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:06,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290174805] [2025-01-09 10:08:06,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:06,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:06,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:06,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:06,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:06,199 INFO L87 Difference]: Start difference. First operand 6725 states and 11344 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:08:06,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:06,704 INFO L93 Difference]: Finished difference Result 19165 states and 32501 transitions. [2025-01-09 10:08:06,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:06,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 730 [2025-01-09 10:08:06,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:06,758 INFO L225 Difference]: With dead ends: 19165 [2025-01-09 10:08:06,758 INFO L226 Difference]: Without dead ends: 12443 [2025-01-09 10:08:06,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:06,783 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 341 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:06,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1187 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:06,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12443 states. [2025-01-09 10:08:07,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12443 to 12441. [2025-01-09 10:08:07,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12441 states, 10537 states have (on average 1.6616684065673342) internal successors, (17509), 10582 states have internal predecessors, (17509), 1821 states have call successors, (1821), 82 states have call predecessors, (1821), 82 states have return successors, (1821), 1776 states have call predecessors, (1821), 1821 states have call successors, (1821) [2025-01-09 10:08:07,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12441 states to 12441 states and 21151 transitions. [2025-01-09 10:08:07,560 INFO L78 Accepts]: Start accepts. Automaton has 12441 states and 21151 transitions. Word has length 730 [2025-01-09 10:08:07,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:07,562 INFO L471 AbstractCegarLoop]: Abstraction has 12441 states and 21151 transitions. [2025-01-09 10:08:07,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:08:07,562 INFO L276 IsEmpty]: Start isEmpty. Operand 12441 states and 21151 transitions. [2025-01-09 10:08:07,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-01-09 10:08:07,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:07,578 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:07,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:08:07,578 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:07,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:07,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1705829089, now seen corresponding path program 1 times [2025-01-09 10:08:07,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:07,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156223763] [2025-01-09 10:08:07,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:07,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:07,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-01-09 10:08:07,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-01-09 10:08:07,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:07,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:08,159 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-01-09 10:08:08,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:08,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156223763] [2025-01-09 10:08:08,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156223763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:08,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:08,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:08:08,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935549775] [2025-01-09 10:08:08,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:08,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:08:08,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:08,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:08:08,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:08:08,166 INFO L87 Difference]: Start difference. First operand 12441 states and 21151 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:08:10,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:10,352 INFO L93 Difference]: Finished difference Result 49527 states and 84238 transitions. [2025-01-09 10:08:10,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:08:10,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 730 [2025-01-09 10:08:10,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:10,524 INFO L225 Difference]: With dead ends: 49527 [2025-01-09 10:08:10,525 INFO L226 Difference]: Without dead ends: 37157 [2025-01-09 10:08:10,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:08:10,588 INFO L435 NwaCegarLoop]: 1254 mSDtfsCounter, 1174 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:10,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1174 Valid, 2198 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:08:10,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37157 states. [2025-01-09 10:08:12,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37157 to 25178. [2025-01-09 10:08:12,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25178 states, 21346 states have (on average 1.650988475592617) internal successors, (35242), 21437 states have internal predecessors, (35242), 3665 states have call successors, (3665), 166 states have call predecessors, (3665), 166 states have return successors, (3665), 3574 states have call predecessors, (3665), 3665 states have call successors, (3665) [2025-01-09 10:08:12,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25178 states to 25178 states and 42572 transitions. [2025-01-09 10:08:12,345 INFO L78 Accepts]: Start accepts. Automaton has 25178 states and 42572 transitions. Word has length 730 [2025-01-09 10:08:12,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:12,347 INFO L471 AbstractCegarLoop]: Abstraction has 25178 states and 42572 transitions. [2025-01-09 10:08:12,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:08:12,347 INFO L276 IsEmpty]: Start isEmpty. Operand 25178 states and 42572 transitions. [2025-01-09 10:08:12,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-01-09 10:08:12,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:12,372 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:12,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:08:12,372 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:12,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:12,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1196355999, now seen corresponding path program 1 times [2025-01-09 10:08:12,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:12,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295486117] [2025-01-09 10:08:12,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:12,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:12,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-01-09 10:08:12,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-01-09 10:08:12,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:12,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:13,147 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-01-09 10:08:13,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:13,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295486117] [2025-01-09 10:08:13,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295486117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:13,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:13,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:08:13,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035474498] [2025-01-09 10:08:13,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:13,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:08:13,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:13,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:08:13,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:08:13,150 INFO L87 Difference]: Start difference. First operand 25178 states and 42572 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:08:18,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:18,002 INFO L93 Difference]: Finished difference Result 99796 states and 165584 transitions. [2025-01-09 10:08:18,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:08:18,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 730 [2025-01-09 10:08:18,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:18,315 INFO L225 Difference]: With dead ends: 99796 [2025-01-09 10:08:18,316 INFO L226 Difference]: Without dead ends: 74689 [2025-01-09 10:08:18,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:08:18,403 INFO L435 NwaCegarLoop]: 901 mSDtfsCounter, 837 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 2132 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:18,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 2132 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 10:08:18,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74689 states. [2025-01-09 10:08:22,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74689 to 74152. [2025-01-09 10:08:22,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74152 states, 61927 states have (on average 1.5996738094853618) internal successors, (99063), 62306 states have internal predecessors, (99063), 11578 states have call successors, (11578), 646 states have call predecessors, (11578), 646 states have return successors, (11578), 11199 states have call predecessors, (11578), 11578 states have call successors, (11578) [2025-01-09 10:08:22,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74152 states to 74152 states and 122219 transitions. [2025-01-09 10:08:22,758 INFO L78 Accepts]: Start accepts. Automaton has 74152 states and 122219 transitions. Word has length 730 [2025-01-09 10:08:22,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:22,760 INFO L471 AbstractCegarLoop]: Abstraction has 74152 states and 122219 transitions. [2025-01-09 10:08:22,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:08:22,760 INFO L276 IsEmpty]: Start isEmpty. Operand 74152 states and 122219 transitions. [2025-01-09 10:08:22,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-01-09 10:08:22,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:22,813 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:22,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 10:08:22,813 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:22,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:22,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1055807389, now seen corresponding path program 1 times [2025-01-09 10:08:22,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:22,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866381076] [2025-01-09 10:08:22,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:22,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:22,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-01-09 10:08:22,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-01-09 10:08:22,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:22,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:23,872 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-01-09 10:08:23,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:23,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866381076] [2025-01-09 10:08:23,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866381076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:23,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:23,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:23,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354058043] [2025-01-09 10:08:23,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:23,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:23,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:23,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:23,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:23,876 INFO L87 Difference]: Start difference. First operand 74152 states and 122219 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:08:29,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:29,955 INFO L93 Difference]: Finished difference Result 210314 states and 344981 transitions. [2025-01-09 10:08:29,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:29,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 730 [2025-01-09 10:08:29,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:30,517 INFO L225 Difference]: With dead ends: 210314 [2025-01-09 10:08:30,517 INFO L226 Difference]: Without dead ends: 136233 [2025-01-09 10:08:30,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:30,723 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 296 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:30,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1323 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:08:30,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136233 states. [2025-01-09 10:08:37,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136233 to 136056. [2025-01-09 10:08:38,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136056 states, 112759 states have (on average 1.57542191754095) internal successors, (177643), 113522 states have internal predecessors, (177643), 22010 states have call successors, (22010), 1286 states have call predecessors, (22010), 1286 states have return successors, (22010), 21247 states have call predecessors, (22010), 22010 states have call successors, (22010) [2025-01-09 10:08:38,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136056 states to 136056 states and 221663 transitions. [2025-01-09 10:08:38,653 INFO L78 Accepts]: Start accepts. Automaton has 136056 states and 221663 transitions. Word has length 730 [2025-01-09 10:08:38,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:38,654 INFO L471 AbstractCegarLoop]: Abstraction has 136056 states and 221663 transitions. [2025-01-09 10:08:38,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-01-09 10:08:38,654 INFO L276 IsEmpty]: Start isEmpty. Operand 136056 states and 221663 transitions. [2025-01-09 10:08:38,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-01-09 10:08:38,742 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:38,743 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:38,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 10:08:38,743 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:38,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:38,744 INFO L85 PathProgramCache]: Analyzing trace with hash 574727131, now seen corresponding path program 1 times [2025-01-09 10:08:38,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:38,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391209041] [2025-01-09 10:08:38,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:38,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:38,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-01-09 10:08:39,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-01-09 10:08:39,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:39,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:39,993 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-01-09 10:08:39,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:39,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391209041] [2025-01-09 10:08:39,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391209041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:39,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:39,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:08:39,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125916257] [2025-01-09 10:08:39,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:39,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:08:39,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:39,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:08:39,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:08:39,997 INFO L87 Difference]: Start difference. First operand 136056 states and 221663 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114)