./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-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/SpamAssassin-loop.i.v+cfa-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 8f0362e5bdd04ddb68671929eb7c82f3a55838c2357b753aa3b8d313416b3614 --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:30,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 21:28:30,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 21:28:30,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 21:28:30,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 21:28:30,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 21:28:30,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 21:28:30,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 21:28:30,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 21:28:30,138 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 21:28:30,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 21:28:30,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 21:28:30,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 21:28:30,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 21:28:30,145 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 21:28:30,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 21:28:30,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 21:28:30,146 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 21:28:30,146 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 21:28:30,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 21:28:30,146 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 21:28:30,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 21:28:30,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 21:28:30,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 21:28:30,149 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 21:28:30,150 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 21:28:30,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 21:28:30,150 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 21:28:30,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 21:28:30,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 21:28:30,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 21:28:30,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 21:28:30,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 21:28:30,153 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 21:28:30,153 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 21:28:30,153 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 21:28:30,154 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 21:28:30,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 21:28:30,154 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 21:28:30,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 21:28:30,155 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 21:28:30,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 21:28:30,155 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 -> 8f0362e5bdd04ddb68671929eb7c82f3a55838c2357b753aa3b8d313416b3614 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:30,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 21:28:30,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 21:28:30,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 21:28:30,410 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 21:28:30,410 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 21:28:30,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2024-09-12 21:28:31,690 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 21:28:31,864 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 21:28:31,864 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2024-09-12 21:28:31,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a41765448/ca15135ada6943979c7664e97d8b9a8e/FLAG38321efd0 [2024-09-12 21:28:31,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a41765448/ca15135ada6943979c7664e97d8b9a8e [2024-09-12 21:28:31,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 21:28:31,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 21:28:31,888 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 21:28:31,888 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 21:28:31,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 21:28:31,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 09:28:31" (1/1) ... [2024-09-12 21:28:31,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63102b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:31, skipping insertion in model container [2024-09-12 21:28:31,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 09:28:31" (1/1) ... [2024-09-12 21:28:31,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 21:28:32,079 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/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2024-09-12 21:28:32,084 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/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2024-09-12 21:28:32,086 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/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2024-09-12 21:28:32,090 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/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2024-09-12 21:28:32,095 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/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2024-09-12 21:28:32,097 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/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2024-09-12 21:28:32,099 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/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2024-09-12 21:28:32,101 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/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2024-09-12 21:28:32,104 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/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2024-09-12 21:28:32,105 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/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2024-09-12 21:28:32,107 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/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2024-09-12 21:28:32,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/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2024-09-12 21:28:32,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/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2024-09-12 21:28:32,113 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/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2024-09-12 21:28:32,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/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2024-09-12 21:28:32,118 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/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2024-09-12 21:28:32,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 21:28:32,132 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 21:28:32,142 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/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2024-09-12 21:28:32,143 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/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2024-09-12 21:28:32,145 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/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2024-09-12 21:28:32,146 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/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2024-09-12 21:28:32,147 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/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2024-09-12 21:28:32,148 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/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2024-09-12 21:28:32,150 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/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2024-09-12 21:28:32,151 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/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2024-09-12 21:28:32,152 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/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2024-09-12 21:28:32,153 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/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2024-09-12 21:28:32,155 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/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2024-09-12 21:28:32,156 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/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2024-09-12 21:28:32,158 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/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2024-09-12 21:28:32,159 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/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2024-09-12 21:28:32,160 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/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2024-09-12 21:28:32,162 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/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2024-09-12 21:28:32,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 21:28:32,176 INFO L204 MainTranslator]: Completed translation [2024-09-12 21:28:32,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:32 WrapperNode [2024-09-12 21:28:32,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 21:28:32,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 21:28:32,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 21:28:32,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 21:28:32,183 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:32" (1/1) ... [2024-09-12 21:28:32,188 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:32" (1/1) ... [2024-09-12 21:28:32,194 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 21:28:32,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 21:28:32,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 21:28:32,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 21:28:32,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 21:28:32,206 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:32" (1/1) ... [2024-09-12 21:28:32,207 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:32" (1/1) ... [2024-09-12 21:28:32,208 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:32" (1/1) ... [2024-09-12 21:28:32,226 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:32,226 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:32" (1/1) ... [2024-09-12 21:28:32,227 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:32" (1/1) ... [2024-09-12 21:28:32,235 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:32" (1/1) ... [2024-09-12 21:28:32,239 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:32" (1/1) ... [2024-09-12 21:28:32,241 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:32" (1/1) ... [2024-09-12 21:28:32,242 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:32" (1/1) ... [2024-09-12 21:28:32,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 21:28:32,263 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 21:28:32,263 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 21:28:32,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 21:28:32,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:32" (1/1) ... [2024-09-12 21:28:32,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 21:28:32,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:28:32,297 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:32,301 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:32,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 21:28:32,357 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 21:28:32,357 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 21:28:32,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 21:28:32,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 21:28:32,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 21:28:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 21:28:32,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 21:28:32,433 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 21:28:32,437 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 21:28:32,668 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-09-12 21:28:32,668 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 21:28:32,695 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 21:28:32,695 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-12 21:28:32,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:28:32 BoogieIcfgContainer [2024-09-12 21:28:32,699 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 21:28:32,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 21:28:32,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 21:28:32,704 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 21:28:32,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 09:28:31" (1/3) ... [2024-09-12 21:28:32,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed556d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 09:28:32, skipping insertion in model container [2024-09-12 21:28:32,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:28:32" (2/3) ... [2024-09-12 21:28:32,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed556d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 09:28:32, skipping insertion in model container [2024-09-12 21:28:32,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:28:32" (3/3) ... [2024-09-12 21:28:32,707 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2024-09-12 21:28:32,727 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 21:28:32,727 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-09-12 21:28:32,801 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 21:28:32,806 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;@44a8428d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 21:28:32,806 INFO L337 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-09-12 21:28:32,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 59 states have internal predecessors, (81), 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:32,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 21:28:32,816 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:32,817 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:32,817 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:32,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:32,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1595173234, now seen corresponding path program 1 times [2024-09-12 21:28:32,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:32,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220663375] [2024-09-12 21:28:32,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:32,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:33,088 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:33,100 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:33,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:33,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220663375] [2024-09-12 21:28:33,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220663375] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:33,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:33,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 21:28:33,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028104299] [2024-09-12 21:28:33,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:33,115 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 21:28:33,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:33,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 21:28:33,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 21:28:33,141 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 59 states have internal predecessors, (81), 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 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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:33,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:33,333 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2024-09-12 21:28:33,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 21:28:33,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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:33,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:33,343 INFO L225 Difference]: With dead ends: 70 [2024-09-12 21:28:33,343 INFO L226 Difference]: Without dead ends: 58 [2024-09-12 21:28:33,345 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-12 21:28:33,348 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 60 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:33,348 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 11 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:28:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-12 21:28:33,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-09-12 21:28:33,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.475) internal successors, (59), 54 states have internal predecessors, (59), 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:33,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2024-09-12 21:28:33,389 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 12 [2024-09-12 21:28:33,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:33,389 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2024-09-12 21:28:33,389 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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:33,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:33,390 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2024-09-12 21:28:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-12 21:28:33,391 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:33,391 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:33,391 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 21:28:33,391 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:33,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:33,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2086065458, now seen corresponding path program 1 times [2024-09-12 21:28:33,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:33,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801389774] [2024-09-12 21:28:33,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:33,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:33,518 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:33,527 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:33,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:33,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801389774] [2024-09-12 21:28:33,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801389774] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:33,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:33,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 21:28:33,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787119956] [2024-09-12 21:28:33,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:33,530 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 21:28:33,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:33,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 21:28:33,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 21:28:33,531 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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:33,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:33,712 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2024-09-12 21:28:33,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 21:28:33,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 13 [2024-09-12 21:28:33,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:33,714 INFO L225 Difference]: With dead ends: 110 [2024-09-12 21:28:33,714 INFO L226 Difference]: Without dead ends: 58 [2024-09-12 21:28:33,715 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:28:33,716 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 86 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:33,716 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 10 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:28:33,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-12 21:28:33,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2024-09-12 21:28:33,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.45) internal successors, (58), 53 states have internal predecessors, (58), 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:33,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2024-09-12 21:28:33,736 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 13 [2024-09-12 21:28:33,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:33,737 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2024-09-12 21:28:33,737 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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:33,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:33,738 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2024-09-12 21:28:33,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-12 21:28:33,738 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:33,738 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:33,739 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 21:28:33,739 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:33,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:33,739 INFO L85 PathProgramCache]: Analyzing trace with hash -2089234227, now seen corresponding path program 1 times [2024-09-12 21:28:33,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:33,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900903636] [2024-09-12 21:28:33,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:33,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:33,862 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:33,869 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:33,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:33,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900903636] [2024-09-12 21:28:33,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900903636] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:33,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:33,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 21:28:33,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441952085] [2024-09-12 21:28:33,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:33,872 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 21:28:33,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:33,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 21:28:33,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 21:28:33,873 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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:34,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:34,011 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2024-09-12 21:28:34,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 21:28:34,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 13 [2024-09-12 21:28:34,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:34,013 INFO L225 Difference]: With dead ends: 57 [2024-09-12 21:28:34,013 INFO L226 Difference]: Without dead ends: 55 [2024-09-12 21:28:34,015 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:28:34,016 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:34,018 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 10 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:28:34,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-12 21:28:34,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-09-12 21:28:34,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.435897435897436) internal successors, (56), 51 states have internal predecessors, (56), 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:34,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2024-09-12 21:28:34,040 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 13 [2024-09-12 21:28:34,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:34,041 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2024-09-12 21:28:34,041 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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:34,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:34,042 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2024-09-12 21:28:34,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 21:28:34,042 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:34,042 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:34,043 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 21:28:34,043 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:34,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:34,043 INFO L85 PathProgramCache]: Analyzing trace with hash -243516670, now seen corresponding path program 1 times [2024-09-12 21:28:34,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:34,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425848327] [2024-09-12 21:28:34,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:34,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:34,206 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:34,210 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:34,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:34,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425848327] [2024-09-12 21:28:34,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425848327] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:34,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:34,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 21:28:34,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418836793] [2024-09-12 21:28:34,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:34,212 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 21:28:34,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:34,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 21:28:34,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 21:28:34,213 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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:34,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:34,328 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2024-09-12 21:28:34,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 21:28:34,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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:34,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:34,330 INFO L225 Difference]: With dead ends: 55 [2024-09-12 21:28:34,330 INFO L226 Difference]: Without dead ends: 53 [2024-09-12 21:28:34,330 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:28:34,331 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 94 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:34,331 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 10 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:28:34,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-12 21:28:34,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-12 21:28:34,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 49 states have internal predecessors, (54), 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:34,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2024-09-12 21:28:34,343 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 14 [2024-09-12 21:28:34,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:34,343 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2024-09-12 21:28:34,343 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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:34,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:34,344 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2024-09-12 21:28:34,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 21:28:34,347 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:34,347 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:34,347 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 21:28:34,348 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:34,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:34,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1040920916, now seen corresponding path program 1 times [2024-09-12 21:28:34,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:34,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357702993] [2024-09-12 21:28:34,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:34,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:34,424 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:34,428 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:34,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:34,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357702993] [2024-09-12 21:28:34,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357702993] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:34,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:34,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 21:28:34,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754783109] [2024-09-12 21:28:34,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:34,429 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 21:28:34,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:34,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 21:28:34,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 21:28:34,430 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:34,575 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2024-09-12 21:28:34,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 21:28:34,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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:34,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:34,576 INFO L225 Difference]: With dead ends: 53 [2024-09-12 21:28:34,576 INFO L226 Difference]: Without dead ends: 51 [2024-09-12 21:28:34,576 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-09-12 21:28:34,577 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 116 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:34,577 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 13 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:28:34,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-12 21:28:34,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-12 21:28:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 47 states have internal predecessors, (52), 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:34,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2024-09-12 21:28:34,591 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 15 [2024-09-12 21:28:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:34,591 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2024-09-12 21:28:34,592 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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:34,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2024-09-12 21:28:34,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 21:28:34,593 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:34,593 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:34,593 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 21:28:34,593 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:34,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:34,594 INFO L85 PathProgramCache]: Analyzing trace with hash -2004240627, now seen corresponding path program 1 times [2024-09-12 21:28:34,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:34,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249486189] [2024-09-12 21:28:34,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:34,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:34,644 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:34,648 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:34,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:34,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249486189] [2024-09-12 21:28:34,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249486189] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:34,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:34,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 21:28:34,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804375754] [2024-09-12 21:28:34,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:34,649 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 21:28:34,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:34,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 21:28:34,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 21:28:34,650 INFO L87 Difference]: Start difference. First operand 51 states and 55 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:34,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:34,765 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2024-09-12 21:28:34,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 21:28:34,765 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:34,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:34,766 INFO L225 Difference]: With dead ends: 52 [2024-09-12 21:28:34,766 INFO L226 Difference]: Without dead ends: 50 [2024-09-12 21:28:34,766 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:28:34,767 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 68 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:34,768 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 10 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:28:34,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-09-12 21:28:34,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-09-12 21:28:34,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 45 states have internal predecessors, (50), 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:34,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2024-09-12 21:28:34,780 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 15 [2024-09-12 21:28:34,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:34,780 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2024-09-12 21:28:34,780 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:34,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:34,781 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2024-09-12 21:28:34,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 21:28:34,781 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:34,782 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:34,782 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 21:28:34,782 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:34,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:34,782 INFO L85 PathProgramCache]: Analyzing trace with hash -2091186872, now seen corresponding path program 1 times [2024-09-12 21:28:34,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:34,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210007282] [2024-09-12 21:28:34,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:34,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:34,844 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:34,848 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:34,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:34,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210007282] [2024-09-12 21:28:34,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210007282] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:34,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:34,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 21:28:34,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378934644] [2024-09-12 21:28:34,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:34,850 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 21:28:34,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:34,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 21:28:34,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 21:28:34,851 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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:34,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:34,963 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2024-09-12 21:28:34,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 21:28:34,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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:34,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:34,964 INFO L225 Difference]: With dead ends: 50 [2024-09-12 21:28:34,964 INFO L226 Difference]: Without dead ends: 48 [2024-09-12 21:28:34,965 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:28:34,965 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 78 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:34,968 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 10 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:28:34,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-12 21:28:34,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-09-12 21:28:34,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 43 states have internal predecessors, (48), 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:34,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2024-09-12 21:28:34,991 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 16 [2024-09-12 21:28:34,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:34,992 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2024-09-12 21:28:34,992 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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:34,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:34,993 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2024-09-12 21:28:34,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 21:28:34,993 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:34,993 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:34,993 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-12 21:28:34,994 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:34,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:34,994 INFO L85 PathProgramCache]: Analyzing trace with hash -2001914178, now seen corresponding path program 1 times [2024-09-12 21:28:34,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:34,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674196394] [2024-09-12 21:28:34,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:34,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:35,064 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:35,067 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:35,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:35,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674196394] [2024-09-12 21:28:35,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674196394] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:35,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:35,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 21:28:35,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9780023] [2024-09-12 21:28:35,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:35,068 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 21:28:35,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:35,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 21:28:35,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 21:28:35,069 INFO L87 Difference]: Start difference. First operand 47 states and 51 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:35,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:35,192 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2024-09-12 21:28:35,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 21:28:35,192 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:35,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:35,193 INFO L225 Difference]: With dead ends: 47 [2024-09-12 21:28:35,193 INFO L226 Difference]: Without dead ends: 45 [2024-09-12 21:28:35,194 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-09-12 21:28:35,196 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 81 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:35,197 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 13 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:28:35,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-12 21:28:35,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-09-12 21:28:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 41 states have internal predecessors, (46), 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:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2024-09-12 21:28:35,215 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 16 [2024-09-12 21:28:35,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:35,218 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2024-09-12 21:28:35,218 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:35,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:35,218 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2024-09-12 21:28:35,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 21:28:35,219 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:35,219 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:35,219 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-12 21:28:35,219 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:35,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:35,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1929794253, now seen corresponding path program 1 times [2024-09-12 21:28:35,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:35,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625278801] [2024-09-12 21:28:35,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:35,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:35,283 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:35,286 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:35,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:35,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625278801] [2024-09-12 21:28:35,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625278801] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:35,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:35,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 21:28:35,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688061809] [2024-09-12 21:28:35,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:35,287 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 21:28:35,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:35,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 21:28:35,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 21:28:35,288 INFO L87 Difference]: Start difference. First operand 45 states and 49 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:35,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:35,400 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2024-09-12 21:28:35,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 21:28:35,400 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:35,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:35,401 INFO L225 Difference]: With dead ends: 45 [2024-09-12 21:28:35,401 INFO L226 Difference]: Without dead ends: 43 [2024-09-12 21:28:35,402 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-09-12 21:28:35,402 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 90 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:35,403 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 13 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:28:35,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-12 21:28:35,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-09-12 21:28:35,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 39 states have internal predecessors, (44), 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:35,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-09-12 21:28:35,411 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 17 [2024-09-12 21:28:35,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:35,411 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-09-12 21:28:35,412 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:35,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:35,412 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-09-12 21:28:35,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 21:28:35,412 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:35,412 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:35,413 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-12 21:28:35,413 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:35,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:35,413 INFO L85 PathProgramCache]: Analyzing trace with hash 305923428, now seen corresponding path program 1 times [2024-09-12 21:28:35,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:35,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643659019] [2024-09-12 21:28:35,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:35,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:35,479 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:35,482 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:35,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:35,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643659019] [2024-09-12 21:28:35,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643659019] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:35,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:35,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 21:28:35,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505519536] [2024-09-12 21:28:35,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:35,484 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 21:28:35,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:35,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 21:28:35,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 21:28:35,484 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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:35,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:35,571 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2024-09-12 21:28:35,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 21:28:35,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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:35,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:35,572 INFO L225 Difference]: With dead ends: 44 [2024-09-12 21:28:35,572 INFO L226 Difference]: Without dead ends: 42 [2024-09-12 21:28:35,572 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:28:35,573 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:35,573 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 10 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:28:35,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-12 21:28:35,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-09-12 21:28:35,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.3125) internal successors, (42), 37 states have internal predecessors, (42), 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:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2024-09-12 21:28:35,582 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2024-09-12 21:28:35,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:35,582 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-09-12 21:28:35,582 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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:35,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:35,583 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2024-09-12 21:28:35,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 21:28:35,583 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:35,583 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:35,584 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-12 21:28:35,584 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:35,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:35,584 INFO L85 PathProgramCache]: Analyzing trace with hash 893694809, now seen corresponding path program 1 times [2024-09-12 21:28:35,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:35,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609792309] [2024-09-12 21:28:35,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:35,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:35,639 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:35,642 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:35,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:35,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609792309] [2024-09-12 21:28:35,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609792309] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:35,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:35,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 21:28:35,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152625307] [2024-09-12 21:28:35,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:35,645 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 21:28:35,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:35,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 21:28:35,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 21:28:35,646 INFO L87 Difference]: Start difference. First operand 41 states and 45 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:35,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:35,757 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2024-09-12 21:28:35,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 21:28:35,758 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:35,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:35,759 INFO L225 Difference]: With dead ends: 46 [2024-09-12 21:28:35,759 INFO L226 Difference]: Without dead ends: 44 [2024-09-12 21:28:35,759 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:35,760 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 43 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:35,760 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 10 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:28:35,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-12 21:28:35,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2024-09-12 21:28:35,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 35 states have internal predecessors, (40), 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:35,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-09-12 21:28:35,775 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 19 [2024-09-12 21:28:35,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:35,776 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-09-12 21:28:35,776 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:35,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:35,776 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-09-12 21:28:35,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-12 21:28:35,778 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:35,779 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:35,779 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-12 21:28:35,779 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:35,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:35,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1934738442, now seen corresponding path program 1 times [2024-09-12 21:28:35,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:35,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057385872] [2024-09-12 21:28:35,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:35,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:35,845 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:35,848 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:35,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:35,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057385872] [2024-09-12 21:28:35,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057385872] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:35,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:35,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 21:28:35,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046426377] [2024-09-12 21:28:35,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:35,850 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 21:28:35,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:35,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 21:28:35,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 21:28:35,851 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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:35,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:35,991 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2024-09-12 21:28:35,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 21:28:35,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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:35,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:35,992 INFO L225 Difference]: With dead ends: 55 [2024-09-12 21:28:35,992 INFO L226 Difference]: Without dead ends: 53 [2024-09-12 21:28:35,992 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-12 21:28:35,993 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 93 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:35,993 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 13 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:28:35,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-12 21:28:36,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 37. [2024-09-12 21:28:36,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 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:36,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-09-12 21:28:36,002 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 20 [2024-09-12 21:28:36,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:36,002 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-09-12 21:28:36,002 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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:36,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:36,003 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-09-12 21:28:36,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 21:28:36,004 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:36,004 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:28:36,004 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-12 21:28:36,004 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:36,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:36,005 INFO L85 PathProgramCache]: Analyzing trace with hash -152647297, now seen corresponding path program 1 times [2024-09-12 21:28:36,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:36,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885301131] [2024-09-12 21:28:36,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:36,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:36,089 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:36,091 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:36,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:36,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885301131] [2024-09-12 21:28:36,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885301131] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:36,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:36,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 21:28:36,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257655680] [2024-09-12 21:28:36,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:36,093 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:28:36,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:36,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:28:36,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:28:36,094 INFO L87 Difference]: Start difference. First operand 37 states and 41 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:28:36,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:36,222 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-09-12 21:28:36,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 21:28:36,223 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:28:36,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:36,224 INFO L225 Difference]: With dead ends: 40 [2024-09-12 21:28:36,225 INFO L226 Difference]: Without dead ends: 38 [2024-09-12 21:28:36,225 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-09-12 21:28:36,225 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 78 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:36,225 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 16 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:28:36,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-12 21:28:36,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2024-09-12 21:28:36,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 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:36,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-09-12 21:28:36,238 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 21 [2024-09-12 21:28:36,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:36,239 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-09-12 21:28:36,239 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:28:36,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:36,239 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-09-12 21:28:36,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-12 21:28:36,240 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:36,240 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] [2024-09-12 21:28:36,240 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-12 21:28:36,240 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:36,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:36,241 INFO L85 PathProgramCache]: Analyzing trace with hash -437095760, now seen corresponding path program 1 times [2024-09-12 21:28:36,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:36,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653541658] [2024-09-12 21:28:36,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:36,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:36,341 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:36,344 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:36,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:36,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653541658] [2024-09-12 21:28:36,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653541658] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:36,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:36,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 21:28:36,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510137921] [2024-09-12 21:28:36,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:36,346 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 21:28:36,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:36,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 21:28:36,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 21:28:36,347 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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:36,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:36,505 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2024-09-12 21:28:36,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 21:28:36,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 22 [2024-09-12 21:28:36,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:36,506 INFO L225 Difference]: With dead ends: 50 [2024-09-12 21:28:36,506 INFO L226 Difference]: Without dead ends: 48 [2024-09-12 21:28:36,507 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-12 21:28:36,507 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 78 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:36,508 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 13 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:28:36,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-12 21:28:36,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. [2024-09-12 21:28:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 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:36,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-09-12 21:28:36,520 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2024-09-12 21:28:36,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:36,520 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-09-12 21:28:36,521 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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:36,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-09-12 21:28:36,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-12 21:28:36,522 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:36,522 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] [2024-09-12 21:28:36,522 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-12 21:28:36,522 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:36,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:36,523 INFO L85 PathProgramCache]: Analyzing trace with hash -665063515, now seen corresponding path program 1 times [2024-09-12 21:28:36,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:36,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433259652] [2024-09-12 21:28:36,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:36,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:36,614 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:36,617 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:36,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:36,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433259652] [2024-09-12 21:28:36,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433259652] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:36,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:36,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 21:28:36,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512209876] [2024-09-12 21:28:36,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:36,618 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:28:36,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:36,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:28:36,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:28:36,619 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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:36,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:36,739 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-09-12 21:28:36,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 21:28:36,740 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 23 [2024-09-12 21:28:36,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:36,740 INFO L225 Difference]: With dead ends: 36 [2024-09-12 21:28:36,740 INFO L226 Difference]: Without dead ends: 34 [2024-09-12 21:28:36,742 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-12 21:28:36,742 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 66 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:36,743 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 16 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:28:36,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-12 21:28:36,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2024-09-12 21:28:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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:36,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-09-12 21:28:36,751 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 23 [2024-09-12 21:28:36,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:36,751 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-09-12 21:28:36,751 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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:36,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:36,752 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-09-12 21:28:36,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-12 21:28:36,753 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:28:36,753 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] [2024-09-12 21:28:36,754 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-12 21:28:36,754 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 21:28:36,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:36,754 INFO L85 PathProgramCache]: Analyzing trace with hash 857870678, now seen corresponding path program 1 times [2024-09-12 21:28:36,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:28:36,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972682993] [2024-09-12 21:28:36,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:28:36,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:28:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:36,841 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:28:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:28:36,845 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:36,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:28:36,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972682993] [2024-09-12 21:28:36,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972682993] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:28:36,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:28:36,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 21:28:36,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99996106] [2024-09-12 21:28:36,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:28:36,846 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:28:36,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:28:36,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:28:36,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:28:36,847 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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:37,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:28:37,046 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2024-09-12 21:28:37,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 21:28:37,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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 24 [2024-09-12 21:28:37,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:28:37,047 INFO L225 Difference]: With dead ends: 66 [2024-09-12 21:28:37,047 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 21:28:37,047 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-09-12 21:28:37,048 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 89 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:28:37,048 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 13 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:28:37,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 21:28:37,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 21:28:37,048 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:28:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 21:28:37,049 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2024-09-12 21:28:37,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:28:37,049 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 21:28:37,049 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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:37,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:28:37,049 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 21:28:37,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 21:28:37,055 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2024-09-12 21:28:37,056 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2024-09-12 21:28:37,056 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2024-09-12 21:28:37,056 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2024-09-12 21:28:37,056 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2024-09-12 21:28:37,056 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2024-09-12 21:28:37,056 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2024-09-12 21:28:37,056 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2024-09-12 21:28:37,057 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2024-09-12 21:28:37,057 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2024-09-12 21:28:37,057 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2024-09-12 21:28:37,057 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2024-09-12 21:28:37,057 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2024-09-12 21:28:37,057 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2024-09-12 21:28:37,057 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2024-09-12 21:28:37,057 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2024-09-12 21:28:37,057 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-12 21:28:37,060 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:28:37,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 21:28:38,601 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 21:28:38,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 09:28:38 BoogieIcfgContainer [2024-09-12 21:28:38,618 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 21:28:38,619 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 21:28:38,619 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 21:28:38,619 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 21:28:38,620 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:32" (3/4) ... [2024-09-12 21:28:38,621 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 21:28:38,624 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 21:28:38,624 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 21:28:38,630 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-09-12 21:28:38,630 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-12 21:28:38,630 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-12 21:28:38,631 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 21:28:38,650 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(__return_334) == __return_334) && (((long long) main__limit + 4) <= main__bufsize)) && ((main__i == 0) || (0 < main__i))) [2024-09-12 21:28:38,650 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= main__i) && (1 <= main__j)) && (\old(__return_334) == __return_334)) && (((long long) main__limit + 4) <= main__bufsize)) || ((((main__j == 0) && (\old(__return_334) == __return_334)) && (((long long) main__limit + 4) <= main__bufsize)) && (((main__i == 0) && (1 <= main__len)) || ((1 <= main__i) && (((long long) main__i + 1) <= main__len))))) [2024-09-12 21:28:38,650 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((main__j == 0) && (\old(__return_334) == __return_334)) && (((long long) main__limit + 4) <= main__bufsize)) && (((main__i == 0) && (1 <= main__len)) || ((1 <= main__i) && (((long long) main__i + 1) <= main__len)))) && (5 <= main__bufsize)) || (((((1 <= main__j) && ((5 + main__j) <= main__bufsize)) && (\old(__return_334) == __return_334)) && (((long long) main__limit + 4) <= main__bufsize)) && (((main__i == 0) && (1 <= main__len)) || ((1 <= main__i) && (((long long) main__i + 1) <= main__len))))) [2024-09-12 21:28:38,729 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 21:28:38,730 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 21:28:38,730 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 21:28:38,730 INFO L158 Benchmark]: Toolchain (without parser) took 6844.08ms. Allocated memory was 146.8MB in the beginning and 226.5MB in the end (delta: 79.7MB). Free memory was 92.5MB in the beginning and 122.0MB in the end (delta: -29.4MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. [2024-09-12 21:28:38,731 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 146.8MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 21:28:38,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.69ms. Allocated memory is still 146.8MB. Free memory was 92.3MB in the beginning and 73.9MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-09-12 21:28:38,732 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.43ms. Allocated memory is still 146.8MB. Free memory was 73.9MB in the beginning and 73.0MB in the end (delta: 845.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 21:28:38,732 INFO L158 Benchmark]: Boogie Preprocessor took 53.37ms. Allocated memory is still 146.8MB. Free memory was 73.0MB in the beginning and 70.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 21:28:38,733 INFO L158 Benchmark]: RCFGBuilder took 436.07ms. Allocated memory was 146.8MB in the beginning and 188.7MB in the end (delta: 41.9MB). Free memory was 118.6MB in the beginning and 145.9MB in the end (delta: -27.3MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2024-09-12 21:28:38,733 INFO L158 Benchmark]: TraceAbstraction took 5917.34ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 144.8MB in the beginning and 128.3MB in the end (delta: 16.6MB). Peak memory consumption was 117.2MB. Max. memory is 16.1GB. [2024-09-12 21:28:38,733 INFO L158 Benchmark]: Witness Printer took 111.02ms. Allocated memory is still 226.5MB. Free memory was 128.3MB in the beginning and 122.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-12 21:28:38,734 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.11ms. Allocated memory is still 146.8MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.69ms. Allocated memory is still 146.8MB. Free memory was 92.3MB in the beginning and 73.9MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.43ms. Allocated memory is still 146.8MB. Free memory was 73.9MB in the beginning and 73.0MB in the end (delta: 845.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.37ms. Allocated memory is still 146.8MB. Free memory was 73.0MB in the beginning and 70.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 436.07ms. Allocated memory was 146.8MB in the beginning and 188.7MB in the end (delta: 41.9MB). Free memory was 118.6MB in the beginning and 145.9MB in the end (delta: -27.3MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5917.34ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 144.8MB in the beginning and 128.3MB in the end (delta: 16.6MB). Peak memory consumption was 117.2MB. Max. memory is 16.1GB. * Witness Printer took 111.02ms. Allocated memory is still 226.5MB. Free memory was 128.3MB in the beginning and 122.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 59]: 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: 100]: 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: 112]: 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: 141]: 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: 153]: 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: 165]: 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: 177]: 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: 193]: 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: 205]: 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: 217]: 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: 229]: 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: 245]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 257]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 64 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1283 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1283 mSDsluCounter, 191 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 141 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2102 IncrementalHoareTripleChecker+Invalid, 2157 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 50 mSDtfsCounter, 2102 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=0, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 46 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 278 NumberOfCodeBlocks, 278 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 838 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 38]: Location Invariant Derived location invariant: ((((((main__j == 0) && (\old(__return_334) == __return_334)) && (((long long) main__limit + 4) <= main__bufsize)) && (((main__i == 0) && (1 <= main__len)) || ((1 <= main__i) && (((long long) main__i + 1) <= main__len)))) && (5 <= main__bufsize)) || (((((1 <= main__j) && ((5 + main__j) <= main__bufsize)) && (\old(__return_334) == __return_334)) && (((long long) main__limit + 4) <= main__bufsize)) && (((main__i == 0) && (1 <= main__len)) || ((1 <= main__i) && (((long long) main__i + 1) <= main__len))))) - InvariantResult [Line: 30]: Location Invariant Derived location invariant: (((\old(__return_334) == __return_334) && (((long long) main__limit + 4) <= main__bufsize)) && ((main__i == 0) || (0 < main__i))) - InvariantResult [Line: 34]: Location Invariant Derived location invariant: (((((1 <= main__i) && (1 <= main__j)) && (\old(__return_334) == __return_334)) && (((long long) main__limit + 4) <= main__bufsize)) || ((((main__j == 0) && (\old(__return_334) == __return_334)) && (((long long) main__limit + 4) <= main__bufsize)) && (((main__i == 0) && (1 <= main__len)) || ((1 <= main__i) && (((long long) main__i + 1) <= main__len))))) RESULT: Ultimate proved your program to be correct! [2024-09-12 21:28:38,765 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE