./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-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+nlh-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 f5182ada4c25502e8c117aae65840c303a96073ec563a87f29fad662bee2286b --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:16:04,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:16:04,273 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:04,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:16:04,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:16:04,300 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:16:04,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:16:04,302 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:16:04,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:16:04,302 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:16:04,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:16:04,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:16:04,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:16:04,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:16:04,304 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:16:04,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:16:04,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:16:04,304 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:16:04,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:16:04,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:16:04,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:16:04,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:16:04,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:16:04,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:16:04,305 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:16:04,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:16:04,305 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:16:04,305 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:16:04,305 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:16:04,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:16:04,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:16:04,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:16:04,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:16:04,306 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:16:04,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:16:04,306 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:16:04,306 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:16:04,306 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:16:04,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:16:04,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:16:04,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:16:04,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:16:04,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:16:04,307 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 -> f5182ada4c25502e8c117aae65840c303a96073ec563a87f29fad662bee2286b [2025-02-07 20:16:04,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:16:04,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:16:04,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:16:04,528 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:16:04,528 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:16:04,529 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+nlh-reducer.c [2025-02-07 20:16:05,635 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d907910f7/eba5ed230f87415b9c7115d3fd2210e0/FLAG48762343f [2025-02-07 20:16:05,907 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:16:05,909 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2025-02-07 20:16:05,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d907910f7/eba5ed230f87415b9c7115d3fd2210e0/FLAG48762343f [2025-02-07 20:16:06,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d907910f7/eba5ed230f87415b9c7115d3fd2210e0 [2025-02-07 20:16:06,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:16:06,208 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:16:06,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:16:06,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:16:06,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:16:06,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:16:06" (1/1) ... [2025-02-07 20:16:06,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@913ff31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:06, skipping insertion in model container [2025-02-07 20:16:06,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:16:06" (1/1) ... [2025-02-07 20:16:06,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:16:06,369 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+nlh-reducer.c[901,914] [2025-02-07 20:16:06,373 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+nlh-reducer.c[1116,1129] [2025-02-07 20:16:06,377 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+nlh-reducer.c[1625,1638] [2025-02-07 20:16:06,378 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+nlh-reducer.c[1840,1853] [2025-02-07 20:16:06,380 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+nlh-reducer.c[2157,2170] [2025-02-07 20:16:06,382 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+nlh-reducer.c[2372,2385] [2025-02-07 20:16:06,384 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+nlh-reducer.c[2867,2880] [2025-02-07 20:16:06,386 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+nlh-reducer.c[3082,3095] [2025-02-07 20:16:06,387 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+nlh-reducer.c[3384,3397] [2025-02-07 20:16:06,389 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+nlh-reducer.c[3602,3615] [2025-02-07 20:16:06,390 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+nlh-reducer.c[3878,3891] [2025-02-07 20:16:06,392 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+nlh-reducer.c[4096,4109] [2025-02-07 20:16:06,393 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+nlh-reducer.c[4582,4595] [2025-02-07 20:16:06,394 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+nlh-reducer.c[4800,4813] [2025-02-07 20:16:06,551 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+nlh-reducer.c[47686,47699] [2025-02-07 20:16:06,556 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+nlh-reducer.c[47907,47920] [2025-02-07 20:16:06,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:16:06,574 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:16:06,584 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+nlh-reducer.c[901,914] [2025-02-07 20:16:06,584 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+nlh-reducer.c[1116,1129] [2025-02-07 20:16:06,585 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+nlh-reducer.c[1625,1638] [2025-02-07 20:16:06,585 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+nlh-reducer.c[1840,1853] [2025-02-07 20:16:06,585 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+nlh-reducer.c[2157,2170] [2025-02-07 20:16:06,586 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+nlh-reducer.c[2372,2385] [2025-02-07 20:16:06,586 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+nlh-reducer.c[2867,2880] [2025-02-07 20:16:06,590 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+nlh-reducer.c[3082,3095] [2025-02-07 20:16:06,591 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+nlh-reducer.c[3384,3397] [2025-02-07 20:16:06,592 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+nlh-reducer.c[3602,3615] [2025-02-07 20:16:06,595 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+nlh-reducer.c[3878,3891] [2025-02-07 20:16:06,596 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+nlh-reducer.c[4096,4109] [2025-02-07 20:16:06,596 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+nlh-reducer.c[4582,4595] [2025-02-07 20:16:06,597 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+nlh-reducer.c[4800,4813] [2025-02-07 20:16:06,683 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+nlh-reducer.c[47686,47699] [2025-02-07 20:16:06,684 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+nlh-reducer.c[47907,47920] [2025-02-07 20:16:06,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:16:06,698 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:16:06,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:06 WrapperNode [2025-02-07 20:16:06,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:16:06,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:16:06,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:16:06,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:16:06,703 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:06" (1/1) ... [2025-02-07 20:16:06,718 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:06" (1/1) ... [2025-02-07 20:16:06,775 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2017 [2025-02-07 20:16:06,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:16:06,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:16:06,775 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:16:06,775 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:16:06,783 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:06" (1/1) ... [2025-02-07 20:16:06,783 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:06" (1/1) ... [2025-02-07 20:16:06,788 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:06" (1/1) ... [2025-02-07 20:16:06,814 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:06,817 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:06" (1/1) ... [2025-02-07 20:16:06,818 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:06" (1/1) ... [2025-02-07 20:16:06,834 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:06" (1/1) ... [2025-02-07 20:16:06,836 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:06" (1/1) ... [2025-02-07 20:16:06,842 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:06" (1/1) ... [2025-02-07 20:16:06,845 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:06" (1/1) ... [2025-02-07 20:16:06,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:16:06,850 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:16:06,850 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:16:06,850 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:16:06,850 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:06" (1/1) ... [2025-02-07 20:16:06,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:16:06,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:16:06,874 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:06,876 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:06,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:16:06,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:16:06,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:16:06,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:16:07,030 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:16:07,031 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:16:07,918 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L40: 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:07,918 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:07,919 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:07,919 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2628: havoc main_~main____CPAchecker_TMP_0~60#1;havoc main_~main____CPAchecker_TMP_1~59#1;havoc main_~__tmp_134~0#1, main_~__VERIFIER_assert__cond~133#1;havoc main_~__tmp_133~0#1, main_~__VERIFIER_assert__cond~132#1;havoc main_~main____CPAchecker_TMP_0~59#1;havoc main_~main____CPAchecker_TMP_1~58#1;havoc main_~__tmp_132~0#1, main_~__VERIFIER_assert__cond~131#1;havoc main_~__tmp_131~0#1, main_~__VERIFIER_assert__cond~130#1;havoc main_~main____CPAchecker_TMP_0~58#1;havoc main_~main____CPAchecker_TMP_1~57#1;havoc main_~__tmp_130~0#1, main_~__VERIFIER_assert__cond~129#1;havoc main_~__tmp_129~0#1, main_~__VERIFIER_assert__cond~128#1;havoc main_~main____CPAchecker_TMP_0~57#1;havoc main_~main____CPAchecker_TMP_1~56#1;havoc main_~__tmp_128~0#1, main_~__VERIFIER_assert__cond~127#1;havoc main_~__tmp_127~0#1, main_~__VERIFIER_assert__cond~126#1;havoc main_~main____CPAchecker_TMP_0~56#1;havoc main_~main____CPAchecker_TMP_1~55#1;havoc main_~__tmp_126~0#1, main_~__VERIFIER_assert__cond~125#1;havoc main_~__tmp_125~0#1, main_~__VERIFIER_assert__cond~124#1;havoc main_~main____CPAchecker_TMP_0~55#1;havoc main_~main____CPAchecker_TMP_1~54#1;havoc main_~__tmp_124~0#1, main_~__VERIFIER_assert__cond~123#1;havoc main_~__tmp_123~0#1, main_~__VERIFIER_assert__cond~122#1;havoc main_~main____CPAchecker_TMP_0~54#1;havoc main_~main____CPAchecker_TMP_1~53#1;havoc main_~__tmp_122~0#1, main_~__VERIFIER_assert__cond~121#1;havoc main_~__tmp_121~0#1, main_~__VERIFIER_assert__cond~120#1;havoc main_~main____CPAchecker_TMP_0~53#1;havoc main_~main____CPAchecker_TMP_1~52#1;havoc main_~__tmp_120~0#1, main_~__VERIFIER_assert__cond~119#1;havoc main_~__tmp_119~0#1, main_~__VERIFIER_assert__cond~118#1;havoc main_~main____CPAchecker_TMP_0~52#1;havoc main_~main____CPAchecker_TMP_1~51#1;havoc main_~__tmp_118~0#1, main_~__VERIFIER_assert__cond~117#1;havoc main_~__tmp_117~0#1, main_~__VERIFIER_assert__cond~116#1;havoc main_~main____CPAchecker_TMP_0~51#1;havoc main_~main____CPAchecker_TMP_1~50#1;havoc main_~__tmp_116~0#1, main_~__VERIFIER_assert__cond~115#1;havoc main_~__tmp_115~0#1, main_~__VERIFIER_assert__cond~114#1;havoc main_~main____CPAchecker_TMP_0~50#1;havoc main_~main____CPAchecker_TMP_1~49#1;havoc main_~__tmp_114~0#1, main_~__VERIFIER_assert__cond~113#1;havoc main_~__tmp_113~0#1, main_~__VERIFIER_assert__cond~112#1;havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~main____CPAchecker_TMP_1~48#1;havoc main_~__tmp_112~0#1, main_~__VERIFIER_assert__cond~111#1;havoc main_~__tmp_111~0#1, main_~__VERIFIER_assert__cond~110#1;havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~main____CPAchecker_TMP_1~47#1;havoc main_~__tmp_110~0#1, main_~__VERIFIER_assert__cond~109#1;havoc main_~__tmp_109~0#1, main_~__VERIFIER_assert__cond~108#1;havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~main____CPAchecker_TMP_1~46#1;havoc main_~__tmp_108~0#1, main_~__VERIFIER_assert__cond~107#1;havoc main_~__tmp_107~0#1, main_~__VERIFIER_assert__cond~106#1;havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~main____CPAchecker_TMP_1~45#1;havoc main_~__tmp_106~0#1, main_~__VERIFIER_assert__cond~105#1;havoc main_~__tmp_105~0#1, main_~__VERIFIER_assert__cond~104#1;havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~main____CPAchecker_TMP_1~44#1;havoc main_~__tmp_104~0#1, main_~__VERIFIER_assert__cond~103#1;havoc main_~__tmp_103~0#1, main_~__VERIFIER_assert__cond~102#1;havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~main____CPAchecker_TMP_1~43#1;havoc main_~__tmp_102~0#1, main_~__VERIFIER_assert__cond~101#1;havoc main_~__tmp_101~0#1, main_~__VERIFIER_assert__cond~100#1;havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~main____CPAchecker_TMP_1~42#1;havoc main_~__tmp_100~0#1, main_~__VERIFIER_assert__cond~99#1;havoc main_~__tmp_99~0#1, main_~__VERIFIER_assert__cond~98#1;havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~main____CPAchecker_TMP_1~41#1;havoc main_~__tmp_98~0#1, main_~__VERIFIER_assert__cond~97#1;havoc main_~__tmp_97~0#1, main_~__VERIFIER_assert__cond~96#1;havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~main____CPAchecker_TMP_1~40#1;havoc main_~__tmp_96~0#1, main_~__VERIFIER_assert__cond~95#1;havoc main_~__tmp_95~0#1, main_~__VERIFIER_assert__cond~94#1;havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~main____CPAchecker_TMP_1~39#1;havoc main_~__tmp_94~0#1, main_~__VERIFIER_assert__cond~93#1;havoc main_~__tmp_93~0#1, main_~__VERIFIER_assert__cond~92#1;havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~main____CPAchecker_TMP_1~38#1;havoc main_~__tmp_92~0#1, main_~__VERIFIER_assert__cond~91#1;havoc main_~__tmp_91~0#1, main_~__VERIFIER_assert__cond~90#1;havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~main____CPAchecker_TMP_1~37#1;havoc main_~__tmp_90~0#1, main_~__VERIFIER_assert__cond~89#1;havoc main_~__tmp_89~0#1, main_~__VERIFIER_assert__cond~88#1;havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~main____CPAchecker_TMP_1~36#1;havoc main_~__tmp_88~0#1, main_~__VERIFIER_assert__cond~87#1;havoc main_~__tmp_87~0#1, main_~__VERIFIER_assert__cond~86#1;havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~main____CPAchecker_TMP_1~35#1;havoc main_~__tmp_86~0#1, main_~__VERIFIER_assert__cond~85#1;havoc main_~__tmp_85~0#1, main_~__VERIFIER_assert__cond~84#1;havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~main____CPAchecker_TMP_1~34#1;havoc main_~__tmp_84~0#1, main_~__VERIFIER_assert__cond~83#1;havoc main_~__tmp_83~0#1, main_~__VERIFIER_assert__cond~82#1;havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~main____CPAchecker_TMP_1~33#1;havoc main_~__tmp_82~0#1, main_~__VERIFIER_assert__cond~81#1;havoc main_~__tmp_81~0#1, main_~__VERIFIER_assert__cond~80#1;havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~main____CPAchecker_TMP_1~32#1;havoc main_~__tmp_80~0#1, main_~__VERIFIER_assert__cond~79#1;havoc main_~__tmp_79~0#1, main_~__VERIFIER_assert__cond~78#1;havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~main____CPAchecker_TMP_1~31#1;havoc main_~__tmp_78~0#1, main_~__VERIFIER_assert__cond~77#1;havoc main_~__tmp_77~0#1, main_~__VERIFIER_assert__cond~76#1;havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~main____CPAchecker_TMP_1~30#1;havoc main_~__tmp_76~0#1, main_~__VERIFIER_assert__cond~75#1;havoc main_~__tmp_75~0#1, main_~__VERIFIER_assert__cond~74#1;havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~main____CPAchecker_TMP_1~29#1;havoc main_~__tmp_74~0#1, main_~__VERIFIER_assert__cond~73#1;havoc main_~__tmp_73~0#1, main_~__VERIFIER_assert__cond~72#1;havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~main____CPAchecker_TMP_1~28#1;havoc main_~__tmp_72~0#1, main_~__VERIFIER_assert__cond~71#1;havoc main_~__tmp_71~0#1, main_~__VERIFIER_assert__cond~70#1;havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~main____CPAchecker_TMP_1~27#1;havoc main_~__tmp_70~0#1, main_~__VERIFIER_assert__cond~69#1;havoc main_~__tmp_69~0#1, main_~__VERIFIER_assert__cond~68#1;havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~main____CPAchecker_TMP_1~26#1;havoc main_~__tmp_68~0#1, main_~__VERIFIER_assert__cond~67#1;havoc main_~__tmp_67~0#1, main_~__VERIFIER_assert__cond~66#1;havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~main____CPAchecker_TMP_1~25#1;havoc main_~__tmp_66~0#1, main_~__VERIFIER_assert__cond~65#1;havoc main_~__tmp_65~0#1, main_~__VERIFIER_assert__cond~64#1;havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~main____CPAchecker_TMP_1~24#1;havoc main_~__tmp_64~0#1, main_~__VERIFIER_assert__cond~63#1;havoc main_~__tmp_63~0#1, main_~__VERIFIER_assert__cond~62#1;havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~main____CPAchecker_TMP_1~23#1;havoc main_~__tmp_62~0#1, main_~__VERIFIER_assert__cond~61#1;havoc main_~__tmp_61~0#1, main_~__VERIFIER_assert__cond~60#1;havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~main____CPAchecker_TMP_1~22#1;havoc main_~__tmp_60~0#1, main_~__VERIFIER_assert__cond~59#1;havoc main_~__tmp_59~0#1, main_~__VERIFIER_assert__cond~58#1;havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~main____CPAchecker_TMP_1~21#1;havoc main_~__tmp_58~0#1, main_~__VERIFIER_assert__cond~57#1;havoc main_~__tmp_57~0#1, main_~__VERIFIER_assert__cond~56#1;havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~main____CPAchecker_TMP_1~20#1;havoc main_~__tmp_56~0#1, main_~__VERIFIER_assert__cond~55#1;havoc main_~__tmp_55~0#1, main_~__VERIFIER_assert__cond~54#1;havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~main____CPAchecker_TMP_1~19#1;havoc main_~__tmp_54~0#1, main_~__VERIFIER_assert__cond~53#1;havoc main_~__tmp_53~0#1, main_~__VERIFIER_assert__cond~52#1;havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~main____CPAchecker_TMP_1~18#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;havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~main____CPAchecker_TMP_1~17#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;havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~main____CPAchecker_TMP_1~16#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;havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~main____CPAchecker_TMP_1~15#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;havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~main____CPAchecker_TMP_1~14#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;havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~main____CPAchecker_TMP_1~13#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;havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~main____CPAchecker_TMP_1~12#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;havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~main____CPAchecker_TMP_1~11#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;havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~main____CPAchecker_TMP_1~10#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;havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~main____CPAchecker_TMP_1~9#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;havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~main____CPAchecker_TMP_1~8#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;havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~main____CPAchecker_TMP_1~7#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;havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~main____CPAchecker_TMP_1~6#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;havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~main____CPAchecker_TMP_1~5#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;havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~main____CPAchecker_TMP_1~4#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;havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~main____CPAchecker_TMP_1~3#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;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~main____CPAchecker_TMP_1~2#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;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~main____CPAchecker_TMP_1~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;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:07,920 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:07,920 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92: 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:07,921 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61: havoc main_~main____CPAchecker_TMP_0~0#1; [2025-02-07 20:16:07,921 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-07 20:16:07,921 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L260: 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:07,921 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:07,921 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: havoc main_~main____CPAchecker_TMP_3~0#1; [2025-02-07 20:16:07,922 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: #t~ret69#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~nondet57#1, main_#t~nondet58#1, main_#t~nondet59#1, main_#t~nondet60#1, main_#t~nondet61#1, main_#t~nondet62#1, main_#t~nondet63#1, main_#t~nondet64#1, main_#t~nondet65#1, main_#t~nondet66#1, main_#t~nondet67#1, main_#t~nondet68#1, main_~main____CPAchecker_TMP_0~60#1, main_~main____CPAchecker_TMP_1~59#1, main_~__tmp_134~0#1, main_~__VERIFIER_assert__cond~133#1, main_~__tmp_133~0#1, main_~__VERIFIER_assert__cond~132#1, main_~main____CPAchecker_TMP_0~59#1, main_~main____CPAchecker_TMP_1~58#1, main_~__tmp_132~0#1, main_~__VERIFIER_assert__cond~131#1, main_~__tmp_131~0#1, main_~__VERIFIER_assert__cond~130#1, main_~main____CPAchecker_TMP_0~58#1, main_~main____CPAchecker_TMP_1~57#1, main_~__tmp_130~0#1, main_~__VERIFIER_assert__cond~129#1, main_~__tmp_129~0#1, main_~__VERIFIER_assert__cond~128#1, main_~main____CPAchecker_TMP_0~57#1, main_~main____CPAchecker_TMP_1~56#1, main_~__tmp_128~0#1, main_~__VERIFIER_assert__cond~127#1, main_~__tmp_127~0#1, main_~__VERIFIER_assert__cond~126#1, main_~main____CPAchecker_TMP_0~56#1, main_~main____CPAchecker_TMP_1~55#1, main_~__tmp_126~0#1, main_~__VERIFIER_assert__cond~125#1, main_~__tmp_125~0#1, main_~__VERIFIER_assert__cond~124#1, main_~main____CPAchecker_TMP_0~55#1, main_~main____CPAchecker_TMP_1~54#1, main_~__tmp_124~0#1, main_~__VERIFIER_assert__cond~123#1, main_~__tmp_123~0#1, main_~__VERIFIER_assert__cond~122#1, main_~main____CPAchecker_TMP_0~54#1, main_~main____CPAchecker_TMP_1~53#1, main_~__tmp_122~0#1, main_~__VERIFIER_assert__cond~121#1, main_~__tmp_121~0#1, main_~__VERIFIER_assert__cond~120#1, main_~main____CPAchecker_TMP_0~53#1, main_~main____CPAchecker_TMP_1~52#1, main_~__tmp_120~0#1, main_~__VERIFIER_assert__cond~119#1, main_~__tmp_119~0#1, main_~__VERIFIER_assert__cond~118#1, main_~main____CPAchecker_TMP_0~52#1, main_~main____CPAchecker_TMP_1~51#1, main_~__tmp_118~0#1, main_~__VERIFIER_assert__cond~117#1, main_~__tmp_117~0#1, main_~__VERIFIER_assert__cond~116#1, main_~main____CPAchecker_TMP_0~51#1, main_~main____CPAchecker_TMP_1~50#1, main_~__tmp_116~0#1, main_~__VERIFIER_assert__cond~115#1, main_~__tmp_115~0#1, main_~__VERIFIER_assert__cond~114#1, main_~main____CPAchecker_TMP_0~50#1, main_~main____CPAchecker_TMP_1~49#1, main_~__tmp_114~0#1, main_~__VERIFIER_assert__cond~113#1, main_~__tmp_113~0#1, main_~__VERIFIER_assert__cond~112#1, main_~main____CPAchecker_TMP_0~49#1, main_~main____CPAchecker_TMP_1~48#1, main_~__tmp_112~0#1, main_~__VERIFIER_assert__cond~111#1, main_~__tmp_111~0#1, main_~__VERIFIER_assert__cond~110#1, main_~main____CPAchecker_TMP_0~48#1, main_~main____CPAchecker_TMP_1~47#1, main_~__tmp_110~0#1, main_~__VERIFIER_assert__cond~109#1, main_~__tmp_109~0#1, main_~__VERIFIER_assert__cond~108#1, main_~main____CPAchecker_TMP_0~47#1, main_~main____CPAchecker_TMP_1~46#1, main_~__tmp_108~0#1, main_~__VERIFIER_assert__cond~107#1, main_~__tmp_107~0#1, main_~__VERIFIER_assert__cond~106#1, main_~main____CPAchecker_TMP_0~46#1, main_~main____CPAchecker_TMP_1~45#1, main_~__tmp_106~0#1, main_~__VERIFIER_assert__cond~105#1, main_~__tmp_105~0#1, main_~__VERIFIER_assert__cond~104#1, main_~main____CPAchecker_TMP_0~45#1, main_~main____CPAchecker_TMP_1~44#1, main_~__tmp_104~0#1, main_~__VERIFIER_assert__cond~103#1, main_~__tmp_103~0#1, main_~__VERIFIER_assert__cond~102#1, main_~main____CPAchecker_TMP_0~44#1, main_~main____CPAchecker_TMP_1~43#1, main_~__tmp_102~0#1, main_~__VERIFIER_assert__cond~101#1, main_~__tmp_101~0#1, main_~__VERIFIER_assert__cond~100#1, main_~main____CPAchecker_TMP_0~43#1, main_~main____CPAchecker_TMP_1~42#1, main_~__tmp_100~0#1, main_~__VERIFIER_assert__cond~99#1, main_~__tmp_99~0#1, main_~__VERIFIER_assert__cond~98#1, main_~main____CPAchecker_TMP_0~42#1, main_~main____CPAchecker_TMP_1~41#1, main_~__tmp_98~0#1, main_~__VERIFIER_assert__cond~97#1, main_~__tmp_97~0#1, main_~__VERIFIER_assert__cond~96#1, main_~main____CPAchecker_TMP_0~41#1, main_~main____CPAchecker_TMP_1~40#1, main_~__tmp_96~0#1, main_~__VERIFIER_assert__cond~95#1, main_~__tmp_95~0#1, main_~__VERIFIER_assert__cond~94#1, main_~main____CPAchecker_TMP_0~40#1, main_~main____CPAchecker_TMP_1~39#1, main_~__tmp_94~0#1, main_~__VERIFIER_assert__cond~93#1, main_~__tmp_93~0#1, main_~__VERIFIER_assert__cond~92#1, main_~main____CPAchecker_TMP_0~39#1, main_~main____CPAchecker_TMP_1~38#1, main_~__tmp_92~0#1, main_~__VERIFIER_assert__cond~91#1, main_~__tmp_91~0#1, main_~__VERIFIER_assert__cond~90#1, main_~main____CPAchecker_TMP_0~38#1, main_~main____CPAchecker_TMP_1~37#1, main_~__tmp_90~0#1, main_~__VERIFIER_assert__cond~89#1, main_~__tmp_89~0#1, main_~__VERIFIER_assert__cond~88#1, main_~main____CPAchecker_TMP_0~37#1, main_~main____CPAchecker_TMP_1~36#1, main_~__tmp_88~0#1, main_~__VERIFIER_assert__cond~87#1, main_~__tmp_87~0#1, main_~__VERIFIER_assert__cond~86#1, main_~main____CPAchecker_TMP_0~36#1, main_~main____CPAchecker_TMP_1~35#1, main_~__tmp_86~0#1, main_~__VERIFIER_assert__cond~85#1, main_~__tmp_85~0#1, main_~__VERIFIER_assert__cond~84#1, main_~main____CPAchecker_TMP_0~35#1, main_~main____CPAchecker_TMP_1~34#1, main_~__tmp_84~0#1, main_~__VERIFIER_assert__cond~83#1, main_~__tmp_83~0#1, main_~__VERIFIER_assert__cond~82#1, main_~main____CPAchecker_TMP_0~34#1, main_~main____CPAchecker_TMP_1~33#1, main_~__tmp_82~0#1, main_~__VERIFIER_assert__cond~81#1, main_~__tmp_81~0#1, main_~__VERIFIER_assert__cond~80#1, main_~main____CPAchecker_TMP_0~33#1, main_~main____CPAchecker_TMP_1~32#1, main_~__tmp_80~0#1, main_~__VERIFIER_assert__cond~79#1, main_~__tmp_79~0#1, main_~__VERIFIER_assert__cond~78#1, main_~main____CPAchecker_TMP_0~32#1, main_~main____CPAchecker_TMP_1~31#1, main_~__tmp_78~0#1, main_~__VERIFIER_assert__cond~77#1, main_~__tmp_77~0#1, main_~__VERIFIER_assert__cond~76#1, main_~main____CPAchecker_TMP_0~31#1, main_~main____CPAchecker_TMP_1~30#1, main_~__tmp_76~0#1, main_~__VERIFIER_assert__cond~75#1, main_~__tmp_75~0#1, main_~__VERIFIER_assert__cond~74#1, main_~main____CPAchecker_TMP_0~30#1, main_~main____CPAchecker_TMP_1~29#1, main_~__tmp_74~0#1, main_~__VERIFIER_assert__cond~73#1, main_~__tmp_73~0#1, main_~__VERIFIER_assert__cond~72#1, main_~main____CPAchecker_TMP_0~29#1, main_~main____CPAchecker_TMP_1~28#1, main_~__tmp_72~0#1, main_~__VERIFIER_assert__cond~71#1, main_~__tmp_71~0#1, main_~__VERIFIER_assert__cond~70#1, main_~main____CPAchecker_TMP_0~28#1, main_~main____CPAchecker_TMP_1~27#1, main_~__tmp_70~0#1, main_~__VERIFIER_assert__cond~69#1, main_~__tmp_69~0#1, main_~__VERIFIER_assert__cond~68#1, main_~main____CPAchecker_TMP_0~27#1, main_~main____CPAchecker_TMP_1~26#1, main_~__tmp_68~0#1, main_~__VERIFIER_assert__cond~67#1, main_~__tmp_67~0#1, main_~__VERIFIER_assert__cond~66#1, main_~main____CPAchecker_TMP_0~26#1, main_~main____CPAchecker_TMP_1~25#1, main_~__tmp_66~0#1, main_~__VERIFIER_assert__cond~65#1, main_~__tmp_65~0#1, main_~__VERIFIER_assert__cond~64#1, main_~main____CPAchecker_TMP_0~25#1, main_~main____CPAchecker_TMP_1~24#1, main_~__tmp_64~0#1, main_~__VERIFIER_assert__cond~63#1, main_~__tmp_63~0#1, main_~__VERIFIER_assert__cond~62#1, main_~main____CPAchecker_TMP_0~24#1, main_~main____CPAchecker_TMP_1~23#1, main_~__tmp_62~0#1, main_~__VERIFIER_assert__cond~61#1, main_~__tmp_61~0#1, main_~__VERIFIER_assert__cond~60#1, main_~main____CPAchecker_TMP_0~23#1, main_~main____CPAchecker_TMP_1~22#1, main_~__tmp_60~0#1, main_~__VERIFIER_assert__cond~59#1, main_~__tmp_59~0#1, main_~__VERIFIER_assert__cond~58#1, main_~main____CPAchecker_TMP_0~22#1, main_~main____CPAchecker_TMP_1~21#1, main_~__tmp_58~0#1, main_~__VERIFIER_assert__cond~57#1, main_~__tmp_57~0#1, main_~__VERIFIER_assert__cond~56#1, main_~main____CPAchecker_TMP_0~21#1, main_~main____CPAchecker_TMP_1~20#1, main_~__tmp_56~0#1, main_~__VERIFIER_assert__cond~55#1, main_~__tmp_55~0#1, main_~__VERIFIER_assert__cond~54#1, main_~main____CPAchecker_TMP_0~20#1, main_~main____CPAchecker_TMP_1~19#1, main_~__tmp_54~0#1, main_~__VERIFIER_assert__cond~53#1, main_~__tmp_53~0#1, main_~__VERIFIER_assert__cond~52#1, main_~main____CPAchecker_TMP_0~19#1, main_~main____CPAchecker_TMP_1~18#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~18#1, main_~main____CPAchecker_TMP_1~17#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_0~17#1, main_~main____CPAchecker_TMP_1~16#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~16#1, main_~main____CPAchecker_TMP_1~15#1, main_~__tmp_46~0#1, main_~__VERIFIER_assert__cond~45#1, main_~__tmp_45~0#1, main_~__VERIFIER_assert__cond~44#1, main_~main____CPAchecker_TMP_0~15#1, main_~main____CPAchecker_TMP_1~14#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~14#1, main_~main____CPAchecker_TMP_1~13#1, main_~__tmp_42~0#1, main_~__VERIFIER_assert__cond~41#1, main_~__tmp_41~0#1, main_~__VERIFIER_assert__cond~40#1, main_~main____CPAchecker_TMP_0~13#1, main_~main____CPAchecker_TMP_1~12#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~12#1, main_~main____CPAchecker_TMP_1~11#1, main_~__tmp_38~0#1, main_~__VERIFIER_assert__cond~37#1, main_~__tmp_37~0#1, main_~__VERIFIER_assert__cond~36#1, main_~main____CPAchecker_TMP_0~11#1, main_~main____CPAchecker_TMP_1~10#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~10#1, main_~main____CPAchecker_TMP_1~9#1, main_~__tmp_34~0#1, main_~__VERIFIER_assert__cond~33#1, main_~__tmp_33~0#1, main_~__VERIFIER_assert__cond~32#1, main_~main____CPAchecker_TMP_0~9#1, main_~main____CPAchecker_TMP_1~8#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~8#1, main_~main____CPAchecker_TMP_1~7#1, main_~__tmp_30~0#1, main_~__VERIFIER_assert__cond~29#1, main_~__tmp_29~0#1, main_~__VERIFIER_assert__cond~28#1, main_~main____CPAchecker_TMP_0~7#1, main_~main____CPAchecker_TMP_1~6#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~6#1, main_~main____CPAchecker_TMP_1~5#1, main_~__tmp_26~0#1, main_~__VERIFIER_assert__cond~25#1, main_~__tmp_25~0#1, main_~__VERIFIER_assert__cond~24#1, main_~main____CPAchecker_TMP_0~5#1, main_~main____CPAchecker_TMP_1~4#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~4#1, main_~main____CPAchecker_TMP_1~3#1, main_~__tmp_22~0#1, main_~__VERIFIER_assert__cond~21#1, main_~__tmp_21~0#1, main_~__VERIFIER_assert__cond~20#1, main_~main____CPAchecker_TMP_0~3#1, main_~main____CPAchecker_TMP_1~2#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~2#1, main_~main____CPAchecker_TMP_1~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_~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:07,979 INFO L? ?]: Removed 845 outVars from TransFormulas that were not future-live. [2025-02-07 20:16:07,979 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:16:07,992 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:16:07,995 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:16:07,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:16:07 BoogieIcfgContainer [2025-02-07 20:16:07,995 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:16:07,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:16:07,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:16:07,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:16:07,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:16:06" (1/3) ... [2025-02-07 20:16:08,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a95b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:16:08, skipping insertion in model container [2025-02-07 20:16:08,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:06" (2/3) ... [2025-02-07 20:16:08,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a95b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:16:08, skipping insertion in model container [2025-02-07 20:16:08,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:16:07" (3/3) ... [2025-02-07 20:16:08,001 INFO L128 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2025-02-07 20:16:08,012 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:16:08,014 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG apache-get-tag.i.p+nlh-reducer.c that has 1 procedures, 304 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-02-07 20:16:08,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:16:08,061 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;@6011ff9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:16:08,062 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-07 20:16:08,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 303 states, 279 states have (on average 1.996415770609319) internal successors, (557), 302 states have internal predecessors, (557), 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,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-07 20:16:08,069 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:08,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-07 20:16:08,070 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:08,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:08,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1298366184, now seen corresponding path program 1 times [2025-02-07 20:16:08,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:08,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441772713] [2025-02-07 20:16:08,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:08,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:08,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-07 20:16:08,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-07 20:16:08,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:08,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:08,233 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,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:08,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441772713] [2025-02-07 20:16:08,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441772713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:08,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:08,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:16:08,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312320308] [2025-02-07 20:16:08,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:08,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:16:08,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:08,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:16:08,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:16:08,250 INFO L87 Difference]: Start difference. First operand has 303 states, 279 states have (on average 1.996415770609319) internal successors, (557), 302 states have internal predecessors, (557), 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:08,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:08,764 INFO L93 Difference]: Finished difference Result 306 states and 557 transitions. [2025-02-07 20:16:08,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:16:08,766 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:08,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:08,775 INFO L225 Difference]: With dead ends: 306 [2025-02-07 20:16:08,775 INFO L226 Difference]: Without dead ends: 291 [2025-02-07 20:16:08,777 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:08,778 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 394 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:08,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 454 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 20:16:08,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-02-07 20:16:08,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2025-02-07 20:16:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 276 states have (on average 1.0507246376811594) internal successors, (290), 290 states have internal predecessors, (290), 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,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 290 transitions. [2025-02-07 20:16:08,806 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 290 transitions. Word has length 5 [2025-02-07 20:16:08,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:08,806 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 290 transitions. [2025-02-07 20:16:08,806 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:08,807 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 290 transitions. [2025-02-07 20:16:08,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-07 20:16:08,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:08,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-07 20:16:08,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:16:08,807 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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:08,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:08,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1633869988, now seen corresponding path program 1 times [2025-02-07 20:16:08,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:08,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677924714] [2025-02-07 20:16:08,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:08,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:08,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 20:16:08,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 20:16:08,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:08,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:08,871 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,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:08,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677924714] [2025-02-07 20:16:08,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677924714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:08,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:08,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:16:08,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459541004] [2025-02-07 20:16:08,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:08,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:16:08,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:08,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:16:08,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:16:08,873 INFO L87 Difference]: Start difference. First operand 291 states and 290 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:09,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:09,192 INFO L93 Difference]: Finished difference Result 291 states and 290 transitions. [2025-02-07 20:16:09,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:16:09,192 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:09,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:09,193 INFO L225 Difference]: With dead ends: 291 [2025-02-07 20:16:09,193 INFO L226 Difference]: Without dead ends: 289 [2025-02-07 20:16:09,193 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:09,194 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 212 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:09,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 71 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 20:16:09,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-02-07 20:16:09,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2025-02-07 20:16:09,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 275 states have (on average 1.0472727272727274) internal successors, (288), 288 states have internal predecessors, (288), 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,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 288 transitions. [2025-02-07 20:16:09,202 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 288 transitions. Word has length 6 [2025-02-07 20:16:09,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:09,202 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 288 transitions. [2025-02-07 20:16:09,202 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:09,202 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 288 transitions. [2025-02-07 20:16:09,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-07 20:16:09,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:09,202 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-07 20:16:09,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:16:09,202 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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:09,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:09,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1594645304, now seen corresponding path program 1 times [2025-02-07 20:16:09,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:09,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978718765] [2025-02-07 20:16:09,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:09,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:09,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 20:16:09,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 20:16:09,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:09,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:09,283 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,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:09,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978718765] [2025-02-07 20:16:09,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978718765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:09,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:09,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:16:09,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822277666] [2025-02-07 20:16:09,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:09,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:16:09,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:09,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:16:09,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:16:09,284 INFO L87 Difference]: Start difference. First operand 289 states and 288 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:09,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:09,496 INFO L93 Difference]: Finished difference Result 289 states and 288 transitions. [2025-02-07 20:16:09,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:16:09,496 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:09,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:09,497 INFO L225 Difference]: With dead ends: 289 [2025-02-07 20:16:09,497 INFO L226 Difference]: Without dead ends: 285 [2025-02-07 20:16:09,498 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:09,498 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 11 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:09,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 571 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:16:09,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-02-07 20:16:09,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2025-02-07 20:16:09,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 272 states have (on average 1.0441176470588236) internal successors, (284), 284 states have internal predecessors, (284), 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,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 284 transitions. [2025-02-07 20:16:09,504 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 284 transitions. Word has length 6 [2025-02-07 20:16:09,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:09,504 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 284 transitions. [2025-02-07 20:16:09,504 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:09,504 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 284 transitions. [2025-02-07 20:16:09,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 20:16:09,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:09,504 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:09,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:16:09,504 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:09,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:09,505 INFO L85 PathProgramCache]: Analyzing trace with hash -889635854, now seen corresponding path program 1 times [2025-02-07 20:16:09,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:09,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184024357] [2025-02-07 20:16:09,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:09,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:09,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 20:16:09,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 20:16:09,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:09,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:09,555 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,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:09,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184024357] [2025-02-07 20:16:09,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184024357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:09,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:09,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:16:09,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698874033] [2025-02-07 20:16:09,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:09,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:16:09,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:09,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:16:09,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:16:09,556 INFO L87 Difference]: Start difference. First operand 285 states and 284 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:09,760 INFO L93 Difference]: Finished difference Result 285 states and 284 transitions. [2025-02-07 20:16:09,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:16:09,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2025-02-07 20:16:09,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:09,762 INFO L225 Difference]: With dead ends: 285 [2025-02-07 20:16:09,762 INFO L226 Difference]: Without dead ends: 283 [2025-02-07 20:16:09,762 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:09,763 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 3 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:09,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 575 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:16:09,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-02-07 20:16:09,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2025-02-07 20:16:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 271 states have (on average 1.040590405904059) internal successors, (282), 282 states have internal predecessors, (282), 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,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 282 transitions. [2025-02-07 20:16:09,771 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 282 transitions. Word has length 7 [2025-02-07 20:16:09,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:09,771 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 282 transitions. [2025-02-07 20:16:09,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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,771 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 282 transitions. [2025-02-07 20:16:09,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 20:16:09,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:09,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:09,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 20:16:09,773 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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:09,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:09,774 INFO L85 PathProgramCache]: Analyzing trace with hash -241576998, now seen corresponding path program 1 times [2025-02-07 20:16:09,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:09,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616626766] [2025-02-07 20:16:09,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:09,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:09,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 20:16:09,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 20:16:09,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:09,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:09,842 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,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:09,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616626766] [2025-02-07 20:16:09,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616626766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:09,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:09,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:16:09,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170073466] [2025-02-07 20:16:09,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:09,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:16:09,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:09,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:16:09,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:16:09,844 INFO L87 Difference]: Start difference. First operand 283 states and 282 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:10,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:10,215 INFO L93 Difference]: Finished difference Result 283 states and 282 transitions. [2025-02-07 20:16:10,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:16:10,216 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:10,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:10,217 INFO L225 Difference]: With dead ends: 283 [2025-02-07 20:16:10,217 INFO L226 Difference]: Without dead ends: 281 [2025-02-07 20:16:10,217 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:10,217 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 205 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:10,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 81 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 20:16:10,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-02-07 20:16:10,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-02-07 20:16:10,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 270 states have (on average 1.037037037037037) internal successors, (280), 280 states have internal predecessors, (280), 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:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 280 transitions. [2025-02-07 20:16:10,222 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 280 transitions. Word has length 9 [2025-02-07 20:16:10,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:10,222 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 280 transitions. [2025-02-07 20:16:10,222 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:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 280 transitions. [2025-02-07 20:16:10,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 20:16:10,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:10,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:10,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 20:16:10,223 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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:10,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:10,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1101046912, now seen corresponding path program 1 times [2025-02-07 20:16:10,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:10,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898329796] [2025-02-07 20:16:10,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:10,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:10,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 20:16:10,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 20:16:10,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:10,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:10,271 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:10,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:10,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898329796] [2025-02-07 20:16:10,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898329796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:10,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:10,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:16:10,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153773331] [2025-02-07 20:16:10,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:10,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:16:10,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:10,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:16:10,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:16:10,272 INFO L87 Difference]: Start difference. First operand 281 states and 280 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:10,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:10,458 INFO L93 Difference]: Finished difference Result 281 states and 280 transitions. [2025-02-07 20:16:10,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:16:10,459 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:10,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:10,459 INFO L225 Difference]: With dead ends: 281 [2025-02-07 20:16:10,459 INFO L226 Difference]: Without dead ends: 277 [2025-02-07 20:16:10,460 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:10,460 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 7 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:10,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 557 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:16:10,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-02-07 20:16:10,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2025-02-07 20:16:10,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 267 states have (on average 1.0337078651685394) internal successors, (276), 276 states have internal predecessors, (276), 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:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 276 transitions. [2025-02-07 20:16:10,464 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 276 transitions. Word has length 10 [2025-02-07 20:16:10,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:10,464 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 276 transitions. [2025-02-07 20:16:10,464 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:10,464 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 276 transitions. [2025-02-07 20:16:10,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 20:16:10,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:10,464 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:10,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 20:16:10,465 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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:10,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:10,465 INFO L85 PathProgramCache]: Analyzing trace with hash -155651615, now seen corresponding path program 1 times [2025-02-07 20:16:10,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:10,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177127380] [2025-02-07 20:16:10,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:10,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:10,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 20:16:10,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 20:16:10,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:10,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:10,513 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:10,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:10,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177127380] [2025-02-07 20:16:10,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177127380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:10,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:10,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:16:10,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434273477] [2025-02-07 20:16:10,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:10,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:16:10,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:10,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:16:10,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:16:10,514 INFO L87 Difference]: Start difference. First operand 277 states and 276 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:10,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:10,859 INFO L93 Difference]: Finished difference Result 277 states and 276 transitions. [2025-02-07 20:16:10,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:16:10,860 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:10,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:10,861 INFO L225 Difference]: With dead ends: 277 [2025-02-07 20:16:10,861 INFO L226 Difference]: Without dead ends: 275 [2025-02-07 20:16:10,862 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:10,862 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 200 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:10,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 67 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 20:16:10,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-02-07 20:16:10,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-02-07 20:16:10,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 266 states have (on average 1.0300751879699248) internal successors, (274), 274 states have internal predecessors, (274), 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:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 274 transitions. [2025-02-07 20:16:10,867 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 274 transitions. Word has length 11 [2025-02-07 20:16:10,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:10,867 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 274 transitions. [2025-02-07 20:16:10,869 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:10,869 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 274 transitions. [2025-02-07 20:16:10,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 20:16:10,869 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:10,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:10,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 20:16:10,870 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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:10,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:10,870 INFO L85 PathProgramCache]: Analyzing trace with hash -156267328, now seen corresponding path program 1 times [2025-02-07 20:16:10,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:10,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556493741] [2025-02-07 20:16:10,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:10,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:10,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 20:16:10,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 20:16:10,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:10,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:10,922 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:10,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:10,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556493741] [2025-02-07 20:16:10,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556493741] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:10,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:10,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:16:10,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025356042] [2025-02-07 20:16:10,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:10,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:16:10,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:10,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:16:10,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:16:10,923 INFO L87 Difference]: Start difference. First operand 275 states and 274 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:11,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:11,254 INFO L93 Difference]: Finished difference Result 275 states and 274 transitions. [2025-02-07 20:16:11,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:16:11,255 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:11,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:11,256 INFO L225 Difference]: With dead ends: 275 [2025-02-07 20:16:11,256 INFO L226 Difference]: Without dead ends: 273 [2025-02-07 20:16:11,256 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:11,256 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 198 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:11,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 61 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 20:16:11,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-02-07 20:16:11,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2025-02-07 20:16:11,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 265 states have (on average 1.0264150943396226) internal successors, (272), 272 states have internal predecessors, (272), 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:11,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 272 transitions. [2025-02-07 20:16:11,260 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 272 transitions. Word has length 11 [2025-02-07 20:16:11,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:11,260 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 272 transitions. [2025-02-07 20:16:11,260 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:11,260 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 272 transitions. [2025-02-07 20:16:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 20:16:11,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:11,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:11,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 20:16:11,261 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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:11,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:11,261 INFO L85 PathProgramCache]: Analyzing trace with hash -530233441, now seen corresponding path program 1 times [2025-02-07 20:16:11,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:11,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861185148] [2025-02-07 20:16:11,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:11,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:11,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 20:16:11,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 20:16:11,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:11,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:11,365 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:11,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:11,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861185148] [2025-02-07 20:16:11,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861185148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:11,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:11,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:16:11,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38051648] [2025-02-07 20:16:11,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:11,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:16:11,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:11,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:16:11,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:11,367 INFO L87 Difference]: Start difference. First operand 273 states and 272 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:11,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:11,618 INFO L93 Difference]: Finished difference Result 273 states and 272 transitions. [2025-02-07 20:16:11,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:16:11,618 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:11,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:11,619 INFO L225 Difference]: With dead ends: 273 [2025-02-07 20:16:11,619 INFO L226 Difference]: Without dead ends: 268 [2025-02-07 20:16:11,619 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:11,619 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 14 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:11,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 533 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:16:11,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-02-07 20:16:11,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-02-07 20:16:11,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 261 states have (on average 1.0229885057471264) internal successors, (267), 267 states have internal predecessors, (267), 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:11,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 267 transitions. [2025-02-07 20:16:11,623 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 267 transitions. Word has length 12 [2025-02-07 20:16:11,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:11,623 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 267 transitions. [2025-02-07 20:16:11,623 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:11,623 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 267 transitions. [2025-02-07 20:16:11,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 20:16:11,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:11,623 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:11,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 20:16:11,623 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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:11,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:11,623 INFO L85 PathProgramCache]: Analyzing trace with hash -549319574, now seen corresponding path program 1 times [2025-02-07 20:16:11,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:11,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938277988] [2025-02-07 20:16:11,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:11,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:11,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 20:16:11,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 20:16:11,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:11,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:11,722 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:11,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:11,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938277988] [2025-02-07 20:16:11,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938277988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:11,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:11,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:16:11,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704350859] [2025-02-07 20:16:11,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:11,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:16:11,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:11,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:16:11,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:11,723 INFO L87 Difference]: Start difference. First operand 268 states and 267 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:12,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:12,085 INFO L93 Difference]: Finished difference Result 268 states and 267 transitions. [2025-02-07 20:16:12,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:16:12,085 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:12,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:12,086 INFO L225 Difference]: With dead ends: 268 [2025-02-07 20:16:12,086 INFO L226 Difference]: Without dead ends: 266 [2025-02-07 20:16:12,086 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:12,087 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 6 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:12,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 537 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 20:16:12,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-02-07 20:16:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-02-07 20:16:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 260 states have (on average 1.0192307692307692) internal successors, (265), 265 states have internal predecessors, (265), 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:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 265 transitions. [2025-02-07 20:16:12,090 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 265 transitions. Word has length 12 [2025-02-07 20:16:12,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:12,090 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 265 transitions. [2025-02-07 20:16:12,090 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:12,090 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 265 transitions. [2025-02-07 20:16:12,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 20:16:12,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:12,091 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:12,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 20:16:12,091 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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:12,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:12,091 INFO L85 PathProgramCache]: Analyzing trace with hash 384854418, now seen corresponding path program 1 times [2025-02-07 20:16:12,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:12,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612889760] [2025-02-07 20:16:12,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:12,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:12,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 20:16:12,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 20:16:12,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:12,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:12,129 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:12,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:12,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612889760] [2025-02-07 20:16:12,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612889760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:12,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:12,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:16:12,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143511197] [2025-02-07 20:16:12,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:12,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:16:12,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:12,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:16:12,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:16:12,131 INFO L87 Difference]: Start difference. First operand 266 states and 265 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:12,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:12,280 INFO L93 Difference]: Finished difference Result 266 states and 265 transitions. [2025-02-07 20:16:12,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:16:12,280 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:12,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:12,281 INFO L225 Difference]: With dead ends: 266 [2025-02-07 20:16:12,281 INFO L226 Difference]: Without dead ends: 264 [2025-02-07 20:16:12,282 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:12,282 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 246 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:12,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 275 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:12,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-02-07 20:16:12,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2025-02-07 20:16:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.0154440154440154) internal successors, (263), 263 states have internal predecessors, (263), 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:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 263 transitions. [2025-02-07 20:16:12,287 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 263 transitions. Word has length 14 [2025-02-07 20:16:12,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:12,287 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 263 transitions. [2025-02-07 20:16:12,287 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:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 263 transitions. [2025-02-07 20:16:12,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 20:16:12,288 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:12,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:12,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 20:16:12,288 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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:12,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:12,289 INFO L85 PathProgramCache]: Analyzing trace with hash 384871297, now seen corresponding path program 1 times [2025-02-07 20:16:12,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:12,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639587641] [2025-02-07 20:16:12,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:12,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:12,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 20:16:12,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 20:16:12,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:12,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:12,349 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:12,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:12,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639587641] [2025-02-07 20:16:12,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639587641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:12,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:12,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:16:12,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575608126] [2025-02-07 20:16:12,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:12,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:16:12,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:12,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:16:12,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:12,351 INFO L87 Difference]: Start difference. First operand 264 states and 263 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:12,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:12,650 INFO L93 Difference]: Finished difference Result 264 states and 263 transitions. [2025-02-07 20:16:12,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:16:12,650 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:12,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:12,651 INFO L225 Difference]: With dead ends: 264 [2025-02-07 20:16:12,651 INFO L226 Difference]: Without dead ends: 262 [2025-02-07 20:16:12,651 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:12,652 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 188 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:12,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 35 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 20:16:12,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-02-07 20:16:12,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2025-02-07 20:16:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 258 states have (on average 1.0116279069767442) internal successors, (261), 261 states have internal predecessors, (261), 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:12,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 261 transitions. [2025-02-07 20:16:12,656 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 261 transitions. Word has length 14 [2025-02-07 20:16:12,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:12,656 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 261 transitions. [2025-02-07 20:16:12,656 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:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 261 transitions. [2025-02-07 20:16:12,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 20:16:12,656 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:12,656 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:12,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 20:16:12,656 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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:12,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:12,657 INFO L85 PathProgramCache]: Analyzing trace with hash -954415646, now seen corresponding path program 1 times [2025-02-07 20:16:12,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:12,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124295436] [2025-02-07 20:16:12,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:12,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:12,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:16:12,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:16:12,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:12,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:12,695 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:12,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:12,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124295436] [2025-02-07 20:16:12,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124295436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:12,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:12,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:16:12,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511428600] [2025-02-07 20:16:12,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:12,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:16:12,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:12,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:16:12,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:16:12,696 INFO L87 Difference]: Start difference. First operand 262 states and 261 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:12,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:12,890 INFO L93 Difference]: Finished difference Result 262 states and 261 transitions. [2025-02-07 20:16:12,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:16:12,890 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:12,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:12,891 INFO L225 Difference]: With dead ends: 262 [2025-02-07 20:16:12,891 INFO L226 Difference]: Without dead ends: 258 [2025-02-07 20:16:12,892 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:12,892 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 5 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:12,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 508 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:16:12,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-02-07 20:16:12,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2025-02-07 20:16:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 255 states have (on average 1.007843137254902) internal successors, (257), 257 states have internal predecessors, (257), 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:12,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 257 transitions. [2025-02-07 20:16:12,897 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 257 transitions. Word has length 15 [2025-02-07 20:16:12,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:12,897 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 257 transitions. [2025-02-07 20:16:12,897 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:12,898 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 257 transitions. [2025-02-07 20:16:12,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 20:16:12,898 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:12,898 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:12,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 20:16:12,898 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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:12,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:12,899 INFO L85 PathProgramCache]: Analyzing trace with hash -953892320, now seen corresponding path program 1 times [2025-02-07 20:16:12,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:12,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594879934] [2025-02-07 20:16:12,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:12,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:12,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:16:12,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:16:12,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:12,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:12,980 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:12,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:12,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594879934] [2025-02-07 20:16:12,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594879934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:12,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:12,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:16:12,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923372817] [2025-02-07 20:16:12,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:12,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:16:12,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:12,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:16:12,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:12,981 INFO L87 Difference]: Start difference. First operand 258 states and 257 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:13,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:13,309 INFO L93 Difference]: Finished difference Result 258 states and 257 transitions. [2025-02-07 20:16:13,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:16:13,310 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:13,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:13,311 INFO L225 Difference]: With dead ends: 258 [2025-02-07 20:16:13,311 INFO L226 Difference]: Without dead ends: 246 [2025-02-07 20:16:13,311 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:13,312 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 444 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:13,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 13 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 20:16:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-02-07 20:16:13,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2025-02-07 20:16:13,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 244 states have (on average 1.0040983606557377) internal successors, (245), 245 states have internal predecessors, (245), 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:13,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 245 transitions. [2025-02-07 20:16:13,318 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 245 transitions. Word has length 15 [2025-02-07 20:16:13,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:13,318 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 245 transitions. [2025-02-07 20:16:13,318 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:13,318 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 245 transitions. [2025-02-07 20:16:13,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-02-07 20:16:13,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:13,326 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 20:16:13,326 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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:13,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:13,326 INFO L85 PathProgramCache]: Analyzing trace with hash 326082526, now seen corresponding path program 1 times [2025-02-07 20:16:13,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:13,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832615511] [2025-02-07 20:16:13,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:13,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:13,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-02-07 20:16:13,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-02-07 20:16:13,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:13,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:16,376 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:16,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:16,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832615511] [2025-02-07 20:16:16,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832615511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:16,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:16,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2025-02-07 20:16:16,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754803033] [2025-02-07 20:16:16,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:16,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-02-07 20:16:16,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:16,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-02-07 20:16:16,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1834, Invalid=2072, Unknown=0, NotChecked=0, Total=3906 [2025-02-07 20:16:16,382 INFO L87 Difference]: Start difference. First operand 246 states and 245 transitions. Second operand has 63 states, 63 states have (on average 3.8412698412698414) internal successors, (242), 63 states have internal predecessors, (242), 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:16,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:16,883 INFO L93 Difference]: Finished difference Result 246 states and 245 transitions. [2025-02-07 20:16:16,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-02-07 20:16:16,884 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 3.8412698412698414) internal successors, (242), 63 states have internal predecessors, (242), 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 242 [2025-02-07 20:16:16,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:16,886 INFO L225 Difference]: With dead ends: 246 [2025-02-07 20:16:16,887 INFO L226 Difference]: Without dead ends: 244 [2025-02-07 20:16:16,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1896, Invalid=2136, Unknown=0, NotChecked=0, Total=4032 [2025-02-07 20:16:16,891 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:16,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 9 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 20:16:16,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-02-07 20:16:16,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-02-07 20:16:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.0) internal successors, (243), 243 states have internal predecessors, (243), 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:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 243 transitions. [2025-02-07 20:16:16,894 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 243 transitions. Word has length 242 [2025-02-07 20:16:16,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:16,895 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 243 transitions. [2025-02-07 20:16:16,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 3.8412698412698414) internal successors, (242), 63 states have internal predecessors, (242), 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:16,895 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 243 transitions. [2025-02-07 20:16:16,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-02-07 20:16:16,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:16,896 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 20:16:16,897 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:16,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:16,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1518624028, now seen corresponding path program 1 times [2025-02-07 20:16:16,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:16,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415243983] [2025-02-07 20:16:16,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:16,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:16,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-02-07 20:16:16,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-02-07 20:16:16,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:16,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:17,296 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:17,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:17,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415243983] [2025-02-07 20:16:17,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415243983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:17,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:17,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:16:17,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914105844] [2025-02-07 20:16:17,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:17,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:16:17,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:17,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:16:17,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:17,299 INFO L87 Difference]: Start difference. First operand 244 states and 243 transitions. Second operand has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 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:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:17,616 INFO L93 Difference]: Finished difference Result 244 states and 243 transitions. [2025-02-07 20:16:17,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:16:17,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 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 243 [2025-02-07 20:16:17,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:17,617 INFO L225 Difference]: With dead ends: 244 [2025-02-07 20:16:17,617 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 20:16:17,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:16:17,619 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 415 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:17,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 3 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 20:16:17,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 20:16:17,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 20:16:17,620 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:17,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 20:16:17,620 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 243 [2025-02-07 20:16:17,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:17,620 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 20:16:17,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 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:17,621 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 20:16:17,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 20:16:17,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2025-02-07 20:16:17,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2025-02-07 20:16:17,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2025-02-07 20:16:17,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2025-02-07 20:16:17,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2025-02-07 20:16:17,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2025-02-07 20:16:17,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2025-02-07 20:16:17,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2025-02-07 20:16:17,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2025-02-07 20:16:17,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2025-02-07 20:16:17,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2025-02-07 20:16:17,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2025-02-07 20:16:17,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2025-02-07 20:16:17,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2025-02-07 20:16:17,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2025-02-07 20:16:17,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2025-02-07 20:16:17,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 20:16:17,627 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:17,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 20:16:17,632 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:16:17,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:16:17 BoogieIcfgContainer [2025-02-07 20:16:17,638 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:16:17,638 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:16:17,638 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:16:17,638 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:16:17,639 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:07" (3/4) ... [2025-02-07 20:16:17,640 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 20:16:17,660 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-07 20:16:17,662 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 20:16:17,663 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-07 20:16:17,664 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 20:16:17,777 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 20:16:17,778 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 20:16:17,778 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:16:17,778 INFO L158 Benchmark]: Toolchain (without parser) took 11570.20ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 104.7MB in the beginning and 147.6MB in the end (delta: -43.0MB). Peak memory consumption was 234.5MB. Max. memory is 16.1GB. [2025-02-07 20:16:17,778 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:16:17,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.82ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 70.7MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-07 20:16:17,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.82ms. Allocated memory is still 142.6MB. Free memory was 70.7MB in the beginning and 63.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:16:17,779 INFO L158 Benchmark]: Boogie Preprocessor took 74.03ms. Allocated memory is still 142.6MB. Free memory was 63.4MB in the beginning and 57.3MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:16:17,779 INFO L158 Benchmark]: IcfgBuilder took 1145.45ms. Allocated memory is still 142.6MB. Free memory was 57.3MB in the beginning and 80.2MB in the end (delta: -22.9MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2025-02-07 20:16:17,779 INFO L158 Benchmark]: TraceAbstraction took 9641.29ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 80.2MB in the beginning and 168.9MB in the end (delta: -88.7MB). Peak memory consumption was 186.1MB. Max. memory is 16.1GB. [2025-02-07 20:16:17,779 INFO L158 Benchmark]: Witness Printer took 139.47ms. Allocated memory is still 419.4MB. Free memory was 168.9MB in the beginning and 147.6MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-07 20:16:17,780 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.18ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 489.82ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 70.7MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.82ms. Allocated memory is still 142.6MB. Free memory was 70.7MB in the beginning and 63.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.03ms. Allocated memory is still 142.6MB. Free memory was 63.4MB in the beginning and 57.3MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1145.45ms. Allocated memory is still 142.6MB. Free memory was 57.3MB in the beginning and 80.2MB in the end (delta: -22.9MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9641.29ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 80.2MB in the beginning and 168.9MB in the end (delta: -88.7MB). Peak memory consumption was 186.1MB. Max. memory is 16.1GB. * Witness Printer took 139.47ms. Allocated memory is still 419.4MB. Free memory was 168.9MB in the beginning and 147.6MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. 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: 35]: 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: 47]: 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: 76]: 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: 88]: 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: 255]: 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: 267]: 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: 2604]: 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: 2616]: 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, 304 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2564 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2564 mSDsluCounter, 4350 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2297 mSDsCounter, 732 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9640 IncrementalHoareTripleChecker+Invalid, 10372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 732 mSolverCounterUnsat, 2053 mSDtfsCounter, 9640 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303occurred in iteration=0, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 632 NumberOfCodeBlocks, 632 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 616 ConstructedInterpolants, 0 QuantifiedInterpolants, 1458 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:17,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE