./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-86.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-10_file-86.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 517783448a287c62461a35f1bc15cb8b62fca77248cd9526eca120bea485e50a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:37:02,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:37:02,320 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:37:02,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:37:02,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:37:02,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:37:02,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:37:02,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:37:02,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:37:02,350 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:37:02,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:37:02,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:37:02,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:37:02,351 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:37:02,351 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:37:02,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:37:02,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:37:02,352 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:37:02,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:37:02,352 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:37:02,352 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:37:02,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:37:02,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:37:02,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:37:02,353 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:37:02,353 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:37:02,353 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:37:02,353 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:37:02,353 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:37:02,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:37:02,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:37:02,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:37:02,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:37:02,354 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:37:02,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:37:02,354 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:37:02,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:37:02,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:37:02,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:37:02,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:37:02,355 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:37:02,355 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:37:02,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:37:02,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:37:02,355 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:37:02,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:37:02,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:37:02,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:37:02,355 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 -> 517783448a287c62461a35f1bc15cb8b62fca77248cd9526eca120bea485e50a [2025-01-09 09:37:02,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:37:02,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:37:02,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:37:02,569 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:37:02,569 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:37:02,570 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-10_file-86.i [2025-01-09 09:37:03,732 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c5f30144/4112055afbc142aaa75a3466a096fcb4/FLAG34d5400f0 [2025-01-09 09:37:04,023 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:37:04,025 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-86.i [2025-01-09 09:37:04,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c5f30144/4112055afbc142aaa75a3466a096fcb4/FLAG34d5400f0 [2025-01-09 09:37:04,045 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c5f30144/4112055afbc142aaa75a3466a096fcb4 [2025-01-09 09:37:04,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:37:04,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:37:04,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:37:04,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:37:04,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:37:04,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:37:04" (1/1) ... [2025-01-09 09:37:04,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a707027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:04, skipping insertion in model container [2025-01-09 09:37:04,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:37:04" (1/1) ... [2025-01-09 09:37:04,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:37:04,173 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-10_file-86.i[915,928] [2025-01-09 09:37:04,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:37:04,222 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:37:04,229 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-10_file-86.i[915,928] [2025-01-09 09:37:04,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:37:04,258 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:37:04,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:04 WrapperNode [2025-01-09 09:37:04,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:37:04,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:37:04,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:37:04,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:37:04,263 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:37:04" (1/1) ... [2025-01-09 09:37:04,268 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:37:04" (1/1) ... [2025-01-09 09:37:04,290 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2025-01-09 09:37:04,290 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:37:04,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:37:04,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:37:04,291 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:37:04,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:04" (1/1) ... [2025-01-09 09:37:04,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:04" (1/1) ... [2025-01-09 09:37:04,298 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:04" (1/1) ... [2025-01-09 09:37:04,309 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:37:04,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:04" (1/1) ... [2025-01-09 09:37:04,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:04" (1/1) ... [2025-01-09 09:37:04,315 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:04" (1/1) ... [2025-01-09 09:37:04,316 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:04" (1/1) ... [2025-01-09 09:37:04,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:04" (1/1) ... [2025-01-09 09:37:04,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:04" (1/1) ... [2025-01-09 09:37:04,322 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:04" (1/1) ... [2025-01-09 09:37:04,324 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:37:04,329 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:37:04,329 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:37:04,329 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:37:04,330 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:04" (1/1) ... [2025-01-09 09:37:04,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:37:04,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:37:04,360 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:37:04,365 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:37:04,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:37:04,384 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:37:04,384 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:37:04,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:37:04,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:37:04,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:37:04,462 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:37:04,463 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:37:04,687 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-09 09:37:04,687 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:37:04,695 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:37:04,695 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:37:04,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:37:04 BoogieIcfgContainer [2025-01-09 09:37:04,695 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:37:04,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:37:04,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:37:04,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:37:04,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:37:04" (1/3) ... [2025-01-09 09:37:04,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9595014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:37:04, skipping insertion in model container [2025-01-09 09:37:04,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:04" (2/3) ... [2025-01-09 09:37:04,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9595014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:37:04, skipping insertion in model container [2025-01-09 09:37:04,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:37:04" (3/3) ... [2025-01-09 09:37:04,703 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-86.i [2025-01-09 09:37:04,713 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:37:04,715 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-86.i that has 2 procedures, 76 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:37:04,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:37:04,768 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;@1b16410d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:37:04,769 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:37:04,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 09:37:04,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 09:37:04,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:37:04,783 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:04,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:37:04,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:37:04,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1678816520, now seen corresponding path program 1 times [2025-01-09 09:37:04,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:37:04,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625208736] [2025-01-09 09:37:04,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:37:04,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:37:04,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 09:37:04,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 09:37:04,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:04,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:37:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-01-09 09:37:05,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:37:05,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625208736] [2025-01-09 09:37:05,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625208736] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:37:05,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161774395] [2025-01-09 09:37:05,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:37:05,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:37:05,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:37:05,112 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:37:05,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 09:37:05,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 09:37:05,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 09:37:05,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:05,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:37:05,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:37:05,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:37:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-01-09 09:37:05,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:37:05,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161774395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:37:05,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:37:05,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:37:05,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671499279] [2025-01-09 09:37:05,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:37:05,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:37:05,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:37:05,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:37:05,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:37:05,286 INFO L87 Difference]: Start difference. First operand has 76 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 09:37:05,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:37:05,302 INFO L93 Difference]: Finished difference Result 146 states and 255 transitions. [2025-01-09 09:37:05,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:37:05,303 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 175 [2025-01-09 09:37:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:37:05,309 INFO L225 Difference]: With dead ends: 146 [2025-01-09 09:37:05,309 INFO L226 Difference]: Without dead ends: 73 [2025-01-09 09:37:05,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:37:05,314 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:37:05,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:37:05,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-09 09:37:05,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-01-09 09:37:05,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 09:37:05,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 111 transitions. [2025-01-09 09:37:05,343 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 111 transitions. Word has length 175 [2025-01-09 09:37:05,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:37:05,343 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 111 transitions. [2025-01-09 09:37:05,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 09:37:05,343 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 111 transitions. [2025-01-09 09:37:05,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 09:37:05,346 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:37:05,347 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:05,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 09:37:05,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 09:37:05,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:37:05,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:37:05,549 INFO L85 PathProgramCache]: Analyzing trace with hash 74776764, now seen corresponding path program 1 times [2025-01-09 09:37:05,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:37:05,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112093780] [2025-01-09 09:37:05,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:37:05,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:37:05,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 09:37:05,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 09:37:05,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:05,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:37:14,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 09:37:14,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:37:14,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112093780] [2025-01-09 09:37:14,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112093780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:37:14,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:37:14,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 09:37:14,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978765827] [2025-01-09 09:37:14,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:37:14,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 09:37:14,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:37:14,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 09:37:14,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:37:14,942 INFO L87 Difference]: Start difference. First operand 73 states and 111 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:37:21,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:37:21,757 INFO L93 Difference]: Finished difference Result 281 states and 419 transitions. [2025-01-09 09:37:21,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 09:37:21,758 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 175 [2025-01-09 09:37:21,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:37:21,761 INFO L225 Difference]: With dead ends: 281 [2025-01-09 09:37:21,761 INFO L226 Difference]: Without dead ends: 211 [2025-01-09 09:37:21,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2025-01-09 09:37:21,762 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 327 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:37:21,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 687 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 09:37:21,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-01-09 09:37:21,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 140. [2025-01-09 09:37:21,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 81 states have internal predecessors, (101), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 09:37:21,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 213 transitions. [2025-01-09 09:37:21,785 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 213 transitions. Word has length 175 [2025-01-09 09:37:21,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:37:21,786 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 213 transitions. [2025-01-09 09:37:21,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:37:21,786 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 213 transitions. [2025-01-09 09:37:21,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 09:37:21,787 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:37:21,788 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:21,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:37:21,788 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:37:21,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:37:21,789 INFO L85 PathProgramCache]: Analyzing trace with hash 775841342, now seen corresponding path program 1 times [2025-01-09 09:37:21,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:37:21,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27072618] [2025-01-09 09:37:21,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:37:21,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:37:21,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 09:37:21,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 09:37:21,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:21,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:37:21,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 09:37:21,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:37:21,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27072618] [2025-01-09 09:37:21,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27072618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:37:21,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:37:21,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:37:21,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851761593] [2025-01-09 09:37:21,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:37:21,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:37:21,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:37:21,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:37:21,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:37:21,857 INFO L87 Difference]: Start difference. First operand 140 states and 213 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:37:21,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:37:21,891 INFO L93 Difference]: Finished difference Result 279 states and 427 transitions. [2025-01-09 09:37:21,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:37:21,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 175 [2025-01-09 09:37:21,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:37:21,894 INFO L225 Difference]: With dead ends: 279 [2025-01-09 09:37:21,896 INFO L226 Difference]: Without dead ends: 209 [2025-01-09 09:37:21,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:37:21,898 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 102 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:37:21,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 221 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:37:21,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-01-09 09:37:21,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2025-01-09 09:37:21,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 119 states have (on average 1.2352941176470589) internal successors, (147), 119 states have internal predecessors, (147), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 09:37:21,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 315 transitions. [2025-01-09 09:37:21,927 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 315 transitions. Word has length 175 [2025-01-09 09:37:21,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:37:21,927 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 315 transitions. [2025-01-09 09:37:21,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:37:21,928 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 315 transitions. [2025-01-09 09:37:21,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 09:37:21,929 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:37:21,929 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:21,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:37:21,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:37:21,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:37:21,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1085894014, now seen corresponding path program 1 times [2025-01-09 09:37:21,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:37:21,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505048601] [2025-01-09 09:37:21,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:37:21,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:37:21,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 09:37:21,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 09:37:21,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:21,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:37:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 09:37:22,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:37:22,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505048601] [2025-01-09 09:37:22,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505048601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:37:22,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:37:22,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:37:22,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011784431] [2025-01-09 09:37:22,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:37:22,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:37:22,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:37:22,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:37:22,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:37:22,099 INFO L87 Difference]: Start difference. First operand 207 states and 315 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:37:22,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:37:22,305 INFO L93 Difference]: Finished difference Result 376 states and 569 transitions. [2025-01-09 09:37:22,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:37:22,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 175 [2025-01-09 09:37:22,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:37:22,309 INFO L225 Difference]: With dead ends: 376 [2025-01-09 09:37:22,309 INFO L226 Difference]: Without dead ends: 239 [2025-01-09 09:37:22,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:37:22,311 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 78 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:37:22,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 357 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:37:22,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-01-09 09:37:22,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 207. [2025-01-09 09:37:22,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 119 states have (on average 1.226890756302521) internal successors, (146), 119 states have internal predecessors, (146), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 09:37:22,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 314 transitions. [2025-01-09 09:37:22,344 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 314 transitions. Word has length 175 [2025-01-09 09:37:22,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:37:22,344 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 314 transitions. [2025-01-09 09:37:22,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:37:22,345 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 314 transitions. [2025-01-09 09:37:22,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 09:37:22,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:37:22,347 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:22,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:37:22,348 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:37:22,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:37:22,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1923385792, now seen corresponding path program 1 times [2025-01-09 09:37:22,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:37:22,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244144548] [2025-01-09 09:37:22,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:37:22,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:37:22,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 09:37:22,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 09:37:22,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:22,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:37:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 09:37:25,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:37:25,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244144548] [2025-01-09 09:37:25,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244144548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:37:25,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:37:25,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 09:37:25,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741570158] [2025-01-09 09:37:25,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:37:25,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 09:37:25,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:37:25,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 09:37:25,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:37:25,218 INFO L87 Difference]: Start difference. First operand 207 states and 314 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:37:26,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:37:26,076 INFO L93 Difference]: Finished difference Result 393 states and 583 transitions. [2025-01-09 09:37:26,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 09:37:26,076 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2025-01-09 09:37:26,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:37:26,078 INFO L225 Difference]: With dead ends: 393 [2025-01-09 09:37:26,078 INFO L226 Difference]: Without dead ends: 256 [2025-01-09 09:37:26,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2025-01-09 09:37:26,080 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 249 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:37:26,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 727 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:37:26,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-01-09 09:37:26,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 209. [2025-01-09 09:37:26,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 121 states have (on average 1.2231404958677685) internal successors, (148), 121 states have internal predecessors, (148), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 09:37:26,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 316 transitions. [2025-01-09 09:37:26,105 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 316 transitions. Word has length 176 [2025-01-09 09:37:26,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:37:26,106 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 316 transitions. [2025-01-09 09:37:26,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:37:26,106 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 316 transitions. [2025-01-09 09:37:26,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 09:37:26,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:37:26,107 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:26,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:37:26,108 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:37:26,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:37:26,108 INFO L85 PathProgramCache]: Analyzing trace with hash -2135543206, now seen corresponding path program 1 times [2025-01-09 09:37:26,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:37:26,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314059696] [2025-01-09 09:37:26,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:37:26,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:37:26,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 09:37:26,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 09:37:26,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:26,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:37:26,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 09:37:26,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:37:26,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314059696] [2025-01-09 09:37:26,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314059696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:37:26,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:37:26,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:37:26,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201217979] [2025-01-09 09:37:26,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:37:26,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:37:26,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:37:26,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:37:26,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:37:26,245 INFO L87 Difference]: Start difference. First operand 209 states and 316 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:37:26,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:37:26,270 INFO L93 Difference]: Finished difference Result 357 states and 541 transitions. [2025-01-09 09:37:26,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:37:26,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2025-01-09 09:37:26,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:37:26,274 INFO L225 Difference]: With dead ends: 357 [2025-01-09 09:37:26,274 INFO L226 Difference]: Without dead ends: 217 [2025-01-09 09:37:26,274 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:37:26,276 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 6 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:37:26,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 310 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:37:26,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-09 09:37:26,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 209. [2025-01-09 09:37:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 121 states have (on average 1.1983471074380165) internal successors, (145), 121 states have internal predecessors, (145), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 09:37:26,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 313 transitions. [2025-01-09 09:37:26,298 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 313 transitions. Word has length 176 [2025-01-09 09:37:26,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:37:26,299 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 313 transitions. [2025-01-09 09:37:26,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:37:26,300 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 313 transitions. [2025-01-09 09:37:26,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 09:37:26,301 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:37:26,301 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:26,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:37:26,301 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:37:26,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:37:26,302 INFO L85 PathProgramCache]: Analyzing trace with hash -360535844, now seen corresponding path program 1 times [2025-01-09 09:37:26,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:37:26,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775969466] [2025-01-09 09:37:26,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:37:26,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:37:26,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 09:37:26,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 09:37:26,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:26,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:37:28,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 09:37:28,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:37:28,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775969466] [2025-01-09 09:37:28,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775969466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:37:28,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:37:28,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 09:37:28,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053601672] [2025-01-09 09:37:28,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:37:28,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 09:37:28,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:37:28,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 09:37:28,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:37:28,194 INFO L87 Difference]: Start difference. First operand 209 states and 313 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:37:29,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:37:29,190 INFO L93 Difference]: Finished difference Result 263 states and 373 transitions. [2025-01-09 09:37:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 09:37:29,191 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2025-01-09 09:37:29,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:37:29,192 INFO L225 Difference]: With dead ends: 263 [2025-01-09 09:37:29,192 INFO L226 Difference]: Without dead ends: 261 [2025-01-09 09:37:29,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=270, Invalid=786, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 09:37:29,193 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 237 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:37:29,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 709 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:37:29,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-01-09 09:37:29,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 209. [2025-01-09 09:37:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 121 states have (on average 1.1983471074380165) internal successors, (145), 121 states have internal predecessors, (145), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 09:37:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 313 transitions. [2025-01-09 09:37:29,214 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 313 transitions. Word has length 176 [2025-01-09 09:37:29,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:37:29,216 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 313 transitions. [2025-01-09 09:37:29,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:37:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 313 transitions. [2025-01-09 09:37:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 09:37:29,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:37:29,219 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:29,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:37:29,219 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:37:29,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:37:29,220 INFO L85 PathProgramCache]: Analyzing trace with hash -804658567, now seen corresponding path program 1 times [2025-01-09 09:37:29,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:37:29,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895630692] [2025-01-09 09:37:29,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:37:29,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:37:29,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 09:37:29,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 09:37:29,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:29,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:37:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 09:37:36,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:37:36,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895630692] [2025-01-09 09:37:36,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895630692] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:37:36,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:37:36,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 09:37:36,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174918991] [2025-01-09 09:37:36,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:37:36,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 09:37:36,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:37:36,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 09:37:36,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:37:36,218 INFO L87 Difference]: Start difference. First operand 209 states and 313 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:37:43,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:37:43,103 INFO L93 Difference]: Finished difference Result 279 states and 392 transitions. [2025-01-09 09:37:43,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 09:37:43,104 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2025-01-09 09:37:43,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:37:43,105 INFO L225 Difference]: With dead ends: 279 [2025-01-09 09:37:43,105 INFO L226 Difference]: Without dead ends: 277 [2025-01-09 09:37:43,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=262, Invalid=668, Unknown=0, NotChecked=0, Total=930 [2025-01-09 09:37:43,106 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 271 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:37:43,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 588 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 09:37:43,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-01-09 09:37:43,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 219. [2025-01-09 09:37:43,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 131 states have (on average 1.2061068702290076) internal successors, (158), 131 states have internal predecessors, (158), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 09:37:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 326 transitions. [2025-01-09 09:37:43,124 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 326 transitions. Word has length 176 [2025-01-09 09:37:43,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:37:43,125 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 326 transitions. [2025-01-09 09:37:43,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:37:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 326 transitions. [2025-01-09 09:37:43,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 09:37:43,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:37:43,127 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:43,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:37:43,128 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:37:43,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:37:43,129 INFO L85 PathProgramCache]: Analyzing trace with hash -124600197, now seen corresponding path program 1 times [2025-01-09 09:37:43,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:37:43,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850864437] [2025-01-09 09:37:43,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:37:43,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:37:43,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 09:37:43,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 09:37:43,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:43,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:37:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 09:37:50,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:37:50,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850864437] [2025-01-09 09:37:50,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850864437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:37:50,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:37:50,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 09:37:50,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745597727] [2025-01-09 09:37:50,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:37:50,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 09:37:50,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:37:50,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 09:37:50,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:37:50,113 INFO L87 Difference]: Start difference. First operand 219 states and 326 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:37:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:37:57,769 INFO L93 Difference]: Finished difference Result 273 states and 386 transitions. [2025-01-09 09:37:57,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 09:37:57,770 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2025-01-09 09:37:57,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:37:57,773 INFO L225 Difference]: With dead ends: 273 [2025-01-09 09:37:57,773 INFO L226 Difference]: Without dead ends: 271 [2025-01-09 09:37:57,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992 [2025-01-09 09:37:57,774 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 240 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:37:57,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 662 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 09:37:57,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-01-09 09:37:57,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 219. [2025-01-09 09:37:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 131 states have (on average 1.2061068702290076) internal successors, (158), 131 states have internal predecessors, (158), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 09:37:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 326 transitions. [2025-01-09 09:37:57,792 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 326 transitions. Word has length 176 [2025-01-09 09:37:57,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:37:57,792 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 326 transitions. [2025-01-09 09:37:57,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:37:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 326 transitions. [2025-01-09 09:37:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 09:37:57,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:37:57,794 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:57,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:37:57,794 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:37:57,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:37:57,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1761792544, now seen corresponding path program 1 times [2025-01-09 09:37:57,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:37:57,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819562551] [2025-01-09 09:37:57,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:37:57,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:37:57,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 09:37:57,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 09:37:57,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:57,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:38:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 09:38:00,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:38:00,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819562551] [2025-01-09 09:38:00,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819562551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:38:00,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:38:00,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 09:38:00,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158980719] [2025-01-09 09:38:00,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:38:00,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 09:38:00,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:38:00,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 09:38:00,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:38:00,342 INFO L87 Difference]: Start difference. First operand 219 states and 326 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:38:01,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:38:01,508 INFO L93 Difference]: Finished difference Result 266 states and 377 transitions. [2025-01-09 09:38:01,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 09:38:01,509 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2025-01-09 09:38:01,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:38:01,511 INFO L225 Difference]: With dead ends: 266 [2025-01-09 09:38:01,511 INFO L226 Difference]: Without dead ends: 264 [2025-01-09 09:38:01,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=321, Invalid=939, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 09:38:01,512 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 247 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:38:01,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 635 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:38:01,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-01-09 09:38:01,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 216. [2025-01-09 09:38:01,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 128 states have (on average 1.203125) internal successors, (154), 128 states have internal predecessors, (154), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 09:38:01,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 322 transitions. [2025-01-09 09:38:01,527 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 322 transitions. Word has length 177 [2025-01-09 09:38:01,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:38:01,527 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 322 transitions. [2025-01-09 09:38:01,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:38:01,527 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 322 transitions. [2025-01-09 09:38:01,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 09:38:01,528 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:38:01,528 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:01,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:38:01,529 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:38:01,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:38:01,529 INFO L85 PathProgramCache]: Analyzing trace with hash 880737061, now seen corresponding path program 1 times [2025-01-09 09:38:01,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:38:01,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705162769] [2025-01-09 09:38:01,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:38:01,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:38:01,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 09:38:01,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 09:38:01,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:38:01,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:38:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 09:38:11,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:38:11,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705162769] [2025-01-09 09:38:11,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705162769] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:38:11,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:38:11,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 09:38:11,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748439566] [2025-01-09 09:38:11,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:38:11,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 09:38:11,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:38:11,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 09:38:11,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-01-09 09:38:11,074 INFO L87 Difference]: Start difference. First operand 216 states and 322 transitions. Second operand has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:38:19,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:38:19,524 INFO L93 Difference]: Finished difference Result 274 states and 387 transitions. [2025-01-09 09:38:19,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 09:38:19,525 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2025-01-09 09:38:19,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:38:19,526 INFO L225 Difference]: With dead ends: 274 [2025-01-09 09:38:19,526 INFO L226 Difference]: Without dead ends: 272 [2025-01-09 09:38:19,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=315, Invalid=875, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 09:38:19,527 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 207 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:38:19,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 725 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 09:38:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-01-09 09:38:19,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 221. [2025-01-09 09:38:19,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 133 states have (on average 1.2105263157894737) internal successors, (161), 133 states have internal predecessors, (161), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 09:38:19,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 329 transitions. [2025-01-09 09:38:19,539 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 329 transitions. Word has length 177 [2025-01-09 09:38:19,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:38:19,539 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 329 transitions. [2025-01-09 09:38:19,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:38:19,539 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 329 transitions. [2025-01-09 09:38:19,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 09:38:19,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:38:19,540 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:19,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 09:38:19,540 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:38:19,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:38:19,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1853227329, now seen corresponding path program 1 times [2025-01-09 09:38:19,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:38:19,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280486054] [2025-01-09 09:38:19,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:38:19,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:38:19,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 09:38:19,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 09:38:19,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:38:19,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:38:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 09:38:25,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:38:25,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280486054] [2025-01-09 09:38:25,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280486054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:38:25,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:38:25,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 09:38:25,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334618526] [2025-01-09 09:38:25,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:38:25,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 09:38:25,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:38:25,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 09:38:25,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-01-09 09:38:25,023 INFO L87 Difference]: Start difference. First operand 221 states and 329 transitions. Second operand has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 09:38:31,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:38:31,795 INFO L93 Difference]: Finished difference Result 274 states and 387 transitions. [2025-01-09 09:38:31,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 09:38:31,796 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 177 [2025-01-09 09:38:31,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:38:31,798 INFO L225 Difference]: With dead ends: 274 [2025-01-09 09:38:31,798 INFO L226 Difference]: Without dead ends: 272 [2025-01-09 09:38:31,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=298, Invalid=824, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 09:38:31,800 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 213 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:38:31,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 816 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 09:38:31,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-01-09 09:38:31,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 222. [2025-01-09 09:38:31,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 134 states have (on average 1.208955223880597) internal successors, (162), 134 states have internal predecessors, (162), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 09:38:31,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 330 transitions. [2025-01-09 09:38:31,816 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 330 transitions. Word has length 177 [2025-01-09 09:38:31,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:38:31,816 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 330 transitions. [2025-01-09 09:38:31,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 09:38:31,817 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 330 transitions. [2025-01-09 09:38:31,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 09:38:31,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:38:31,818 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:31,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 09:38:31,818 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:38:31,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:38:31,820 INFO L85 PathProgramCache]: Analyzing trace with hash 487710051, now seen corresponding path program 1 times [2025-01-09 09:38:31,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:38:31,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197637259] [2025-01-09 09:38:31,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:38:31,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:38:31,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 09:38:31,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 09:38:31,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:38:31,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat