./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-58.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 59e2360cc163a0d2384c49f36d50ca727f3204f5fadd596107d45f50dd73df19 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:44:53,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:44:53,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:44:53,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:44:53,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:44:53,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:44:53,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:44:53,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:44:53,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:44:53,774 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:44:53,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:44:53,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:44:53,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:44:53,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:44:53,776 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:44:53,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:44:53,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:44:53,776 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:44:53,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:44:53,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:44:53,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:44:53,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:44:53,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:44:53,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:44:53,777 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:44:53,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:44:53,777 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:44:53,777 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:44:53,777 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:44:53,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:44:53,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:44:53,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:44:53,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:44:53,778 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:44:53,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:44:53,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:44:53,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:44:53,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:44:53,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:44:53,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:44:53,778 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:44:53,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:44:53,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:44:53,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:44:53,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:44:53,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:44:53,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:44:53,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:44:53,779 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 -> 59e2360cc163a0d2384c49f36d50ca727f3204f5fadd596107d45f50dd73df19 [2025-01-09 09:44:54,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:44:54,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:44:54,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:44:54,061 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:44:54,061 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:44:54,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-58.i [2025-01-09 09:44:55,306 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bdf33c54/e39a0bd9d9c74819a23d3a9901ce393b/FLAGc5e3ae371 [2025-01-09 09:44:55,559 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:44:55,559 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-58.i [2025-01-09 09:44:55,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bdf33c54/e39a0bd9d9c74819a23d3a9901ce393b/FLAGc5e3ae371 [2025-01-09 09:44:55,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bdf33c54/e39a0bd9d9c74819a23d3a9901ce393b [2025-01-09 09:44:55,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:44:55,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:44:55,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:44:55,585 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:44:55,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:44:55,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:44:55" (1/1) ... [2025-01-09 09:44:55,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fddfd67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:55, skipping insertion in model container [2025-01-09 09:44:55,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:44:55" (1/1) ... [2025-01-09 09:44:55,619 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:44:55,714 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-58.i[916,929] [2025-01-09 09:44:55,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:44:55,804 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:44:55,812 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-58.i[916,929] [2025-01-09 09:44:55,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:44:55,884 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:44:55,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:55 WrapperNode [2025-01-09 09:44:55,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:44:55,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:44:55,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:44:55,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:44:55,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:55" (1/1) ... [2025-01-09 09:44:55,904 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:55" (1/1) ... [2025-01-09 09:44:55,947 INFO L138 Inliner]: procedures = 26, calls = 87, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 542 [2025-01-09 09:44:55,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:44:55,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:44:55,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:44:55,948 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:44:55,955 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:55" (1/1) ... [2025-01-09 09:44:55,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:55" (1/1) ... [2025-01-09 09:44:55,966 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:55" (1/1) ... [2025-01-09 09:44:55,998 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 09:44:55,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:55" (1/1) ... [2025-01-09 09:44:55,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:55" (1/1) ... [2025-01-09 09:44:56,012 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:55" (1/1) ... [2025-01-09 09:44:56,018 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:55" (1/1) ... [2025-01-09 09:44:56,025 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:55" (1/1) ... [2025-01-09 09:44:56,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:55" (1/1) ... [2025-01-09 09:44:56,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:55" (1/1) ... [2025-01-09 09:44:56,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:44:56,051 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:44:56,051 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:44:56,051 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:44:56,052 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:55" (1/1) ... [2025-01-09 09:44:56,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:44:56,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:44:56,080 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 09:44:56,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 09:44:56,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:44:56,102 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:44:56,102 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:44:56,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:44:56,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:44:56,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:44:56,196 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:44:56,198 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:44:56,904 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-01-09 09:44:56,904 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:44:56,922 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:44:56,922 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:44:56,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:44:56 BoogieIcfgContainer [2025-01-09 09:44:56,922 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:44:56,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:44:56,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:44:56,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:44:56,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:44:55" (1/3) ... [2025-01-09 09:44:56,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a401fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:44:56, skipping insertion in model container [2025-01-09 09:44:56,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:55" (2/3) ... [2025-01-09 09:44:56,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a401fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:44:56, skipping insertion in model container [2025-01-09 09:44:56,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:44:56" (3/3) ... [2025-01-09 09:44:56,929 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-58.i [2025-01-09 09:44:56,940 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:44:56,943 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-58.i that has 2 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:44:56,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:44:57,001 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;@7f4b2a52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:44:57,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:44:57,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 150 states have (on average 1.54) internal successors, (231), 151 states have internal predecessors, (231), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-09 09:44:57,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-01-09 09:44:57,023 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:57,024 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:44:57,024 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:57,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:57,029 INFO L85 PathProgramCache]: Analyzing trace with hash -928428572, now seen corresponding path program 1 times [2025-01-09 09:44:57,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:57,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468359124] [2025-01-09 09:44:57,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:57,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:57,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-01-09 09:44:57,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-01-09 09:44:57,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:57,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:57,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2025-01-09 09:44:57,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:57,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468359124] [2025-01-09 09:44:57,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468359124] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:44:57,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204452298] [2025-01-09 09:44:57,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:57,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:44:57,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:44:57,443 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:44:57,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 09:44:57,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-01-09 09:44:57,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-01-09 09:44:57,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:57,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:57,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:44:57,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:44:57,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2025-01-09 09:44:57,769 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:44:57,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204452298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:57,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:44:57,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:44:57,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5994388] [2025-01-09 09:44:57,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:57,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:44:57,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:57,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:44:57,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:44:57,793 INFO L87 Difference]: Start difference. First operand has 227 states, 150 states have (on average 1.54) internal successors, (231), 151 states have internal predecessors, (231), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) Second operand has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) [2025-01-09 09:44:57,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:57,834 INFO L93 Difference]: Finished difference Result 448 states and 827 transitions. [2025-01-09 09:44:57,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:44:57,836 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) Word has length 468 [2025-01-09 09:44:57,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:57,843 INFO L225 Difference]: With dead ends: 448 [2025-01-09 09:44:57,843 INFO L226 Difference]: Without dead ends: 224 [2025-01-09 09:44:57,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:44:57,852 INFO L435 NwaCegarLoop]: 373 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, 373 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:57,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:44:57,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-01-09 09:44:57,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2025-01-09 09:44:57,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 148 states have (on average 1.5202702702702702) internal successors, (225), 148 states have internal predecessors, (225), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-09 09:44:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 373 transitions. [2025-01-09 09:44:57,921 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 373 transitions. Word has length 468 [2025-01-09 09:44:57,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:57,921 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 373 transitions. [2025-01-09 09:44:57,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) [2025-01-09 09:44:57,922 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 373 transitions. [2025-01-09 09:44:57,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-01-09 09:44:57,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:57,928 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:44:57,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 09:44:58,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 09:44:58,134 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:58,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:58,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1796406416, now seen corresponding path program 1 times [2025-01-09 09:44:58,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:58,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673943567] [2025-01-09 09:44:58,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:58,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:58,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-01-09 09:44:58,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-01-09 09:44:58,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:58,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-01-09 09:44:58,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:58,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673943567] [2025-01-09 09:44:58,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673943567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:58,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:58,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:44:58,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683434714] [2025-01-09 09:44:58,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:58,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:44:58,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:58,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:44:58,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:44:58,616 INFO L87 Difference]: Start difference. First operand 224 states and 373 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 09:44:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:58,741 INFO L93 Difference]: Finished difference Result 639 states and 1066 transitions. [2025-01-09 09:44:58,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:44:58,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 468 [2025-01-09 09:44:58,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:58,750 INFO L225 Difference]: With dead ends: 639 [2025-01-09 09:44:58,751 INFO L226 Difference]: Without dead ends: 418 [2025-01-09 09:44:58,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:44:58,752 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 325 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:58,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 691 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:44:58,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-01-09 09:44:58,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 227. [2025-01-09 09:44:58,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 151 states have (on average 1.5231788079470199) internal successors, (230), 151 states have internal predecessors, (230), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-09 09:44:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 378 transitions. [2025-01-09 09:44:58,809 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 378 transitions. Word has length 468 [2025-01-09 09:44:58,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:58,814 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 378 transitions. [2025-01-09 09:44:58,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 09:44:58,814 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 378 transitions. [2025-01-09 09:44:58,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-01-09 09:44:58,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:58,822 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:44:58,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:44:58,825 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:58,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:58,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1596682820, now seen corresponding path program 1 times [2025-01-09 09:44:58,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:58,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426928717] [2025-01-09 09:44:58,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:58,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:58,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-01-09 09:44:58,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-01-09 09:44:58,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:58,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:59,058 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-01-09 09:44:59,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:59,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426928717] [2025-01-09 09:44:59,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426928717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:59,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:59,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:44:59,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155580261] [2025-01-09 09:44:59,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:59,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:44:59,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:59,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:44:59,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:44:59,062 INFO L87 Difference]: Start difference. First operand 227 states and 378 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 09:44:59,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:59,124 INFO L93 Difference]: Finished difference Result 673 states and 1124 transitions. [2025-01-09 09:44:59,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:44:59,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 468 [2025-01-09 09:44:59,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:59,129 INFO L225 Difference]: With dead ends: 673 [2025-01-09 09:44:59,129 INFO L226 Difference]: Without dead ends: 449 [2025-01-09 09:44:59,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:44:59,130 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 357 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:59,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 993 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:44:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-01-09 09:44:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2025-01-09 09:44:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 296 states have (on average 1.510135135135135) internal successors, (447), 296 states have internal predecessors, (447), 148 states have call successors, (148), 2 states have call predecessors, (148), 2 states have return successors, (148), 148 states have call predecessors, (148), 148 states have call successors, (148) [2025-01-09 09:44:59,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 743 transitions. [2025-01-09 09:44:59,182 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 743 transitions. Word has length 468 [2025-01-09 09:44:59,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:59,183 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 743 transitions. [2025-01-09 09:44:59,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 09:44:59,184 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 743 transitions. [2025-01-09 09:44:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-01-09 09:44:59,189 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:59,189 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:44:59,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:44:59,189 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:59,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:59,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1769468096, now seen corresponding path program 1 times [2025-01-09 09:44:59,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:59,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956646042] [2025-01-09 09:44:59,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:59,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:59,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-01-09 09:44:59,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-01-09 09:44:59,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:59,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:59,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-01-09 09:44:59,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:59,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956646042] [2025-01-09 09:44:59,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956646042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:59,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:59,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:44:59,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094375697] [2025-01-09 09:44:59,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:59,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:44:59,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:59,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:44:59,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:44:59,543 INFO L87 Difference]: Start difference. First operand 447 states and 743 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-01-09 09:44:59,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:59,624 INFO L93 Difference]: Finished difference Result 891 states and 1483 transitions. [2025-01-09 09:44:59,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:44:59,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) Word has length 468 [2025-01-09 09:44:59,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:59,630 INFO L225 Difference]: With dead ends: 891 [2025-01-09 09:44:59,630 INFO L226 Difference]: Without dead ends: 447 [2025-01-09 09:44:59,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:44:59,632 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 323 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:59,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 710 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:44:59,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-01-09 09:44:59,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2025-01-09 09:44:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 296 states have (on average 1.5033783783783783) internal successors, (445), 296 states have internal predecessors, (445), 148 states have call successors, (148), 2 states have call predecessors, (148), 2 states have return successors, (148), 148 states have call predecessors, (148), 148 states have call successors, (148) [2025-01-09 09:44:59,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 741 transitions. [2025-01-09 09:44:59,694 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 741 transitions. Word has length 468 [2025-01-09 09:44:59,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:59,696 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 741 transitions. [2025-01-09 09:44:59,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-01-09 09:44:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 741 transitions. [2025-01-09 09:44:59,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-01-09 09:44:59,703 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:59,704 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:44:59,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:44:59,705 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:59,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:59,705 INFO L85 PathProgramCache]: Analyzing trace with hash -35970238, now seen corresponding path program 1 times [2025-01-09 09:44:59,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:59,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737863473] [2025-01-09 09:44:59,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:59,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:59,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-01-09 09:44:59,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-01-09 09:44:59,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:59,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-01-09 09:45:00,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:00,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737863473] [2025-01-09 09:45:00,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737863473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:00,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:00,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:45:00,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992964427] [2025-01-09 09:45:00,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:00,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:45:00,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:00,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:45:00,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:45:00,264 INFO L87 Difference]: Start difference. First operand 447 states and 741 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 09:45:00,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:00,470 INFO L93 Difference]: Finished difference Result 1255 states and 2088 transitions. [2025-01-09 09:45:00,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:45:00,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 468 [2025-01-09 09:45:00,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:00,475 INFO L225 Difference]: With dead ends: 1255 [2025-01-09 09:45:00,476 INFO L226 Difference]: Without dead ends: 771 [2025-01-09 09:45:00,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 09:45:00,478 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 503 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:00,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1101 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:45:00,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-01-09 09:45:00,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 765. [2025-01-09 09:45:00,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 560 states have (on average 1.5589285714285714) internal successors, (873), 562 states have internal predecessors, (873), 200 states have call successors, (200), 4 states have call predecessors, (200), 4 states have return successors, (200), 198 states have call predecessors, (200), 200 states have call successors, (200) [2025-01-09 09:45:00,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1273 transitions. [2025-01-09 09:45:00,590 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1273 transitions. Word has length 468 [2025-01-09 09:45:00,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:00,591 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1273 transitions. [2025-01-09 09:45:00,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 09:45:00,593 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1273 transitions. [2025-01-09 09:45:00,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-01-09 09:45:00,597 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:00,598 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:45:00,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:45:00,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:00,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:00,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1334698946, now seen corresponding path program 1 times [2025-01-09 09:45:00,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:00,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231148013] [2025-01-09 09:45:00,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:00,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:00,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-01-09 09:45:00,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-01-09 09:45:00,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:00,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-01-09 09:45:01,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:01,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231148013] [2025-01-09 09:45:01,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231148013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:01,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:01,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:45:01,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143511620] [2025-01-09 09:45:01,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:01,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:45:01,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:01,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:45:01,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:45:01,361 INFO L87 Difference]: Start difference. First operand 765 states and 1273 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-01-09 09:45:02,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:02,315 INFO L93 Difference]: Finished difference Result 2136 states and 3559 transitions. [2025-01-09 09:45:02,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:45:02,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) Word has length 468 [2025-01-09 09:45:02,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:02,329 INFO L225 Difference]: With dead ends: 2136 [2025-01-09 09:45:02,330 INFO L226 Difference]: Without dead ends: 1374 [2025-01-09 09:45:02,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:45:02,335 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 564 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:02,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 899 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 09:45:02,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2025-01-09 09:45:02,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1362. [2025-01-09 09:45:02,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1031 states have (on average 1.5732298739088264) internal successors, (1622), 1037 states have internal predecessors, (1622), 322 states have call successors, (322), 8 states have call predecessors, (322), 8 states have return successors, (322), 316 states have call predecessors, (322), 322 states have call successors, (322) [2025-01-09 09:45:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 2266 transitions. [2025-01-09 09:45:02,497 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 2266 transitions. Word has length 468 [2025-01-09 09:45:02,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:02,497 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 2266 transitions. [2025-01-09 09:45:02,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-01-09 09:45:02,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2266 transitions. [2025-01-09 09:45:02,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-01-09 09:45:02,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:02,501 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:45:02,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:45:02,502 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:02,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:02,502 INFO L85 PathProgramCache]: Analyzing trace with hash 931682240, now seen corresponding path program 1 times [2025-01-09 09:45:02,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:02,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615830638] [2025-01-09 09:45:02,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:02,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:02,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-01-09 09:45:02,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-01-09 09:45:02,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:02,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-01-09 09:45:02,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:02,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615830638] [2025-01-09 09:45:02,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615830638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:02,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:02,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:45:02,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961774131] [2025-01-09 09:45:02,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:02,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:45:02,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:02,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:45:02,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:45:02,851 INFO L87 Difference]: Start difference. First operand 1362 states and 2266 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 09:45:03,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:03,060 INFO L93 Difference]: Finished difference Result 3495 states and 5819 transitions. [2025-01-09 09:45:03,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:45:03,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 468 [2025-01-09 09:45:03,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:03,074 INFO L225 Difference]: With dead ends: 3495 [2025-01-09 09:45:03,074 INFO L226 Difference]: Without dead ends: 2136 [2025-01-09 09:45:03,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:45:03,079 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 234 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:03,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1346 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:45:03,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2025-01-09 09:45:03,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 2126. [2025-01-09 09:45:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2126 states, 1591 states have (on average 1.5656819610307982) internal successors, (2491), 1599 states have internal predecessors, (2491), 522 states have call successors, (522), 12 states have call predecessors, (522), 12 states have return successors, (522), 514 states have call predecessors, (522), 522 states have call successors, (522) [2025-01-09 09:45:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 3535 transitions. [2025-01-09 09:45:03,265 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 3535 transitions. Word has length 468 [2025-01-09 09:45:03,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:03,266 INFO L471 AbstractCegarLoop]: Abstraction has 2126 states and 3535 transitions. [2025-01-09 09:45:03,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 09:45:03,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 3535 transitions. [2025-01-09 09:45:03,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-01-09 09:45:03,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:03,271 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:45:03,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:45:03,272 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:03,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:03,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1644165335, now seen corresponding path program 1 times [2025-01-09 09:45:03,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:03,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972365821] [2025-01-09 09:45:03,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:03,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:03,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-01-09 09:45:03,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-01-09 09:45:03,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:03,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:03,756 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-01-09 09:45:03,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:03,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972365821] [2025-01-09 09:45:03,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972365821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:03,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:03,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:45:03,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445692502] [2025-01-09 09:45:03,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:03,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:45:03,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:03,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:45:03,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:45:03,759 INFO L87 Difference]: Start difference. First operand 2126 states and 3535 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-01-09 09:45:04,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:04,369 INFO L93 Difference]: Finished difference Result 4267 states and 7100 transitions. [2025-01-09 09:45:04,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:45:04,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) Word has length 469 [2025-01-09 09:45:04,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:04,386 INFO L225 Difference]: With dead ends: 4267 [2025-01-09 09:45:04,387 INFO L226 Difference]: Without dead ends: 2908 [2025-01-09 09:45:04,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:45:04,392 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 600 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:04,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1467 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:45:04,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2025-01-09 09:45:04,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2898. [2025-01-09 09:45:04,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2159 states have (on average 1.5636868920796665) internal successors, (3376), 2169 states have internal predecessors, (3376), 722 states have call successors, (722), 16 states have call predecessors, (722), 16 states have return successors, (722), 712 states have call predecessors, (722), 722 states have call successors, (722) [2025-01-09 09:45:04,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4820 transitions. [2025-01-09 09:45:04,589 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4820 transitions. Word has length 469 [2025-01-09 09:45:04,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:04,590 INFO L471 AbstractCegarLoop]: Abstraction has 2898 states and 4820 transitions. [2025-01-09 09:45:04,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-01-09 09:45:04,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4820 transitions. [2025-01-09 09:45:04,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-01-09 09:45:04,594 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:04,595 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:45:04,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:45:04,595 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:04,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:04,596 INFO L85 PathProgramCache]: Analyzing trace with hash -105825305, now seen corresponding path program 1 times [2025-01-09 09:45:04,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:04,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114230255] [2025-01-09 09:45:04,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:04,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:04,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-01-09 09:45:04,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-01-09 09:45:04,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:04,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-01-09 09:45:04,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:04,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114230255] [2025-01-09 09:45:04,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114230255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:04,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:04,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:45:04,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161286157] [2025-01-09 09:45:04,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:04,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:45:04,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:04,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:45:04,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:45:04,933 INFO L87 Difference]: Start difference. First operand 2898 states and 4820 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 09:45:05,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:05,756 INFO L93 Difference]: Finished difference Result 6331 states and 10522 transitions. [2025-01-09 09:45:05,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:45:05,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 469 [2025-01-09 09:45:05,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:05,782 INFO L225 Difference]: With dead ends: 6331 [2025-01-09 09:45:05,782 INFO L226 Difference]: Without dead ends: 3436 [2025-01-09 09:45:05,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:45:05,792 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 538 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:05,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1301 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 09:45:05,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2025-01-09 09:45:06,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 2940. [2025-01-09 09:45:06,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2940 states, 2201 states have (on average 1.562925942753294) internal successors, (3440), 2211 states have internal predecessors, (3440), 722 states have call successors, (722), 16 states have call predecessors, (722), 16 states have return successors, (722), 712 states have call predecessors, (722), 722 states have call successors, (722) [2025-01-09 09:45:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2940 states to 2940 states and 4884 transitions. [2025-01-09 09:45:06,034 INFO L78 Accepts]: Start accepts. Automaton has 2940 states and 4884 transitions. Word has length 469 [2025-01-09 09:45:06,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:06,035 INFO L471 AbstractCegarLoop]: Abstraction has 2940 states and 4884 transitions. [2025-01-09 09:45:06,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 09:45:06,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2940 states and 4884 transitions. [2025-01-09 09:45:06,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-01-09 09:45:06,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:06,040 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:45:06,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:45:06,041 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:06,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:06,041 INFO L85 PathProgramCache]: Analyzing trace with hash 2139754149, now seen corresponding path program 1 times [2025-01-09 09:45:06,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:06,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756958777] [2025-01-09 09:45:06,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:06,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:06,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-01-09 09:45:06,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-01-09 09:45:06,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:06,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-01-09 09:45:07,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:07,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756958777] [2025-01-09 09:45:07,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756958777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:07,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:07,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 09:45:07,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698499731] [2025-01-09 09:45:07,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:07,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 09:45:07,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:07,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 09:45:07,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:45:07,805 INFO L87 Difference]: Start difference. First operand 2940 states and 4884 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-01-09 09:45:09,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:09,160 INFO L93 Difference]: Finished difference Result 6456 states and 10727 transitions. [2025-01-09 09:45:09,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:45:09,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) Word has length 469 [2025-01-09 09:45:09,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:09,180 INFO L225 Difference]: With dead ends: 6456 [2025-01-09 09:45:09,180 INFO L226 Difference]: Without dead ends: 3519 [2025-01-09 09:45:09,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:45:09,190 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 823 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 2043 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:09,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 2043 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 09:45:09,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3519 states. [2025-01-09 09:45:09,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3519 to 3513. [2025-01-09 09:45:09,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3513 states, 2648 states have (on average 1.5672205438066464) internal successors, (4150), 2662 states have internal predecessors, (4150), 844 states have call successors, (844), 20 states have call predecessors, (844), 20 states have return successors, (844), 830 states have call predecessors, (844), 844 states have call successors, (844) [2025-01-09 09:45:09,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3513 states to 3513 states and 5838 transitions. [2025-01-09 09:45:09,427 INFO L78 Accepts]: Start accepts. Automaton has 3513 states and 5838 transitions. Word has length 469 [2025-01-09 09:45:09,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:09,428 INFO L471 AbstractCegarLoop]: Abstraction has 3513 states and 5838 transitions. [2025-01-09 09:45:09,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-01-09 09:45:09,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3513 states and 5838 transitions. [2025-01-09 09:45:09,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-01-09 09:45:09,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:09,433 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:45:09,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:45:09,433 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:09,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:09,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1681226875, now seen corresponding path program 1 times [2025-01-09 09:45:09,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:09,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598749251] [2025-01-09 09:45:09,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:09,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:09,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-01-09 09:45:09,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-01-09 09:45:09,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:09,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:10,022 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-01-09 09:45:10,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:10,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598749251] [2025-01-09 09:45:10,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598749251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:10,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:10,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:45:10,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618966597] [2025-01-09 09:45:10,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:10,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:45:10,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:10,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:45:10,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:45:10,024 INFO L87 Difference]: Start difference. First operand 3513 states and 5838 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 09:45:11,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:11,173 INFO L93 Difference]: Finished difference Result 6119 states and 10161 transitions. [2025-01-09 09:45:11,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:45:11,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 470 [2025-01-09 09:45:11,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:11,200 INFO L225 Difference]: With dead ends: 6119 [2025-01-09 09:45:11,201 INFO L226 Difference]: Without dead ends: 3988 [2025-01-09 09:45:11,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:45:11,210 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 608 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:11,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 1439 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 09:45:11,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3988 states. [2025-01-09 09:45:11,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3988 to 3559. [2025-01-09 09:45:11,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3559 states, 2694 states have (on average 1.5682999257609502) internal successors, (4225), 2708 states have internal predecessors, (4225), 844 states have call successors, (844), 20 states have call predecessors, (844), 20 states have return successors, (844), 830 states have call predecessors, (844), 844 states have call successors, (844) [2025-01-09 09:45:11,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3559 states to 3559 states and 5913 transitions. [2025-01-09 09:45:11,527 INFO L78 Accepts]: Start accepts. Automaton has 3559 states and 5913 transitions. Word has length 470 [2025-01-09 09:45:11,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:11,528 INFO L471 AbstractCegarLoop]: Abstraction has 3559 states and 5913 transitions. [2025-01-09 09:45:11,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 09:45:11,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3559 states and 5913 transitions. [2025-01-09 09:45:11,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-01-09 09:45:11,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:11,534 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:45:11,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 09:45:11,535 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:11,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:11,536 INFO L85 PathProgramCache]: Analyzing trace with hash -381101519, now seen corresponding path program 1 times [2025-01-09 09:45:11,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:11,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549105461] [2025-01-09 09:45:11,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:11,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:11,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-01-09 09:45:11,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-01-09 09:45:11,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:11,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-01-09 09:45:12,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:12,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549105461] [2025-01-09 09:45:12,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549105461] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:12,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:12,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 09:45:12,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401966720] [2025-01-09 09:45:12,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:12,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 09:45:12,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:12,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 09:45:12,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:45:12,593 INFO L87 Difference]: Start difference. First operand 3559 states and 5913 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-01-09 09:45:14,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:14,394 INFO L93 Difference]: Finished difference Result 6604 states and 10946 transitions. [2025-01-09 09:45:14,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:45:14,395 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) Word has length 470 [2025-01-09 09:45:14,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:14,428 INFO L225 Difference]: With dead ends: 6604 [2025-01-09 09:45:14,428 INFO L226 Difference]: Without dead ends: 4427 [2025-01-09 09:45:14,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:45:14,441 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 1157 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:14,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 1276 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 09:45:14,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4427 states. [2025-01-09 09:45:14,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4427 to 3633. [2025-01-09 09:45:14,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3633 states, 2768 states have (on average 1.5740606936416186) internal successors, (4357), 2782 states have internal predecessors, (4357), 844 states have call successors, (844), 20 states have call predecessors, (844), 20 states have return successors, (844), 830 states have call predecessors, (844), 844 states have call successors, (844) [2025-01-09 09:45:14,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 6045 transitions. [2025-01-09 09:45:14,759 INFO L78 Accepts]: Start accepts. Automaton has 3633 states and 6045 transitions. Word has length 470 [2025-01-09 09:45:14,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:14,759 INFO L471 AbstractCegarLoop]: Abstraction has 3633 states and 6045 transitions. [2025-01-09 09:45:14,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-01-09 09:45:14,760 INFO L276 IsEmpty]: Start isEmpty. Operand 3633 states and 6045 transitions. [2025-01-09 09:45:14,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-01-09 09:45:14,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:14,765 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:45:14,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 09:45:14,765 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:14,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:14,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1077975895, now seen corresponding path program 1 times [2025-01-09 09:45:14,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:14,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368513222] [2025-01-09 09:45:14,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:14,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:14,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-01-09 09:45:14,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-01-09 09:45:14,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:14,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-01-09 09:45:14,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:14,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368513222] [2025-01-09 09:45:14,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368513222] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:14,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:14,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:45:14,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687074719] [2025-01-09 09:45:14,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:14,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:45:14,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:14,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:45:14,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:45:14,956 INFO L87 Difference]: Start difference. First operand 3633 states and 6045 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 09:45:15,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:15,298 INFO L93 Difference]: Finished difference Result 8014 states and 13341 transitions. [2025-01-09 09:45:15,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:45:15,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 470 [2025-01-09 09:45:15,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:15,318 INFO L225 Difference]: With dead ends: 8014 [2025-01-09 09:45:15,318 INFO L226 Difference]: Without dead ends: 4384 [2025-01-09 09:45:15,326 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 09:45:15,327 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 369 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:15,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1031 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:45:15,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4384 states. [2025-01-09 09:45:15,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4384 to 4382. [2025-01-09 09:45:15,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4382 states, 3313 states have (on average 1.5641412616963477) internal successors, (5182), 3329 states have internal predecessors, (5182), 1044 states have call successors, (1044), 24 states have call predecessors, (1044), 24 states have return successors, (1044), 1028 states have call predecessors, (1044), 1044 states have call successors, (1044) [2025-01-09 09:45:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 7270 transitions. [2025-01-09 09:45:15,705 INFO L78 Accepts]: Start accepts. Automaton has 4382 states and 7270 transitions. Word has length 470 [2025-01-09 09:45:15,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:15,706 INFO L471 AbstractCegarLoop]: Abstraction has 4382 states and 7270 transitions. [2025-01-09 09:45:15,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 09:45:15,706 INFO L276 IsEmpty]: Start isEmpty. Operand 4382 states and 7270 transitions. [2025-01-09 09:45:15,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-01-09 09:45:15,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:15,714 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:45:15,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 09:45:15,715 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:15,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:15,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1720254083, now seen corresponding path program 1 times [2025-01-09 09:45:15,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:15,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337021407] [2025-01-09 09:45:15,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:15,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:15,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-01-09 09:45:15,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-01-09 09:45:15,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:15,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-01-09 09:45:16,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:16,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337021407] [2025-01-09 09:45:16,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337021407] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:16,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:16,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 09:45:16,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995026860] [2025-01-09 09:45:16,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:16,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 09:45:16,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:16,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 09:45:16,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:45:16,693 INFO L87 Difference]: Start difference. First operand 4382 states and 7270 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-01-09 09:45:18,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:18,423 INFO L93 Difference]: Finished difference Result 8098 states and 13442 transitions. [2025-01-09 09:45:18,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:45:18,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) Word has length 470 [2025-01-09 09:45:18,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:18,489 INFO L225 Difference]: With dead ends: 8098 [2025-01-09 09:45:18,489 INFO L226 Difference]: Without dead ends: 5098 [2025-01-09 09:45:18,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:45:18,495 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 856 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:18,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 1330 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 09:45:18,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5098 states. [2025-01-09 09:45:18,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5098 to 4480. [2025-01-09 09:45:18,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4480 states, 3411 states have (on average 1.5705071826443857) internal successors, (5357), 3427 states have internal predecessors, (5357), 1044 states have call successors, (1044), 24 states have call predecessors, (1044), 24 states have return successors, (1044), 1028 states have call predecessors, (1044), 1044 states have call successors, (1044) [2025-01-09 09:45:18,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4480 states to 4480 states and 7445 transitions. [2025-01-09 09:45:18,841 INFO L78 Accepts]: Start accepts. Automaton has 4480 states and 7445 transitions. Word has length 470 [2025-01-09 09:45:18,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:18,841 INFO L471 AbstractCegarLoop]: Abstraction has 4480 states and 7445 transitions. [2025-01-09 09:45:18,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-01-09 09:45:18,842 INFO L276 IsEmpty]: Start isEmpty. Operand 4480 states and 7445 transitions. [2025-01-09 09:45:18,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-01-09 09:45:18,847 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:18,847 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:45:18,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 09:45:18,847 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:18,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:18,848 INFO L85 PathProgramCache]: Analyzing trace with hash -224474291, now seen corresponding path program 1 times [2025-01-09 09:45:18,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:18,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320001242] [2025-01-09 09:45:18,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:18,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:18,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-01-09 09:45:19,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-01-09 09:45:19,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:19,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:20,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-01-09 09:45:20,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:20,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320001242] [2025-01-09 09:45:20,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320001242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:20,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:20,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 09:45:20,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663638440] [2025-01-09 09:45:20,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:20,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 09:45:20,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:20,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 09:45:20,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:45:20,608 INFO L87 Difference]: Start difference. First operand 4480 states and 7445 transitions. Second operand has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 3 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 3 states have call predecessors, (74), 3 states have call successors, (74) [2025-01-09 09:45:26,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:26,766 INFO L93 Difference]: Finished difference Result 13044 states and 21523 transitions. [2025-01-09 09:45:26,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 09:45:26,767 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 3 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 3 states have call predecessors, (74), 3 states have call successors, (74) Word has length 470 [2025-01-09 09:45:26,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:26,794 INFO L225 Difference]: With dead ends: 13044 [2025-01-09 09:45:26,794 INFO L226 Difference]: Without dead ends: 8567 [2025-01-09 09:45:26,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2025-01-09 09:45:26,806 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 2066 mSDsluCounter, 3040 mSDsCounter, 0 mSdLazyCounter, 3113 mSolverCounterSat, 1283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2066 SdHoareTripleChecker+Valid, 3653 SdHoareTripleChecker+Invalid, 4396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1283 IncrementalHoareTripleChecker+Valid, 3113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:26,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2066 Valid, 3653 Invalid, 4396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1283 Valid, 3113 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-01-09 09:45:26,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8567 states. [2025-01-09 09:45:27,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8567 to 6789. [2025-01-09 09:45:27,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6789 states, 5172 states have (on average 1.565351894818252) internal successors, (8096), 5204 states have internal predecessors, (8096), 1570 states have call successors, (1570), 46 states have call predecessors, (1570), 46 states have return successors, (1570), 1538 states have call predecessors, (1570), 1570 states have call successors, (1570) [2025-01-09 09:45:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6789 states to 6789 states and 11236 transitions. [2025-01-09 09:45:27,467 INFO L78 Accepts]: Start accepts. Automaton has 6789 states and 11236 transitions. Word has length 470 [2025-01-09 09:45:27,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:27,468 INFO L471 AbstractCegarLoop]: Abstraction has 6789 states and 11236 transitions. [2025-01-09 09:45:27,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 3 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 3 states have call predecessors, (74), 3 states have call successors, (74) [2025-01-09 09:45:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 6789 states and 11236 transitions. [2025-01-09 09:45:27,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-01-09 09:45:27,475 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:27,475 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:45:27,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 09:45:27,476 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:27,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:27,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1121867569, now seen corresponding path program 1 times [2025-01-09 09:45:27,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:27,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121908774] [2025-01-09 09:45:27,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:27,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:27,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-01-09 09:45:27,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-01-09 09:45:27,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:27,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat