./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 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 19:45:26,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 19:45:26,110 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 19:45:26,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 19:45:26,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 19:45:26,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 19:45:26,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 19:45:26,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 19:45:26,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 19:45:26,145 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 19:45:26,145 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 19:45:26,145 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 19:45:26,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 19:45:26,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 19:45:26,146 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 19:45:26,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 19:45:26,146 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 19:45:26,146 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 19:45:26,146 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 19:45:26,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 19:45:26,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 19:45:26,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 19:45:26,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 19:45:26,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 19:45:26,148 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 19:45:26,149 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 19:45:26,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 19:45:26,149 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 19:45:26,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 19:45:26,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 19:45:26,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 19:45:26,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 19:45:26,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:45:26,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 19:45:26,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 19:45:26,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 19:45:26,151 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 19:45:26,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 19:45:26,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 19:45:26,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 19:45:26,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 19:45:26,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 19:45:26,152 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 [2024-11-11 19:45:26,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 19:45:26,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 19:45:26,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 19:45:26,378 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 19:45:26,378 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 19:45:26,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2024-11-11 19:45:27,606 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 19:45:27,857 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 19:45:27,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2024-11-11 19:45:27,875 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa076acb8/0ae16649a78244698aa45e9a9927c6d2/FLAGde258d5d8 [2024-11-11 19:45:28,208 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa076acb8/0ae16649a78244698aa45e9a9927c6d2 [2024-11-11 19:45:28,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 19:45:28,211 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 19:45:28,212 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 19:45:28,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 19:45:28,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 19:45:28,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:45:28" (1/1) ... [2024-11-11 19:45:28,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@124fe0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:28, skipping insertion in model container [2024-11-11 19:45:28,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:45:28" (1/1) ... [2024-11-11 19:45:28,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 19:45:28,432 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[901,914] [2024-11-11 19:45:28,437 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1116,1129] [2024-11-11 19:45:28,440 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1625,1638] [2024-11-11 19:45:28,441 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1840,1853] [2024-11-11 19:45:28,442 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2157,2170] [2024-11-11 19:45:28,444 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2372,2385] [2024-11-11 19:45:28,445 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2867,2880] [2024-11-11 19:45:28,446 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3082,3095] [2024-11-11 19:45:28,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3384,3397] [2024-11-11 19:45:28,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3602,3615] [2024-11-11 19:45:28,449 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3878,3891] [2024-11-11 19:45:28,450 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4096,4109] [2024-11-11 19:45:28,452 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4582,4595] [2024-11-11 19:45:28,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4800,4813] [2024-11-11 19:45:28,675 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47686,47699] [2024-11-11 19:45:28,679 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47907,47920] [2024-11-11 19:45:28,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:45:28,709 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 19:45:28,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[901,914] [2024-11-11 19:45:28,719 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1116,1129] [2024-11-11 19:45:28,719 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1625,1638] [2024-11-11 19:45:28,720 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1840,1853] [2024-11-11 19:45:28,722 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2157,2170] [2024-11-11 19:45:28,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2372,2385] [2024-11-11 19:45:28,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2867,2880] [2024-11-11 19:45:28,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3082,3095] [2024-11-11 19:45:28,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3384,3397] [2024-11-11 19:45:28,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3602,3615] [2024-11-11 19:45:28,726 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3878,3891] [2024-11-11 19:45:28,727 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4096,4109] [2024-11-11 19:45:28,727 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4582,4595] [2024-11-11 19:45:28,728 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4800,4813] [2024-11-11 19:45:28,905 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47686,47699] [2024-11-11 19:45:28,914 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47907,47920] [2024-11-11 19:45:28,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:45:28,945 INFO L204 MainTranslator]: Completed translation [2024-11-11 19:45:28,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:28 WrapperNode [2024-11-11 19:45:28,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 19:45:28,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 19:45:28,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 19:45:28,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 19:45:28,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:28" (1/1) ... [2024-11-11 19:45:28,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:28" (1/1) ... [2024-11-11 19:45:29,008 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2017 [2024-11-11 19:45:29,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 19:45:29,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 19:45:29,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 19:45:29,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 19:45:29,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:28" (1/1) ... [2024-11-11 19:45:29,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:28" (1/1) ... [2024-11-11 19:45:29,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:28" (1/1) ... [2024-11-11 19:45:29,052 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]. [2024-11-11 19:45:29,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:28" (1/1) ... [2024-11-11 19:45:29,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:28" (1/1) ... [2024-11-11 19:45:29,079 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:28" (1/1) ... [2024-11-11 19:45:29,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:28" (1/1) ... [2024-11-11 19:45:29,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:28" (1/1) ... [2024-11-11 19:45:29,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:28" (1/1) ... [2024-11-11 19:45:29,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 19:45:29,124 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 19:45:29,124 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 19:45:29,124 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 19:45:29,124 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:28" (1/1) ... [2024-11-11 19:45:29,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:45:29,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:45:29,180 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 19:45:29,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 19:45:29,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 19:45:29,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 19:45:29,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 19:45:29,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 19:45:29,375 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 19:45:29,377 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 19:45:30,145 INFO L? ?]: Removed 607 outVars from TransFormulas that were not future-live. [2024-11-11 19:45:30,145 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 19:45:30,165 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 19:45:30,168 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 19:45:30,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:45:30 BoogieIcfgContainer [2024-11-11 19:45:30,169 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 19:45:30,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 19:45:30,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 19:45:30,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 19:45:30,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 07:45:28" (1/3) ... [2024-11-11 19:45:30,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d25e567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:45:30, skipping insertion in model container [2024-11-11 19:45:30,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:28" (2/3) ... [2024-11-11 19:45:30,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d25e567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:45:30, skipping insertion in model container [2024-11-11 19:45:30,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:45:30" (3/3) ... [2024-11-11 19:45:30,181 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2024-11-11 19:45:30,204 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 19:45:30,204 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-11-11 19:45:30,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 19:45:30,280 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;@875471d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 19:45:30,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-11 19:45:30,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 304 states, 287 states have (on average 1.9686411149825784) internal successors, (565), 303 states have internal predecessors, (565), 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) [2024-11-11 19:45:30,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-11 19:45:30,288 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:30,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:30,289 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)] === [2024-11-11 19:45:30,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:30,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1804934597, now seen corresponding path program 1 times [2024-11-11 19:45:30,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:30,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101592107] [2024-11-11 19:45:30,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:30,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:30,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:30,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:30,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101592107] [2024-11-11 19:45:30,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101592107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:30,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:30,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 19:45:30,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393966137] [2024-11-11 19:45:30,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:30,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 19:45:30,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:30,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 19:45:30,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:45:30,579 INFO L87 Difference]: Start difference. First operand has 304 states, 287 states have (on average 1.9686411149825784) internal successors, (565), 303 states have internal predecessors, (565), 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.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) [2024-11-11 19:45:31,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:31,084 INFO L93 Difference]: Finished difference Result 308 states and 568 transitions. [2024-11-11 19:45:31,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 19:45:31,086 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 [2024-11-11 19:45:31,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:31,093 INFO L225 Difference]: With dead ends: 308 [2024-11-11 19:45:31,094 INFO L226 Difference]: Without dead ends: 298 [2024-11-11 19:45:31,096 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 [2024-11-11 19:45:31,098 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 460 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:31,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 467 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 19:45:31,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-11 19:45:31,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-11-11 19:45:31,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 283 states have (on average 1.4876325088339222) internal successors, (421), 297 states have internal predecessors, (421), 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) [2024-11-11 19:45:31,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 421 transitions. [2024-11-11 19:45:31,138 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 421 transitions. Word has length 7 [2024-11-11 19:45:31,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:31,138 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 421 transitions. [2024-11-11 19:45:31,139 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) [2024-11-11 19:45:31,139 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 421 transitions. [2024-11-11 19:45:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-11 19:45:31,139 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:31,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:31,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 19:45:31,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 19:45:31,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:31,140 INFO L85 PathProgramCache]: Analyzing trace with hash 118401710, now seen corresponding path program 1 times [2024-11-11 19:45:31,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:31,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401418295] [2024-11-11 19:45:31,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:31,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:31,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:31,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:31,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401418295] [2024-11-11 19:45:31,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401418295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:31,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:31,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:45:31,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752068251] [2024-11-11 19:45:31,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:31,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:45:31,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:31,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:45:31,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:45:31,264 INFO L87 Difference]: Start difference. First operand 298 states and 421 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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) [2024-11-11 19:45:31,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:31,933 INFO L93 Difference]: Finished difference Result 305 states and 428 transitions. [2024-11-11 19:45:31,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 19:45:31,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2024-11-11 19:45:31,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:31,938 INFO L225 Difference]: With dead ends: 305 [2024-11-11 19:45:31,940 INFO L226 Difference]: Without dead ends: 300 [2024-11-11 19:45:31,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:45:31,941 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 28 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:31,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 904 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 19:45:31,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-11 19:45:31,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 293. [2024-11-11 19:45:31,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 279 states have (on average 1.2759856630824373) internal successors, (356), 292 states have internal predecessors, (356), 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) [2024-11-11 19:45:31,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 356 transitions. [2024-11-11 19:45:31,979 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 356 transitions. Word has length 8 [2024-11-11 19:45:31,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:31,980 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 356 transitions. [2024-11-11 19:45:31,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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) [2024-11-11 19:45:31,980 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 356 transitions. [2024-11-11 19:45:31,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-11 19:45:31,980 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:31,980 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:31,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 19:45:31,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 19:45:31,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:31,981 INFO L85 PathProgramCache]: Analyzing trace with hash 137513629, now seen corresponding path program 1 times [2024-11-11 19:45:31,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:31,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642505772] [2024-11-11 19:45:31,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:31,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:32,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:32,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:32,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642505772] [2024-11-11 19:45:32,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642505772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:32,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:32,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 19:45:32,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530577997] [2024-11-11 19:45:32,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:32,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 19:45:32,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:32,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 19:45:32,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:45:32,073 INFO L87 Difference]: Start difference. First operand 293 states and 356 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2024-11-11 19:45:32,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:32,439 INFO L93 Difference]: Finished difference Result 293 states and 356 transitions. [2024-11-11 19:45:32,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 19:45:32,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2024-11-11 19:45:32,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:32,441 INFO L225 Difference]: With dead ends: 293 [2024-11-11 19:45:32,442 INFO L226 Difference]: Without dead ends: 291 [2024-11-11 19:45:32,442 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 [2024-11-11 19:45:32,443 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 277 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:32,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 198 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 19:45:32,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-11 19:45:32,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2024-11-11 19:45:32,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 278 states have (on average 1.2733812949640289) internal successors, (354), 290 states have internal predecessors, (354), 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) [2024-11-11 19:45:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 354 transitions. [2024-11-11 19:45:32,461 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 354 transitions. Word has length 8 [2024-11-11 19:45:32,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:32,462 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 354 transitions. [2024-11-11 19:45:32,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2024-11-11 19:45:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 354 transitions. [2024-11-11 19:45:32,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-11 19:45:32,463 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:32,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:32,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 19:45:32,463 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)] === [2024-11-11 19:45:32,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:32,464 INFO L85 PathProgramCache]: Analyzing trace with hash -32040723, now seen corresponding path program 1 times [2024-11-11 19:45:32,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:32,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963023494] [2024-11-11 19:45:32,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:32,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:32,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:32,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963023494] [2024-11-11 19:45:32,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963023494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:32,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:32,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 19:45:32,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907281195] [2024-11-11 19:45:32,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:32,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 19:45:32,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:32,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 19:45:32,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:45:32,528 INFO L87 Difference]: Start difference. First operand 291 states and 354 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) [2024-11-11 19:45:32,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:32,761 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2024-11-11 19:45:32,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 19:45:32,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 [2024-11-11 19:45:32,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:32,763 INFO L225 Difference]: With dead ends: 296 [2024-11-11 19:45:32,763 INFO L226 Difference]: Without dead ends: 294 [2024-11-11 19:45:32,763 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 [2024-11-11 19:45:32,764 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 3 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:32,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 785 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:45:32,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-11 19:45:32,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-11-11 19:45:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 281 states have (on average 1.2704626334519573) internal successors, (357), 293 states have internal predecessors, (357), 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) [2024-11-11 19:45:32,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 357 transitions. [2024-11-11 19:45:32,771 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 357 transitions. Word has length 9 [2024-11-11 19:45:32,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:32,771 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 357 transitions. [2024-11-11 19:45:32,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) [2024-11-11 19:45:32,772 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 357 transitions. [2024-11-11 19:45:32,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-11 19:45:32,772 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:32,772 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:32,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 19:45:32,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)] === [2024-11-11 19:45:32,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:32,773 INFO L85 PathProgramCache]: Analyzing trace with hash -726236111, now seen corresponding path program 1 times [2024-11-11 19:45:32,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:32,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908295318] [2024-11-11 19:45:32,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:32,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:32,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:32,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908295318] [2024-11-11 19:45:32,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908295318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:32,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:32,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:45:32,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268568541] [2024-11-11 19:45:32,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:32,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:45:32,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:32,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:45:32,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:45:32,821 INFO L87 Difference]: Start difference. First operand 294 states and 357 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) [2024-11-11 19:45:33,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:33,238 INFO L93 Difference]: Finished difference Result 294 states and 357 transitions. [2024-11-11 19:45:33,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:45:33,239 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 [2024-11-11 19:45:33,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:33,240 INFO L225 Difference]: With dead ends: 294 [2024-11-11 19:45:33,240 INFO L226 Difference]: Without dead ends: 292 [2024-11-11 19:45:33,240 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 [2024-11-11 19:45:33,241 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 275 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:33,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 286 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 19:45:33,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-11 19:45:33,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2024-11-11 19:45:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 280 states have (on average 1.2678571428571428) internal successors, (355), 291 states have internal predecessors, (355), 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) [2024-11-11 19:45:33,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 355 transitions. [2024-11-11 19:45:33,247 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 355 transitions. Word has length 11 [2024-11-11 19:45:33,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:33,247 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 355 transitions. [2024-11-11 19:45:33,247 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) [2024-11-11 19:45:33,247 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2024-11-11 19:45:33,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-11 19:45:33,248 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:33,248 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:33,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 19:45:33,248 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)] === [2024-11-11 19:45:33,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:33,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1038478869, now seen corresponding path program 1 times [2024-11-11 19:45:33,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:33,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963614349] [2024-11-11 19:45:33,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:33,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:33,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:33,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:33,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963614349] [2024-11-11 19:45:33,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963614349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:33,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:33,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 19:45:33,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733844632] [2024-11-11 19:45:33,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:33,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 19:45:33,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:33,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 19:45:33,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:45:33,291 INFO L87 Difference]: Start difference. First operand 292 states and 355 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2024-11-11 19:45:33,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:33,502 INFO L93 Difference]: Finished difference Result 292 states and 355 transitions. [2024-11-11 19:45:33,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 19:45:33,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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 [2024-11-11 19:45:33,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:33,503 INFO L225 Difference]: With dead ends: 292 [2024-11-11 19:45:33,503 INFO L226 Difference]: Without dead ends: 288 [2024-11-11 19:45:33,504 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 [2024-11-11 19:45:33,504 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 8 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:33,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 768 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:45:33,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-11 19:45:33,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-11-11 19:45:33,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 277 states have (on average 1.2671480144404332) internal successors, (351), 287 states have internal predecessors, (351), 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) [2024-11-11 19:45:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 351 transitions. [2024-11-11 19:45:33,509 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 351 transitions. Word has length 12 [2024-11-11 19:45:33,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:33,509 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 351 transitions. [2024-11-11 19:45:33,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2024-11-11 19:45:33,509 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2024-11-11 19:45:33,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-11 19:45:33,510 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:33,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:33,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 19:45:33,510 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 19:45:33,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:33,511 INFO L85 PathProgramCache]: Analyzing trace with hash -242777879, now seen corresponding path program 1 times [2024-11-11 19:45:33,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:33,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015894941] [2024-11-11 19:45:33,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:33,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:33,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:33,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:33,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015894941] [2024-11-11 19:45:33,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015894941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:33,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:33,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 19:45:33,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400286378] [2024-11-11 19:45:33,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:33,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:45:33,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:33,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:45:33,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:45:33,626 INFO L87 Difference]: Start difference. First operand 288 states and 351 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) [2024-11-11 19:45:33,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:33,948 INFO L93 Difference]: Finished difference Result 313 states and 379 transitions. [2024-11-11 19:45:33,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 19:45:33,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2024-11-11 19:45:33,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:33,950 INFO L225 Difference]: With dead ends: 313 [2024-11-11 19:45:33,950 INFO L226 Difference]: Without dead ends: 311 [2024-11-11 19:45:33,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 19:45:33,952 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 31 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:33,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 831 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 19:45:33,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-11 19:45:33,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 288. [2024-11-11 19:45:33,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 277 states have (on average 1.2671480144404332) internal successors, (351), 287 states have internal predecessors, (351), 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) [2024-11-11 19:45:33,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 351 transitions. [2024-11-11 19:45:33,956 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 351 transitions. Word has length 13 [2024-11-11 19:45:33,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:33,956 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 351 transitions. [2024-11-11 19:45:33,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) [2024-11-11 19:45:33,956 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2024-11-11 19:45:33,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-11 19:45:33,957 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:33,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:33,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 19:45:33,958 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)] === [2024-11-11 19:45:33,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:33,959 INFO L85 PathProgramCache]: Analyzing trace with hash -2112927996, now seen corresponding path program 1 times [2024-11-11 19:45:33,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:33,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873340088] [2024-11-11 19:45:33,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:33,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:33,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:33,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:33,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873340088] [2024-11-11 19:45:33,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873340088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:33,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:33,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:45:33,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738154265] [2024-11-11 19:45:33,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:33,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:45:33,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:33,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:45:33,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:45:33,999 INFO L87 Difference]: Start difference. First operand 288 states and 351 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2024-11-11 19:45:34,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:34,362 INFO L93 Difference]: Finished difference Result 291 states and 354 transitions. [2024-11-11 19:45:34,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:45:34,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2024-11-11 19:45:34,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:34,364 INFO L225 Difference]: With dead ends: 291 [2024-11-11 19:45:34,364 INFO L226 Difference]: Without dead ends: 289 [2024-11-11 19:45:34,364 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 [2024-11-11 19:45:34,364 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 270 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:34,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 272 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 19:45:34,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-11 19:45:34,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2024-11-11 19:45:34,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 276 states have (on average 1.2644927536231885) internal successors, (349), 285 states have internal predecessors, (349), 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) [2024-11-11 19:45:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 349 transitions. [2024-11-11 19:45:34,369 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 349 transitions. Word has length 13 [2024-11-11 19:45:34,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:34,369 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 349 transitions. [2024-11-11 19:45:34,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2024-11-11 19:45:34,369 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 349 transitions. [2024-11-11 19:45:34,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-11 19:45:34,370 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:34,370 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:34,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 19:45:34,370 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 19:45:34,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:34,374 INFO L85 PathProgramCache]: Analyzing trace with hash -2111204092, now seen corresponding path program 1 times [2024-11-11 19:45:34,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:34,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414953946] [2024-11-11 19:45:34,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:34,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:34,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:34,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414953946] [2024-11-11 19:45:34,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414953946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:34,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:34,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:45:34,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934913566] [2024-11-11 19:45:34,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:34,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:45:34,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:34,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:45:34,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:45:34,447 INFO L87 Difference]: Start difference. First operand 286 states and 349 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2024-11-11 19:45:34,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:34,868 INFO L93 Difference]: Finished difference Result 289 states and 352 transitions. [2024-11-11 19:45:34,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:45:34,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2024-11-11 19:45:34,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:34,871 INFO L225 Difference]: With dead ends: 289 [2024-11-11 19:45:34,871 INFO L226 Difference]: Without dead ends: 287 [2024-11-11 19:45:34,872 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 [2024-11-11 19:45:34,872 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 268 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:34,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 266 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 19:45:34,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-11 19:45:34,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2024-11-11 19:45:34,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 275 states have (on average 1.2618181818181817) internal successors, (347), 283 states have internal predecessors, (347), 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) [2024-11-11 19:45:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 347 transitions. [2024-11-11 19:45:34,876 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 347 transitions. Word has length 13 [2024-11-11 19:45:34,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:34,876 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 347 transitions. [2024-11-11 19:45:34,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2024-11-11 19:45:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 347 transitions. [2024-11-11 19:45:34,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-11 19:45:34,877 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:34,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:34,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 19:45:34,877 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)] === [2024-11-11 19:45:34,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:34,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1076254322, now seen corresponding path program 1 times [2024-11-11 19:45:34,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:34,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654426496] [2024-11-11 19:45:34,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:34,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:34,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:34,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:34,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654426496] [2024-11-11 19:45:34,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654426496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:34,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:34,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 19:45:34,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153850051] [2024-11-11 19:45:34,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:34,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:45:34,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:34,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:45:34,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:45:34,979 INFO L87 Difference]: Start difference. First operand 284 states and 347 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) [2024-11-11 19:45:35,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:35,298 INFO L93 Difference]: Finished difference Result 303 states and 369 transitions. [2024-11-11 19:45:35,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:45:35,299 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 [2024-11-11 19:45:35,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:35,300 INFO L225 Difference]: With dead ends: 303 [2024-11-11 19:45:35,300 INFO L226 Difference]: Without dead ends: 301 [2024-11-11 19:45:35,300 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 [2024-11-11 19:45:35,301 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 23 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:35,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 815 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 19:45:35,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-11 19:45:35,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 292. [2024-11-11 19:45:35,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 283 states have (on average 1.2614840989399294) internal successors, (357), 291 states have internal predecessors, (357), 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) [2024-11-11 19:45:35,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 357 transitions. [2024-11-11 19:45:35,307 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 357 transitions. Word has length 14 [2024-11-11 19:45:35,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:35,307 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 357 transitions. [2024-11-11 19:45:35,307 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) [2024-11-11 19:45:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 357 transitions. [2024-11-11 19:45:35,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-11 19:45:35,308 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:35,308 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:35,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 19:45:35,308 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 19:45:35,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:35,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1074707177, now seen corresponding path program 1 times [2024-11-11 19:45:35,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:35,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641906597] [2024-11-11 19:45:35,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:35,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:35,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:35,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:35,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641906597] [2024-11-11 19:45:35,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641906597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:35,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:35,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:45:35,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129642601] [2024-11-11 19:45:35,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:35,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:45:35,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:35,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:45:35,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:45:35,347 INFO L87 Difference]: Start difference. First operand 292 states and 357 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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) [2024-11-11 19:45:35,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:35,738 INFO L93 Difference]: Finished difference Result 292 states and 357 transitions. [2024-11-11 19:45:35,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:45:35,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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 [2024-11-11 19:45:35,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:35,739 INFO L225 Difference]: With dead ends: 292 [2024-11-11 19:45:35,739 INFO L226 Difference]: Without dead ends: 290 [2024-11-11 19:45:35,739 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 [2024-11-11 19:45:35,740 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 265 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:35,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 260 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 19:45:35,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-11 19:45:35,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2024-11-11 19:45:35,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 282 states have (on average 1.2588652482269505) internal successors, (355), 289 states have internal predecessors, (355), 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) [2024-11-11 19:45:35,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 355 transitions. [2024-11-11 19:45:35,744 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 355 transitions. Word has length 14 [2024-11-11 19:45:35,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:35,744 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 355 transitions. [2024-11-11 19:45:35,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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) [2024-11-11 19:45:35,744 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 355 transitions. [2024-11-11 19:45:35,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-11 19:45:35,745 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:35,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:35,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 19:45:35,745 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 19:45:35,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:35,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1022813242, now seen corresponding path program 1 times [2024-11-11 19:45:35,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:35,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348529414] [2024-11-11 19:45:35,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:35,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:35,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:35,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:35,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348529414] [2024-11-11 19:45:35,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348529414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:35,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:35,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 19:45:35,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095948769] [2024-11-11 19:45:35,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:35,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:45:35,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:35,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:45:35,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:45:35,812 INFO L87 Difference]: Start difference. First operand 290 states and 355 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) [2024-11-11 19:45:36,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:36,121 INFO L93 Difference]: Finished difference Result 300 states and 365 transitions. [2024-11-11 19:45:36,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:45:36,121 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 [2024-11-11 19:45:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:36,123 INFO L225 Difference]: With dead ends: 300 [2024-11-11 19:45:36,123 INFO L226 Difference]: Without dead ends: 296 [2024-11-11 19:45:36,123 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 [2024-11-11 19:45:36,123 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 21 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:36,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 807 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 19:45:36,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-11 19:45:36,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 291. [2024-11-11 19:45:36,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 283 states have (on average 1.2579505300353357) internal successors, (356), 290 states have internal predecessors, (356), 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) [2024-11-11 19:45:36,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 356 transitions. [2024-11-11 19:45:36,128 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 356 transitions. Word has length 14 [2024-11-11 19:45:36,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:36,128 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 356 transitions. [2024-11-11 19:45:36,129 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) [2024-11-11 19:45:36,129 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 356 transitions. [2024-11-11 19:45:36,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 19:45:36,129 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:36,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:36,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 19:45:36,129 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 19:45:36,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:36,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1043820030, now seen corresponding path program 1 times [2024-11-11 19:45:36,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:36,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463239811] [2024-11-11 19:45:36,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:36,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:36,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:36,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:36,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463239811] [2024-11-11 19:45:36,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463239811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:36,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:36,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 19:45:36,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029950149] [2024-11-11 19:45:36,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:36,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:45:36,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:36,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:45:36,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:45:36,195 INFO L87 Difference]: Start difference. First operand 291 states and 356 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) [2024-11-11 19:45:36,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:36,529 INFO L93 Difference]: Finished difference Result 296 states and 361 transitions. [2024-11-11 19:45:36,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:45:36,529 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 [2024-11-11 19:45:36,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:36,530 INFO L225 Difference]: With dead ends: 296 [2024-11-11 19:45:36,531 INFO L226 Difference]: Without dead ends: 294 [2024-11-11 19:45:36,531 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 [2024-11-11 19:45:36,531 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 17 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:36,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 811 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 19:45:36,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-11 19:45:36,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-11-11 19:45:36,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 286 states have (on average 1.2552447552447552) internal successors, (359), 293 states have internal predecessors, (359), 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) [2024-11-11 19:45:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 359 transitions. [2024-11-11 19:45:36,535 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 359 transitions. Word has length 15 [2024-11-11 19:45:36,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:36,535 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 359 transitions. [2024-11-11 19:45:36,535 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) [2024-11-11 19:45:36,536 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 359 transitions. [2024-11-11 19:45:36,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 19:45:36,536 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:36,536 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:36,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 19:45:36,536 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 19:45:36,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:36,537 INFO L85 PathProgramCache]: Analyzing trace with hash 806842801, now seen corresponding path program 1 times [2024-11-11 19:45:36,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:36,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586938729] [2024-11-11 19:45:36,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:36,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:36,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:36,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:36,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586938729] [2024-11-11 19:45:36,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586938729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:36,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:36,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 19:45:36,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812224434] [2024-11-11 19:45:36,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:36,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 19:45:36,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:36,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 19:45:36,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:45:36,575 INFO L87 Difference]: Start difference. First operand 294 states and 359 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2024-11-11 19:45:36,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:36,833 INFO L93 Difference]: Finished difference Result 294 states and 359 transitions. [2024-11-11 19:45:36,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 19:45:36,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2024-11-11 19:45:36,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:36,834 INFO L225 Difference]: With dead ends: 294 [2024-11-11 19:45:36,835 INFO L226 Difference]: Without dead ends: 292 [2024-11-11 19:45:36,835 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 [2024-11-11 19:45:36,835 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 321 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:36,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 426 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:45:36,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-11 19:45:36,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2024-11-11 19:45:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 285 states have (on average 1.2526315789473683) internal successors, (357), 291 states have internal predecessors, (357), 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) [2024-11-11 19:45:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 357 transitions. [2024-11-11 19:45:36,840 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 357 transitions. Word has length 16 [2024-11-11 19:45:36,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:36,840 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 357 transitions. [2024-11-11 19:45:36,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2024-11-11 19:45:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 357 transitions. [2024-11-11 19:45:36,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-11 19:45:36,841 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:36,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:36,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 19:45:36,842 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 19:45:36,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:36,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1029635725, now seen corresponding path program 1 times [2024-11-11 19:45:36,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:36,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755738834] [2024-11-11 19:45:36,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:36,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:36,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:36,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:36,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755738834] [2024-11-11 19:45:36,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755738834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:36,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:36,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 19:45:36,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605779826] [2024-11-11 19:45:36,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:36,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:45:36,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:36,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:45:36,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:45:36,939 INFO L87 Difference]: Start difference. First operand 292 states and 357 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) [2024-11-11 19:45:37,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:37,398 INFO L93 Difference]: Finished difference Result 292 states and 357 transitions. [2024-11-11 19:45:37,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:45:37,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2024-11-11 19:45:37,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:37,399 INFO L225 Difference]: With dead ends: 292 [2024-11-11 19:45:37,399 INFO L226 Difference]: Without dead ends: 290 [2024-11-11 19:45:37,401 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 [2024-11-11 19:45:37,401 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 464 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:37,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 178 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 19:45:37,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-11 19:45:37,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2024-11-11 19:45:37,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 281 states have (on average 1.2526690391459074) internal successors, (352), 286 states have internal predecessors, (352), 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) [2024-11-11 19:45:37,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 352 transitions. [2024-11-11 19:45:37,405 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 352 transitions. Word has length 17 [2024-11-11 19:45:37,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:37,405 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 352 transitions. [2024-11-11 19:45:37,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) [2024-11-11 19:45:37,405 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 352 transitions. [2024-11-11 19:45:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-11 19:45:37,406 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:37,406 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:37,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 19:45:37,406 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 19:45:37,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:37,407 INFO L85 PathProgramCache]: Analyzing trace with hash -757672814, now seen corresponding path program 1 times [2024-11-11 19:45:37,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:37,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996184615] [2024-11-11 19:45:37,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:37,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:37,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:37,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:37,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996184615] [2024-11-11 19:45:37,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996184615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:37,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:37,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 19:45:37,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473671416] [2024-11-11 19:45:37,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:37,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 19:45:37,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:37,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 19:45:37,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:45:37,449 INFO L87 Difference]: Start difference. First operand 287 states and 352 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2024-11-11 19:45:37,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:37,818 INFO L93 Difference]: Finished difference Result 287 states and 352 transitions. [2024-11-11 19:45:37,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 19:45:37,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2024-11-11 19:45:37,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:37,820 INFO L225 Difference]: With dead ends: 287 [2024-11-11 19:45:37,820 INFO L226 Difference]: Without dead ends: 283 [2024-11-11 19:45:37,820 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 [2024-11-11 19:45:37,820 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 6 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:37,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 732 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 19:45:37,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-11 19:45:37,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-11-11 19:45:37,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 278 states have (on average 1.2517985611510791) internal successors, (348), 282 states have internal predecessors, (348), 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) [2024-11-11 19:45:37,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 348 transitions. [2024-11-11 19:45:37,824 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 348 transitions. Word has length 17 [2024-11-11 19:45:37,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:37,825 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 348 transitions. [2024-11-11 19:45:37,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2024-11-11 19:45:37,825 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 348 transitions. [2024-11-11 19:45:37,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-11 19:45:37,825 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:37,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:37,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 19:45:37,825 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 19:45:37,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:37,826 INFO L85 PathProgramCache]: Analyzing trace with hash -476651758, now seen corresponding path program 1 times [2024-11-11 19:45:37,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:37,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840337746] [2024-11-11 19:45:37,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:37,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:37,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:37,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:37,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840337746] [2024-11-11 19:45:37,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840337746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:37,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:37,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 19:45:37,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014553250] [2024-11-11 19:45:37,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:37,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:45:37,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:37,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:45:37,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:45:37,929 INFO L87 Difference]: Start difference. First operand 283 states and 348 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) [2024-11-11 19:45:38,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:38,341 INFO L93 Difference]: Finished difference Result 283 states and 348 transitions. [2024-11-11 19:45:38,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:45:38,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2024-11-11 19:45:38,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:38,342 INFO L225 Difference]: With dead ends: 283 [2024-11-11 19:45:38,342 INFO L226 Difference]: Without dead ends: 281 [2024-11-11 19:45:38,342 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 [2024-11-11 19:45:38,343 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 656 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:38,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 161 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 19:45:38,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-11 19:45:38,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2024-11-11 19:45:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 275 states have (on average 1.250909090909091) internal successors, (344), 278 states have internal predecessors, (344), 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) [2024-11-11 19:45:38,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 344 transitions. [2024-11-11 19:45:38,346 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 344 transitions. Word has length 18 [2024-11-11 19:45:38,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:38,346 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 344 transitions. [2024-11-11 19:45:38,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) [2024-11-11 19:45:38,346 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 344 transitions. [2024-11-11 19:45:38,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-11 19:45:38,346 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:38,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:38,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 19:45:38,347 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 19:45:38,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:38,347 INFO L85 PathProgramCache]: Analyzing trace with hash -423210678, now seen corresponding path program 1 times [2024-11-11 19:45:38,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:38,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063701316] [2024-11-11 19:45:38,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:38,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:38,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:38,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:38,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063701316] [2024-11-11 19:45:38,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063701316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:38,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:38,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 19:45:38,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567490485] [2024-11-11 19:45:38,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:38,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:45:38,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:38,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:45:38,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:45:38,417 INFO L87 Difference]: Start difference. First operand 279 states and 344 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) [2024-11-11 19:45:38,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:38,759 INFO L93 Difference]: Finished difference Result 279 states and 344 transitions. [2024-11-11 19:45:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:45:38,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2024-11-11 19:45:38,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:38,760 INFO L225 Difference]: With dead ends: 279 [2024-11-11 19:45:38,760 INFO L226 Difference]: Without dead ends: 275 [2024-11-11 19:45:38,761 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 [2024-11-11 19:45:38,761 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 656 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:38,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 153 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 19:45:38,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-11 19:45:38,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-11-11 19:45:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 272 states have (on average 1.25) internal successors, (340), 274 states have internal predecessors, (340), 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) [2024-11-11 19:45:38,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 340 transitions. [2024-11-11 19:45:38,765 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 340 transitions. Word has length 18 [2024-11-11 19:45:38,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:38,765 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 340 transitions. [2024-11-11 19:45:38,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) [2024-11-11 19:45:38,765 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 340 transitions. [2024-11-11 19:45:38,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-11 19:45:38,765 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:38,765 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:38,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 19:45:38,766 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 19:45:38,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:38,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1997901656, now seen corresponding path program 1 times [2024-11-11 19:45:38,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:38,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229156909] [2024-11-11 19:45:38,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:38,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:38,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:38,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:38,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229156909] [2024-11-11 19:45:38,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229156909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:38,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:38,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 19:45:38,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990676609] [2024-11-11 19:45:38,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:38,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:45:38,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:38,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:45:38,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:45:38,825 INFO L87 Difference]: Start difference. First operand 275 states and 340 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) [2024-11-11 19:45:39,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:39,216 INFO L93 Difference]: Finished difference Result 275 states and 340 transitions. [2024-11-11 19:45:39,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:45:39,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2024-11-11 19:45:39,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:39,217 INFO L225 Difference]: With dead ends: 275 [2024-11-11 19:45:39,217 INFO L226 Difference]: Without dead ends: 250 [2024-11-11 19:45:39,218 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 [2024-11-11 19:45:39,218 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 454 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:39,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 150 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 19:45:39,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-11 19:45:39,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2024-11-11 19:45:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 248 states have (on average 1.0080645161290323) internal successors, (250), 249 states have internal predecessors, (250), 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) [2024-11-11 19:45:39,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2024-11-11 19:45:39,223 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 18 [2024-11-11 19:45:39,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:39,223 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2024-11-11 19:45:39,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) [2024-11-11 19:45:39,223 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2024-11-11 19:45:39,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-11 19:45:39,227 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:39,228 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, 1] [2024-11-11 19:45:39,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 19:45:39,228 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 19:45:39,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:39,229 INFO L85 PathProgramCache]: Analyzing trace with hash -707619029, now seen corresponding path program 1 times [2024-11-11 19:45:39,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:39,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646254962] [2024-11-11 19:45:39,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:39,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:42,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:42,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:42,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646254962] [2024-11-11 19:45:42,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646254962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:42,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:42,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2024-11-11 19:45:42,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363714805] [2024-11-11 19:45:42,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:42,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-11-11 19:45:42,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:42,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-11-11 19:45:42,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1834, Invalid=2072, Unknown=0, NotChecked=0, Total=3906 [2024-11-11 19:45:42,186 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand has 63 states, 63 states have (on average 3.873015873015873) internal successors, (244), 63 states have internal predecessors, (244), 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) [2024-11-11 19:45:42,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:42,733 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2024-11-11 19:45:42,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-11 19:45:42,734 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 3.873015873015873) internal successors, (244), 63 states have internal predecessors, (244), 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 244 [2024-11-11 19:45:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:42,736 INFO L225 Difference]: With dead ends: 250 [2024-11-11 19:45:42,736 INFO L226 Difference]: Without dead ends: 248 [2024-11-11 19:45:42,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1896, Invalid=2136, Unknown=0, NotChecked=0, Total=4032 [2024-11-11 19:45:42,738 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 36 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:42,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 22 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 19:45:42,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-11 19:45:42,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2024-11-11 19:45:42,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.0040485829959513) internal successors, (248), 247 states have internal predecessors, (248), 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) [2024-11-11 19:45:42,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2024-11-11 19:45:42,741 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 244 [2024-11-11 19:45:42,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:42,741 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2024-11-11 19:45:42,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 3.873015873015873) internal successors, (244), 63 states have internal predecessors, (244), 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) [2024-11-11 19:45:42,741 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2024-11-11 19:45:42,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-11 19:45:42,742 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:42,743 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, 1, 1] [2024-11-11 19:45:42,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 19:45:42,743 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 19:45:42,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:42,743 INFO L85 PathProgramCache]: Analyzing trace with hash -461348049, now seen corresponding path program 1 times [2024-11-11 19:45:42,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:42,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598368412] [2024-11-11 19:45:42,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:42,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:43,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:43,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598368412] [2024-11-11 19:45:43,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598368412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:43,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:43,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 19:45:43,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773808016] [2024-11-11 19:45:43,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:43,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:45:43,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:43,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:45:43,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:45:43,237 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand has 6 states, 6 states have (on average 40.833333333333336) internal successors, (245), 6 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) [2024-11-11 19:45:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:43,581 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2024-11-11 19:45:43,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:45:43,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.833333333333336) internal successors, (245), 6 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) Word has length 245 [2024-11-11 19:45:43,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:43,582 INFO L225 Difference]: With dead ends: 248 [2024-11-11 19:45:43,582 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 19:45:43,583 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 [2024-11-11 19:45:43,584 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 421 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:43,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 11 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 19:45:43,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 19:45:43,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 19:45:43,584 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) [2024-11-11 19:45:43,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 19:45:43,584 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 245 [2024-11-11 19:45:43,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:43,584 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 19:45:43,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.833333333333336) internal successors, (245), 6 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) [2024-11-11 19:45:43,585 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 19:45:43,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 19:45:43,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2024-11-11 19:45:43,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2024-11-11 19:45:43,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2024-11-11 19:45:43,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2024-11-11 19:45:43,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2024-11-11 19:45:43,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2024-11-11 19:45:43,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2024-11-11 19:45:43,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2024-11-11 19:45:43,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2024-11-11 19:45:43,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2024-11-11 19:45:43,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2024-11-11 19:45:43,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2024-11-11 19:45:43,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2024-11-11 19:45:43,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2024-11-11 19:45:43,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2024-11-11 19:45:43,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2024-11-11 19:45:43,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 19:45:43,592 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:43,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 19:45:43,599 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 19:45:43,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 07:45:43 BoogieIcfgContainer [2024-11-11 19:45:43,605 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 19:45:43,606 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 19:45:43,606 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 19:45:43,606 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 19:45:43,606 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:45:30" (3/4) ... [2024-11-11 19:45:43,608 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 19:45:43,627 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-11 19:45:43,628 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 19:45:43,630 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 19:45:43,631 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 19:45:43,770 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 19:45:43,771 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 19:45:43,771 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 19:45:43,771 INFO L158 Benchmark]: Toolchain (without parser) took 15560.78ms. Allocated memory was 188.7MB in the beginning and 427.8MB in the end (delta: 239.1MB). Free memory was 119.3MB in the beginning and 350.3MB in the end (delta: -231.0MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-11-11 19:45:43,772 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 19:45:43,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 734.13ms. Allocated memory is still 188.7MB. Free memory was 119.0MB in the beginning and 149.6MB in the end (delta: -30.6MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2024-11-11 19:45:43,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.81ms. Allocated memory is still 188.7MB. Free memory was 149.6MB in the beginning and 142.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-11 19:45:43,772 INFO L158 Benchmark]: Boogie Preprocessor took 114.41ms. Allocated memory is still 188.7MB. Free memory was 142.4MB in the beginning and 134.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 19:45:43,772 INFO L158 Benchmark]: RCFGBuilder took 1045.14ms. Allocated memory is still 188.7MB. Free memory was 134.0MB in the beginning and 96.0MB in the end (delta: 38.0MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. [2024-11-11 19:45:43,772 INFO L158 Benchmark]: TraceAbstraction took 13435.24ms. Allocated memory was 188.7MB in the beginning and 427.8MB in the end (delta: 239.1MB). Free memory was 96.0MB in the beginning and 374.4MB in the end (delta: -278.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 19:45:43,773 INFO L158 Benchmark]: Witness Printer took 165.45ms. Allocated memory is still 427.8MB. Free memory was 373.3MB in the beginning and 350.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-11 19:45:43,774 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.15ms. Allocated memory is still 121.6MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 734.13ms. Allocated memory is still 188.7MB. Free memory was 119.0MB in the beginning and 149.6MB in the end (delta: -30.6MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.81ms. Allocated memory is still 188.7MB. Free memory was 149.6MB in the beginning and 142.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.41ms. Allocated memory is still 188.7MB. Free memory was 142.4MB in the beginning and 134.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1045.14ms. Allocated memory is still 188.7MB. Free memory was 134.0MB in the beginning and 96.0MB in the end (delta: 38.0MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. * TraceAbstraction took 13435.24ms. Allocated memory was 188.7MB in the beginning and 427.8MB in the end (delta: 239.1MB). Free memory was 96.0MB in the beginning and 374.4MB in the end (delta: -278.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 165.45ms. Allocated memory is still 427.8MB. Free memory was 373.3MB in the beginning and 350.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. 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: 13.3s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4960 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4960 mSDsluCounter, 9303 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5368 mSDsCounter, 1325 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12255 IncrementalHoareTripleChecker+Invalid, 13580 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1325 mSolverCounterUnsat, 3935 mSDtfsCounter, 12255 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=0, InterpolantAutomatonStates: 161, 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, 21 MinimizatonAttempts, 55 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 744 NumberOfCodeBlocks, 744 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 723 ConstructedInterpolants, 0 QuantifiedInterpolants, 1783 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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 - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-11 19:45:43,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE