./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-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 133ba40f5b51c272364c51a4e246bcd97a40cd88b0bcd4bd92df8f8d6bb23a52 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:33:10,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:33:10,849 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:33:10,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:33:10,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:33:10,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:33:10,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:33:10,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:33:10,878 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:33:10,878 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:33:10,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:33:10,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:33:10,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:33:10,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:33:10,880 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:33:10,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:33:10,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:33:10,881 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:33:10,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:33:10,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:33:10,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:33:10,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:33:10,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:33:10,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:33:10,884 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:33:10,884 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:33:10,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:33:10,885 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:33:10,885 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:33:10,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:33:10,886 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:33:10,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:33:10,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:33:10,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:33:10,887 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:33:10,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:33:10,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:33:10,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:33:10,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:33:10,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:33:10,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:33:10,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:33:10,892 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 -> 133ba40f5b51c272364c51a4e246bcd97a40cd88b0bcd4bd92df8f8d6bb23a52 [2024-10-12 18:33:11,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:33:11,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:33:11,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:33:11,188 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:33:11,189 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:33:11,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2024-10-12 18:33:12,704 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:33:12,912 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:33:12,914 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2024-10-12 18:33:12,923 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9358e993d/337e41555d4543379e0b51f3580c4eee/FLAG4942c0b72 [2024-10-12 18:33:12,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9358e993d/337e41555d4543379e0b51f3580c4eee [2024-10-12 18:33:12,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:33:12,941 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:33:12,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:33:12,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:33:12,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:33:12,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:33:12" (1/1) ... [2024-10-12 18:33:12,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7918a592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:12, skipping insertion in model container [2024-10-12 18:33:12,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:33:12" (1/1) ... [2024-10-12 18:33:12,986 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:33:13,171 WARN L248 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.v+lhb-reducer.c[1224,1237] [2024-10-12 18:33:13,179 WARN L248 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.v+lhb-reducer.c[1636,1649] [2024-10-12 18:33:13,183 WARN L248 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.v+lhb-reducer.c[1851,1864] [2024-10-12 18:33:13,190 WARN L248 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.v+lhb-reducer.c[2384,2397] [2024-10-12 18:33:13,196 WARN L248 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.v+lhb-reducer.c[2599,2612] [2024-10-12 18:33:13,198 WARN L248 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.v+lhb-reducer.c[2901,2914] [2024-10-12 18:33:13,202 WARN L248 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.v+lhb-reducer.c[3116,3129] [2024-10-12 18:33:13,206 WARN L248 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.v+lhb-reducer.c[3386,3399] [2024-10-12 18:33:13,210 WARN L248 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.v+lhb-reducer.c[3604,3617] [2024-10-12 18:33:13,215 WARN L248 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.v+lhb-reducer.c[4088,4101] [2024-10-12 18:33:13,216 WARN L248 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.v+lhb-reducer.c[4306,4319] [2024-10-12 18:33:13,220 WARN L248 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.v+lhb-reducer.c[4802,4815] [2024-10-12 18:33:13,224 WARN L248 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.v+lhb-reducer.c[5203,5216] [2024-10-12 18:33:13,227 WARN L248 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.v+lhb-reducer.c[5421,5434] [2024-10-12 18:33:13,229 WARN L248 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.v+lhb-reducer.c[5792,5805] [2024-10-12 18:33:13,230 WARN L248 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.v+lhb-reducer.c[6010,6023] [2024-10-12 18:33:13,232 WARN L248 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.v+lhb-reducer.c[6296,6309] [2024-10-12 18:33:13,235 WARN L248 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.v+lhb-reducer.c[6514,6527] [2024-10-12 18:33:13,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:33:13,259 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:33:13,274 WARN L248 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.v+lhb-reducer.c[1224,1237] [2024-10-12 18:33:13,279 WARN L248 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.v+lhb-reducer.c[1636,1649] [2024-10-12 18:33:13,282 WARN L248 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.v+lhb-reducer.c[1851,1864] [2024-10-12 18:33:13,288 WARN L248 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.v+lhb-reducer.c[2384,2397] [2024-10-12 18:33:13,292 WARN L248 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.v+lhb-reducer.c[2599,2612] [2024-10-12 18:33:13,295 WARN L248 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.v+lhb-reducer.c[2901,2914] [2024-10-12 18:33:13,298 WARN L248 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.v+lhb-reducer.c[3116,3129] [2024-10-12 18:33:13,301 WARN L248 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.v+lhb-reducer.c[3386,3399] [2024-10-12 18:33:13,304 WARN L248 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.v+lhb-reducer.c[3604,3617] [2024-10-12 18:33:13,310 WARN L248 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.v+lhb-reducer.c[4088,4101] [2024-10-12 18:33:13,311 WARN L248 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.v+lhb-reducer.c[4306,4319] [2024-10-12 18:33:13,315 WARN L248 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.v+lhb-reducer.c[4802,4815] [2024-10-12 18:33:13,317 WARN L248 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.v+lhb-reducer.c[5203,5216] [2024-10-12 18:33:13,321 WARN L248 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.v+lhb-reducer.c[5421,5434] [2024-10-12 18:33:13,322 WARN L248 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.v+lhb-reducer.c[5792,5805] [2024-10-12 18:33:13,323 WARN L248 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.v+lhb-reducer.c[6010,6023] [2024-10-12 18:33:13,324 WARN L248 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.v+lhb-reducer.c[6296,6309] [2024-10-12 18:33:13,325 WARN L248 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.v+lhb-reducer.c[6514,6527] [2024-10-12 18:33:13,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:33:13,348 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:33:13,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:13 WrapperNode [2024-10-12 18:33:13,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:33:13,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:33:13,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:33:13,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:33:13,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:13" (1/1) ... [2024-10-12 18:33:13,369 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:13" (1/1) ... [2024-10-12 18:33:13,403 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 278 [2024-10-12 18:33:13,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:33:13,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:33:13,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:33:13,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:33:13,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:13" (1/1) ... [2024-10-12 18:33:13,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:13" (1/1) ... [2024-10-12 18:33:13,417 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:13" (1/1) ... [2024-10-12 18:33:13,435 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-10-12 18:33:13,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:13" (1/1) ... [2024-10-12 18:33:13,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:13" (1/1) ... [2024-10-12 18:33:13,445 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:13" (1/1) ... [2024-10-12 18:33:13,450 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:13" (1/1) ... [2024-10-12 18:33:13,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:13" (1/1) ... [2024-10-12 18:33:13,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:13" (1/1) ... [2024-10-12 18:33:13,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:33:13,472 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:33:13,473 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:33:13,473 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:33:13,475 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:13" (1/1) ... [2024-10-12 18:33:13,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:33:13,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:33:13,508 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-10-12 18:33:13,514 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-10-12 18:33:13,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:33:13,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:33:13,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:33:13,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:33:13,670 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:33:13,672 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:33:14,015 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-10-12 18:33:14,016 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:33:14,057 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:33:14,060 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 18:33:14,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:33:14 BoogieIcfgContainer [2024-10-12 18:33:14,060 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:33:14,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:33:14,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:33:14,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:33:14,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:33:12" (1/3) ... [2024-10-12 18:33:14,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b38a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:33:14, skipping insertion in model container [2024-10-12 18:33:14,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:13" (2/3) ... [2024-10-12 18:33:14,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b38a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:33:14, skipping insertion in model container [2024-10-12 18:33:14,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:33:14" (3/3) ... [2024-10-12 18:33:14,072 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2024-10-12 18:33:14,092 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:33:14,093 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-10-12 18:33:14,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:33:14,182 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;@780d1d33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:33:14,183 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-10-12 18:33:14,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 72 states have internal predecessors, (102), 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-10-12 18:33:14,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 18:33:14,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:14,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:14,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-10-12 18:33:14,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:14,203 INFO L85 PathProgramCache]: Analyzing trace with hash 786284628, now seen corresponding path program 1 times [2024-10-12 18:33:14,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:14,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533494777] [2024-10-12 18:33:14,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:14,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:14,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:14,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533494777] [2024-10-12 18:33:14,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533494777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:14,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:14,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:33:14,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353350671] [2024-10-12 18:33:14,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:14,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:33:14,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:14,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:33:14,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:33:14,610 INFO L87 Difference]: Start difference. First operand has 73 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 72 states have internal predecessors, (102), 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-10-12 18:33:14,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:14,790 INFO L93 Difference]: Finished difference Result 78 states and 106 transitions. [2024-10-12 18:33:14,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:33:14,793 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-10-12 18:33:14,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:14,802 INFO L225 Difference]: With dead ends: 78 [2024-10-12 18:33:14,802 INFO L226 Difference]: Without dead ends: 70 [2024-10-12 18:33:14,805 INFO L431 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-10-12 18:33:14,809 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 9 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:14,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 185 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:14,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-12 18:33:14,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-10-12 18:33:14,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.411764705882353) internal successors, (72), 67 states have internal predecessors, (72), 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-10-12 18:33:14,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2024-10-12 18:33:14,851 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 7 [2024-10-12 18:33:14,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:14,851 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2024-10-12 18:33:14,852 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-10-12 18:33:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2024-10-12 18:33:14,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 18:33:14,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:14,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:14,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:33:14,853 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-10-12 18:33:14,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:14,854 INFO L85 PathProgramCache]: Analyzing trace with hash 782713684, now seen corresponding path program 1 times [2024-10-12 18:33:14,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:14,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803054211] [2024-10-12 18:33:14,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:14,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:14,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:14,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:14,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803054211] [2024-10-12 18:33:14,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803054211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:14,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:14,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:33:14,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941946033] [2024-10-12 18:33:14,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:14,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:33:14,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:14,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:33:14,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:33:14,991 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:33:15,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:15,072 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2024-10-12 18:33:15,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:33:15,073 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-10-12 18:33:15,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:15,075 INFO L225 Difference]: With dead ends: 70 [2024-10-12 18:33:15,075 INFO L226 Difference]: Without dead ends: 68 [2024-10-12 18:33:15,076 INFO L431 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-10-12 18:33:15,077 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 5 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:15,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 160 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:15,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-12 18:33:15,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-10-12 18:33:15,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 50 states have (on average 1.4) internal successors, (70), 65 states have internal predecessors, (70), 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-10-12 18:33:15,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2024-10-12 18:33:15,083 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 7 [2024-10-12 18:33:15,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:15,084 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2024-10-12 18:33:15,084 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-10-12 18:33:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2024-10-12 18:33:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 18:33:15,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:15,085 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:15,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:33:15,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-10-12 18:33:15,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:15,086 INFO L85 PathProgramCache]: Analyzing trace with hash -542291522, now seen corresponding path program 1 times [2024-10-12 18:33:15,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:15,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657355303] [2024-10-12 18:33:15,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:15,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:15,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-10-12 18:33:15,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:15,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657355303] [2024-10-12 18:33:15,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657355303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:15,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:15,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:33:15,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939008393] [2024-10-12 18:33:15,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:15,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:33:15,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:15,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:33:15,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:33:15,196 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:33:15,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:15,300 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2024-10-12 18:33:15,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:33:15,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-12 18:33:15,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:15,302 INFO L225 Difference]: With dead ends: 68 [2024-10-12 18:33:15,302 INFO L226 Difference]: Without dead ends: 66 [2024-10-12 18:33:15,302 INFO L431 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-10-12 18:33:15,303 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 46 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:15,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 124 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:15,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-12 18:33:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-10-12 18:33:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 63 states have internal predecessors, (68), 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-10-12 18:33:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2024-10-12 18:33:15,315 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 10 [2024-10-12 18:33:15,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:15,316 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2024-10-12 18:33:15,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:33:15,316 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2024-10-12 18:33:15,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 18:33:15,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:15,318 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:15,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 18:33:15,318 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-10-12 18:33:15,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:15,319 INFO L85 PathProgramCache]: Analyzing trace with hash 449783979, now seen corresponding path program 1 times [2024-10-12 18:33:15,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:15,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874414401] [2024-10-12 18:33:15,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:15,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:15,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:15,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874414401] [2024-10-12 18:33:15,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874414401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:15,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:15,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:33:15,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427125600] [2024-10-12 18:33:15,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:15,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:33:15,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:15,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:33:15,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:33:15,402 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:33:15,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:15,492 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2024-10-12 18:33:15,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:33:15,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-12 18:33:15,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:15,494 INFO L225 Difference]: With dead ends: 66 [2024-10-12 18:33:15,494 INFO L226 Difference]: Without dead ends: 64 [2024-10-12 18:33:15,495 INFO L431 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-10-12 18:33:15,496 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 44 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:15,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 118 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:15,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-12 18:33:15,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-10-12 18:33:15,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.375) internal successors, (66), 61 states have internal predecessors, (66), 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-10-12 18:33:15,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2024-10-12 18:33:15,502 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 10 [2024-10-12 18:33:15,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:15,503 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2024-10-12 18:33:15,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:33:15,503 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2024-10-12 18:33:15,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-12 18:33:15,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:15,504 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:15,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 18:33:15,504 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-10-12 18:33:15,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:15,505 INFO L85 PathProgramCache]: Analyzing trace with hash 368836189, now seen corresponding path program 1 times [2024-10-12 18:33:15,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:15,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091192304] [2024-10-12 18:33:15,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:15,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:15,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:15,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:15,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091192304] [2024-10-12 18:33:15,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091192304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:15,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:15,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:33:15,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484738813] [2024-10-12 18:33:15,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:15,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:33:15,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:15,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:33:15,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:33:15,573 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-10-12 18:33:15,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:15,622 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2024-10-12 18:33:15,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:33:15,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-10-12 18:33:15,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:15,623 INFO L225 Difference]: With dead ends: 64 [2024-10-12 18:33:15,623 INFO L226 Difference]: Without dead ends: 60 [2024-10-12 18:33:15,623 INFO L431 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-10-12 18:33:15,624 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 9 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:15,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 136 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:33:15,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-12 18:33:15,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-10-12 18:33:15,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 57 states have internal predecessors, (62), 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-10-12 18:33:15,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2024-10-12 18:33:15,631 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 11 [2024-10-12 18:33:15,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:15,632 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2024-10-12 18:33:15,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-10-12 18:33:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2024-10-12 18:33:15,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-12 18:33:15,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:15,632 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:15,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 18:33:15,633 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-10-12 18:33:15,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:15,637 INFO L85 PathProgramCache]: Analyzing trace with hash 369324761, now seen corresponding path program 1 times [2024-10-12 18:33:15,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:15,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306649673] [2024-10-12 18:33:15,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:15,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:15,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:15,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:15,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306649673] [2024-10-12 18:33:15,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306649673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:15,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:15,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:33:15,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658022489] [2024-10-12 18:33:15,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:15,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:33:15,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:15,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:33:15,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:33:15,704 INFO L87 Difference]: Start difference. First operand 58 states and 62 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-10-12 18:33:15,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:15,789 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2024-10-12 18:33:15,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:33:15,789 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-10-12 18:33:15,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:15,790 INFO L225 Difference]: With dead ends: 60 [2024-10-12 18:33:15,790 INFO L226 Difference]: Without dead ends: 58 [2024-10-12 18:33:15,790 INFO L431 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-10-12 18:33:15,791 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 40 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:15,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 104 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:15,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-12 18:33:15,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-10-12 18:33:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 55 states have internal predecessors, (60), 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-10-12 18:33:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2024-10-12 18:33:15,795 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 11 [2024-10-12 18:33:15,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:15,795 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2024-10-12 18:33:15,795 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-10-12 18:33:15,795 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2024-10-12 18:33:15,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-12 18:33:15,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:15,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:15,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 18:33:15,796 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-10-12 18:33:15,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:15,797 INFO L85 PathProgramCache]: Analyzing trace with hash 369340649, now seen corresponding path program 1 times [2024-10-12 18:33:15,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:15,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660552853] [2024-10-12 18:33:15,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:15,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:15,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:15,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:15,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660552853] [2024-10-12 18:33:15,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660552853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:15,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:15,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:33:15,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353851491] [2024-10-12 18:33:15,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:15,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:33:15,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:15,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:33:15,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:33:15,876 INFO L87 Difference]: Start difference. First operand 56 states and 60 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-10-12 18:33:15,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:15,953 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2024-10-12 18:33:15,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:33:15,954 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-10-12 18:33:15,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:15,954 INFO L225 Difference]: With dead ends: 58 [2024-10-12 18:33:15,954 INFO L226 Difference]: Without dead ends: 56 [2024-10-12 18:33:15,955 INFO L431 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-10-12 18:33:15,955 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 38 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:15,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 98 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:15,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-12 18:33:15,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2024-10-12 18:33:15,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 53 states have internal predecessors, (58), 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-10-12 18:33:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-10-12 18:33:15,962 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 11 [2024-10-12 18:33:15,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:15,962 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-10-12 18:33:15,962 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-10-12 18:33:15,963 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-10-12 18:33:15,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-12 18:33:15,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:15,963 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:15,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 18:33:15,964 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-10-12 18:33:15,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:15,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1058405533, now seen corresponding path program 1 times [2024-10-12 18:33:15,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:15,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710241089] [2024-10-12 18:33:15,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:15,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:16,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:16,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:16,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710241089] [2024-10-12 18:33:16,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710241089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:16,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:16,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:33:16,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198128522] [2024-10-12 18:33:16,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:16,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:33:16,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:16,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:33:16,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:33:16,029 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-10-12 18:33:16,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:16,069 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2024-10-12 18:33:16,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:33:16,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-10-12 18:33:16,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:16,070 INFO L225 Difference]: With dead ends: 56 [2024-10-12 18:33:16,070 INFO L226 Difference]: Without dead ends: 52 [2024-10-12 18:33:16,070 INFO L431 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-10-12 18:33:16,072 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:16,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 116 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:33:16,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-12 18:33:16,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2024-10-12 18:33:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.35) internal successors, (54), 49 states have internal predecessors, (54), 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-10-12 18:33:16,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2024-10-12 18:33:16,079 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 11 [2024-10-12 18:33:16,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:16,079 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2024-10-12 18:33:16,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-10-12 18:33:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2024-10-12 18:33:16,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-12 18:33:16,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:16,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:16,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 18:33:16,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-10-12 18:33:16,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:16,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1435830091, now seen corresponding path program 1 times [2024-10-12 18:33:16,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:16,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594071124] [2024-10-12 18:33:16,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:16,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:16,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:16,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:16,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594071124] [2024-10-12 18:33:16,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594071124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:16,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:16,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:33:16,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591576161] [2024-10-12 18:33:16,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:16,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:33:16,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:16,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:33:16,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:33:16,229 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:33:16,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:16,323 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2024-10-12 18:33:16,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:33:16,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-12 18:33:16,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:16,326 INFO L225 Difference]: With dead ends: 84 [2024-10-12 18:33:16,326 INFO L226 Difference]: Without dead ends: 82 [2024-10-12 18:33:16,327 INFO L431 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-10-12 18:33:16,328 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 30 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:16,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 137 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-12 18:33:16,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 55. [2024-10-12 18:33:16,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 54 states have internal predecessors, (60), 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-10-12 18:33:16,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2024-10-12 18:33:16,336 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 12 [2024-10-12 18:33:16,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:16,336 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2024-10-12 18:33:16,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:33:16,336 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2024-10-12 18:33:16,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-12 18:33:16,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:16,337 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:16,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 18:33:16,337 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-10-12 18:33:16,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:16,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1435337547, now seen corresponding path program 1 times [2024-10-12 18:33:16,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:16,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125990239] [2024-10-12 18:33:16,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:16,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:16,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:16,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:16,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125990239] [2024-10-12 18:33:16,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125990239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:16,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:16,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:33:16,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905638804] [2024-10-12 18:33:16,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:16,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:33:16,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:16,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:33:16,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:33:16,476 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:33:16,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:16,565 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2024-10-12 18:33:16,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:33:16,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-12 18:33:16,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:16,566 INFO L225 Difference]: With dead ends: 82 [2024-10-12 18:33:16,566 INFO L226 Difference]: Without dead ends: 80 [2024-10-12 18:33:16,567 INFO L431 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-10-12 18:33:16,567 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 34 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:16,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 112 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:16,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-12 18:33:16,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 57. [2024-10-12 18:33:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 56 states have internal predecessors, (62), 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-10-12 18:33:16,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2024-10-12 18:33:16,570 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 12 [2024-10-12 18:33:16,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:16,571 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2024-10-12 18:33:16,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:33:16,571 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2024-10-12 18:33:16,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-12 18:33:16,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:16,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:16,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 18:33:16,572 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-10-12 18:33:16,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:16,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1532112384, now seen corresponding path program 1 times [2024-10-12 18:33:16,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:16,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726067245] [2024-10-12 18:33:16,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:16,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:16,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:16,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:16,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726067245] [2024-10-12 18:33:16,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726067245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:16,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:16,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:33:16,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238275382] [2024-10-12 18:33:16,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:16,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:33:16,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:16,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:33:16,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:33:16,623 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-10-12 18:33:16,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:16,687 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-10-12 18:33:16,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:33:16,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-10-12 18:33:16,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:16,688 INFO L225 Difference]: With dead ends: 58 [2024-10-12 18:33:16,688 INFO L226 Difference]: Without dead ends: 56 [2024-10-12 18:33:16,688 INFO L431 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-10-12 18:33:16,689 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 34 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:16,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 84 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:16,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-12 18:33:16,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-10-12 18:33:16,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 54 states have internal predecessors, (60), 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-10-12 18:33:16,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2024-10-12 18:33:16,692 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 12 [2024-10-12 18:33:16,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:16,693 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2024-10-12 18:33:16,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-10-12 18:33:16,693 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2024-10-12 18:33:16,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-12 18:33:16,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:16,694 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:16,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 18:33:16,694 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-10-12 18:33:16,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:16,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1530388480, now seen corresponding path program 1 times [2024-10-12 18:33:16,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:16,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104001108] [2024-10-12 18:33:16,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:16,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:16,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:16,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104001108] [2024-10-12 18:33:16,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104001108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:16,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:16,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:33:16,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945463905] [2024-10-12 18:33:16,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:16,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:33:16,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:16,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:33:16,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:33:16,744 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-10-12 18:33:16,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:16,802 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2024-10-12 18:33:16,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:33:16,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-10-12 18:33:16,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:16,803 INFO L225 Difference]: With dead ends: 56 [2024-10-12 18:33:16,804 INFO L226 Difference]: Without dead ends: 54 [2024-10-12 18:33:16,804 INFO L431 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-10-12 18:33:16,804 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 32 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:16,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 78 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:16,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-12 18:33:16,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2024-10-12 18:33:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 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-10-12 18:33:16,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2024-10-12 18:33:16,807 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 12 [2024-10-12 18:33:16,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:16,808 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2024-10-12 18:33:16,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-10-12 18:33:16,808 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2024-10-12 18:33:16,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 18:33:16,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:16,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:16,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 18:33:16,809 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-10-12 18:33:16,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:16,809 INFO L85 PathProgramCache]: Analyzing trace with hash -250839552, now seen corresponding path program 1 times [2024-10-12 18:33:16,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:16,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040354687] [2024-10-12 18:33:16,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:16,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:16,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:16,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040354687] [2024-10-12 18:33:16,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040354687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:16,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:16,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:33:16,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895927712] [2024-10-12 18:33:16,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:16,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:33:16,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:16,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:33:16,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:33:16,946 INFO L87 Difference]: Start difference. First operand 53 states and 58 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-10-12 18:33:17,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:17,019 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2024-10-12 18:33:17,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:33:17,020 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-10-12 18:33:17,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:17,021 INFO L225 Difference]: With dead ends: 72 [2024-10-12 18:33:17,021 INFO L226 Difference]: Without dead ends: 70 [2024-10-12 18:33:17,021 INFO L431 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-10-12 18:33:17,022 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 24 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:17,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 99 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:17,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-12 18:33:17,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2024-10-12 18:33:17,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 58 states have internal predecessors, (66), 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-10-12 18:33:17,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2024-10-12 18:33:17,025 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 13 [2024-10-12 18:33:17,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:17,025 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2024-10-12 18:33:17,025 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-10-12 18:33:17,025 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2024-10-12 18:33:17,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 18:33:17,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:17,026 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:17,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 18:33:17,029 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-10-12 18:33:17,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:17,029 INFO L85 PathProgramCache]: Analyzing trace with hash -249292407, now seen corresponding path program 1 times [2024-10-12 18:33:17,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:17,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040078351] [2024-10-12 18:33:17,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:17,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:17,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:17,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040078351] [2024-10-12 18:33:17,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040078351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:17,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:17,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:33:17,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897064657] [2024-10-12 18:33:17,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:17,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:33:17,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:17,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:33:17,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:33:17,107 INFO L87 Difference]: Start difference. First operand 59 states and 66 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-10-12 18:33:17,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:17,169 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2024-10-12 18:33:17,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:33:17,170 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-10-12 18:33:17,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:17,173 INFO L225 Difference]: With dead ends: 59 [2024-10-12 18:33:17,173 INFO L226 Difference]: Without dead ends: 57 [2024-10-12 18:33:17,173 INFO L431 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-10-12 18:33:17,174 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 29 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:17,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 72 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-12 18:33:17,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-12 18:33:17,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.28) internal successors, (64), 56 states have internal predecessors, (64), 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-10-12 18:33:17,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2024-10-12 18:33:17,177 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 13 [2024-10-12 18:33:17,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:17,177 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2024-10-12 18:33:17,178 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-10-12 18:33:17,178 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2024-10-12 18:33:17,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 18:33:17,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:17,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:17,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 18:33:17,186 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-10-12 18:33:17,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:17,186 INFO L85 PathProgramCache]: Analyzing trace with hash -197398472, now seen corresponding path program 1 times [2024-10-12 18:33:17,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:17,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698643226] [2024-10-12 18:33:17,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:17,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:17,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:17,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:17,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698643226] [2024-10-12 18:33:17,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698643226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:17,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:17,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:33:17,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333109229] [2024-10-12 18:33:17,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:17,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:33:17,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:17,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:33:17,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:33:17,299 INFO L87 Difference]: Start difference. First operand 57 states and 64 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-10-12 18:33:17,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:17,379 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2024-10-12 18:33:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:33:17,380 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-10-12 18:33:17,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:17,380 INFO L225 Difference]: With dead ends: 69 [2024-10-12 18:33:17,380 INFO L226 Difference]: Without dead ends: 65 [2024-10-12 18:33:17,382 INFO L431 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-10-12 18:33:17,382 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:17,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 111 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:17,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-12 18:33:17,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2024-10-12 18:33:17,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 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-10-12 18:33:17,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2024-10-12 18:33:17,386 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 13 [2024-10-12 18:33:17,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:17,386 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2024-10-12 18:33:17,386 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-10-12 18:33:17,386 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2024-10-12 18:33:17,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-12 18:33:17,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:17,386 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:17,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 18:33:17,387 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-10-12 18:33:17,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:17,387 INFO L85 PathProgramCache]: Analyzing trace with hash 861874106, now seen corresponding path program 1 times [2024-10-12 18:33:17,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:17,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816203080] [2024-10-12 18:33:17,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:17,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:17,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:17,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:17,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816203080] [2024-10-12 18:33:17,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816203080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:17,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:17,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:33:17,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755823628] [2024-10-12 18:33:17,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:17,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:33:17,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:17,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:33:17,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:33:17,496 INFO L87 Difference]: Start difference. First operand 58 states and 65 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-10-12 18:33:17,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:17,577 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2024-10-12 18:33:17,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:33:17,577 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-10-12 18:33:17,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:17,578 INFO L225 Difference]: With dead ends: 65 [2024-10-12 18:33:17,578 INFO L226 Difference]: Without dead ends: 63 [2024-10-12 18:33:17,578 INFO L431 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-10-12 18:33:17,579 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 15 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:17,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 115 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:17,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-12 18:33:17,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2024-10-12 18:33:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 60 states have internal predecessors, (68), 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-10-12 18:33:17,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-10-12 18:33:17,581 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 14 [2024-10-12 18:33:17,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:17,581 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-10-12 18:33:17,581 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-10-12 18:33:17,585 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-10-12 18:33:17,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 18:33:17,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:17,589 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:17,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 18:33:17,589 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-10-12 18:33:17,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:17,590 INFO L85 PathProgramCache]: Analyzing trace with hash -538513565, now seen corresponding path program 1 times [2024-10-12 18:33:17,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:17,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681383672] [2024-10-12 18:33:17,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:17,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:17,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:17,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:17,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681383672] [2024-10-12 18:33:17,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681383672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:17,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:17,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:33:17,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435941882] [2024-10-12 18:33:17,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:17,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:33:17,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:17,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:33:17,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:33:17,646 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:33:17,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:17,673 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2024-10-12 18:33:17,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:33:17,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-12 18:33:17,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:17,674 INFO L225 Difference]: With dead ends: 61 [2024-10-12 18:33:17,675 INFO L226 Difference]: Without dead ends: 59 [2024-10-12 18:33:17,675 INFO L431 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-10-12 18:33:17,677 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:17,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 68 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:33:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-12 18:33:17,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-12 18:33:17,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 58 states have internal predecessors, (66), 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-10-12 18:33:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2024-10-12 18:33:17,680 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 15 [2024-10-12 18:33:17,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:17,681 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2024-10-12 18:33:17,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:33:17,681 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2024-10-12 18:33:17,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 18:33:17,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:17,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:17,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 18:33:17,682 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-10-12 18:33:17,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:17,682 INFO L85 PathProgramCache]: Analyzing trace with hash 485952782, now seen corresponding path program 1 times [2024-10-12 18:33:17,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:17,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882798415] [2024-10-12 18:33:17,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:17,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:17,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:17,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882798415] [2024-10-12 18:33:17,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882798415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:17,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:17,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:33:17,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38450088] [2024-10-12 18:33:17,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:17,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:33:17,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:17,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:33:17,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:33:17,748 INFO L87 Difference]: Start difference. First operand 59 states and 66 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-10-12 18:33:17,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:17,779 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2024-10-12 18:33:17,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:33:17,779 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-10-12 18:33:17,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:17,780 INFO L225 Difference]: With dead ends: 59 [2024-10-12 18:33:17,780 INFO L226 Difference]: Without dead ends: 55 [2024-10-12 18:33:17,780 INFO L431 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-10-12 18:33:17,780 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:17,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 86 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:33:17,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-12 18:33:17,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-12 18:33:17,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 54 states have internal predecessors, (62), 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-10-12 18:33:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2024-10-12 18:33:17,782 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 16 [2024-10-12 18:33:17,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:17,782 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2024-10-12 18:33:17,782 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-10-12 18:33:17,782 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2024-10-12 18:33:17,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 18:33:17,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:17,783 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:17,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 18:33:17,785 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-10-12 18:33:17,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:17,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1674321770, now seen corresponding path program 1 times [2024-10-12 18:33:17,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:17,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549253813] [2024-10-12 18:33:17,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:17,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:17,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:17,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549253813] [2024-10-12 18:33:17,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549253813] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:33:17,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965998840] [2024-10-12 18:33:17,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:17,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:33:17,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:33:17,888 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:33:17,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 18:33:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:17,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-12 18:33:17,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:33:18,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:18,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:33:18,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 18:33:18,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965998840] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:33:18,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:33:18,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 17 [2024-10-12 18:33:18,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453530760] [2024-10-12 18:33:18,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:33:18,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-12 18:33:18,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:18,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-12 18:33:18,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-12 18:33:18,352 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 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-10-12 18:33:18,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:18,520 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2024-10-12 18:33:18,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 18:33:18,520 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 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-10-12 18:33:18,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:18,521 INFO L225 Difference]: With dead ends: 82 [2024-10-12 18:33:18,521 INFO L226 Difference]: Without dead ends: 80 [2024-10-12 18:33:18,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2024-10-12 18:33:18,522 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 154 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:18,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 79 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:18,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-12 18:33:18,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 51. [2024-10-12 18:33:18,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 50 states have internal predecessors, (58), 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-10-12 18:33:18,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2024-10-12 18:33:18,525 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 17 [2024-10-12 18:33:18,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:18,525 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2024-10-12 18:33:18,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 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-10-12 18:33:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2024-10-12 18:33:18,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 18:33:18,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:18,526 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:18,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 18:33:18,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:33:18,731 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-10-12 18:33:18,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:18,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1674814314, now seen corresponding path program 1 times [2024-10-12 18:33:18,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:18,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863280133] [2024-10-12 18:33:18,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:18,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:18,817 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:18,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:18,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863280133] [2024-10-12 18:33:18,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863280133] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:33:18,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047207773] [2024-10-12 18:33:18,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:18,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:33:18,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:33:18,820 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:33:18,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 18:33:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:18,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-12 18:33:18,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:33:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:19,092 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:33:19,205 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 18:33:19,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047207773] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:33:19,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:33:19,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 17 [2024-10-12 18:33:19,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174879211] [2024-10-12 18:33:19,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:33:19,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-12 18:33:19,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:19,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-12 18:33:19,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-12 18:33:19,210 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 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-10-12 18:33:19,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:19,410 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2024-10-12 18:33:19,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 18:33:19,411 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 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-10-12 18:33:19,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:19,412 INFO L225 Difference]: With dead ends: 78 [2024-10-12 18:33:19,412 INFO L226 Difference]: Without dead ends: 76 [2024-10-12 18:33:19,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2024-10-12 18:33:19,413 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 272 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:19,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 72 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:19,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-12 18:33:19,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 44. [2024-10-12 18:33:19,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 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-10-12 18:33:19,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-10-12 18:33:19,415 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 17 [2024-10-12 18:33:19,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:19,415 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-10-12 18:33:19,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 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-10-12 18:33:19,416 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-10-12 18:33:19,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 18:33:19,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:19,416 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:19,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 18:33:19,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-10-12 18:33:19,617 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-10-12 18:33:19,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:19,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2100213862, now seen corresponding path program 1 times [2024-10-12 18:33:19,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:19,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527940048] [2024-10-12 18:33:19,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:19,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:19,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:19,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527940048] [2024-10-12 18:33:19,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527940048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:19,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:19,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:33:19,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507200754] [2024-10-12 18:33:19,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:19,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:33:19,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:19,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:33:19,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:33:19,693 INFO L87 Difference]: Start difference. First operand 44 states and 50 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-10-12 18:33:19,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:19,750 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2024-10-12 18:33:19,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:33:19,751 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-10-12 18:33:19,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:19,751 INFO L225 Difference]: With dead ends: 44 [2024-10-12 18:33:19,751 INFO L226 Difference]: Without dead ends: 42 [2024-10-12 18:33:19,751 INFO L431 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-10-12 18:33:19,752 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 47 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:19,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 32 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:33:19,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-12 18:33:19,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-10-12 18:33:19,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 38 states have internal predecessors, (45), 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-10-12 18:33:19,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-10-12 18:33:19,754 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 17 [2024-10-12 18:33:19,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:19,754 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-10-12 18:33:19,754 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-10-12 18:33:19,754 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-10-12 18:33:19,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 18:33:19,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:19,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:19,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 18:33:19,755 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-10-12 18:33:19,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:19,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1328628103, now seen corresponding path program 1 times [2024-10-12 18:33:19,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:19,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796728555] [2024-10-12 18:33:19,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:19,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:19,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:19,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:19,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796728555] [2024-10-12 18:33:19,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796728555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:19,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:19,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 18:33:19,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390372267] [2024-10-12 18:33:19,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:19,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:33:19,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:19,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:33:19,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:33:19,843 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-10-12 18:33:19,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:19,894 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2024-10-12 18:33:19,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:33:19,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-10-12 18:33:19,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:19,895 INFO L225 Difference]: With dead ends: 39 [2024-10-12 18:33:19,895 INFO L226 Difference]: Without dead ends: 37 [2024-10-12 18:33:19,896 INFO L431 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-10-12 18:33:19,896 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 78 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:19,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 26 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:33:19,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-12 18:33:19,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2024-10-12 18:33:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 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-10-12 18:33:19,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-10-12 18:33:19,898 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 18 [2024-10-12 18:33:19,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:19,899 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-10-12 18:33:19,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-10-12 18:33:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-10-12 18:33:19,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 18:33:19,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:19,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:19,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 18:33:19,899 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-10-12 18:33:19,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:19,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1382069183, now seen corresponding path program 1 times [2024-10-12 18:33:19,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:19,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671421450] [2024-10-12 18:33:19,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:19,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:19,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:19,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:19,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671421450] [2024-10-12 18:33:19,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671421450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:19,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:19,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 18:33:19,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101321694] [2024-10-12 18:33:19,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:19,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:33:19,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:19,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:33:19,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:33:19,986 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-10-12 18:33:20,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:20,032 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-10-12 18:33:20,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:33:20,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-10-12 18:33:20,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:20,033 INFO L225 Difference]: With dead ends: 34 [2024-10-12 18:33:20,033 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 18:33:20,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:33:20,034 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 59 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:20,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 18 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:33:20,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 18:33:20,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 18:33:20,036 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-10-12 18:33:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 18:33:20,036 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2024-10-12 18:33:20,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:20,036 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 18:33:20,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-10-12 18:33:20,036 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 18:33:20,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 18:33:20,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2024-10-12 18:33:20,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2024-10-12 18:33:20,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2024-10-12 18:33:20,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2024-10-12 18:33:20,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2024-10-12 18:33:20,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2024-10-12 18:33:20,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2024-10-12 18:33:20,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2024-10-12 18:33:20,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2024-10-12 18:33:20,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2024-10-12 18:33:20,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2024-10-12 18:33:20,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2024-10-12 18:33:20,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2024-10-12 18:33:20,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2024-10-12 18:33:20,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2024-10-12 18:33:20,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2024-10-12 18:33:20,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2024-10-12 18:33:20,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2024-10-12 18:33:20,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 18:33:20,046 INFO L407 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, 1, 1] [2024-10-12 18:33:20,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 18:33:20,053 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 18:33:20,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 06:33:20 BoogieIcfgContainer [2024-10-12 18:33:20,062 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 18:33:20,063 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 18:33:20,063 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 18:33:20,063 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 18:33:20,063 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:33:14" (3/4) ... [2024-10-12 18:33:20,065 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 18:33:20,076 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-10-12 18:33:20,077 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 18:33:20,077 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 18:33:20,077 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 18:33:20,189 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 18:33:20,190 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 18:33:20,190 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 18:33:20,191 INFO L158 Benchmark]: Toolchain (without parser) took 7250.30ms. Allocated memory was 159.4MB in the beginning and 243.3MB in the end (delta: 83.9MB). Free memory was 86.2MB in the beginning and 80.1MB in the end (delta: 6.1MB). Peak memory consumption was 92.4MB. Max. memory is 16.1GB. [2024-10-12 18:33:20,191 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:33:20,191 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.86ms. Allocated memory is still 159.4MB. Free memory was 86.1MB in the beginning and 66.8MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-12 18:33:20,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.68ms. Allocated memory is still 159.4MB. Free memory was 66.8MB in the beginning and 64.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:33:20,192 INFO L158 Benchmark]: Boogie Preprocessor took 66.79ms. Allocated memory is still 159.4MB. Free memory was 64.5MB in the beginning and 128.7MB in the end (delta: -64.1MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2024-10-12 18:33:20,192 INFO L158 Benchmark]: RCFGBuilder took 588.21ms. Allocated memory was 159.4MB in the beginning and 201.3MB in the end (delta: 41.9MB). Free memory was 128.6MB in the beginning and 156.0MB in the end (delta: -27.4MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2024-10-12 18:33:20,192 INFO L158 Benchmark]: TraceAbstraction took 5999.31ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 155.0MB in the beginning and 86.4MB in the end (delta: 68.6MB). Peak memory consumption was 111.6MB. Max. memory is 16.1GB. [2024-10-12 18:33:20,192 INFO L158 Benchmark]: Witness Printer took 128.07ms. Allocated memory is still 243.3MB. Free memory was 86.4MB in the beginning and 80.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 18:33:20,196 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.20ms. Allocated memory is still 159.4MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 407.86ms. Allocated memory is still 159.4MB. Free memory was 86.1MB in the beginning and 66.8MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.68ms. Allocated memory is still 159.4MB. Free memory was 66.8MB in the beginning and 64.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.79ms. Allocated memory is still 159.4MB. Free memory was 64.5MB in the beginning and 128.7MB in the end (delta: -64.1MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * RCFGBuilder took 588.21ms. Allocated memory was 159.4MB in the beginning and 201.3MB in the end (delta: 41.9MB). Free memory was 128.6MB in the beginning and 156.0MB in the end (delta: -27.4MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5999.31ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 155.0MB in the beginning and 86.4MB in the end (delta: 68.6MB). Peak memory consumption was 111.6MB. Max. memory is 16.1GB. * Witness Printer took 128.07ms. Allocated memory is still 243.3MB. Free memory was 86.4MB in the beginning and 80.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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: 52]: 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: 72]: 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: 84]: 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: 114]: 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: 126]: 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: 142]: 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: 154]: 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: 176]: 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: 188]: 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: 224]: 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: 236]: 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: 278]: 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: 297]: 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: 309]: 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: 333]: 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: 345]: 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: 366]: 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: 378]: 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, 73 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1062 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1062 mSDsluCounter, 2230 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1510 mSDsCounter, 156 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1804 IncrementalHoareTripleChecker+Invalid, 1960 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 156 mSolverCounterUnsat, 720 mSDtfsCounter, 1804 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 87 SyntacticMatches, 8 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=0, InterpolantAutomatonStates: 132, 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, 23 MinimizatonAttempts, 155 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 338 ConstructedInterpolants, 0 QuantifiedInterpolants, 1430 SizeOfPredicates, 6 NumberOfNonLiveVariables, 197 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 8/24 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 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-12 18:33:20,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE