./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f5182ada4c25502e8c117aae65840c303a96073ec563a87f29fad662bee2286b --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-12 21:28:45,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 21:28:45,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 21:28:45,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 21:28:45,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 21:28:45,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 21:28:45,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 21:28:45,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 21:28:45,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 21:28:45,952 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 21:28:45,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 21:28:45,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 21:28:45,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 21:28:45,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 21:28:45,956 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 21:28:45,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 21:28:45,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 21:28:45,957 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 21:28:45,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 21:28:45,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 21:28:45,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 21:28:45,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 21:28:45,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 21:28:45,963 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 21:28:45,963 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 21:28:45,963 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 21:28:45,963 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 21:28:45,963 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 21:28:45,963 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 21:28:45,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 21:28:45,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 21:28:45,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 21:28:45,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 21:28:45,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 21:28:45,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 21:28:45,965 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 21:28:45,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 21:28:45,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 21:28:45,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 21:28:45,966 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 21:28:45,966 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 21:28:45,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 21:28:45,967 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f5182ada4c25502e8c117aae65840c303a96073ec563a87f29fad662bee2286b Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-12 21:28:46,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 21:28:46,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 21:28:46,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 21:28:46,173 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 21:28:46,173 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 21:28:46,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2024-09-12 21:28:47,335 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 21:28:47,522 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 21:28:47,523 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2024-09-12 21:28:47,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/5bcdba0fa/98dad24e9dd84dfc9167563532f040a9/FLAG7f7c7941e [2024-09-12 21:28:47,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/5bcdba0fa/98dad24e9dd84dfc9167563532f040a9 [2024-09-12 21:28:47,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 21:28:47,905 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 21:28:47,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 21:28:47,907 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 21:28:47,911 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 21:28:47,912 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 09:28:47" (1/1) ... [2024-09-12 21:28:47,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@572a8936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:47, skipping insertion in model container [2024-09-12 21:28:47,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 09:28:47" (1/1) ... [2024-09-12 21:28:47,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 21:28:48,096 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[901,914] [2024-09-12 21:28:48,103 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1116,1129] [2024-09-12 21:28:48,106 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1625,1638] [2024-09-12 21:28:48,110 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1840,1853] [2024-09-12 21:28:48,111 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2157,2170] [2024-09-12 21:28:48,112 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2372,2385] [2024-09-12 21:28:48,114 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2867,2880] [2024-09-12 21:28:48,115 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3082,3095] [2024-09-12 21:28:48,117 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3384,3397] [2024-09-12 21:28:48,120 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3602,3615] [2024-09-12 21:28:48,122 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3878,3891] [2024-09-12 21:28:48,123 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4096,4109] [2024-09-12 21:28:48,124 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4582,4595] [2024-09-12 21:28:48,126 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4800,4813] [2024-09-12 21:28:48,274 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47686,47699] [2024-09-12 21:28:48,291 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47907,47920] [2024-09-12 21:28:48,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 21:28:48,325 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 21:28:48,349 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[901,914] [2024-09-12 21:28:48,350 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1116,1129] [2024-09-12 21:28:48,351 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1625,1638] [2024-09-12 21:28:48,351 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1840,1853] [2024-09-12 21:28:48,352 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2157,2170] [2024-09-12 21:28:48,352 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2372,2385] [2024-09-12 21:28:48,353 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2867,2880] [2024-09-12 21:28:48,354 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3082,3095] [2024-09-12 21:28:48,354 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3384,3397] [2024-09-12 21:28:48,355 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3602,3615] [2024-09-12 21:28:48,366 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3878,3891] [2024-09-12 21:28:48,367 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4096,4109] [2024-09-12 21:28:48,368 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4582,4595] [2024-09-12 21:28:48,368 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4800,4813] [2024-09-12 21:28:48,466 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47686,47699] [2024-09-12 21:28:48,469 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47907,47920] [2024-09-12 21:28:48,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 21:28:48,492 INFO L204 MainTranslator]: Completed translation [2024-09-12 21:28:48,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:48 WrapperNode [2024-09-12 21:28:48,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 21:28:48,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 21:28:48,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 21:28:48,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 21:28:48,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:48" (1/1) ... [2024-09-12 21:28:48,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:48" (1/1) ... [2024-09-12 21:28:48,527 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 21:28:48,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 21:28:48,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 21:28:48,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 21:28:48,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 21:28:48,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:48" (1/1) ... [2024-09-12 21:28:48,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:48" (1/1) ... [2024-09-12 21:28:48,539 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:48" (1/1) ... [2024-09-12 21:28:48,568 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-09-12 21:28:48,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:48" (1/1) ... [2024-09-12 21:28:48,569 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:48" (1/1) ... [2024-09-12 21:28:48,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:48" (1/1) ... [2024-09-12 21:28:48,606 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:48" (1/1) ... [2024-09-12 21:28:48,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:48" (1/1) ... [2024-09-12 21:28:48,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:48" (1/1) ... [2024-09-12 21:28:48,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 21:28:48,628 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 21:28:48,629 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 21:28:48,629 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 21:28:48,630 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:48" (1/1) ... [2024-09-12 21:28:48,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 21:28:48,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:28:48,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 21:28:48,654 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 21:28:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 21:28:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 21:28:48,684 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 21:28:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 21:28:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 21:28:48,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 21:28:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 21:28:48,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 21:28:48,803 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 21:28:48,804 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 21:28:49,504 INFO L? ?]: Removed 606 outVars from TransFormulas that were not future-live. [2024-09-12 21:28:49,504 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 21:28:49,529 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 21:28:49,530 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-12 21:28:49,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:28:49 BoogieIcfgContainer [2024-09-12 21:28:49,530 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 21:28:49,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 21:28:49,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 21:28:49,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 21:28:49,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 09:28:47" (1/3) ... [2024-09-12 21:28:49,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d617d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 09:28:49, skipping insertion in model container [2024-09-12 21:28:49,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:48" (2/3) ... [2024-09-12 21:28:49,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d617d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 09:28:49, skipping insertion in model container [2024-09-12 21:28:49,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:28:49" (3/3) ... [2024-09-12 21:28:49,537 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2024-09-12 21:28:49,549 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 21:28:49,549 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-09-12 21:28:49,611 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 21:28:49,615 INFO L336 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=All, 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;@53ba21b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 21:28:49,616 INFO L337 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-09-12 21:28:49,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 308 states, 287 states have (on average 1.9686411149825784) internal successors, (565), 303 states have internal predecessors, (565), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 21:28:49,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 21:28:49,625 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:49,625 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:49,626 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:49,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:49,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1962000724, now seen corresponding path program 1 times [2024-09-12 21:28:49,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:49,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325671969] [2024-09-12 21:28:49,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:49,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:49,838 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:49,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:28:49,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:49,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325671969] [2024-09-12 21:28:49,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325671969] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:49,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:49,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 21:28:49,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608460373] [2024-09-12 21:28:49,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:49,859 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 21:28:49,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:49,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 21:28:49,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 21:28:49,879 INFO L87 Difference]: Start difference. First operand has 308 states, 287 states have (on average 1.9686411149825784) internal successors, (565), 303 states have internal predecessors, (565), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:50,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:50,791 INFO L93 Difference]: Finished difference Result 320 states and 582 transitions. [2024-09-12 21:28:50,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 21:28:50,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-12 21:28:50,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:50,800 INFO L225 Difference]: With dead ends: 320 [2024-09-12 21:28:50,800 INFO L226 Difference]: Without dead ends: 306 [2024-09-12 21:28:50,802 INFO L433 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-09-12 21:28:50,804 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 886 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:50,805 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 105 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-09-12 21:28:50,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-09-12 21:28:50,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2024-09-12 21:28:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 283 states have (on average 1.4876325088339222) internal successors, (421), 297 states have internal predecessors, (421), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 424 transitions. [2024-09-12 21:28:50,890 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 424 transitions. Word has length 10 [2024-09-12 21:28:50,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:50,891 INFO L474 AbstractCegarLoop]: Abstraction has 301 states and 424 transitions. [2024-09-12 21:28:50,891 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:50,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:50,892 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 424 transitions. [2024-09-12 21:28:50,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-12 21:28:50,892 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:50,892 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:50,892 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 21:28:50,893 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:50,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:50,893 INFO L85 PathProgramCache]: Analyzing trace with hash -692477239, now seen corresponding path program 1 times [2024-09-12 21:28:50,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:50,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955817724] [2024-09-12 21:28:50,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:50,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:51,001 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:28:51,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:51,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955817724] [2024-09-12 21:28:51,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955817724] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:51,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:51,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 21:28:51,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373909956] [2024-09-12 21:28:51,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:51,007 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 21:28:51,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:51,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 21:28:51,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-12 21:28:51,007 INFO L87 Difference]: Start difference. First operand 301 states and 424 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:51,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:51,800 INFO L93 Difference]: Finished difference Result 311 states and 434 transitions. [2024-09-12 21:28:51,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 21:28:51,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-12 21:28:51,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:51,802 INFO L225 Difference]: With dead ends: 311 [2024-09-12 21:28:51,802 INFO L226 Difference]: Without dead ends: 303 [2024-09-12 21:28:51,802 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-09-12 21:28:51,803 INFO L434 NwaCegarLoop]: 54 mSDtfsCounter, 315 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 1487 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:51,803 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 175 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1487 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-12 21:28:51,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-09-12 21:28:51,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 296. [2024-09-12 21:28:51,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 279 states have (on average 1.2759856630824373) internal successors, (356), 292 states have internal predecessors, (356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:51,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 359 transitions. [2024-09-12 21:28:51,844 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 359 transitions. Word has length 11 [2024-09-12 21:28:51,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:51,845 INFO L474 AbstractCegarLoop]: Abstraction has 296 states and 359 transitions. [2024-09-12 21:28:51,845 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:51,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:51,845 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2024-09-12 21:28:51,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-12 21:28:51,846 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:51,846 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:51,846 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 21:28:51,846 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:51,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:51,846 INFO L85 PathProgramCache]: Analyzing trace with hash -676227242, now seen corresponding path program 1 times [2024-09-12 21:28:51,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:51,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586983785] [2024-09-12 21:28:51,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:51,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:51,921 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:28:51,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:51,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586983785] [2024-09-12 21:28:51,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586983785] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:51,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:51,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 21:28:51,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931758947] [2024-09-12 21:28:51,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:51,926 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 21:28:51,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:51,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 21:28:51,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 21:28:51,926 INFO L87 Difference]: Start difference. First operand 296 states and 359 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:52,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:52,451 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2024-09-12 21:28:52,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 21:28:52,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-12 21:28:52,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:52,453 INFO L225 Difference]: With dead ends: 296 [2024-09-12 21:28:52,453 INFO L226 Difference]: Without dead ends: 294 [2024-09-12 21:28:52,454 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:28:52,456 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 516 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:52,456 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 80 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-12 21:28:52,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-09-12 21:28:52,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-09-12 21:28:52,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 278 states have (on average 1.2733812949640289) internal successors, (354), 290 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:52,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 357 transitions. [2024-09-12 21:28:52,488 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 357 transitions. Word has length 11 [2024-09-12 21:28:52,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:52,488 INFO L474 AbstractCegarLoop]: Abstraction has 294 states and 357 transitions. [2024-09-12 21:28:52,489 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:52,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 357 transitions. [2024-09-12 21:28:52,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 21:28:52,490 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:52,490 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:52,490 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 21:28:52,491 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:52,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:52,491 INFO L85 PathProgramCache]: Analyzing trace with hash 511795059, now seen corresponding path program 1 times [2024-09-12 21:28:52,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:52,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835371406] [2024-09-12 21:28:52,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:52,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:52,570 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:52,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:28:52,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:52,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835371406] [2024-09-12 21:28:52,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835371406] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:52,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:52,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 21:28:52,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681488718] [2024-09-12 21:28:52,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:52,577 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 21:28:52,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:52,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 21:28:52,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 21:28:52,578 INFO L87 Difference]: Start difference. First operand 294 states and 357 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:53,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:53,117 INFO L93 Difference]: Finished difference Result 299 states and 362 transitions. [2024-09-12 21:28:53,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 21:28:53,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-12 21:28:53,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:53,119 INFO L225 Difference]: With dead ends: 299 [2024-09-12 21:28:53,120 INFO L226 Difference]: Without dead ends: 297 [2024-09-12 21:28:53,120 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:28:53,121 INFO L434 NwaCegarLoop]: 53 mSDtfsCounter, 242 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:53,122 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 141 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-12 21:28:53,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-09-12 21:28:53,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2024-09-12 21:28:53,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 281 states have (on average 1.2704626334519573) internal successors, (357), 293 states have internal predecessors, (357), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 360 transitions. [2024-09-12 21:28:53,153 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 360 transitions. Word has length 12 [2024-09-12 21:28:53,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:53,153 INFO L474 AbstractCegarLoop]: Abstraction has 297 states and 360 transitions. [2024-09-12 21:28:53,153 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:53,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 360 transitions. [2024-09-12 21:28:53,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 21:28:53,154 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:53,154 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:53,154 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 21:28:53,155 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:53,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:53,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2086090537, now seen corresponding path program 1 times [2024-09-12 21:28:53,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:53,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063100870] [2024-09-12 21:28:53,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:53,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:53,209 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:28:53,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:53,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063100870] [2024-09-12 21:28:53,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063100870] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:53,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:53,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 21:28:53,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697380672] [2024-09-12 21:28:53,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:53,217 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 21:28:53,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:53,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 21:28:53,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 21:28:53,217 INFO L87 Difference]: Start difference. First operand 297 states and 360 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:53,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:53,749 INFO L93 Difference]: Finished difference Result 297 states and 360 transitions. [2024-09-12 21:28:53,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 21:28:53,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-12 21:28:53,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:53,751 INFO L225 Difference]: With dead ends: 297 [2024-09-12 21:28:53,751 INFO L226 Difference]: Without dead ends: 295 [2024-09-12 21:28:53,751 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-12 21:28:53,752 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 514 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:53,752 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 109 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-12 21:28:53,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-09-12 21:28:53,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-09-12 21:28:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 280 states have (on average 1.2678571428571428) internal successors, (355), 291 states have internal predecessors, (355), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:53,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 358 transitions. [2024-09-12 21:28:53,776 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 358 transitions. Word has length 14 [2024-09-12 21:28:53,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:53,776 INFO L474 AbstractCegarLoop]: Abstraction has 295 states and 358 transitions. [2024-09-12 21:28:53,776 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:53,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:53,776 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2024-09-12 21:28:53,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 21:28:53,777 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:53,777 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:53,777 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 21:28:53,777 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:53,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:53,777 INFO L85 PathProgramCache]: Analyzing trace with hash -244294110, now seen corresponding path program 1 times [2024-09-12 21:28:53,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:53,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180774194] [2024-09-12 21:28:53,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:53,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:53,829 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:53,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:28:53,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:53,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180774194] [2024-09-12 21:28:53,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180774194] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:53,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:53,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 21:28:53,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136537129] [2024-09-12 21:28:53,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:53,832 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 21:28:53,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:53,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 21:28:53,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 21:28:53,833 INFO L87 Difference]: Start difference. First operand 295 states and 358 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:54,316 INFO L93 Difference]: Finished difference Result 295 states and 358 transitions. [2024-09-12 21:28:54,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 21:28:54,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-12 21:28:54,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:54,318 INFO L225 Difference]: With dead ends: 295 [2024-09-12 21:28:54,318 INFO L226 Difference]: Without dead ends: 291 [2024-09-12 21:28:54,318 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-09-12 21:28:54,319 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 247 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:54,319 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 124 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 21:28:54,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-09-12 21:28:54,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2024-09-12 21:28:54,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 277 states have (on average 1.2671480144404332) internal successors, (351), 287 states have internal predecessors, (351), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:54,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 354 transitions. [2024-09-12 21:28:54,340 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 354 transitions. Word has length 15 [2024-09-12 21:28:54,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:54,340 INFO L474 AbstractCegarLoop]: Abstraction has 291 states and 354 transitions. [2024-09-12 21:28:54,340 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:54,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:54,340 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 354 transitions. [2024-09-12 21:28:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 21:28:54,341 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:54,341 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:54,341 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 21:28:54,341 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:54,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:54,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1367121598, now seen corresponding path program 1 times [2024-09-12 21:28:54,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:54,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358886957] [2024-09-12 21:28:54,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:54,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:54,443 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:54,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:28:54,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:54,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358886957] [2024-09-12 21:28:54,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358886957] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:54,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:54,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 21:28:54,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236053864] [2024-09-12 21:28:54,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:54,447 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:28:54,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:54,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:28:54,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:28:54,447 INFO L87 Difference]: Start difference. First operand 291 states and 354 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:55,168 INFO L93 Difference]: Finished difference Result 316 states and 382 transitions. [2024-09-12 21:28:55,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 21:28:55,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-12 21:28:55,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:55,169 INFO L225 Difference]: With dead ends: 316 [2024-09-12 21:28:55,169 INFO L226 Difference]: Without dead ends: 314 [2024-09-12 21:28:55,170 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-09-12 21:28:55,170 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 265 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1678 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:55,170 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 169 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1678 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-12 21:28:55,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-09-12 21:28:55,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 291. [2024-09-12 21:28:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 277 states have (on average 1.2671480144404332) internal successors, (351), 287 states have internal predecessors, (351), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 354 transitions. [2024-09-12 21:28:55,190 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 354 transitions. Word has length 16 [2024-09-12 21:28:55,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:55,190 INFO L474 AbstractCegarLoop]: Abstraction has 291 states and 354 transitions. [2024-09-12 21:28:55,191 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:55,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:55,191 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 354 transitions. [2024-09-12 21:28:55,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 21:28:55,191 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:55,191 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:55,192 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-12 21:28:55,192 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:55,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:55,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1030085224, now seen corresponding path program 1 times [2024-09-12 21:28:55,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:55,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214450666] [2024-09-12 21:28:55,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:55,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:55,237 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:28:55,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:55,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214450666] [2024-09-12 21:28:55,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214450666] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:55,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:55,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 21:28:55,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699775737] [2024-09-12 21:28:55,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:55,240 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 21:28:55,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:55,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 21:28:55,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 21:28:55,241 INFO L87 Difference]: Start difference. First operand 291 states and 354 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:55,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:55,734 INFO L93 Difference]: Finished difference Result 294 states and 357 transitions. [2024-09-12 21:28:55,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 21:28:55,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-12 21:28:55,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:55,736 INFO L225 Difference]: With dead ends: 294 [2024-09-12 21:28:55,736 INFO L226 Difference]: Without dead ends: 292 [2024-09-12 21:28:55,736 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-12 21:28:55,737 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 509 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:55,737 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 95 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 21:28:55,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-09-12 21:28:55,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 289. [2024-09-12 21:28:55,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 276 states have (on average 1.2644927536231885) internal successors, (349), 285 states have internal predecessors, (349), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:55,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 352 transitions. [2024-09-12 21:28:55,756 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 352 transitions. Word has length 16 [2024-09-12 21:28:55,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:55,757 INFO L474 AbstractCegarLoop]: Abstraction has 289 states and 352 transitions. [2024-09-12 21:28:55,757 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:55,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:55,757 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 352 transitions. [2024-09-12 21:28:55,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 21:28:55,758 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:55,758 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:55,758 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-12 21:28:55,758 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:55,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:55,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1031624424, now seen corresponding path program 1 times [2024-09-12 21:28:55,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:55,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768699242] [2024-09-12 21:28:55,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:55,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:55,795 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:55,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:28:55,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:55,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768699242] [2024-09-12 21:28:55,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768699242] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:55,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:55,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 21:28:55,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588022663] [2024-09-12 21:28:55,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:55,799 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 21:28:55,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:55,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 21:28:55,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 21:28:55,799 INFO L87 Difference]: Start difference. First operand 289 states and 352 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:56,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:56,247 INFO L93 Difference]: Finished difference Result 292 states and 355 transitions. [2024-09-12 21:28:56,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 21:28:56,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-12 21:28:56,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:56,249 INFO L225 Difference]: With dead ends: 292 [2024-09-12 21:28:56,249 INFO L226 Difference]: Without dead ends: 290 [2024-09-12 21:28:56,249 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-12 21:28:56,250 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 507 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:56,250 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 89 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 21:28:56,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-09-12 21:28:56,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2024-09-12 21:28:56,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 275 states have (on average 1.2618181818181817) internal successors, (347), 283 states have internal predecessors, (347), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:56,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 350 transitions. [2024-09-12 21:28:56,268 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 350 transitions. Word has length 16 [2024-09-12 21:28:56,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:56,269 INFO L474 AbstractCegarLoop]: Abstraction has 287 states and 350 transitions. [2024-09-12 21:28:56,269 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:56,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:56,269 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 350 transitions. [2024-09-12 21:28:56,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 21:28:56,269 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:56,270 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:56,270 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-12 21:28:56,270 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:56,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:56,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1869239409, now seen corresponding path program 1 times [2024-09-12 21:28:56,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:56,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124654601] [2024-09-12 21:28:56,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:56,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:56,309 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:56,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:28:56,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:56,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124654601] [2024-09-12 21:28:56,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124654601] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:56,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:56,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 21:28:56,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065481312] [2024-09-12 21:28:56,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:56,312 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 21:28:56,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:56,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 21:28:56,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 21:28:56,313 INFO L87 Difference]: Start difference. First operand 287 states and 350 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:56,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:56,754 INFO L93 Difference]: Finished difference Result 290 states and 353 transitions. [2024-09-12 21:28:56,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 21:28:56,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-12 21:28:56,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:56,756 INFO L225 Difference]: With dead ends: 290 [2024-09-12 21:28:56,756 INFO L226 Difference]: Without dead ends: 288 [2024-09-12 21:28:56,756 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-12 21:28:56,756 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 504 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:56,756 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 83 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 21:28:56,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-09-12 21:28:56,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 285. [2024-09-12 21:28:56,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 274 states have (on average 1.2591240875912408) internal successors, (345), 281 states have internal predecessors, (345), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 348 transitions. [2024-09-12 21:28:56,776 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 348 transitions. Word has length 17 [2024-09-12 21:28:56,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:56,776 INFO L474 AbstractCegarLoop]: Abstraction has 285 states and 348 transitions. [2024-09-12 21:28:56,776 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:56,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 348 transitions. [2024-09-12 21:28:56,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 21:28:56,777 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:56,777 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:56,777 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-12 21:28:56,777 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:56,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:56,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1867873989, now seen corresponding path program 1 times [2024-09-12 21:28:56,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:56,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681444386] [2024-09-12 21:28:56,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:56,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:56,864 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:56,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:28:56,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:56,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681444386] [2024-09-12 21:28:56,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681444386] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:56,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:56,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 21:28:56,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72158005] [2024-09-12 21:28:56,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:56,870 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:28:56,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:56,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:28:56,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:28:56,871 INFO L87 Difference]: Start difference. First operand 285 states and 348 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:57,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:57,525 INFO L93 Difference]: Finished difference Result 302 states and 368 transitions. [2024-09-12 21:28:57,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 21:28:57,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-12 21:28:57,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:57,527 INFO L225 Difference]: With dead ends: 302 [2024-09-12 21:28:57,527 INFO L226 Difference]: Without dead ends: 300 [2024-09-12 21:28:57,527 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-09-12 21:28:57,528 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 256 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:57,528 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 139 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-12 21:28:57,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-09-12 21:28:57,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 293. [2024-09-12 21:28:57,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 282 states have (on average 1.2588652482269505) internal successors, (355), 289 states have internal predecessors, (355), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:57,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 358 transitions. [2024-09-12 21:28:57,547 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 358 transitions. Word has length 17 [2024-09-12 21:28:57,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:57,547 INFO L474 AbstractCegarLoop]: Abstraction has 293 states and 358 transitions. [2024-09-12 21:28:57,547 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:57,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 358 transitions. [2024-09-12 21:28:57,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 21:28:57,548 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:57,548 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:57,548 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-12 21:28:57,548 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:57,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:57,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1915589239, now seen corresponding path program 1 times [2024-09-12 21:28:57,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:57,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986024933] [2024-09-12 21:28:57,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:57,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:57,629 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:57,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:28:57,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:57,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986024933] [2024-09-12 21:28:57,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986024933] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:57,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:57,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 21:28:57,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267582584] [2024-09-12 21:28:57,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:57,632 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:28:57,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:57,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:28:57,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:28:57,633 INFO L87 Difference]: Start difference. First operand 293 states and 358 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:58,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:58,245 INFO L93 Difference]: Finished difference Result 303 states and 368 transitions. [2024-09-12 21:28:58,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 21:28:58,246 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-12 21:28:58,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:58,247 INFO L225 Difference]: With dead ends: 303 [2024-09-12 21:28:58,247 INFO L226 Difference]: Without dead ends: 299 [2024-09-12 21:28:58,247 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-12 21:28:58,248 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 256 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:58,248 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 139 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-12 21:28:58,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-09-12 21:28:58,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 294. [2024-09-12 21:28:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 283 states have (on average 1.2579505300353357) internal successors, (356), 290 states have internal predecessors, (356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 359 transitions. [2024-09-12 21:28:58,284 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 359 transitions. Word has length 17 [2024-09-12 21:28:58,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:58,285 INFO L474 AbstractCegarLoop]: Abstraction has 294 states and 359 transitions. [2024-09-12 21:28:58,285 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:58,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 359 transitions. [2024-09-12 21:28:58,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 21:28:58,285 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:58,285 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:58,286 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-12 21:28:58,286 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:58,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:58,286 INFO L85 PathProgramCache]: Analyzing trace with hash 2111849979, now seen corresponding path program 1 times [2024-09-12 21:28:58,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:58,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340893907] [2024-09-12 21:28:58,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:58,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:58,372 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:58,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:28:58,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:58,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340893907] [2024-09-12 21:28:58,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340893907] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:58,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:58,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 21:28:58,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189657341] [2024-09-12 21:28:58,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:58,375 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:28:58,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:58,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:28:58,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:28:58,376 INFO L87 Difference]: Start difference. First operand 294 states and 359 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:58,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:58,968 INFO L93 Difference]: Finished difference Result 299 states and 364 transitions. [2024-09-12 21:28:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 21:28:58,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-12 21:28:58,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:58,970 INFO L225 Difference]: With dead ends: 299 [2024-09-12 21:28:58,970 INFO L226 Difference]: Without dead ends: 297 [2024-09-12 21:28:58,970 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-09-12 21:28:58,971 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 256 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:58,971 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 118 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-12 21:28:58,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-09-12 21:28:58,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2024-09-12 21:28:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 286 states have (on average 1.2552447552447552) internal successors, (359), 293 states have internal predecessors, (359), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:58,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 362 transitions. [2024-09-12 21:28:58,998 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 362 transitions. Word has length 18 [2024-09-12 21:28:58,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:58,998 INFO L474 AbstractCegarLoop]: Abstraction has 297 states and 362 transitions. [2024-09-12 21:28:58,998 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:58,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:58,999 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 362 transitions. [2024-09-12 21:28:58,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 21:28:58,999 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:58,999 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:58,999 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-12 21:28:58,999 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:59,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:59,000 INFO L85 PathProgramCache]: Analyzing trace with hash -269329336, now seen corresponding path program 1 times [2024-09-12 21:28:59,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:59,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760831075] [2024-09-12 21:28:59,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:59,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:59,037 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:59,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:28:59,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:59,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760831075] [2024-09-12 21:28:59,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760831075] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:59,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:59,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 21:28:59,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413712738] [2024-09-12 21:28:59,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:59,040 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 21:28:59,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:59,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 21:28:59,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 21:28:59,041 INFO L87 Difference]: Start difference. First operand 297 states and 362 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:59,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:59,444 INFO L93 Difference]: Finished difference Result 297 states and 362 transitions. [2024-09-12 21:28:59,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 21:28:59,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-09-12 21:28:59,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:59,446 INFO L225 Difference]: With dead ends: 297 [2024-09-12 21:28:59,446 INFO L226 Difference]: Without dead ends: 295 [2024-09-12 21:28:59,446 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:28:59,446 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 560 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:59,446 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 72 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 21:28:59,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-09-12 21:28:59,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-09-12 21:28:59,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 285 states have (on average 1.2526315789473683) internal successors, (357), 291 states have internal predecessors, (357), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:59,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 360 transitions. [2024-09-12 21:28:59,469 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 360 transitions. Word has length 19 [2024-09-12 21:28:59,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:59,469 INFO L474 AbstractCegarLoop]: Abstraction has 295 states and 360 transitions. [2024-09-12 21:28:59,469 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:59,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:59,470 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 360 transitions. [2024-09-12 21:28:59,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-12 21:28:59,470 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:59,470 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:59,470 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-12 21:28:59,471 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:59,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:59,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1720197717, now seen corresponding path program 1 times [2024-09-12 21:28:59,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:59,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772997653] [2024-09-12 21:28:59,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:59,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:59,537 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:59,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:28:59,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:59,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772997653] [2024-09-12 21:28:59,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772997653] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:59,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:59,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 21:28:59,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009930253] [2024-09-12 21:28:59,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:59,540 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:28:59,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:59,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:28:59,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:28:59,541 INFO L87 Difference]: Start difference. First operand 295 states and 360 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:28:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:59,979 INFO L93 Difference]: Finished difference Result 295 states and 360 transitions. [2024-09-12 21:28:59,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 21:28:59,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-09-12 21:28:59,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:59,981 INFO L225 Difference]: With dead ends: 295 [2024-09-12 21:28:59,981 INFO L226 Difference]: Without dead ends: 293 [2024-09-12 21:28:59,981 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-12 21:28:59,981 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 903 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:59,982 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 57 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 21:28:59,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-09-12 21:29:00,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2024-09-12 21:29:00,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 281 states have (on average 1.2526690391459074) internal successors, (352), 286 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:29:00,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 355 transitions. [2024-09-12 21:29:00,007 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 355 transitions. Word has length 20 [2024-09-12 21:29:00,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:29:00,007 INFO L474 AbstractCegarLoop]: Abstraction has 290 states and 355 transitions. [2024-09-12 21:29:00,007 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:29:00,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:00,007 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 355 transitions. [2024-09-12 21:29:00,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-12 21:29:00,008 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:29:00,008 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:29:00,008 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-12 21:29:00,008 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:29:00,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:00,008 INFO L85 PathProgramCache]: Analyzing trace with hash 240728308, now seen corresponding path program 1 times [2024-09-12 21:29:00,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:29:00,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000341379] [2024-09-12 21:29:00,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:29:00,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:29:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:00,049 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:29:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:00,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:29:00,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:29:00,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000341379] [2024-09-12 21:29:00,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000341379] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:29:00,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:29:00,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 21:29:00,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490687246] [2024-09-12 21:29:00,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:29:00,052 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 21:29:00,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:29:00,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 21:29:00,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 21:29:00,052 INFO L87 Difference]: Start difference. First operand 290 states and 355 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:29:00,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:29:00,471 INFO L93 Difference]: Finished difference Result 290 states and 355 transitions. [2024-09-12 21:29:00,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 21:29:00,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-09-12 21:29:00,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:29:00,472 INFO L225 Difference]: With dead ends: 290 [2024-09-12 21:29:00,472 INFO L226 Difference]: Without dead ends: 286 [2024-09-12 21:29:00,473 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-09-12 21:29:00,473 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 245 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 21:29:00,473 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 88 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 21:29:00,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-09-12 21:29:00,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2024-09-12 21:29:00,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 278 states have (on average 1.2517985611510791) internal successors, (348), 282 states have internal predecessors, (348), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:29:00,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 351 transitions. [2024-09-12 21:29:00,496 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 351 transitions. Word has length 20 [2024-09-12 21:29:00,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:29:00,496 INFO L474 AbstractCegarLoop]: Abstraction has 286 states and 351 transitions. [2024-09-12 21:29:00,496 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:29:00,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:00,497 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 351 transitions. [2024-09-12 21:29:00,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 21:29:00,497 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:29:00,497 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:29:00,497 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-12 21:29:00,497 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:29:00,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:00,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1498986922, now seen corresponding path program 1 times [2024-09-12 21:29:00,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:29:00,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455195887] [2024-09-12 21:29:00,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:29:00,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:29:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:00,607 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:29:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:29:00,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:29:00,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455195887] [2024-09-12 21:29:00,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455195887] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:29:00,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:29:00,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 21:29:00,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323659183] [2024-09-12 21:29:00,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:29:00,610 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:29:00,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:29:00,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:29:00,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:29:00,610 INFO L87 Difference]: Start difference. First operand 286 states and 351 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:29:01,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:29:01,037 INFO L93 Difference]: Finished difference Result 286 states and 351 transitions. [2024-09-12 21:29:01,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 21:29:01,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-12 21:29:01,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:29:01,039 INFO L225 Difference]: With dead ends: 286 [2024-09-12 21:29:01,039 INFO L226 Difference]: Without dead ends: 284 [2024-09-12 21:29:01,039 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-12 21:29:01,040 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 895 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 21:29:01,040 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 45 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 21:29:01,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-09-12 21:29:01,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2024-09-12 21:29:01,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 275 states have (on average 1.250909090909091) internal successors, (344), 278 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:29:01,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 347 transitions. [2024-09-12 21:29:01,071 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 347 transitions. Word has length 21 [2024-09-12 21:29:01,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:29:01,071 INFO L474 AbstractCegarLoop]: Abstraction has 282 states and 347 transitions. [2024-09-12 21:29:01,071 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:29:01,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:01,072 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 347 transitions. [2024-09-12 21:29:01,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 21:29:01,072 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:29:01,072 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:29:01,072 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-12 21:29:01,072 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:29:01,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:01,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1451271672, now seen corresponding path program 1 times [2024-09-12 21:29:01,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:29:01,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071428021] [2024-09-12 21:29:01,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:29:01,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:29:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:01,134 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:29:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:01,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:29:01,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:29:01,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071428021] [2024-09-12 21:29:01,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071428021] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:29:01,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:29:01,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 21:29:01,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596407604] [2024-09-12 21:29:01,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:29:01,136 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:29:01,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:29:01,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:29:01,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:29:01,137 INFO L87 Difference]: Start difference. First operand 282 states and 347 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:29:01,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:29:01,566 INFO L93 Difference]: Finished difference Result 282 states and 347 transitions. [2024-09-12 21:29:01,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 21:29:01,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-12 21:29:01,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:29:01,567 INFO L225 Difference]: With dead ends: 282 [2024-09-12 21:29:01,567 INFO L226 Difference]: Without dead ends: 278 [2024-09-12 21:29:01,568 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-12 21:29:01,568 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 698 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 21:29:01,568 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 40 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 21:29:01,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-09-12 21:29:01,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2024-09-12 21:29:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 272 states have (on average 1.25) internal successors, (340), 274 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:29:01,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 343 transitions. [2024-09-12 21:29:01,593 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 343 transitions. Word has length 21 [2024-09-12 21:29:01,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:29:01,593 INFO L474 AbstractCegarLoop]: Abstraction has 278 states and 343 transitions. [2024-09-12 21:29:01,594 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:29:01,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:01,594 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 343 transitions. [2024-09-12 21:29:01,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 21:29:01,594 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:29:01,594 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:29:01,594 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-12 21:29:01,594 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:29:01,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:01,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1114116772, now seen corresponding path program 1 times [2024-09-12 21:29:01,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:29:01,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288357165] [2024-09-12 21:29:01,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:29:01,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:29:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:01,678 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:29:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:01,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:29:01,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:29:01,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288357165] [2024-09-12 21:29:01,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288357165] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:29:01,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:29:01,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 21:29:01,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25852421] [2024-09-12 21:29:01,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:29:01,681 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:29:01,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:29:01,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:29:01,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:29:01,681 INFO L87 Difference]: Start difference. First operand 278 states and 343 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:29:02,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:29:02,153 INFO L93 Difference]: Finished difference Result 278 states and 343 transitions. [2024-09-12 21:29:02,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 21:29:02,153 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-12 21:29:02,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:29:02,155 INFO L225 Difference]: With dead ends: 278 [2024-09-12 21:29:02,155 INFO L226 Difference]: Without dead ends: 253 [2024-09-12 21:29:02,156 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-12 21:29:02,156 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 693 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 21:29:02,156 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 36 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 21:29:02,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-09-12 21:29:02,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2024-09-12 21:29:02,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 248 states have (on average 1.0080645161290323) internal successors, (250), 249 states have internal predecessors, (250), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:29:02,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2024-09-12 21:29:02,181 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 21 [2024-09-12 21:29:02,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:29:02,182 INFO L474 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2024-09-12 21:29:02,182 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:29:02,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:02,185 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2024-09-12 21:29:02,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-09-12 21:29:02,191 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:29:02,192 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:29:02,192 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-09-12 21:29:02,192 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:29:02,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:02,192 INFO L85 PathProgramCache]: Analyzing trace with hash 25963049, now seen corresponding path program 1 times [2024-09-12 21:29:02,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:29:02,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71549854] [2024-09-12 21:29:02,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:29:02,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:29:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:04,816 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:29:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:04,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:29:04,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:29:04,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71549854] [2024-09-12 21:29:04,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71549854] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:29:04,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:29:04,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2024-09-12 21:29:04,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514030271] [2024-09-12 21:29:04,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:29:04,820 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-09-12 21:29:04,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:29:04,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-09-12 21:29:04,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1836, Invalid=2196, Unknown=0, NotChecked=0, Total=4032 [2024-09-12 21:29:04,822 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand has 64 states, 64 states have (on average 3.8125) internal successors, (244), 63 states have internal predecessors, (244), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:29:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:29:06,462 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2024-09-12 21:29:06,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-09-12 21:29:06,462 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 3.8125) internal successors, (244), 63 states have internal predecessors, (244), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 247 [2024-09-12 21:29:06,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:29:06,463 INFO L225 Difference]: With dead ends: 253 [2024-09-12 21:29:06,463 INFO L226 Difference]: Without dead ends: 251 [2024-09-12 21:29:06,466 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1946 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5560, Invalid=9940, Unknown=0, NotChecked=0, Total=15500 [2024-09-12 21:29:06,466 INFO L434 NwaCegarLoop]: 6 mSDtfsCounter, 257 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-12 21:29:06,467 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 37 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1775 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-12 21:29:06,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-09-12 21:29:06,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-09-12 21:29:06,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 247 states have (on average 1.0040485829959513) internal successors, (248), 247 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:29:06,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2024-09-12 21:29:06,490 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 247 [2024-09-12 21:29:06,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:29:06,492 INFO L474 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2024-09-12 21:29:06,492 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 3.8125) internal successors, (244), 63 states have internal predecessors, (244), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:29:06,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:06,492 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2024-09-12 21:29:06,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-09-12 21:29:06,493 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:29:06,494 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:29:06,494 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-09-12 21:29:06,494 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:29:06,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:06,495 INFO L85 PathProgramCache]: Analyzing trace with hash 804858766, now seen corresponding path program 1 times [2024-09-12 21:29:06,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:29:06,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449146424] [2024-09-12 21:29:06,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:29:06,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:29:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:10,807 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:29:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:10,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:29:10,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:29:10,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449146424] [2024-09-12 21:29:10,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449146424] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:29:10,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:29:10,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-12 21:29:10,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674978112] [2024-09-12 21:29:10,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:29:10,811 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 21:29:10,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:29:10,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 21:29:10,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-12 21:29:10,813 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand has 8 states, 8 states have (on average 30.625) internal successors, (245), 7 states have internal predecessors, (245), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:29:11,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:29:11,161 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2024-09-12 21:29:11,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 21:29:11,161 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 30.625) internal successors, (245), 7 states have internal predecessors, (245), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 248 [2024-09-12 21:29:11,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:29:11,162 INFO L225 Difference]: With dead ends: 251 [2024-09-12 21:29:11,162 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 21:29:11,163 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-12 21:29:11,163 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 247 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 21:29:11,163 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 18 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 21:29:11,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 21:29:11,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 21:29:11,164 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-09-12 21:29:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 21:29:11,164 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 248 [2024-09-12 21:29:11,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:29:11,164 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 21:29:11,164 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.625) internal successors, (245), 7 states have internal predecessors, (245), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:29:11,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:11,165 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 21:29:11,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 21:29:11,167 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2024-09-12 21:29:11,167 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2024-09-12 21:29:11,167 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2024-09-12 21:29:11,167 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2024-09-12 21:29:11,167 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2024-09-12 21:29:11,167 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2024-09-12 21:29:11,168 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2024-09-12 21:29:11,168 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2024-09-12 21:29:11,168 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2024-09-12 21:29:11,168 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2024-09-12 21:29:11,168 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2024-09-12 21:29:11,168 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2024-09-12 21:29:11,168 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2024-09-12 21:29:11,168 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2024-09-12 21:29:11,168 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2024-09-12 21:29:11,168 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2024-09-12 21:29:11,169 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-09-12 21:29:11,171 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:29:11,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 21:29:14,035 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 21:29:14,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 09:29:14 BoogieIcfgContainer [2024-09-12 21:29:14,048 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 21:29:14,049 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 21:29:14,049 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 21:29:14,049 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 21:29:14,049 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:28:49" (3/4) ... [2024-09-12 21:29:14,050 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 21:29:14,053 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 21:29:14,053 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 21:29:14,072 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 73 nodes and edges [2024-09-12 21:29:14,074 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-12 21:29:14,075 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-12 21:29:14,076 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 21:29:14,247 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 21:29:14,249 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 21:29:14,249 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 21:29:14,250 INFO L158 Benchmark]: Toolchain (without parser) took 26344.57ms. Allocated memory was 159.4MB in the beginning and 941.6MB in the end (delta: 782.2MB). Free memory was 101.3MB in the beginning and 823.7MB in the end (delta: -722.4MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2024-09-12 21:29:14,250 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 159.4MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 21:29:14,250 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.33ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 100.9MB in the beginning and 168.7MB in the end (delta: -67.8MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. [2024-09-12 21:29:14,250 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.64ms. Allocated memory is still 213.9MB. Free memory was 168.7MB in the beginning and 167.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 21:29:14,250 INFO L158 Benchmark]: Boogie Preprocessor took 100.27ms. Allocated memory is still 213.9MB. Free memory was 167.7MB in the beginning and 160.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-12 21:29:14,251 INFO L158 Benchmark]: RCFGBuilder took 901.63ms. Allocated memory is still 213.9MB. Free memory was 160.3MB in the beginning and 153.8MB in the end (delta: 6.6MB). Peak memory consumption was 111.4MB. Max. memory is 16.1GB. [2024-09-12 21:29:14,251 INFO L158 Benchmark]: TraceAbstraction took 24515.85ms. Allocated memory was 213.9MB in the beginning and 941.6MB in the end (delta: 727.7MB). Free memory was 153.8MB in the beginning and 852.0MB in the end (delta: -698.2MB). Peak memory consumption was 546.4MB. Max. memory is 16.1GB. [2024-09-12 21:29:14,251 INFO L158 Benchmark]: Witness Printer took 200.91ms. Allocated memory is still 941.6MB. Free memory was 852.0MB in the beginning and 823.7MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-09-12 21:29:14,252 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.09ms. Allocated memory is still 159.4MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 586.33ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 100.9MB in the beginning and 168.7MB in the end (delta: -67.8MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.64ms. Allocated memory is still 213.9MB. Free memory was 168.7MB in the beginning and 167.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.27ms. Allocated memory is still 213.9MB. Free memory was 167.7MB in the beginning and 160.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 901.63ms. Allocated memory is still 213.9MB. Free memory was 160.3MB in the beginning and 153.8MB in the end (delta: 6.6MB). Peak memory consumption was 111.4MB. Max. memory is 16.1GB. * TraceAbstraction took 24515.85ms. Allocated memory was 213.9MB in the beginning and 941.6MB in the end (delta: 727.7MB). Free memory was 153.8MB in the beginning and 852.0MB in the end (delta: -698.2MB). Peak memory consumption was 546.4MB. Max. memory is 16.1GB. * Witness Printer took 200.91ms. Allocated memory is still 941.6MB. Free memory was 852.0MB in the beginning and 823.7MB in the end (delta: 28.3MB). Peak memory consumption was 27.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: 35]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 47]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 76]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 88]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 105]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 117]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 145]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 157]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 173]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 185]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 207]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 219]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 255]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 267]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 2604]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 2616]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 308 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 21.6s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9771 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9771 mSDsluCounter, 1959 SdHoareTripleChecker+Invalid, 8.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1334 mSDsCounter, 1107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23665 IncrementalHoareTripleChecker+Invalid, 24772 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1107 mSolverCounterUnsat, 625 mSDtfsCounter, 23665 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 458 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308occurred in iteration=0, InterpolantAutomatonStates: 218, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 61 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 807 NumberOfCodeBlocks, 807 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 786 ConstructedInterpolants, 0 QuantifiedInterpolants, 2771 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 132]: Location Invariant Derived location invariant: ((((long long) main__t + 1) <= main__tagbuf_len) && (1 <= main__t)) - InvariantResult [Line: 25]: Location Invariant Derived location invariant: ((0 <= main__t) && (main__t <= main__tagbuf_len)) - InvariantResult [Line: 96]: Location Invariant Derived location invariant: ((1 <= main__t) && (main__t <= main__tagbuf_len)) - InvariantResult [Line: 2591]: Location Invariant Derived location invariant: ((59 <= main__t) && (((long long) main__t + 1) <= main__tagbuf_len)) - InvariantResult [Line: 64]: Location Invariant Derived location invariant: (((main__t == 0) || (1 <= main__t)) && (((long long) main__t + 1) <= main__tagbuf_len)) - InvariantResult [Line: 21]: Location Invariant Derived location invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-09-12 21:29:14,279 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/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