./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c -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 39feee77bf576ea852c42114836a4ed3182237f56346991038306ebcfd74e257 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:16:03,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:16:03,110 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:16:03,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:16:03,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:16:03,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:16:03,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:16:03,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:16:03,127 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:16:03,127 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:16:03,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:16:03,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:16:03,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:16:03,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:16:03,127 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:16:03,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:16:03,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:16:03,128 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:16:03,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:16:03,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:16:03,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:16:03,128 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:16:03,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:16:03,128 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:16:03,128 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:16:03,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:16:03,129 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:16:03,129 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:16:03,129 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:16:03,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:16:03,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:16:03,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:16:03,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:16:03,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:16:03,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:16:03,129 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:16:03,129 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:16:03,130 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:16:03,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:16:03,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:16:03,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:16:03,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:16:03,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:16:03,130 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 -> 39feee77bf576ea852c42114836a4ed3182237f56346991038306ebcfd74e257 [2025-02-07 20:16:03,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:16:03,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:16:03,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:16:03,360 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:16:03,360 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:16:03,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2025-02-07 20:16:04,477 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b58d16d0/b50a341985c348bbb3c735af62d148d7/FLAG93e9dc5a8 [2025-02-07 20:16:04,789 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:16:04,790 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2025-02-07 20:16:04,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b58d16d0/b50a341985c348bbb3c735af62d148d7/FLAG93e9dc5a8 [2025-02-07 20:16:05,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b58d16d0/b50a341985c348bbb3c735af62d148d7 [2025-02-07 20:16:05,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:16:05,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:16:05,066 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:16:05,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:16:05,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:16:05,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:16:05" (1/1) ... [2025-02-07 20:16:05,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e1dcd78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:05, skipping insertion in model container [2025-02-07 20:16:05,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:16:05" (1/1) ... [2025-02-07 20:16:05,092 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:16:05,192 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[919,932] [2025-02-07 20:16:05,195 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[1134,1147] [2025-02-07 20:16:05,203 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2208,2221] [2025-02-07 20:16:05,204 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2423,2436] [2025-02-07 20:16:05,205 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2918,2931] [2025-02-07 20:16:05,207 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3133,3146] [2025-02-07 20:16:05,208 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3435,3448] [2025-02-07 20:16:05,210 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3653,3666] [2025-02-07 20:16:05,211 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3929,3942] [2025-02-07 20:16:05,213 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4147,4160] [2025-02-07 20:16:05,215 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4717,4730] [2025-02-07 20:16:05,216 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4935,4948] [2025-02-07 20:16:05,257 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[15828,15841] [2025-02-07 20:16:05,257 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16046,16059] [2025-02-07 20:16:05,259 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16441,16454] [2025-02-07 20:16:05,261 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16659,16672] [2025-02-07 20:16:05,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:16:05,273 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:16:05,283 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[919,932] [2025-02-07 20:16:05,284 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[1134,1147] [2025-02-07 20:16:05,286 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2208,2221] [2025-02-07 20:16:05,288 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2423,2436] [2025-02-07 20:16:05,289 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2918,2931] [2025-02-07 20:16:05,290 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3133,3146] [2025-02-07 20:16:05,291 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3435,3448] [2025-02-07 20:16:05,292 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3653,3666] [2025-02-07 20:16:05,293 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3929,3942] [2025-02-07 20:16:05,297 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4147,4160] [2025-02-07 20:16:05,298 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4717,4730] [2025-02-07 20:16:05,298 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4935,4948] [2025-02-07 20:16:05,314 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[15828,15841] [2025-02-07 20:16:05,315 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16046,16059] [2025-02-07 20:16:05,316 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16441,16454] [2025-02-07 20:16:05,316 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/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16659,16672] [2025-02-07 20:16:05,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:16:05,331 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:16:05,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:05 WrapperNode [2025-02-07 20:16:05,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:16:05,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:16:05,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:16:05,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:16:05,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:05" (1/1) ... [2025-02-07 20:16:05,347 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:05" (1/1) ... [2025-02-07 20:16:05,379 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 690 [2025-02-07 20:16:05,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:16:05,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:16:05,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:16:05,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:16:05,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:05" (1/1) ... [2025-02-07 20:16:05,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:05" (1/1) ... [2025-02-07 20:16:05,388 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:05" (1/1) ... [2025-02-07 20:16:05,396 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-02-07 20:16:05,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:05" (1/1) ... [2025-02-07 20:16:05,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:05" (1/1) ... [2025-02-07 20:16:05,401 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:05" (1/1) ... [2025-02-07 20:16:05,402 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:05" (1/1) ... [2025-02-07 20:16:05,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:05" (1/1) ... [2025-02-07 20:16:05,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:05" (1/1) ... [2025-02-07 20:16:05,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:16:05,417 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:16:05,417 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:16:05,417 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:16:05,417 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:05" (1/1) ... [2025-02-07 20:16:05,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:16:05,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:16:05,443 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-02-07 20:16:05,445 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-02-07 20:16:05,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:16:05,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:16:05,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:16:05,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:16:05,519 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:16:05,521 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:16:05,896 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L416: havoc main_~main____CPAchecker_TMP_2~2#1;havoc main_~__tmp_22~0#1, main_~__VERIFIER_assert__cond~21#1;havoc main_~__tmp_21~0#1, main_~__VERIFIER_assert__cond~20#1; [2025-02-07 20:16:05,897 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~main____CPAchecker_TMP_1~6#1;havoc main_~__tmp_40~0#1, main_~__VERIFIER_assert__cond~39#1;havoc main_~__tmp_39~0#1, main_~__VERIFIER_assert__cond~38#1; [2025-02-07 20:16:05,897 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L484: havoc main_~main____CPAchecker_TMP_2~3#1;havoc main_~__tmp_26~0#1, main_~__VERIFIER_assert__cond~25#1;havoc main_~__tmp_25~0#1, main_~__VERIFIER_assert__cond~24#1; [2025-02-07 20:16:05,897 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L798: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~main____CPAchecker_TMP_1~7#1;havoc main_~__tmp_44~0#1, main_~__VERIFIER_assert__cond~43#1;havoc main_~__tmp_43~0#1, main_~__VERIFIER_assert__cond~42#1; [2025-02-07 20:16:05,897 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L88: havoc main_~main____CPAchecker_TMP_2~0#1;havoc main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1;havoc main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1; [2025-02-07 20:16:05,897 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L552: havoc main_~main____CPAchecker_TMP_2~4#1;havoc main_~__tmp_30~0#1, main_~__VERIFIER_assert__cond~29#1;havoc main_~__tmp_29~0#1, main_~__VERIFIER_assert__cond~28#1; [2025-02-07 20:16:05,897 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L899: havoc main_~main____CPAchecker_TMP_2~9#1;havoc main_~__tmp_50~0#1, main_~__VERIFIER_assert__cond~49#1;havoc main_~__tmp_49~0#1, main_~__VERIFIER_assert__cond~48#1; [2025-02-07 20:16:05,897 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L41: havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1; [2025-02-07 20:16:05,897 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L322: havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1;havoc main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1; [2025-02-07 20:16:05,897 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L223: havoc main_~main____CPAchecker_TMP_7~0#1;havoc main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1;havoc main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1; [2025-02-07 20:16:05,897 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L620: havoc main_~main____CPAchecker_TMP_2~5#1;havoc main_~__tmp_34~0#1, main_~__VERIFIER_assert__cond~33#1;havoc main_~__tmp_33~0#1, main_~__VERIFIER_assert__cond~32#1; [2025-02-07 20:16:05,897 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L935: havoc main_~main____CPAchecker_TMP_1~9#1;havoc main_~__tmp_52~0#1, main_~__VERIFIER_assert__cond~51#1;havoc main_~__tmp_51~0#1, main_~__VERIFIER_assert__cond~50#1; [2025-02-07 20:16:05,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L390: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~main____CPAchecker_TMP_1~1#1;havoc main_~__tmp_20~0#1, main_~__VERIFIER_assert__cond~19#1;havoc main_~__tmp_19~0#1, main_~__VERIFIER_assert__cond~18#1; [2025-02-07 20:16:05,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L688: havoc main_~main____CPAchecker_TMP_2~6#1;havoc main_~__tmp_38~0#1, main_~__VERIFIER_assert__cond~37#1;havoc main_~__tmp_37~0#1, main_~__VERIFIER_assert__cond~36#1; [2025-02-07 20:16:05,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: havoc main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1;havoc main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1; [2025-02-07 20:16:05,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-07 20:16:05,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L458: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~main____CPAchecker_TMP_1~2#1;havoc main_~__tmp_24~0#1, main_~__VERIFIER_assert__cond~23#1;havoc main_~__tmp_23~0#1, main_~__VERIFIER_assert__cond~22#1; [2025-02-07 20:16:05,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L871: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~main____CPAchecker_TMP_1~8#1;havoc main_~__tmp_48~0#1, main_~__VERIFIER_assert__cond~47#1;havoc main_~__tmp_47~0#1, main_~__VERIFIER_assert__cond~46#1; [2025-02-07 20:16:05,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L161: havoc main_~main____CPAchecker_TMP_5~0#1;havoc main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1;havoc main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1;havoc main_~main____CPAchecker_TMP_4~0#1; [2025-02-07 20:16:05,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L62: havoc main_~main____CPAchecker_TMP_0~0#1; [2025-02-07 20:16:05,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L756: havoc main_~main____CPAchecker_TMP_2~7#1;havoc main_~__tmp_42~0#1, main_~__VERIFIER_assert__cond~41#1;havoc main_~__tmp_41~0#1, main_~__VERIFIER_assert__cond~40#1; [2025-02-07 20:16:05,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: havoc main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1;havoc main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1; [2025-02-07 20:16:05,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: havoc main_~main____CPAchecker_TMP_3~0#1; [2025-02-07 20:16:05,898 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L526: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~main____CPAchecker_TMP_1~3#1;havoc main_~__tmp_28~0#1, main_~__VERIFIER_assert__cond~27#1;havoc main_~__tmp_27~0#1, main_~__VERIFIER_assert__cond~26#1; [2025-02-07 20:16:05,899 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L262: havoc main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1;havoc main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1;havoc main_~main____CPAchecker_TMP_6~0#1; [2025-02-07 20:16:05,899 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L824: havoc main_~main____CPAchecker_TMP_2~8#1;havoc main_~__tmp_46~0#1, main_~__VERIFIER_assert__cond~45#1;havoc main_~__tmp_45~0#1, main_~__VERIFIER_assert__cond~44#1; [2025-02-07 20:16:05,899 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: #t~ret18#1 := main_#res#1;havoc main_#t~nondet4#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_#t~nondet5#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_#t~nondet6#1, main_#t~nondet7#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_7~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~main____CPAchecker_TMP_5~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~main____CPAchecker_TMP_4~0#1, main_#t~nondet8#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_6~0#1, main_~main____CPAchecker_TMP_3~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_#t~nondet9#1, main_~main____CPAchecker_TMP_2~1#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_#t~nondet10#1, main_~main____CPAchecker_TMP_2~2#1, main_~__tmp_22~0#1, main_~__VERIFIER_assert__cond~21#1, main_~__tmp_21~0#1, main_~__VERIFIER_assert__cond~20#1, main_#t~nondet11#1, main_~main____CPAchecker_TMP_2~3#1, main_~__tmp_26~0#1, main_~__VERIFIER_assert__cond~25#1, main_~__tmp_25~0#1, main_~__VERIFIER_assert__cond~24#1, main_#t~nondet12#1, main_~main____CPAchecker_TMP_2~4#1, main_~__tmp_30~0#1, main_~__VERIFIER_assert__cond~29#1, main_~__tmp_29~0#1, main_~__VERIFIER_assert__cond~28#1, main_#t~nondet13#1, main_~main____CPAchecker_TMP_2~5#1, main_~__tmp_34~0#1, main_~__VERIFIER_assert__cond~33#1, main_~__tmp_33~0#1, main_~__VERIFIER_assert__cond~32#1, main_#t~nondet14#1, main_~main____CPAchecker_TMP_2~6#1, main_~__tmp_38~0#1, main_~__VERIFIER_assert__cond~37#1, main_~__tmp_37~0#1, main_~__VERIFIER_assert__cond~36#1, main_#t~nondet15#1, main_~main____CPAchecker_TMP_2~7#1, main_~__tmp_42~0#1, main_~__VERIFIER_assert__cond~41#1, main_~__tmp_41~0#1, main_~__VERIFIER_assert__cond~40#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_2~8#1, main_~__tmp_46~0#1, main_~__VERIFIER_assert__cond~45#1, main_~__tmp_45~0#1, main_~__VERIFIER_assert__cond~44#1, main_#t~nondet17#1, main_~main____CPAchecker_TMP_2~9#1, main_~__tmp_50~0#1, main_~__VERIFIER_assert__cond~49#1, main_~__tmp_49~0#1, main_~__VERIFIER_assert__cond~48#1, main_~main____CPAchecker_TMP_1~9#1, main_~__tmp_52~0#1, main_~__VERIFIER_assert__cond~51#1, main_~__tmp_51~0#1, main_~__VERIFIER_assert__cond~50#1, main_~main____CPAchecker_TMP_0~9#1, main_~main____CPAchecker_TMP_1~8#1, main_~__tmp_48~0#1, main_~__VERIFIER_assert__cond~47#1, main_~__tmp_47~0#1, main_~__VERIFIER_assert__cond~46#1, main_~main____CPAchecker_TMP_0~8#1, main_~main____CPAchecker_TMP_1~7#1, main_~__tmp_44~0#1, main_~__VERIFIER_assert__cond~43#1, main_~__tmp_43~0#1, main_~__VERIFIER_assert__cond~42#1, main_~main____CPAchecker_TMP_0~7#1, main_~main____CPAchecker_TMP_1~6#1, main_~__tmp_40~0#1, main_~__VERIFIER_assert__cond~39#1, main_~__tmp_39~0#1, main_~__VERIFIER_assert__cond~38#1, main_~main____CPAchecker_TMP_0~6#1, main_~main____CPAchecker_TMP_1~5#1, main_~__tmp_36~0#1, main_~__VERIFIER_assert__cond~35#1, main_~__tmp_35~0#1, main_~__VERIFIER_assert__cond~34#1, main_~main____CPAchecker_TMP_0~5#1, main_~main____CPAchecker_TMP_1~4#1, main_~__tmp_32~0#1, main_~__VERIFIER_assert__cond~31#1, main_~__tmp_31~0#1, main_~__VERIFIER_assert__cond~30#1, main_~main____CPAchecker_TMP_0~4#1, main_~main____CPAchecker_TMP_1~3#1, main_~__tmp_28~0#1, main_~__VERIFIER_assert__cond~27#1, main_~__tmp_27~0#1, main_~__VERIFIER_assert__cond~26#1, main_~main____CPAchecker_TMP_0~3#1, main_~main____CPAchecker_TMP_1~2#1, main_~__tmp_24~0#1, main_~__VERIFIER_assert__cond~23#1, main_~__tmp_23~0#1, main_~__VERIFIER_assert__cond~22#1, main_~main____CPAchecker_TMP_0~2#1, main_~main____CPAchecker_TMP_1~1#1, main_~__tmp_20~0#1, main_~__VERIFIER_assert__cond~19#1, main_~__tmp_19~0#1, main_~__VERIFIER_assert__cond~18#1, main_~main____CPAchecker_TMP_0~1#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__tagbuf_len~0#1, main_~main__t~0#1;assume { :end_inline_main } true; [2025-02-07 20:16:05,899 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L594: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~main____CPAchecker_TMP_1~4#1;havoc main_~__tmp_32~0#1, main_~__VERIFIER_assert__cond~31#1;havoc main_~__tmp_31~0#1, main_~__VERIFIER_assert__cond~30#1; [2025-02-07 20:16:05,899 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L348: havoc main_~main____CPAchecker_TMP_2~1#1;havoc main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1;havoc main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1; [2025-02-07 20:16:05,899 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L662: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~main____CPAchecker_TMP_1~5#1;havoc main_~__tmp_36~0#1, main_~__VERIFIER_assert__cond~35#1;havoc main_~__tmp_35~0#1, main_~__VERIFIER_assert__cond~34#1; [2025-02-07 20:16:05,925 INFO L? ?]: Removed 290 outVars from TransFormulas that were not future-live. [2025-02-07 20:16:05,925 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:16:05,932 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:16:05,932 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:16:05,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:16:05 BoogieIcfgContainer [2025-02-07 20:16:05,932 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:16:05,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:16:05,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:16:05,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:16:05,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:16:05" (1/3) ... [2025-02-07 20:16:05,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8f2ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:16:05, skipping insertion in model container [2025-02-07 20:16:05,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:05" (2/3) ... [2025-02-07 20:16:05,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8f2ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:16:05, skipping insertion in model container [2025-02-07 20:16:05,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:16:05" (3/3) ... [2025-02-07 20:16:05,938 INFO L128 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2025-02-07 20:16:05,947 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:16:05,949 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG apache-get-tag.i.p+lhb-reducer.c that has 1 procedures, 119 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-02-07 20:16:05,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:16:06,006 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;@1842b9cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:16:06,007 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-07 20:16:06,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 95 states have (on average 1.9894736842105263) internal successors, (189), 117 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:06,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-07 20:16:06,013 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:06,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-07 20:16:06,014 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:06,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:06,018 INFO L85 PathProgramCache]: Analyzing trace with hash 423225768, now seen corresponding path program 1 times [2025-02-07 20:16:06,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:06,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593655935] [2025-02-07 20:16:06,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:06,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:06,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-07 20:16:06,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-07 20:16:06,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:06,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:06,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:06,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:06,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593655935] [2025-02-07 20:16:06,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593655935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:06,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:06,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:16:06,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750561169] [2025-02-07 20:16:06,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:06,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:16:06,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:06,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:16:06,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:16:06,202 INFO L87 Difference]: Start difference. First operand has 118 states, 95 states have (on average 1.9894736842105263) internal successors, (189), 117 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:06,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:06,410 INFO L93 Difference]: Finished difference Result 120 states and 189 transitions. [2025-02-07 20:16:06,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:16:06,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-07 20:16:06,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:06,416 INFO L225 Difference]: With dead ends: 120 [2025-02-07 20:16:06,416 INFO L226 Difference]: Without dead ends: 93 [2025-02-07 20:16:06,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:16:06,419 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 121 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:06,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 166 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:16:06,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-07 20:16:06,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-07 20:16:06,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 92 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 92 transitions. [2025-02-07 20:16:06,438 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 92 transitions. Word has length 5 [2025-02-07 20:16:06,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:06,438 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 92 transitions. [2025-02-07 20:16:06,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:06,438 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 92 transitions. [2025-02-07 20:16:06,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-07 20:16:06,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:06,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-07 20:16:06,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:16:06,438 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:06,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:06,439 INFO L85 PathProgramCache]: Analyzing trace with hash 235096184, now seen corresponding path program 1 times [2025-02-07 20:16:06,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:06,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210298239] [2025-02-07 20:16:06,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:06,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:06,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 20:16:06,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 20:16:06,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:06,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:06,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:06,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210298239] [2025-02-07 20:16:06,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210298239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:06,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:06,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:16:06,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875693901] [2025-02-07 20:16:06,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:06,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:16:06,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:06,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:16:06,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:16:06,496 INFO L87 Difference]: Start difference. First operand 93 states and 92 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:06,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:06,561 INFO L93 Difference]: Finished difference Result 93 states and 92 transitions. [2025-02-07 20:16:06,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:16:06,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-07 20:16:06,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:06,562 INFO L225 Difference]: With dead ends: 93 [2025-02-07 20:16:06,562 INFO L226 Difference]: Without dead ends: 89 [2025-02-07 20:16:06,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:16:06,562 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 9 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:06,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 183 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:06,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-07 20:16:06,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-07 20:16:06,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.1733333333333333) internal successors, (88), 88 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:06,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 88 transitions. [2025-02-07 20:16:06,566 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 88 transitions. Word has length 6 [2025-02-07 20:16:06,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:06,566 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 88 transitions. [2025-02-07 20:16:06,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:06,567 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 88 transitions. [2025-02-07 20:16:06,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 20:16:06,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:06,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:06,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:16:06,567 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:06,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:06,568 INFO L85 PathProgramCache]: Analyzing trace with hash 170248709, now seen corresponding path program 1 times [2025-02-07 20:16:06,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:06,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326393034] [2025-02-07 20:16:06,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:06,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:06,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 20:16:06,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 20:16:06,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:06,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:06,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:06,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:06,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326393034] [2025-02-07 20:16:06,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326393034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:06,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:06,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:16:06,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649927968] [2025-02-07 20:16:06,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:06,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:16:06,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:06,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:16:06,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:16:06,634 INFO L87 Difference]: Start difference. First operand 89 states and 88 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:06,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:06,736 INFO L93 Difference]: Finished difference Result 89 states and 88 transitions. [2025-02-07 20:16:06,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:16:06,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-07 20:16:06,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:06,737 INFO L225 Difference]: With dead ends: 89 [2025-02-07 20:16:06,737 INFO L226 Difference]: Without dead ends: 87 [2025-02-07 20:16:06,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:06,738 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 61 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:06,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 93 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:06,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-07 20:16:06,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-07 20:16:06,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 74 states have (on average 1.162162162162162) internal successors, (86), 86 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:06,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 86 transitions. [2025-02-07 20:16:06,747 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 86 transitions. Word has length 9 [2025-02-07 20:16:06,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:06,747 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 86 transitions. [2025-02-07 20:16:06,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:06,747 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 86 transitions. [2025-02-07 20:16:06,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 20:16:06,747 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:06,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:06,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:16:06,747 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:06,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:06,748 INFO L85 PathProgramCache]: Analyzing trace with hash 982741939, now seen corresponding path program 1 times [2025-02-07 20:16:06,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:06,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237162836] [2025-02-07 20:16:06,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:06,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:06,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 20:16:06,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 20:16:06,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:06,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:06,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:06,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:06,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237162836] [2025-02-07 20:16:06,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237162836] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:06,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:06,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:16:06,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809574657] [2025-02-07 20:16:06,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:06,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:16:06,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:06,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:16:06,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:16:06,802 INFO L87 Difference]: Start difference. First operand 87 states and 86 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:06,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:06,857 INFO L93 Difference]: Finished difference Result 87 states and 86 transitions. [2025-02-07 20:16:06,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:16:06,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-07 20:16:06,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:06,858 INFO L225 Difference]: With dead ends: 87 [2025-02-07 20:16:06,858 INFO L226 Difference]: Without dead ends: 83 [2025-02-07 20:16:06,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:16:06,858 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 7 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:06,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 173 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:06,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-07 20:16:06,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-02-07 20:16:06,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 71 states have (on average 1.1549295774647887) internal successors, (82), 82 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 82 transitions. [2025-02-07 20:16:06,862 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 82 transitions. Word has length 10 [2025-02-07 20:16:06,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:06,862 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 82 transitions. [2025-02-07 20:16:06,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 82 transitions. [2025-02-07 20:16:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 20:16:06,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:06,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:06,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 20:16:06,863 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:06,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:06,863 INFO L85 PathProgramCache]: Analyzing trace with hash 471861516, now seen corresponding path program 1 times [2025-02-07 20:16:06,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:06,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261005829] [2025-02-07 20:16:06,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:06,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:06,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 20:16:06,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 20:16:06,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:06,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:06,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:06,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:06,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261005829] [2025-02-07 20:16:06,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261005829] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:06,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:06,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:16:06,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133412778] [2025-02-07 20:16:06,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:06,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:16:06,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:06,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:16:06,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:16:06,926 INFO L87 Difference]: Start difference. First operand 83 states and 82 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:07,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:07,020 INFO L93 Difference]: Finished difference Result 83 states and 82 transitions. [2025-02-07 20:16:07,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:16:07,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-07 20:16:07,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:07,021 INFO L225 Difference]: With dead ends: 83 [2025-02-07 20:16:07,021 INFO L226 Difference]: Without dead ends: 81 [2025-02-07 20:16:07,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:07,021 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 56 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:07,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 79 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:07,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-07 20:16:07,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-07 20:16:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.1428571428571428) internal successors, (80), 80 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:07,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 80 transitions. [2025-02-07 20:16:07,024 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 80 transitions. Word has length 11 [2025-02-07 20:16:07,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:07,025 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 80 transitions. [2025-02-07 20:16:07,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:07,025 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 80 transitions. [2025-02-07 20:16:07,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 20:16:07,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:07,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:07,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 20:16:07,025 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:07,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:07,026 INFO L85 PathProgramCache]: Analyzing trace with hash 471245803, now seen corresponding path program 1 times [2025-02-07 20:16:07,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:07,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286900913] [2025-02-07 20:16:07,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:07,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:07,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 20:16:07,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 20:16:07,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:07,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:07,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:07,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:07,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286900913] [2025-02-07 20:16:07,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286900913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:07,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:07,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:16:07,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236538426] [2025-02-07 20:16:07,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:07,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:16:07,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:07,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:16:07,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:16:07,106 INFO L87 Difference]: Start difference. First operand 81 states and 80 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:07,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:07,191 INFO L93 Difference]: Finished difference Result 81 states and 80 transitions. [2025-02-07 20:16:07,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:16:07,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-07 20:16:07,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:07,192 INFO L225 Difference]: With dead ends: 81 [2025-02-07 20:16:07,192 INFO L226 Difference]: Without dead ends: 79 [2025-02-07 20:16:07,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:07,193 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 54 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:07,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 73 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:07,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-07 20:16:07,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-07 20:16:07,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 78 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 78 transitions. [2025-02-07 20:16:07,196 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 78 transitions. Word has length 11 [2025-02-07 20:16:07,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:07,196 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 78 transitions. [2025-02-07 20:16:07,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:07,196 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 78 transitions. [2025-02-07 20:16:07,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 20:16:07,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:07,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:07,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 20:16:07,197 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:07,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:07,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1742804434, now seen corresponding path program 1 times [2025-02-07 20:16:07,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:07,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996472824] [2025-02-07 20:16:07,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:07,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:07,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 20:16:07,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 20:16:07,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:07,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:07,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:07,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996472824] [2025-02-07 20:16:07,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996472824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:07,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:07,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:16:07,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274829227] [2025-02-07 20:16:07,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:07,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:16:07,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:07,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:16:07,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:07,290 INFO L87 Difference]: Start difference. First operand 79 states and 78 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:07,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:07,363 INFO L93 Difference]: Finished difference Result 79 states and 78 transitions. [2025-02-07 20:16:07,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:16:07,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-07 20:16:07,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:07,363 INFO L225 Difference]: With dead ends: 79 [2025-02-07 20:16:07,363 INFO L226 Difference]: Without dead ends: 74 [2025-02-07 20:16:07,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:07,364 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 14 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:07,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 153 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:07,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-07 20:16:07,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-07 20:16:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 65 states have (on average 1.123076923076923) internal successors, (73), 73 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 73 transitions. [2025-02-07 20:16:07,367 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 73 transitions. Word has length 12 [2025-02-07 20:16:07,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:07,367 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 73 transitions. [2025-02-07 20:16:07,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:07,367 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 73 transitions. [2025-02-07 20:16:07,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 20:16:07,367 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:07,367 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:07,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 20:16:07,368 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:07,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:07,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1723718301, now seen corresponding path program 1 times [2025-02-07 20:16:07,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:07,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237394668] [2025-02-07 20:16:07,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:07,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:07,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 20:16:07,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 20:16:07,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:07,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:07,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:07,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237394668] [2025-02-07 20:16:07,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237394668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:07,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:07,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:16:07,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258149317] [2025-02-07 20:16:07,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:07,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:16:07,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:07,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:16:07,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:07,457 INFO L87 Difference]: Start difference. First operand 74 states and 73 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:07,530 INFO L93 Difference]: Finished difference Result 74 states and 73 transitions. [2025-02-07 20:16:07,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:16:07,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-07 20:16:07,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:07,530 INFO L225 Difference]: With dead ends: 74 [2025-02-07 20:16:07,530 INFO L226 Difference]: Without dead ends: 72 [2025-02-07 20:16:07,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:16:07,531 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 10 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:07,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:07,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-07 20:16:07,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-07 20:16:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.109375) internal successors, (71), 71 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 71 transitions. [2025-02-07 20:16:07,533 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 71 transitions. Word has length 12 [2025-02-07 20:16:07,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:07,533 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 71 transitions. [2025-02-07 20:16:07,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:07,533 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 71 transitions. [2025-02-07 20:16:07,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 20:16:07,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:07,533 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:07,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 20:16:07,534 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:07,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:07,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1364101435, now seen corresponding path program 1 times [2025-02-07 20:16:07,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:07,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821474543] [2025-02-07 20:16:07,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:07,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:07,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 20:16:07,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 20:16:07,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:07,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:07,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:07,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:07,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821474543] [2025-02-07 20:16:07,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821474543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:07,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:07,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:16:07,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708858625] [2025-02-07 20:16:07,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:07,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:16:07,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:07,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:16:07,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:16:07,575 INFO L87 Difference]: Start difference. First operand 72 states and 71 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:07,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:07,611 INFO L93 Difference]: Finished difference Result 72 states and 71 transitions. [2025-02-07 20:16:07,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:16:07,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-07 20:16:07,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:07,612 INFO L225 Difference]: With dead ends: 72 [2025-02-07 20:16:07,612 INFO L226 Difference]: Without dead ends: 70 [2025-02-07 20:16:07,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:16:07,613 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 46 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:07,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 89 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:16:07,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-07 20:16:07,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-02-07 20:16:07,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.0952380952380953) internal successors, (69), 69 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:07,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 69 transitions. [2025-02-07 20:16:07,615 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 69 transitions. Word has length 14 [2025-02-07 20:16:07,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:07,615 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 69 transitions. [2025-02-07 20:16:07,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:07,615 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 69 transitions. [2025-02-07 20:16:07,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 20:16:07,615 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:07,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:07,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 20:16:07,616 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:07,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:07,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1364084556, now seen corresponding path program 1 times [2025-02-07 20:16:07,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:07,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888704985] [2025-02-07 20:16:07,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:07,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:07,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 20:16:07,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 20:16:07,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:07,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:07,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:07,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:07,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888704985] [2025-02-07 20:16:07,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888704985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:07,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:07,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:16:07,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298336771] [2025-02-07 20:16:07,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:07,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:16:07,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:07,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:16:07,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:07,712 INFO L87 Difference]: Start difference. First operand 70 states and 69 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:07,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:07,822 INFO L93 Difference]: Finished difference Result 70 states and 69 transitions. [2025-02-07 20:16:07,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:16:07,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-07 20:16:07,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:07,823 INFO L225 Difference]: With dead ends: 70 [2025-02-07 20:16:07,823 INFO L226 Difference]: Without dead ends: 68 [2025-02-07 20:16:07,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:16:07,823 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 44 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:07,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 47 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:07,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-07 20:16:07,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-02-07 20:16:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 67 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 67 transitions. [2025-02-07 20:16:07,825 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 67 transitions. Word has length 14 [2025-02-07 20:16:07,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:07,825 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 67 transitions. [2025-02-07 20:16:07,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:07,825 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 67 transitions. [2025-02-07 20:16:07,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 20:16:07,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:07,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:07,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 20:16:07,830 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:07,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:07,830 INFO L85 PathProgramCache]: Analyzing trace with hash 662527757, now seen corresponding path program 1 times [2025-02-07 20:16:07,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:07,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186922166] [2025-02-07 20:16:07,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:07,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:07,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:16:07,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:16:07,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:07,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:07,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:07,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:07,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186922166] [2025-02-07 20:16:07,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186922166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:07,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:07,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:16:07,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62256151] [2025-02-07 20:16:07,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:07,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:16:07,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:07,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:16:07,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:16:07,889 INFO L87 Difference]: Start difference. First operand 68 states and 67 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:07,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:07,937 INFO L93 Difference]: Finished difference Result 68 states and 67 transitions. [2025-02-07 20:16:07,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:16:07,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-07 20:16:07,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:07,938 INFO L225 Difference]: With dead ends: 68 [2025-02-07 20:16:07,938 INFO L226 Difference]: Without dead ends: 64 [2025-02-07 20:16:07,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:16:07,939 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 5 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:07,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 124 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:16:07,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-07 20:16:07,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-07 20:16:07,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 63 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:07,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 63 transitions. [2025-02-07 20:16:07,940 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 63 transitions. Word has length 15 [2025-02-07 20:16:07,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:07,940 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 63 transitions. [2025-02-07 20:16:07,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:07,940 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 63 transitions. [2025-02-07 20:16:07,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 20:16:07,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:07,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:07,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 20:16:07,941 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:07,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:07,944 INFO L85 PathProgramCache]: Analyzing trace with hash 663051083, now seen corresponding path program 1 times [2025-02-07 20:16:07,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:07,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520353033] [2025-02-07 20:16:07,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:07,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:07,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:16:07,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:16:07,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:07,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:08,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:08,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:08,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520353033] [2025-02-07 20:16:08,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520353033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:08,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:08,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:16:08,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403575307] [2025-02-07 20:16:08,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:08,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:16:08,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:08,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:16:08,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:08,013 INFO L87 Difference]: Start difference. First operand 64 states and 63 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:08,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:08,098 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2025-02-07 20:16:08,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:16:08,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-07 20:16:08,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:08,099 INFO L225 Difference]: With dead ends: 64 [2025-02-07 20:16:08,099 INFO L226 Difference]: Without dead ends: 52 [2025-02-07 20:16:08,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:16:08,102 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 68 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:08,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 33 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:08,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-07 20:16:08,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-07 20:16:08,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.0625) internal successors, (51), 51 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:08,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 51 transitions. [2025-02-07 20:16:08,103 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 51 transitions. Word has length 15 [2025-02-07 20:16:08,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:08,104 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 51 transitions. [2025-02-07 20:16:08,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:08,104 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 51 transitions. [2025-02-07 20:16:08,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-07 20:16:08,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:08,104 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 20:16:08,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 20:16:08,104 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:08,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:08,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1741023398, now seen corresponding path program 1 times [2025-02-07 20:16:08,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:08,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942373636] [2025-02-07 20:16:08,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:08,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:08,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-07 20:16:08,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-07 20:16:08,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:08,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:08,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:08,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:08,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942373636] [2025-02-07 20:16:08,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942373636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:08,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:08,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-07 20:16:08,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768948118] [2025-02-07 20:16:08,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:08,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 20:16:08,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:08,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 20:16:08,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2025-02-07 20:16:08,293 INFO L87 Difference]: Start difference. First operand 52 states and 51 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:08,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:08,388 INFO L93 Difference]: Finished difference Result 52 states and 51 transitions. [2025-02-07 20:16:08,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 20:16:08,388 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-02-07 20:16:08,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:08,389 INFO L225 Difference]: With dead ends: 52 [2025-02-07 20:16:08,389 INFO L226 Difference]: Without dead ends: 50 [2025-02-07 20:16:08,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-02-07 20:16:08,389 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 30 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:08,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 21 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:08,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-07 20:16:08,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-07 20:16:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 49 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 49 transitions. [2025-02-07 20:16:08,391 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 49 transitions. Word has length 42 [2025-02-07 20:16:08,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:08,391 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 49 transitions. [2025-02-07 20:16:08,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:08,391 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 49 transitions. [2025-02-07 20:16:08,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-07 20:16:08,391 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:08,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 20:16:08,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 20:16:08,392 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:08,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:08,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1741040279, now seen corresponding path program 1 times [2025-02-07 20:16:08,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:08,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972745089] [2025-02-07 20:16:08,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:08,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:08,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-07 20:16:08,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-07 20:16:08,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:08,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:08,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:08,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:08,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972745089] [2025-02-07 20:16:08,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972745089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:08,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:08,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-07 20:16:08,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414855198] [2025-02-07 20:16:08,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:08,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 20:16:08,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:08,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 20:16:08,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2025-02-07 20:16:08,602 INFO L87 Difference]: Start difference. First operand 50 states and 49 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:08,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:08,712 INFO L93 Difference]: Finished difference Result 50 states and 49 transitions. [2025-02-07 20:16:08,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 20:16:08,713 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-02-07 20:16:08,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:08,713 INFO L225 Difference]: With dead ends: 50 [2025-02-07 20:16:08,713 INFO L226 Difference]: Without dead ends: 48 [2025-02-07 20:16:08,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-02-07 20:16:08,713 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:08,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 15 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:08,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-07 20:16:08,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-07 20:16:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 47 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 47 transitions. [2025-02-07 20:16:08,715 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 47 transitions. Word has length 42 [2025-02-07 20:16:08,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:08,715 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 47 transitions. [2025-02-07 20:16:08,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:08,715 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 47 transitions. [2025-02-07 20:16:08,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-07 20:16:08,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:08,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 20:16:08,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 20:16:08,716 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:08,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:08,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1862849912, now seen corresponding path program 1 times [2025-02-07 20:16:08,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:08,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169200100] [2025-02-07 20:16:08,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:08,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:08,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-07 20:16:08,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 20:16:08,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:08,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:09,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:09,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169200100] [2025-02-07 20:16:09,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169200100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:09,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:09,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 20:16:09,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102683074] [2025-02-07 20:16:09,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:09,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:16:09,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:09,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:16:09,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:16:09,128 INFO L87 Difference]: Start difference. First operand 48 states and 47 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:09,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:09,209 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2025-02-07 20:16:09,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:16:09,209 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-02-07 20:16:09,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:09,209 INFO L225 Difference]: With dead ends: 48 [2025-02-07 20:16:09,210 INFO L226 Difference]: Without dead ends: 44 [2025-02-07 20:16:09,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:16:09,210 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:09,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 13 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:09,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-07 20:16:09,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-02-07 20:16:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.0) internal successors, (43), 43 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 43 transitions. [2025-02-07 20:16:09,212 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 43 transitions. Word has length 43 [2025-02-07 20:16:09,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:09,212 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 43 transitions. [2025-02-07 20:16:09,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:09,212 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2025-02-07 20:16:09,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-07 20:16:09,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:09,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 20:16:09,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 20:16:09,213 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:09,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:09,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1862326584, now seen corresponding path program 1 times [2025-02-07 20:16:09,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:09,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942029932] [2025-02-07 20:16:09,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:09,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:09,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-07 20:16:09,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 20:16:09,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:09,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:09,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:09,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942029932] [2025-02-07 20:16:09,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942029932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:09,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:09,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:16:09,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307594449] [2025-02-07 20:16:09,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:09,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:16:09,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:09,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:16:09,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:09,349 INFO L87 Difference]: Start difference. First operand 44 states and 43 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:09,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:09,416 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2025-02-07 20:16:09,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:16:09,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-02-07 20:16:09,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:09,416 INFO L225 Difference]: With dead ends: 44 [2025-02-07 20:16:09,416 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 20:16:09,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:16:09,417 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 62 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:09,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 3 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:09,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 20:16:09,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 20:16:09,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:09,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 20:16:09,418 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2025-02-07 20:16:09,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:09,418 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 20:16:09,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:09,418 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 20:16:09,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 20:16:09,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2025-02-07 20:16:09,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2025-02-07 20:16:09,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2025-02-07 20:16:09,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2025-02-07 20:16:09,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2025-02-07 20:16:09,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2025-02-07 20:16:09,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2025-02-07 20:16:09,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2025-02-07 20:16:09,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2025-02-07 20:16:09,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2025-02-07 20:16:09,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2025-02-07 20:16:09,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2025-02-07 20:16:09,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2025-02-07 20:16:09,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2025-02-07 20:16:09,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2025-02-07 20:16:09,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2025-02-07 20:16:09,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 20:16:09,423 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:09,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 20:16:09,427 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:16:09,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:16:09 BoogieIcfgContainer [2025-02-07 20:16:09,431 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:16:09,431 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:16:09,431 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:16:09,431 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:16:09,432 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:16:05" (3/4) ... [2025-02-07 20:16:09,433 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 20:16:09,441 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-07 20:16:09,442 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 20:16:09,443 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-07 20:16:09,443 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 20:16:09,510 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 20:16:09,511 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 20:16:09,511 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:16:09,511 INFO L158 Benchmark]: Toolchain (without parser) took 4446.52ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 123.1MB in the beginning and 302.5MB in the end (delta: -179.4MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. [2025-02-07 20:16:09,511 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:16:09,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.76ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 105.0MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 20:16:09,512 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.83ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 101.7MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:16:09,512 INFO L158 Benchmark]: Boogie Preprocessor took 32.24ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 99.2MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:16:09,512 INFO L158 Benchmark]: IcfgBuilder took 515.50ms. Allocated memory is still 167.8MB. Free memory was 99.2MB in the beginning and 60.7MB in the end (delta: 38.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-07 20:16:09,512 INFO L158 Benchmark]: TraceAbstraction took 3497.07ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 59.9MB in the beginning and 310.7MB in the end (delta: -250.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:16:09,512 INFO L158 Benchmark]: Witness Printer took 79.67ms. Allocated memory is still 394.3MB. Free memory was 310.7MB in the beginning and 302.5MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:16:09,513 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.76ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 105.0MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.83ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 101.7MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.24ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 99.2MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 515.50ms. Allocated memory is still 167.8MB. Free memory was 99.2MB in the beginning and 60.7MB in the end (delta: 38.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3497.07ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 59.9MB in the beginning and 310.7MB in the end (delta: -250.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 79.67ms. Allocated memory is still 394.3MB. Free memory was 310.7MB in the beginning and 302.5MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 48]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 105]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 117]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 145]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 157]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 173]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 185]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 207]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 219]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 257]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 269]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 883]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 895]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 919]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 931]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 621 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 621 mSDsluCounter, 1409 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 839 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2183 IncrementalHoareTripleChecker+Invalid, 2300 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 570 mSDtfsCounter, 2183 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=0, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 859 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-07 20:16:09,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE