./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-24.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 91568889e64309585cc4780728e0f3ac2bb8be964788cb7e1aee4dd059fc722f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:03:13,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:03:13,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:03:13,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:03:13,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:03:13,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:03:13,840 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:03:13,840 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:03:13,840 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:03:13,840 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:03:13,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:03:13,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:03:13,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:03:13,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:03:13,841 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:03:13,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:03:13,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:03:13,841 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:03:13,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:03:13,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:03:13,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:03:13,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:03:13,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:03:13,841 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:03:13,841 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:03:13,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:03:13,841 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:03:13,841 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:03:13,842 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:03:13,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:03:13,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:03:13,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:03:13,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:03:13,842 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:03:13,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:03:13,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:03:13,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:03:13,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:03:13,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:03:13,842 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:03:13,842 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:03:13,842 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:03:13,842 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:03:13,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:03:13,843 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:03:13,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:03:13,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:03:13,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:03:13,843 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 -> 91568889e64309585cc4780728e0f3ac2bb8be964788cb7e1aee4dd059fc722f [2025-01-09 10:03:14,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:03:14,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:03:14,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:03:14,049 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:03:14,049 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:03:14,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-24.i [2025-01-09 10:03:15,247 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/91947f023/aa4d697d77f84dd58b4edf598ae951ab/FLAGb76301cd2 [2025-01-09 10:03:15,574 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:03:15,574 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-24.i [2025-01-09 10:03:15,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/91947f023/aa4d697d77f84dd58b4edf598ae951ab/FLAGb76301cd2 [2025-01-09 10:03:15,822 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/91947f023/aa4d697d77f84dd58b4edf598ae951ab [2025-01-09 10:03:15,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:03:15,825 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:03:15,826 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:03:15,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:03:15,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:03:15,829 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:03:15" (1/1) ... [2025-01-09 10:03:15,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28d3be11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:15, skipping insertion in model container [2025-01-09 10:03:15,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:03:15" (1/1) ... [2025-01-09 10:03:15,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:03:15,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-24.i[916,929] [2025-01-09 10:03:16,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:03:16,166 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:03:16,172 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-24.i[916,929] [2025-01-09 10:03:16,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:03:16,231 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:03:16,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:16 WrapperNode [2025-01-09 10:03:16,231 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:03:16,232 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:03:16,232 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:03:16,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:03:16,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:16" (1/1) ... [2025-01-09 10:03:16,256 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:16" (1/1) ... [2025-01-09 10:03:16,334 INFO L138 Inliner]: procedures = 26, calls = 120, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 906 [2025-01-09 10:03:16,334 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:03:16,335 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:03:16,335 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:03:16,336 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:03:16,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:16" (1/1) ... [2025-01-09 10:03:16,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:16" (1/1) ... [2025-01-09 10:03:16,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:16" (1/1) ... [2025-01-09 10:03:16,390 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 10:03:16,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:16" (1/1) ... [2025-01-09 10:03:16,391 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:16" (1/1) ... [2025-01-09 10:03:16,420 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:16" (1/1) ... [2025-01-09 10:03:16,426 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:16" (1/1) ... [2025-01-09 10:03:16,436 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:16" (1/1) ... [2025-01-09 10:03:16,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:16" (1/1) ... [2025-01-09 10:03:16,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:16" (1/1) ... [2025-01-09 10:03:16,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:03:16,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:03:16,476 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:03:16,476 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:03:16,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:16" (1/1) ... [2025-01-09 10:03:16,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:03:16,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:03:16,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:03:16,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:03:16,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:03:16,539 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:03:16,539 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:03:16,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:03:16,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:03:16,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:03:16,662 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:03:16,663 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:03:17,742 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-01-09 10:03:17,742 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:03:17,764 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:03:17,767 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:03:17,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:03:17 BoogieIcfgContainer [2025-01-09 10:03:17,768 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:03:17,770 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:03:17,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:03:17,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:03:17,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:03:15" (1/3) ... [2025-01-09 10:03:17,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc5c2e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:03:17, skipping insertion in model container [2025-01-09 10:03:17,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:16" (2/3) ... [2025-01-09 10:03:17,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc5c2e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:03:17, skipping insertion in model container [2025-01-09 10:03:17,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:03:17" (3/3) ... [2025-01-09 10:03:17,779 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-24.i [2025-01-09 10:03:17,798 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:03:17,802 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-24.i that has 2 procedures, 375 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:03:17,855 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:03:17,864 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;@373817a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:03:17,865 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:03:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 375 states, 265 states have (on average 1.588679245283019) internal successors, (421), 266 states have internal predecessors, (421), 107 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 107 states have call predecessors, (107), 107 states have call successors, (107) [2025-01-09 10:03:17,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2025-01-09 10:03:17,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:17,899 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:17,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:17,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:17,904 INFO L85 PathProgramCache]: Analyzing trace with hash -797811113, now seen corresponding path program 1 times [2025-01-09 10:03:17,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:17,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154272354] [2025-01-09 10:03:17,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:17,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:18,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 690 statements into 1 equivalence classes. [2025-01-09 10:03:18,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 690 of 690 statements. [2025-01-09 10:03:18,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:18,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:18,449 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 22472 trivial. 0 not checked. [2025-01-09 10:03:18,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:18,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154272354] [2025-01-09 10:03:18,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154272354] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:03:18,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267901045] [2025-01-09 10:03:18,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:18,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:03:18,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:03:18,452 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:03:18,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:03:18,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 690 statements into 1 equivalence classes. [2025-01-09 10:03:18,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 690 of 690 statements. [2025-01-09 10:03:18,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:18,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:18,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 1555 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:03:18,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:03:18,842 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 22472 trivial. 0 not checked. [2025-01-09 10:03:18,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:03:18,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267901045] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:18,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:03:18,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:03:18,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39968761] [2025-01-09 10:03:18,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:18,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:03:18,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:18,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:03:18,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:03:18,867 INFO L87 Difference]: Start difference. First operand has 375 states, 265 states have (on average 1.588679245283019) internal successors, (421), 266 states have internal predecessors, (421), 107 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 107 states have call predecessors, (107), 107 states have call successors, (107) Second operand has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (107), 2 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 2 states have call successors, (107) [2025-01-09 10:03:18,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:18,920 INFO L93 Difference]: Finished difference Result 744 states and 1372 transitions. [2025-01-09 10:03:18,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:03:18,922 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (107), 2 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 2 states have call successors, (107) Word has length 690 [2025-01-09 10:03:18,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:18,928 INFO L225 Difference]: With dead ends: 744 [2025-01-09 10:03:18,928 INFO L226 Difference]: Without dead ends: 372 [2025-01-09 10:03:18,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 691 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:03:18,933 INFO L435 NwaCegarLoop]: 629 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, 629 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:18,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:18,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-01-09 10:03:18,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-01-09 10:03:18,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 263 states have (on average 1.5779467680608366) internal successors, (415), 263 states have internal predecessors, (415), 107 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 107 states have call predecessors, (107), 107 states have call successors, (107) [2025-01-09 10:03:18,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 629 transitions. [2025-01-09 10:03:18,997 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 629 transitions. Word has length 690 [2025-01-09 10:03:18,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:18,998 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 629 transitions. [2025-01-09 10:03:18,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (107), 2 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 2 states have call successors, (107) [2025-01-09 10:03:18,998 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 629 transitions. [2025-01-09 10:03:19,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2025-01-09 10:03:19,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:19,008 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:19,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:03:19,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:03:19,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:19,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:19,209 INFO L85 PathProgramCache]: Analyzing trace with hash -112659115, now seen corresponding path program 1 times [2025-01-09 10:03:19,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:19,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168738365] [2025-01-09 10:03:19,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:19,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:19,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 690 statements into 1 equivalence classes. [2025-01-09 10:03:19,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 690 of 690 statements. [2025-01-09 10:03:19,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:19,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:03:19,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:19,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168738365] [2025-01-09 10:03:19,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168738365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:19,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:19,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:19,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651466799] [2025-01-09 10:03:19,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:19,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:19,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:19,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:19,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:19,943 INFO L87 Difference]: Start difference. First operand 372 states and 629 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:19,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:19,999 INFO L93 Difference]: Finished difference Result 741 states and 1255 transitions. [2025-01-09 10:03:19,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:19,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 690 [2025-01-09 10:03:20,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:20,006 INFO L225 Difference]: With dead ends: 741 [2025-01-09 10:03:20,006 INFO L226 Difference]: Without dead ends: 372 [2025-01-09 10:03:20,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:20,009 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 0 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:20,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1248 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:20,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-01-09 10:03:20,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-01-09 10:03:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 263 states have (on average 1.5741444866920151) internal successors, (414), 263 states have internal predecessors, (414), 107 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 107 states have call predecessors, (107), 107 states have call successors, (107) [2025-01-09 10:03:20,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 628 transitions. [2025-01-09 10:03:20,044 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 628 transitions. Word has length 690 [2025-01-09 10:03:20,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:20,047 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 628 transitions. [2025-01-09 10:03:20,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:20,048 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 628 transitions. [2025-01-09 10:03:20,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-01-09 10:03:20,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:20,056 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:20,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:03:20,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:20,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:20,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1533476528, now seen corresponding path program 1 times [2025-01-09 10:03:20,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:20,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728640154] [2025-01-09 10:03:20,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:20,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:20,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-01-09 10:03:20,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-01-09 10:03:20,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:20,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:20,514 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:03:20,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:20,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728640154] [2025-01-09 10:03:20,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728640154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:20,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:20,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:20,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688581230] [2025-01-09 10:03:20,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:20,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:20,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:20,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:20,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:20,517 INFO L87 Difference]: Start difference. First operand 372 states and 628 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:20,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:20,585 INFO L93 Difference]: Finished difference Result 973 states and 1652 transitions. [2025-01-09 10:03:20,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:20,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 692 [2025-01-09 10:03:20,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:20,592 INFO L225 Difference]: With dead ends: 973 [2025-01-09 10:03:20,592 INFO L226 Difference]: Without dead ends: 604 [2025-01-09 10:03:20,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:20,594 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 390 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:20,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1418 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:20,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-01-09 10:03:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 601. [2025-01-09 10:03:20,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 463 states have (on average 1.6220302375809936) internal successors, (751), 464 states have internal predecessors, (751), 135 states have call successors, (135), 2 states have call predecessors, (135), 2 states have return successors, (135), 134 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 10:03:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1021 transitions. [2025-01-09 10:03:20,635 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1021 transitions. Word has length 692 [2025-01-09 10:03:20,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:20,636 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 1021 transitions. [2025-01-09 10:03:20,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:20,637 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1021 transitions. [2025-01-09 10:03:20,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-01-09 10:03:20,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:20,641 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:20,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:03:20,641 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:20,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:20,641 INFO L85 PathProgramCache]: Analyzing trace with hash 802915982, now seen corresponding path program 1 times [2025-01-09 10:03:20,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:20,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229217482] [2025-01-09 10:03:20,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:20,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:20,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-01-09 10:03:20,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-01-09 10:03:20,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:20,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:03:20,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:20,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229217482] [2025-01-09 10:03:20,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229217482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:20,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:20,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:20,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619381466] [2025-01-09 10:03:20,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:20,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:20,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:20,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:20,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:20,968 INFO L87 Difference]: Start difference. First operand 601 states and 1021 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:21,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:21,041 INFO L93 Difference]: Finished difference Result 1628 states and 2773 transitions. [2025-01-09 10:03:21,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:21,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 692 [2025-01-09 10:03:21,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:21,048 INFO L225 Difference]: With dead ends: 1628 [2025-01-09 10:03:21,048 INFO L226 Difference]: Without dead ends: 1030 [2025-01-09 10:03:21,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:21,050 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 365 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:21,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1487 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:21,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2025-01-09 10:03:21,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1026. [2025-01-09 10:03:21,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 838 states have (on average 1.6312649164677804) internal successors, (1367), 841 states have internal predecessors, (1367), 183 states have call successors, (183), 4 states have call predecessors, (183), 4 states have return successors, (183), 180 states have call predecessors, (183), 183 states have call successors, (183) [2025-01-09 10:03:21,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1733 transitions. [2025-01-09 10:03:21,096 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1733 transitions. Word has length 692 [2025-01-09 10:03:21,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:21,097 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1733 transitions. [2025-01-09 10:03:21,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:21,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1733 transitions. [2025-01-09 10:03:21,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-01-09 10:03:21,101 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:21,102 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:21,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:03:21,102 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:21,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:21,102 INFO L85 PathProgramCache]: Analyzing trace with hash -883263856, now seen corresponding path program 1 times [2025-01-09 10:03:21,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:21,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644264805] [2025-01-09 10:03:21,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:21,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:21,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-01-09 10:03:21,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-01-09 10:03:21,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:21,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:21,424 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:03:21,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:21,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644264805] [2025-01-09 10:03:21,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644264805] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:21,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:21,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:21,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313457659] [2025-01-09 10:03:21,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:21,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:21,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:21,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:21,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:21,426 INFO L87 Difference]: Start difference. First operand 1026 states and 1733 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:21,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:21,501 INFO L93 Difference]: Finished difference Result 2835 states and 4788 transitions. [2025-01-09 10:03:21,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:21,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 692 [2025-01-09 10:03:21,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:21,517 INFO L225 Difference]: With dead ends: 2835 [2025-01-09 10:03:21,517 INFO L226 Difference]: Without dead ends: 1812 [2025-01-09 10:03:21,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:21,527 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 318 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:21,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1296 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:21,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2025-01-09 10:03:21,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1808. [2025-01-09 10:03:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1516 states have (on average 1.628627968337731) internal successors, (2469), 1523 states have internal predecessors, (2469), 283 states have call successors, (283), 8 states have call predecessors, (283), 8 states have return successors, (283), 276 states have call predecessors, (283), 283 states have call successors, (283) [2025-01-09 10:03:21,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 3035 transitions. [2025-01-09 10:03:21,604 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 3035 transitions. Word has length 692 [2025-01-09 10:03:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:21,605 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 3035 transitions. [2025-01-09 10:03:21,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:21,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 3035 transitions. [2025-01-09 10:03:21,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-01-09 10:03:21,611 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:21,612 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:21,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:03:21,612 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:21,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:21,612 INFO L85 PathProgramCache]: Analyzing trace with hash 795201536, now seen corresponding path program 1 times [2025-01-09 10:03:21,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:21,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893183326] [2025-01-09 10:03:21,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:21,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:21,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-01-09 10:03:21,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-01-09 10:03:21,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:21,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:22,035 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:03:22,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:22,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893183326] [2025-01-09 10:03:22,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893183326] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:22,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:22,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:22,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758106825] [2025-01-09 10:03:22,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:22,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:22,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:22,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:22,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:22,038 INFO L87 Difference]: Start difference. First operand 1808 states and 3035 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:22,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:22,130 INFO L93 Difference]: Finished difference Result 3620 states and 6072 transitions. [2025-01-09 10:03:22,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:22,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 693 [2025-01-09 10:03:22,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:22,142 INFO L225 Difference]: With dead ends: 3620 [2025-01-09 10:03:22,142 INFO L226 Difference]: Without dead ends: 1815 [2025-01-09 10:03:22,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:22,147 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 330 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:22,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1354 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:22,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2025-01-09 10:03:22,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1451. [2025-01-09 10:03:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1451 states, 1264 states have (on average 1.6447784810126582) internal successors, (2079), 1267 states have internal predecessors, (2079), 181 states have call successors, (181), 5 states have call predecessors, (181), 5 states have return successors, (181), 178 states have call predecessors, (181), 181 states have call successors, (181) [2025-01-09 10:03:22,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2441 transitions. [2025-01-09 10:03:22,212 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2441 transitions. Word has length 693 [2025-01-09 10:03:22,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:22,213 INFO L471 AbstractCegarLoop]: Abstraction has 1451 states and 2441 transitions. [2025-01-09 10:03:22,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:22,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2441 transitions. [2025-01-09 10:03:22,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-01-09 10:03:22,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:22,220 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:22,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:03:22,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:22,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:22,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1010236798, now seen corresponding path program 1 times [2025-01-09 10:03:22,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:22,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372283723] [2025-01-09 10:03:22,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:22,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:22,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-01-09 10:03:22,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-01-09 10:03:22,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:22,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:22,448 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:03:22,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:22,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372283723] [2025-01-09 10:03:22,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372283723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:22,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:22,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:22,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529822724] [2025-01-09 10:03:22,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:22,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:22,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:22,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:22,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:22,451 INFO L87 Difference]: Start difference. First operand 1451 states and 2441 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:22,531 INFO L93 Difference]: Finished difference Result 3008 states and 5064 transitions. [2025-01-09 10:03:22,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:22,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 693 [2025-01-09 10:03:22,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:22,539 INFO L225 Difference]: With dead ends: 3008 [2025-01-09 10:03:22,539 INFO L226 Difference]: Without dead ends: 1560 [2025-01-09 10:03:22,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:22,542 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 322 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:22,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1283 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:22,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2025-01-09 10:03:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1392. [2025-01-09 10:03:22,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1253 states have (on average 1.6464485235434956) internal successors, (2063), 1254 states have internal predecessors, (2063), 133 states have call successors, (133), 5 states have call predecessors, (133), 5 states have return successors, (133), 132 states have call predecessors, (133), 133 states have call successors, (133) [2025-01-09 10:03:22,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 2329 transitions. [2025-01-09 10:03:22,609 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 2329 transitions. Word has length 693 [2025-01-09 10:03:22,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:22,610 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 2329 transitions. [2025-01-09 10:03:22,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:22,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2329 transitions. [2025-01-09 10:03:22,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-01-09 10:03:22,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:22,618 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:22,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:03:22,619 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:22,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:22,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1097588864, now seen corresponding path program 1 times [2025-01-09 10:03:22,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:22,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201945191] [2025-01-09 10:03:22,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:22,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:22,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-01-09 10:03:22,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-01-09 10:03:22,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:22,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:22,846 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:03:22,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:22,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201945191] [2025-01-09 10:03:22,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201945191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:22,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:22,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:22,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076952121] [2025-01-09 10:03:22,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:22,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:22,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:22,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:22,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:22,848 INFO L87 Difference]: Start difference. First operand 1392 states and 2329 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:22,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:22,909 INFO L93 Difference]: Finished difference Result 4170 states and 6981 transitions. [2025-01-09 10:03:22,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:22,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 693 [2025-01-09 10:03:22,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:22,920 INFO L225 Difference]: With dead ends: 4170 [2025-01-09 10:03:22,920 INFO L226 Difference]: Without dead ends: 2781 [2025-01-09 10:03:22,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:22,923 INFO L435 NwaCegarLoop]: 1098 mSDtfsCounter, 602 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:22,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 1720 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:22,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2025-01-09 10:03:22,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2775. [2025-01-09 10:03:22,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2775 states, 2498 states have (on average 1.643714971977582) internal successors, (4106), 2500 states have internal predecessors, (4106), 266 states have call successors, (266), 10 states have call predecessors, (266), 10 states have return successors, (266), 264 states have call predecessors, (266), 266 states have call successors, (266) [2025-01-09 10:03:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 4638 transitions. [2025-01-09 10:03:23,003 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 4638 transitions. Word has length 693 [2025-01-09 10:03:23,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:23,003 INFO L471 AbstractCegarLoop]: Abstraction has 2775 states and 4638 transitions. [2025-01-09 10:03:23,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 4638 transitions. [2025-01-09 10:03:23,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-01-09 10:03:23,010 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:23,010 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:23,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:03:23,010 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:23,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:23,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1203233726, now seen corresponding path program 1 times [2025-01-09 10:03:23,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:23,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494959527] [2025-01-09 10:03:23,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:23,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:23,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-01-09 10:03:23,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-01-09 10:03:23,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:23,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:23,502 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:03:23,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:23,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494959527] [2025-01-09 10:03:23,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494959527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:23,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:23,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:03:23,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414921955] [2025-01-09 10:03:23,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:23,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:03:23,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:23,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:03:23,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:03:23,503 INFO L87 Difference]: Start difference. First operand 2775 states and 4638 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:24,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:24,284 INFO L93 Difference]: Finished difference Result 8433 states and 14089 transitions. [2025-01-09 10:03:24,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:03:24,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 693 [2025-01-09 10:03:24,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:24,305 INFO L225 Difference]: With dead ends: 8433 [2025-01-09 10:03:24,306 INFO L226 Difference]: Without dead ends: 5661 [2025-01-09 10:03:24,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:03:24,356 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 678 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:24,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1886 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:03:24,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5661 states. [2025-01-09 10:03:24,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5661 to 5545. [2025-01-09 10:03:24,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5545 states, 4992 states have (on average 1.6434294871794872) internal successors, (8204), 4996 states have internal predecessors, (8204), 532 states have call successors, (532), 20 states have call predecessors, (532), 20 states have return successors, (532), 528 states have call predecessors, (532), 532 states have call successors, (532) [2025-01-09 10:03:24,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5545 states to 5545 states and 9268 transitions. [2025-01-09 10:03:24,534 INFO L78 Accepts]: Start accepts. Automaton has 5545 states and 9268 transitions. Word has length 693 [2025-01-09 10:03:24,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:24,535 INFO L471 AbstractCegarLoop]: Abstraction has 5545 states and 9268 transitions. [2025-01-09 10:03:24,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:24,535 INFO L276 IsEmpty]: Start isEmpty. Operand 5545 states and 9268 transitions. [2025-01-09 10:03:24,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2025-01-09 10:03:24,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:24,541 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:24,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:03:24,541 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:24,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:24,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1940839506, now seen corresponding path program 1 times [2025-01-09 10:03:24,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:24,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996738241] [2025-01-09 10:03:24,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:24,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:24,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-01-09 10:03:24,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-01-09 10:03:24,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:24,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:24,971 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:03:24,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:24,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996738241] [2025-01-09 10:03:24,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996738241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:24,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:24,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:03:24,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372924922] [2025-01-09 10:03:24,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:24,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:03:24,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:24,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:03:24,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:03:24,973 INFO L87 Difference]: Start difference. First operand 5545 states and 9268 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:25,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:25,273 INFO L93 Difference]: Finished difference Result 15989 states and 26786 transitions. [2025-01-09 10:03:25,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:03:25,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 694 [2025-01-09 10:03:25,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:25,328 INFO L225 Difference]: With dead ends: 15989 [2025-01-09 10:03:25,328 INFO L226 Difference]: Without dead ends: 10447 [2025-01-09 10:03:25,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:03:25,346 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 392 mSDsluCounter, 1717 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 2318 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:25,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 2318 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:03:25,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10447 states. [2025-01-09 10:03:25,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10447 to 10437. [2025-01-09 10:03:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10437 states, 9716 states have (on average 1.6595306710580486) internal successors, (16124), 9728 states have internal predecessors, (16124), 692 states have call successors, (692), 28 states have call predecessors, (692), 28 states have return successors, (692), 680 states have call predecessors, (692), 692 states have call successors, (692) [2025-01-09 10:03:25,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10437 states to 10437 states and 17508 transitions. [2025-01-09 10:03:25,783 INFO L78 Accepts]: Start accepts. Automaton has 10437 states and 17508 transitions. Word has length 694 [2025-01-09 10:03:25,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:25,784 INFO L471 AbstractCegarLoop]: Abstraction has 10437 states and 17508 transitions. [2025-01-09 10:03:25,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:25,785 INFO L276 IsEmpty]: Start isEmpty. Operand 10437 states and 17508 transitions. [2025-01-09 10:03:25,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2025-01-09 10:03:25,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:25,796 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:25,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:03:25,796 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:25,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:25,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1583394224, now seen corresponding path program 1 times [2025-01-09 10:03:25,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:25,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236101642] [2025-01-09 10:03:25,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:25,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:25,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-01-09 10:03:25,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-01-09 10:03:25,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:25,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:26,462 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:03:26,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:26,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236101642] [2025-01-09 10:03:26,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236101642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:26,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:26,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:26,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419978426] [2025-01-09 10:03:26,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:26,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:26,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:26,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:26,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:26,468 INFO L87 Difference]: Start difference. First operand 10437 states and 17508 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:26,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:26,722 INFO L93 Difference]: Finished difference Result 26097 states and 43798 transitions. [2025-01-09 10:03:26,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:26,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 694 [2025-01-09 10:03:26,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:26,763 INFO L225 Difference]: With dead ends: 26097 [2025-01-09 10:03:26,763 INFO L226 Difference]: Without dead ends: 15663 [2025-01-09 10:03:26,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:26,783 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 398 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:26,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1246 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:26,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15663 states. [2025-01-09 10:03:27,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15663 to 15645. [2025-01-09 10:03:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15645 states, 14564 states have (on average 1.6583356220818457) internal successors, (24152), 14582 states have internal predecessors, (24152), 1038 states have call successors, (1038), 42 states have call predecessors, (1038), 42 states have return successors, (1038), 1020 states have call predecessors, (1038), 1038 states have call successors, (1038) [2025-01-09 10:03:27,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15645 states to 15645 states and 26228 transitions. [2025-01-09 10:03:27,179 INFO L78 Accepts]: Start accepts. Automaton has 15645 states and 26228 transitions. Word has length 694 [2025-01-09 10:03:27,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:27,180 INFO L471 AbstractCegarLoop]: Abstraction has 15645 states and 26228 transitions. [2025-01-09 10:03:27,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:27,181 INFO L276 IsEmpty]: Start isEmpty. Operand 15645 states and 26228 transitions. [2025-01-09 10:03:27,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2025-01-09 10:03:27,189 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:27,190 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:27,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:03:27,190 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:27,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:27,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1950916684, now seen corresponding path program 1 times [2025-01-09 10:03:27,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:27,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425096487] [2025-01-09 10:03:27,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:27,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:27,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-01-09 10:03:27,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-01-09 10:03:27,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:27,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:27,796 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:03:27,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:27,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425096487] [2025-01-09 10:03:27,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425096487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:27,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:27,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:03:27,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074050376] [2025-01-09 10:03:27,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:27,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:03:27,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:27,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:03:27,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:03:27,798 INFO L87 Difference]: Start difference. First operand 15645 states and 26228 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:28,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:28,639 INFO L93 Difference]: Finished difference Result 54265 states and 91023 transitions. [2025-01-09 10:03:28,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:03:28,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 694 [2025-01-09 10:03:28,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:28,734 INFO L225 Difference]: With dead ends: 54265 [2025-01-09 10:03:28,734 INFO L226 Difference]: Without dead ends: 38623 [2025-01-09 10:03:28,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:03:28,771 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 880 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:28,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 1854 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:03:28,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38623 states. [2025-01-09 10:03:29,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38623 to 31477. [2025-01-09 10:03:29,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31477 states, 29316 states have (on average 1.6577977896029472) internal successors, (48600), 29352 states have internal predecessors, (48600), 2076 states have call successors, (2076), 84 states have call predecessors, (2076), 84 states have return successors, (2076), 2040 states have call predecessors, (2076), 2076 states have call successors, (2076) [2025-01-09 10:03:29,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31477 states to 31477 states and 52752 transitions. [2025-01-09 10:03:29,762 INFO L78 Accepts]: Start accepts. Automaton has 31477 states and 52752 transitions. Word has length 694 [2025-01-09 10:03:29,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:29,763 INFO L471 AbstractCegarLoop]: Abstraction has 31477 states and 52752 transitions. [2025-01-09 10:03:29,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:29,763 INFO L276 IsEmpty]: Start isEmpty. Operand 31477 states and 52752 transitions. [2025-01-09 10:03:29,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2025-01-09 10:03:29,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:29,781 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:29,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:03:29,781 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:29,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:29,782 INFO L85 PathProgramCache]: Analyzing trace with hash 800464889, now seen corresponding path program 1 times [2025-01-09 10:03:29,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:29,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31234974] [2025-01-09 10:03:29,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:29,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:29,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 695 statements into 1 equivalence classes. [2025-01-09 10:03:29,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 695 of 695 statements. [2025-01-09 10:03:29,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:29,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:30,398 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:03:30,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:30,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31234974] [2025-01-09 10:03:30,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31234974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:30,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:30,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:03:30,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324775909] [2025-01-09 10:03:30,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:30,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:03:30,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:30,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:03:30,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:03:30,401 INFO L87 Difference]: Start difference. First operand 31477 states and 52752 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:31,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:31,356 INFO L93 Difference]: Finished difference Result 70331 states and 117907 transitions. [2025-01-09 10:03:31,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:03:31,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 695 [2025-01-09 10:03:31,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:31,480 INFO L225 Difference]: With dead ends: 70331 [2025-01-09 10:03:31,480 INFO L226 Difference]: Without dead ends: 38857 [2025-01-09 10:03:31,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:03:31,546 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 1156 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:31,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 1591 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:03:31,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38857 states. [2025-01-09 10:03:32,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38857 to 31519. [2025-01-09 10:03:32,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31519 states, 29358 states have (on average 1.6574698548947475) internal successors, (48660), 29394 states have internal predecessors, (48660), 2076 states have call successors, (2076), 84 states have call predecessors, (2076), 84 states have return successors, (2076), 2040 states have call predecessors, (2076), 2076 states have call successors, (2076) [2025-01-09 10:03:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31519 states to 31519 states and 52812 transitions. [2025-01-09 10:03:32,421 INFO L78 Accepts]: Start accepts. Automaton has 31519 states and 52812 transitions. Word has length 695 [2025-01-09 10:03:32,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:32,423 INFO L471 AbstractCegarLoop]: Abstraction has 31519 states and 52812 transitions. [2025-01-09 10:03:32,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:32,423 INFO L276 IsEmpty]: Start isEmpty. Operand 31519 states and 52812 transitions. [2025-01-09 10:03:32,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2025-01-09 10:03:32,439 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:32,439 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:32,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:03:32,440 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:32,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:32,440 INFO L85 PathProgramCache]: Analyzing trace with hash 574809002, now seen corresponding path program 1 times [2025-01-09 10:03:32,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:32,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774282116] [2025-01-09 10:03:32,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:32,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:32,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 695 statements into 1 equivalence classes. [2025-01-09 10:03:32,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 695 of 695 statements. [2025-01-09 10:03:32,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:32,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:33,333 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:03:33,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:33,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774282116] [2025-01-09 10:03:33,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774282116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:33,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:33,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:03:33,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751313418] [2025-01-09 10:03:33,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:33,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:03:33,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:33,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:03:33,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:03:33,337 INFO L87 Difference]: Start difference. First operand 31519 states and 52812 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:34,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:34,605 INFO L93 Difference]: Finished difference Result 75211 states and 125781 transitions. [2025-01-09 10:03:34,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:03:34,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 695 [2025-01-09 10:03:34,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:34,723 INFO L225 Difference]: With dead ends: 75211 [2025-01-09 10:03:34,723 INFO L226 Difference]: Without dead ends: 43695 [2025-01-09 10:03:34,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:03:34,775 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 1190 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 2546 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:34,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 2546 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 10:03:34,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43695 states. [2025-01-09 10:03:36,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43695 to 43685. [2025-01-09 10:03:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43685 states, 40822 states have (on average 1.6527362696585175) internal successors, (67468), 40882 states have internal predecessors, (67468), 2736 states have call successors, (2736), 126 states have call predecessors, (2736), 126 states have return successors, (2736), 2676 states have call predecessors, (2736), 2736 states have call successors, (2736) [2025-01-09 10:03:36,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43685 states to 43685 states and 72940 transitions. [2025-01-09 10:03:36,488 INFO L78 Accepts]: Start accepts. Automaton has 43685 states and 72940 transitions. Word has length 695 [2025-01-09 10:03:36,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:36,489 INFO L471 AbstractCegarLoop]: Abstraction has 43685 states and 72940 transitions. [2025-01-09 10:03:36,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 43685 states and 72940 transitions. [2025-01-09 10:03:36,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2025-01-09 10:03:36,508 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:36,509 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:36,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 10:03:36,509 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:36,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:36,510 INFO L85 PathProgramCache]: Analyzing trace with hash 776317384, now seen corresponding path program 1 times [2025-01-09 10:03:36,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:36,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217996007] [2025-01-09 10:03:36,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:36,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:36,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 695 statements into 1 equivalence classes. [2025-01-09 10:03:36,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 695 of 695 statements. [2025-01-09 10:03:36,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:36,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:03:37,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:37,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217996007] [2025-01-09 10:03:37,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217996007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:37,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:37,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:03:37,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532519150] [2025-01-09 10:03:37,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:37,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:03:37,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:37,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:03:37,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:03:37,415 INFO L87 Difference]: Start difference. First operand 43685 states and 72940 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:39,021 INFO L93 Difference]: Finished difference Result 131855 states and 219875 transitions. [2025-01-09 10:03:39,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:03:39,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 695 [2025-01-09 10:03:39,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:39,213 INFO L225 Difference]: With dead ends: 131855 [2025-01-09 10:03:39,214 INFO L226 Difference]: Without dead ends: 88173 [2025-01-09 10:03:39,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:03:39,290 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 776 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 1972 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:39,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 1972 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:03:39,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88173 states. [2025-01-09 10:03:40,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88173 to 79157. [2025-01-09 10:03:41,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79157 states, 75190 states have (on average 1.6571352573480516) internal successors, (124600), 75298 states have internal predecessors, (124600), 3768 states have call successors, (3768), 198 states have call predecessors, (3768), 198 states have return successors, (3768), 3660 states have call predecessors, (3768), 3768 states have call successors, (3768) [2025-01-09 10:03:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79157 states to 79157 states and 132136 transitions. [2025-01-09 10:03:41,247 INFO L78 Accepts]: Start accepts. Automaton has 79157 states and 132136 transitions. Word has length 695 [2025-01-09 10:03:41,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:41,248 INFO L471 AbstractCegarLoop]: Abstraction has 79157 states and 132136 transitions. [2025-01-09 10:03:41,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:03:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand 79157 states and 132136 transitions. [2025-01-09 10:03:41,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2025-01-09 10:03:41,282 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:41,283 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:41,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 10:03:41,283 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:41,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:41,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1514897356, now seen corresponding path program 1 times [2025-01-09 10:03:41,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:41,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637695500] [2025-01-09 10:03:41,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:41,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:41,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 695 statements into 1 equivalence classes. [2025-01-09 10:03:41,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 695 of 695 statements. [2025-01-09 10:03:41,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:41,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:46,868 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:03:46,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:46,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637695500] [2025-01-09 10:03:46,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637695500] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:46,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:46,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 10:03:46,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39950407] [2025-01-09 10:03:46,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:46,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 10:03:46,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:46,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 10:03:46,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:03:46,872 INFO L87 Difference]: Start difference. First operand 79157 states and 132136 transitions. Second operand has 10 states, 10 states have (on average 16.3) internal successors, (163), 10 states have internal predecessors, (163), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:04:09,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:09,357 INFO L93 Difference]: Finished difference Result 523991 states and 871129 transitions. [2025-01-09 10:04:09,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 10:04:09,360 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.3) internal successors, (163), 10 states have internal predecessors, (163), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 695 [2025-01-09 10:04:09,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:10,685 INFO L225 Difference]: With dead ends: 523991 [2025-01-09 10:04:10,686 INFO L226 Difference]: Without dead ends: 444837 [2025-01-09 10:04:10,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-01-09 10:04:10,881 INFO L435 NwaCegarLoop]: 1017 mSDtfsCounter, 5696 mSDsluCounter, 4551 mSDsCounter, 0 mSdLazyCounter, 3658 mSolverCounterSat, 1334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5696 SdHoareTripleChecker+Valid, 5568 SdHoareTripleChecker+Invalid, 4992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1334 IncrementalHoareTripleChecker+Valid, 3658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:10,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5696 Valid, 5568 Invalid, 4992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1334 Valid, 3658 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2025-01-09 10:04:11,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444837 states.