./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-90.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 135ac301b840ddafcbb7b86477d3c5ee7127cca75a8084665d3a360db9d72e39 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:48:46,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:48:46,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:48:46,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:48:46,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:48:46,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:48:46,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:48:46,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:48:46,290 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:48:46,290 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:48:46,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:48:46,290 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:48:46,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:48:46,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:48:46,291 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:48:46,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:48:46,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:48:46,291 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:48:46,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:48:46,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:48:46,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:48:46,291 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:48:46,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:48:46,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:48:46,293 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:48:46,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:48:46,293 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:48:46,293 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:48:46,293 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:48:46,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:48:46,293 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:48:46,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:48:46,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:48:46,294 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:48:46,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:48:46,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:48:46,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:48:46,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:48:46,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:48:46,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:48:46,295 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:48:46,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:48:46,295 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:48:46,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:48:46,296 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:48:46,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:48:46,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:48:46,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:48:46,296 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 -> 135ac301b840ddafcbb7b86477d3c5ee7127cca75a8084665d3a360db9d72e39 [2025-01-09 09:48:46,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:48:46,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:48:46,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:48:46,594 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:48:46,594 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:48:46,595 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-90.i [2025-01-09 09:48:47,792 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96699e9d1/064be2531f6c42b0865040c778f33838/FLAG8274249da [2025-01-09 09:48:48,131 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:48:48,131 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-90.i [2025-01-09 09:48:48,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96699e9d1/064be2531f6c42b0865040c778f33838/FLAG8274249da [2025-01-09 09:48:48,169 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96699e9d1/064be2531f6c42b0865040c778f33838 [2025-01-09 09:48:48,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:48:48,173 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:48:48,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:48:48,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:48:48,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:48:48,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:48:48" (1/1) ... [2025-01-09 09:48:48,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4825ead2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:48, skipping insertion in model container [2025-01-09 09:48:48,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:48:48" (1/1) ... [2025-01-09 09:48:48,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:48:48,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-90.i[916,929] [2025-01-09 09:48:48,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:48:48,445 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:48:48,457 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-90.i[916,929] [2025-01-09 09:48:48,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:48:48,541 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:48:48,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:48 WrapperNode [2025-01-09 09:48:48,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:48:48,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:48:48,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:48:48,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:48:48,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:48" (1/1) ... [2025-01-09 09:48:48,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:48" (1/1) ... [2025-01-09 09:48:48,615 INFO L138 Inliner]: procedures = 26, calls = 68, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 474 [2025-01-09 09:48:48,616 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:48:48,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:48:48,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:48:48,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:48:48,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:48" (1/1) ... [2025-01-09 09:48:48,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:48" (1/1) ... [2025-01-09 09:48:48,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:48" (1/1) ... [2025-01-09 09:48:48,651 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 09:48:48,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:48" (1/1) ... [2025-01-09 09:48:48,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:48" (1/1) ... [2025-01-09 09:48:48,671 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:48" (1/1) ... [2025-01-09 09:48:48,678 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:48" (1/1) ... [2025-01-09 09:48:48,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:48" (1/1) ... [2025-01-09 09:48:48,691 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:48" (1/1) ... [2025-01-09 09:48:48,696 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:48" (1/1) ... [2025-01-09 09:48:48,707 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:48:48,709 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:48:48,710 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:48:48,710 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:48:48,711 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:48" (1/1) ... [2025-01-09 09:48:48,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:48:48,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:48:48,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 09:48:48,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 09:48:48,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:48:48,765 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:48:48,765 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:48:48,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:48:48,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:48:48,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:48:48,857 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:48:48,858 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:48:49,602 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-01-09 09:48:49,602 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:48:49,615 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:48:49,616 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:48:49,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:48:49 BoogieIcfgContainer [2025-01-09 09:48:49,616 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:48:49,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:48:49,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:48:49,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:48:49,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:48:48" (1/3) ... [2025-01-09 09:48:49,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@561405ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:48:49, skipping insertion in model container [2025-01-09 09:48:49,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:48" (2/3) ... [2025-01-09 09:48:49,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@561405ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:48:49, skipping insertion in model container [2025-01-09 09:48:49,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:48:49" (3/3) ... [2025-01-09 09:48:49,625 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-90.i [2025-01-09 09:48:49,636 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:48:49,639 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-90.i that has 2 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:48:49,694 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:48:49,705 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;@4b354b4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:48:49,705 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:48:49,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 140 states have (on average 1.6142857142857143) internal successors, (226), 141 states have internal predecessors, (226), 55 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-01-09 09:48:49,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-01-09 09:48:49,728 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:49,729 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:49,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:49,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:49,734 INFO L85 PathProgramCache]: Analyzing trace with hash -440661689, now seen corresponding path program 1 times [2025-01-09 09:48:49,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:49,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203104298] [2025-01-09 09:48:49,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:49,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:49,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-01-09 09:48:50,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-01-09 09:48:50,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:50,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 09:48:50,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:50,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203104298] [2025-01-09 09:48:50,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203104298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:50,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:50,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:50,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209028613] [2025-01-09 09:48:50,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:50,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:50,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:50,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:50,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:50,522 INFO L87 Difference]: Start difference. First operand has 198 states, 140 states have (on average 1.6142857142857143) internal successors, (226), 141 states have internal predecessors, (226), 55 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:48:50,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:50,662 INFO L93 Difference]: Finished difference Result 516 states and 960 transitions. [2025-01-09 09:48:50,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:50,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 357 [2025-01-09 09:48:50,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:50,677 INFO L225 Difference]: With dead ends: 516 [2025-01-09 09:48:50,678 INFO L226 Difference]: Without dead ends: 321 [2025-01-09 09:48:50,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:50,686 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 220 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:50,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 712 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:50,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-01-09 09:48:50,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 318. [2025-01-09 09:48:50,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 242 states have (on average 1.6363636363636365) internal successors, (396), 243 states have internal predecessors, (396), 73 states have call successors, (73), 2 states have call predecessors, (73), 2 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2025-01-09 09:48:50,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 542 transitions. [2025-01-09 09:48:50,786 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 542 transitions. Word has length 357 [2025-01-09 09:48:50,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:50,791 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 542 transitions. [2025-01-09 09:48:50,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:48:50,792 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 542 transitions. [2025-01-09 09:48:50,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-01-09 09:48:50,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:50,802 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:50,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 09:48:50,802 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:50,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:50,803 INFO L85 PathProgramCache]: Analyzing trace with hash -456180407, now seen corresponding path program 1 times [2025-01-09 09:48:50,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:50,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803745314] [2025-01-09 09:48:50,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:50,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:50,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-01-09 09:48:50,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-01-09 09:48:50,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:50,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:51,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 09:48:51,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:51,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803745314] [2025-01-09 09:48:51,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803745314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:51,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:51,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:51,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136367179] [2025-01-09 09:48:51,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:51,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:51,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:51,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:51,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:51,137 INFO L87 Difference]: Start difference. First operand 318 states and 542 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:48:51,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:51,213 INFO L93 Difference]: Finished difference Result 845 states and 1438 transitions. [2025-01-09 09:48:51,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:51,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 357 [2025-01-09 09:48:51,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:51,221 INFO L225 Difference]: With dead ends: 845 [2025-01-09 09:48:51,221 INFO L226 Difference]: Without dead ends: 530 [2025-01-09 09:48:51,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:51,223 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 203 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:51,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 776 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:51,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-01-09 09:48:51,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 527. [2025-01-09 09:48:51,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 401 states have (on average 1.628428927680798) internal successors, (653), 404 states have internal predecessors, (653), 121 states have call successors, (121), 4 states have call predecessors, (121), 4 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) [2025-01-09 09:48:51,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 895 transitions. [2025-01-09 09:48:51,294 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 895 transitions. Word has length 357 [2025-01-09 09:48:51,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:51,296 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 895 transitions. [2025-01-09 09:48:51,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:48:51,296 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 895 transitions. [2025-01-09 09:48:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-01-09 09:48:51,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:51,303 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:51,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:48:51,304 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:51,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:51,308 INFO L85 PathProgramCache]: Analyzing trace with hash -394140793, now seen corresponding path program 1 times [2025-01-09 09:48:51,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:51,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802174130] [2025-01-09 09:48:51,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:51,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:51,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-01-09 09:48:51,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-01-09 09:48:51,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:51,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 09:48:51,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:51,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802174130] [2025-01-09 09:48:51,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802174130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:51,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:51,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:51,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608731652] [2025-01-09 09:48:51,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:51,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:51,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:51,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:51,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:51,577 INFO L87 Difference]: Start difference. First operand 527 states and 895 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:48:51,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:51,652 INFO L93 Difference]: Finished difference Result 1063 states and 1796 transitions. [2025-01-09 09:48:51,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:51,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 357 [2025-01-09 09:48:51,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:51,658 INFO L225 Difference]: With dead ends: 1063 [2025-01-09 09:48:51,658 INFO L226 Difference]: Without dead ends: 539 [2025-01-09 09:48:51,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:51,660 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 182 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:51,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 726 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:51,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-01-09 09:48:51,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 421. [2025-01-09 09:48:51,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 331 states have (on average 1.646525679758308) internal successors, (545), 332 states have internal predecessors, (545), 85 states have call successors, (85), 4 states have call predecessors, (85), 4 states have return successors, (85), 84 states have call predecessors, (85), 85 states have call successors, (85) [2025-01-09 09:48:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 715 transitions. [2025-01-09 09:48:51,722 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 715 transitions. Word has length 357 [2025-01-09 09:48:51,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:51,723 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 715 transitions. [2025-01-09 09:48:51,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:48:51,723 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 715 transitions. [2025-01-09 09:48:51,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-01-09 09:48:51,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:51,731 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:51,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:48:51,732 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:51,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:51,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1982488695, now seen corresponding path program 1 times [2025-01-09 09:48:51,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:51,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315504446] [2025-01-09 09:48:51,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:51,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:51,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-01-09 09:48:51,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-01-09 09:48:51,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:51,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 09:48:52,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:52,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315504446] [2025-01-09 09:48:52,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315504446] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:52,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:52,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:48:52,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693085641] [2025-01-09 09:48:52,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:52,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:48:52,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:52,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:48:52,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:48:52,217 INFO L87 Difference]: Start difference. First operand 421 states and 715 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:48:52,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:52,697 INFO L93 Difference]: Finished difference Result 1564 states and 2658 transitions. [2025-01-09 09:48:52,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:48:52,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 357 [2025-01-09 09:48:52,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:52,707 INFO L225 Difference]: With dead ends: 1564 [2025-01-09 09:48:52,708 INFO L226 Difference]: Without dead ends: 1146 [2025-01-09 09:48:52,709 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 09:48:52,710 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 505 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:52,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1139 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:48:52,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-01-09 09:48:52,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1139. [2025-01-09 09:48:52,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 911 states have (on average 1.6564215148188803) internal successors, (1509), 916 states have internal predecessors, (1509), 215 states have call successors, (215), 12 states have call predecessors, (215), 12 states have return successors, (215), 210 states have call predecessors, (215), 215 states have call successors, (215) [2025-01-09 09:48:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1939 transitions. [2025-01-09 09:48:52,857 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1939 transitions. Word has length 357 [2025-01-09 09:48:52,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:52,859 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1939 transitions. [2025-01-09 09:48:52,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:48:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1939 transitions. [2025-01-09 09:48:52,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-01-09 09:48:52,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:52,870 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:52,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:48:52,871 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:52,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:52,871 INFO L85 PathProgramCache]: Analyzing trace with hash -54215993, now seen corresponding path program 1 times [2025-01-09 09:48:52,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:52,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28060990] [2025-01-09 09:48:52,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:52,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:52,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-01-09 09:48:52,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-01-09 09:48:52,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:52,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:53,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 09:48:53,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:53,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28060990] [2025-01-09 09:48:53,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28060990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:53,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:53,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:48:53,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296476518] [2025-01-09 09:48:53,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:53,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:48:53,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:53,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:48:53,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:48:53,292 INFO L87 Difference]: Start difference. First operand 1139 states and 1939 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:48:54,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:54,034 INFO L93 Difference]: Finished difference Result 3837 states and 6529 transitions. [2025-01-09 09:48:54,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:48:54,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 357 [2025-01-09 09:48:54,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:54,053 INFO L225 Difference]: With dead ends: 3837 [2025-01-09 09:48:54,053 INFO L226 Difference]: Without dead ends: 2701 [2025-01-09 09:48:54,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:48:54,058 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 593 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:54,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 1076 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:48:54,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2025-01-09 09:48:54,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2683. [2025-01-09 09:48:54,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2683 states, 2138 states have (on average 1.64733395696913) internal successors, (3522), 2150 states have internal predecessors, (3522), 515 states have call successors, (515), 29 states have call predecessors, (515), 29 states have return successors, (515), 503 states have call predecessors, (515), 515 states have call successors, (515) [2025-01-09 09:48:54,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 4552 transitions. [2025-01-09 09:48:54,332 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 4552 transitions. Word has length 357 [2025-01-09 09:48:54,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:54,333 INFO L471 AbstractCegarLoop]: Abstraction has 2683 states and 4552 transitions. [2025-01-09 09:48:54,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:48:54,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 4552 transitions. [2025-01-09 09:48:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-01-09 09:48:54,341 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:54,342 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:54,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:48:54,342 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:54,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:54,344 INFO L85 PathProgramCache]: Analyzing trace with hash 532608393, now seen corresponding path program 1 times [2025-01-09 09:48:54,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:54,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255364499] [2025-01-09 09:48:54,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:54,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:54,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-01-09 09:48:54,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-01-09 09:48:54,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:54,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:54,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 09:48:54,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:54,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255364499] [2025-01-09 09:48:54,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255364499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:54,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:54,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:48:54,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357703306] [2025-01-09 09:48:54,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:54,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:48:54,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:54,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:48:54,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:48:54,806 INFO L87 Difference]: Start difference. First operand 2683 states and 4552 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:48:55,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:55,201 INFO L93 Difference]: Finished difference Result 6893 states and 11696 transitions. [2025-01-09 09:48:55,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:48:55,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 357 [2025-01-09 09:48:55,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:55,229 INFO L225 Difference]: With dead ends: 6893 [2025-01-09 09:48:55,230 INFO L226 Difference]: Without dead ends: 4213 [2025-01-09 09:48:55,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:48:55,238 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 236 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:55,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1240 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:48:55,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states. [2025-01-09 09:48:55,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 4211. [2025-01-09 09:48:55,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4211 states, 3332 states have (on average 1.6422569027611045) internal successors, (5472), 3350 states have internal predecessors, (5472), 833 states have call successors, (833), 45 states have call predecessors, (833), 45 states have return successors, (833), 815 states have call predecessors, (833), 833 states have call successors, (833) [2025-01-09 09:48:55,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4211 states to 4211 states and 7138 transitions. [2025-01-09 09:48:55,597 INFO L78 Accepts]: Start accepts. Automaton has 4211 states and 7138 transitions. Word has length 357 [2025-01-09 09:48:55,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:55,598 INFO L471 AbstractCegarLoop]: Abstraction has 4211 states and 7138 transitions. [2025-01-09 09:48:55,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:48:55,598 INFO L276 IsEmpty]: Start isEmpty. Operand 4211 states and 7138 transitions. [2025-01-09 09:48:55,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-01-09 09:48:55,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:55,608 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:55,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:48:55,609 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:55,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:55,610 INFO L85 PathProgramCache]: Analyzing trace with hash -717235463, now seen corresponding path program 1 times [2025-01-09 09:48:55,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:55,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124061862] [2025-01-09 09:48:55,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:55,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:55,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-01-09 09:48:55,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-01-09 09:48:55,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:55,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 09:48:55,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:55,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124061862] [2025-01-09 09:48:55,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124061862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:55,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:55,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:48:55,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246081413] [2025-01-09 09:48:55,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:55,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:48:55,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:55,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:48:55,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:48:55,900 INFO L87 Difference]: Start difference. First operand 4211 states and 7138 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:48:56,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:56,693 INFO L93 Difference]: Finished difference Result 8313 states and 14070 transitions. [2025-01-09 09:48:56,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:48:56,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 358 [2025-01-09 09:48:56,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:56,730 INFO L225 Difference]: With dead ends: 8313 [2025-01-09 09:48:56,731 INFO L226 Difference]: Without dead ends: 5633 [2025-01-09 09:48:56,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:48:56,739 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 606 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:56,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 1081 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:48:56,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5633 states. [2025-01-09 09:48:57,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5633 to 5573. [2025-01-09 09:48:57,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5573 states, 4404 states have (on average 1.6391916439600362) internal successors, (7219), 4430 states have internal predecessors, (7219), 1104 states have call successors, (1104), 64 states have call predecessors, (1104), 64 states have return successors, (1104), 1078 states have call predecessors, (1104), 1104 states have call successors, (1104) [2025-01-09 09:48:57,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5573 states to 5573 states and 9427 transitions. [2025-01-09 09:48:57,148 INFO L78 Accepts]: Start accepts. Automaton has 5573 states and 9427 transitions. Word has length 358 [2025-01-09 09:48:57,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:57,150 INFO L471 AbstractCegarLoop]: Abstraction has 5573 states and 9427 transitions. [2025-01-09 09:48:57,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:48:57,154 INFO L276 IsEmpty]: Start isEmpty. Operand 5573 states and 9427 transitions. [2025-01-09 09:48:57,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-01-09 09:48:57,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:57,166 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:57,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:48:57,166 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:57,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:57,167 INFO L85 PathProgramCache]: Analyzing trace with hash 2033509080, now seen corresponding path program 1 times [2025-01-09 09:48:57,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:57,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988369246] [2025-01-09 09:48:57,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:57,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:57,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-01-09 09:48:57,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-01-09 09:48:57,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:57,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:57,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 09:48:57,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:57,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988369246] [2025-01-09 09:48:57,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988369246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:57,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:57,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:48:57,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962026746] [2025-01-09 09:48:57,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:57,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:48:57,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:57,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:48:57,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:48:57,530 INFO L87 Difference]: Start difference. First operand 5573 states and 9427 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:48:59,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:59,495 INFO L93 Difference]: Finished difference Result 26308 states and 44477 transitions. [2025-01-09 09:48:59,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:48:59,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 358 [2025-01-09 09:48:59,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:59,602 INFO L225 Difference]: With dead ends: 26308 [2025-01-09 09:48:59,602 INFO L226 Difference]: Without dead ends: 20738 [2025-01-09 09:48:59,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:48:59,625 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 1443 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1443 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:59,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1443 Valid, 1544 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 09:48:59,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20738 states. [2025-01-09 09:49:00,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20738 to 10547. [2025-01-09 09:49:00,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10547 states, 8450 states have (on average 1.6460355029585798) internal successors, (13909), 8504 states have internal predecessors, (13909), 1960 states have call successors, (1960), 136 states have call predecessors, (1960), 136 states have return successors, (1960), 1906 states have call predecessors, (1960), 1960 states have call successors, (1960) [2025-01-09 09:49:00,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10547 states to 10547 states and 17829 transitions. [2025-01-09 09:49:00,509 INFO L78 Accepts]: Start accepts. Automaton has 10547 states and 17829 transitions. Word has length 358 [2025-01-09 09:49:00,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:00,510 INFO L471 AbstractCegarLoop]: Abstraction has 10547 states and 17829 transitions. [2025-01-09 09:49:00,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:49:00,511 INFO L276 IsEmpty]: Start isEmpty. Operand 10547 states and 17829 transitions. [2025-01-09 09:49:00,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-01-09 09:49:00,523 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:00,525 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:49:00,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:49:00,526 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:00,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:00,526 INFO L85 PathProgramCache]: Analyzing trace with hash -675974905, now seen corresponding path program 1 times [2025-01-09 09:49:00,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:00,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233085501] [2025-01-09 09:49:00,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:00,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:00,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-01-09 09:49:00,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-01-09 09:49:00,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:00,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:01,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 09:49:01,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:01,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233085501] [2025-01-09 09:49:01,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233085501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:01,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:01,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:49:01,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547214839] [2025-01-09 09:49:01,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:01,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:49:01,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:01,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:49:01,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:49:01,265 INFO L87 Difference]: Start difference. First operand 10547 states and 17829 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:49:02,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:02,330 INFO L93 Difference]: Finished difference Result 25831 states and 43936 transitions. [2025-01-09 09:49:02,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:49:02,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 358 [2025-01-09 09:49:02,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:02,393 INFO L225 Difference]: With dead ends: 25831 [2025-01-09 09:49:02,393 INFO L226 Difference]: Without dead ends: 15287 [2025-01-09 09:49:02,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:49:02,431 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 333 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:02,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 951 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:49:02,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15287 states. [2025-01-09 09:49:03,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15287 to 14935. [2025-01-09 09:49:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14935 states, 12779 states have (on average 1.684717114015181) internal successors, (21529), 12833 states have internal predecessors, (21529), 2015 states have call successors, (2015), 140 states have call predecessors, (2015), 140 states have return successors, (2015), 1961 states have call predecessors, (2015), 2015 states have call successors, (2015) [2025-01-09 09:49:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14935 states to 14935 states and 25559 transitions. [2025-01-09 09:49:03,248 INFO L78 Accepts]: Start accepts. Automaton has 14935 states and 25559 transitions. Word has length 358 [2025-01-09 09:49:03,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:03,249 INFO L471 AbstractCegarLoop]: Abstraction has 14935 states and 25559 transitions. [2025-01-09 09:49:03,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:49:03,249 INFO L276 IsEmpty]: Start isEmpty. Operand 14935 states and 25559 transitions. [2025-01-09 09:49:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-01-09 09:49:03,261 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:03,261 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:49:03,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:49:03,261 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:03,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:03,262 INFO L85 PathProgramCache]: Analyzing trace with hash 410919850, now seen corresponding path program 1 times [2025-01-09 09:49:03,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:03,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544384345] [2025-01-09 09:49:03,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:03,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:03,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-01-09 09:49:03,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-01-09 09:49:03,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:03,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:03,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 09:49:03,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:03,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544384345] [2025-01-09 09:49:03,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544384345] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:03,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:03,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:49:03,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139563198] [2025-01-09 09:49:03,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:03,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:49:03,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:03,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:49:03,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:49:03,635 INFO L87 Difference]: Start difference. First operand 14935 states and 25559 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:49:04,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:04,776 INFO L93 Difference]: Finished difference Result 37347 states and 63258 transitions. [2025-01-09 09:49:04,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:49:04,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 360 [2025-01-09 09:49:04,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:04,869 INFO L225 Difference]: With dead ends: 37347 [2025-01-09 09:49:04,870 INFO L226 Difference]: Without dead ends: 26103 [2025-01-09 09:49:04,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:49:04,901 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 363 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:04,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 965 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:49:04,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26103 states. [2025-01-09 09:49:06,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26103 to 25751. [2025-01-09 09:49:06,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25751 states, 21499 states have (on average 1.6558909716731012) internal successors, (35600), 21607 states have internal predecessors, (35600), 3975 states have call successors, (3975), 276 states have call predecessors, (3975), 276 states have return successors, (3975), 3867 states have call predecessors, (3975), 3975 states have call successors, (3975) [2025-01-09 09:49:06,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25751 states to 25751 states and 43550 transitions. [2025-01-09 09:49:06,714 INFO L78 Accepts]: Start accepts. Automaton has 25751 states and 43550 transitions. Word has length 360 [2025-01-09 09:49:06,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:06,716 INFO L471 AbstractCegarLoop]: Abstraction has 25751 states and 43550 transitions. [2025-01-09 09:49:06,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:49:06,716 INFO L276 IsEmpty]: Start isEmpty. Operand 25751 states and 43550 transitions. [2025-01-09 09:49:06,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-01-09 09:49:06,727 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:06,727 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:49:06,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:49:06,728 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:06,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:06,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1987492985, now seen corresponding path program 1 times [2025-01-09 09:49:06,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:06,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851627096] [2025-01-09 09:49:06,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:06,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:06,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-01-09 09:49:06,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-01-09 09:49:06,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:06,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 09:49:08,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:08,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851627096] [2025-01-09 09:49:08,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851627096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:08,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:08,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:49:08,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727834831] [2025-01-09 09:49:08,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:08,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:49:08,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:08,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:49:08,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:49:08,136 INFO L87 Difference]: Start difference. First operand 25751 states and 43550 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-01-09 09:49:10,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:10,430 INFO L93 Difference]: Finished difference Result 48017 states and 81016 transitions. [2025-01-09 09:49:10,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:49:10,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 362 [2025-01-09 09:49:10,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:10,526 INFO L225 Difference]: With dead ends: 48017 [2025-01-09 09:49:10,526 INFO L226 Difference]: Without dead ends: 25801 [2025-01-09 09:49:10,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:49:10,579 INFO L435 NwaCegarLoop]: 709 mSDtfsCounter, 892 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:10,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 1441 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 09:49:10,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25801 states. [2025-01-09 09:49:12,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25801 to 20759. [2025-01-09 09:49:12,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20759 states, 17339 states have (on average 1.6545360170713421) internal successors, (28688), 17423 states have internal predecessors, (28688), 3195 states have call successors, (3195), 224 states have call predecessors, (3195), 224 states have return successors, (3195), 3111 states have call predecessors, (3195), 3195 states have call successors, (3195) [2025-01-09 09:49:12,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20759 states to 20759 states and 35078 transitions. [2025-01-09 09:49:12,122 INFO L78 Accepts]: Start accepts. Automaton has 20759 states and 35078 transitions. Word has length 362 [2025-01-09 09:49:12,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:12,123 INFO L471 AbstractCegarLoop]: Abstraction has 20759 states and 35078 transitions. [2025-01-09 09:49:12,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-01-09 09:49:12,124 INFO L276 IsEmpty]: Start isEmpty. Operand 20759 states and 35078 transitions. [2025-01-09 09:49:12,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-01-09 09:49:12,134 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:12,134 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:49:12,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 09:49:12,135 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:12,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:12,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1062170239, now seen corresponding path program 1 times [2025-01-09 09:49:12,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:12,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953502097] [2025-01-09 09:49:12,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:12,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:12,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-01-09 09:49:12,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-01-09 09:49:12,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:12,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:12,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 09:49:12,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:12,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953502097] [2025-01-09 09:49:12,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953502097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:12,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:12,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:49:12,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424398337] [2025-01-09 09:49:12,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:12,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:49:12,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:12,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:49:12,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:49:12,473 INFO L87 Difference]: Start difference. First operand 20759 states and 35078 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:49:14,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:14,619 INFO L93 Difference]: Finished difference Result 41657 states and 70275 transitions. [2025-01-09 09:49:14,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:49:14,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 363 [2025-01-09 09:49:14,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:14,707 INFO L225 Difference]: With dead ends: 41657 [2025-01-09 09:49:14,708 INFO L226 Difference]: Without dead ends: 26833 [2025-01-09 09:49:14,731 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 09:49:14,732 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 325 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:14,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 597 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:49:14,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26833 states. [2025-01-09 09:49:16,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26833 to 26759. [2025-01-09 09:49:16,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26759 states, 22087 states have (on average 1.6463983338615475) internal successors, (36364), 22203 states have internal predecessors, (36364), 4351 states have call successors, (4351), 320 states have call predecessors, (4351), 320 states have return successors, (4351), 4235 states have call predecessors, (4351), 4351 states have call successors, (4351) [2025-01-09 09:49:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26759 states to 26759 states and 45066 transitions. [2025-01-09 09:49:16,365 INFO L78 Accepts]: Start accepts. Automaton has 26759 states and 45066 transitions. Word has length 363 [2025-01-09 09:49:16,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:16,366 INFO L471 AbstractCegarLoop]: Abstraction has 26759 states and 45066 transitions. [2025-01-09 09:49:16,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:49:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 26759 states and 45066 transitions. [2025-01-09 09:49:16,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-01-09 09:49:16,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:16,376 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:49:16,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 09:49:16,376 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:16,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:16,376 INFO L85 PathProgramCache]: Analyzing trace with hash -966415871, now seen corresponding path program 1 times [2025-01-09 09:49:16,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:16,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561013550] [2025-01-09 09:49:16,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:16,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:16,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-01-09 09:49:16,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-01-09 09:49:16,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:16,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:16,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 09:49:16,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:16,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561013550] [2025-01-09 09:49:16,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561013550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:16,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:16,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:49:16,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258515282] [2025-01-09 09:49:16,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:16,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:49:16,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:16,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:49:16,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:49:16,588 INFO L87 Difference]: Start difference. First operand 26759 states and 45066 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:49:20,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:20,128 INFO L93 Difference]: Finished difference Result 64553 states and 108629 transitions. [2025-01-09 09:49:20,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:49:20,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 363 [2025-01-09 09:49:20,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:20,277 INFO L225 Difference]: With dead ends: 64553 [2025-01-09 09:49:20,277 INFO L226 Difference]: Without dead ends: 43923 [2025-01-09 09:49:20,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:49:20,322 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 1399 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:20,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1399 Valid, 1575 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 09:49:20,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43923 states. [2025-01-09 09:49:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43923 to 41535. [2025-01-09 09:49:23,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41535 states, 34103 states have (on average 1.6409113567721314) internal successors, (55960), 34287 states have internal predecessors, (55960), 6909 states have call successors, (6909), 522 states have call predecessors, (6909), 522 states have return successors, (6909), 6725 states have call predecessors, (6909), 6909 states have call successors, (6909) [2025-01-09 09:49:23,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41535 states to 41535 states and 69778 transitions. [2025-01-09 09:49:23,814 INFO L78 Accepts]: Start accepts. Automaton has 41535 states and 69778 transitions. Word has length 363 [2025-01-09 09:49:23,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:23,815 INFO L471 AbstractCegarLoop]: Abstraction has 41535 states and 69778 transitions. [2025-01-09 09:49:23,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 09:49:23,815 INFO L276 IsEmpty]: Start isEmpty. Operand 41535 states and 69778 transitions. [2025-01-09 09:49:23,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-01-09 09:49:23,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:23,825 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:49:23,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 09:49:23,825 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:23,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:23,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1694457027, now seen corresponding path program 1 times [2025-01-09 09:49:23,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:23,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431514960] [2025-01-09 09:49:23,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:23,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:23,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-01-09 09:49:23,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-01-09 09:49:23,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:23,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 09:49:24,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:24,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431514960] [2025-01-09 09:49:24,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431514960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:24,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:24,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 09:49:24,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279728624] [2025-01-09 09:49:24,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:24,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 09:49:24,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:24,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 09:49:24,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:49:24,356 INFO L87 Difference]: Start difference. First operand 41535 states and 69778 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 2 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-01-09 09:49:30,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:30,095 INFO L93 Difference]: Finished difference Result 92303 states and 154713 transitions. [2025-01-09 09:49:30,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 09:49:30,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 2 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 363 [2025-01-09 09:49:30,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:30,276 INFO L225 Difference]: With dead ends: 92303 [2025-01-09 09:49:30,276 INFO L226 Difference]: Without dead ends: 54733 [2025-01-09 09:49:30,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:49:30,353 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 1519 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:30,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1606 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 09:49:30,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54733 states. [2025-01-09 09:49:33,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54733 to 46613. [2025-01-09 09:49:33,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46613 states, 37977 states have (on average 1.6330673828896438) internal successors, (62019), 38185 states have internal predecessors, (62019), 8011 states have call successors, (8011), 624 states have call predecessors, (8011), 624 states have return successors, (8011), 7803 states have call predecessors, (8011), 8011 states have call successors, (8011) [2025-01-09 09:49:33,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46613 states to 46613 states and 78041 transitions. [2025-01-09 09:49:33,370 INFO L78 Accepts]: Start accepts. Automaton has 46613 states and 78041 transitions. Word has length 363 [2025-01-09 09:49:33,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:33,371 INFO L471 AbstractCegarLoop]: Abstraction has 46613 states and 78041 transitions. [2025-01-09 09:49:33,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 2 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-01-09 09:49:33,371 INFO L276 IsEmpty]: Start isEmpty. Operand 46613 states and 78041 transitions. [2025-01-09 09:49:33,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-01-09 09:49:33,379 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:33,379 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:49:33,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 09:49:33,379 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:33,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:33,380 INFO L85 PathProgramCache]: Analyzing trace with hash 571924159, now seen corresponding path program 1 times [2025-01-09 09:49:33,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:33,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946528929] [2025-01-09 09:49:33,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:33,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:33,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-01-09 09:49:33,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-01-09 09:49:33,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:33,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 09:49:33,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:33,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946528929] [2025-01-09 09:49:33,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946528929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:33,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:33,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:49:33,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425535352] [2025-01-09 09:49:33,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:33,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:49:33,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:33,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:49:33,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:49:33,975 INFO L87 Difference]: Start difference. First operand 46613 states and 78041 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55)