./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-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 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version de325976 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-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 133ba40f5b51c272364c51a4e246bcd97a40cd88b0bcd4bd92df8f8d6bb23a52 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-de32597-m [2024-09-18 15:35:51,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-18 15:35:51,197 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-18 15:35:51,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-18 15:35:51,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-18 15:35:51,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-18 15:35:51,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-18 15:35:51,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-18 15:35:51,226 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-18 15:35:51,227 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-18 15:35:51,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-18 15:35:51,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-18 15:35:51,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-18 15:35:51,229 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-18 15:35:51,230 INFO L153 SettingsManager]: * Use SBE=true [2024-09-18 15:35:51,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-18 15:35:51,230 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-18 15:35:51,231 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-18 15:35:51,231 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-18 15:35:51,231 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-18 15:35:51,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-18 15:35:51,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-18 15:35:51,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-18 15:35:51,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-18 15:35:51,233 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-18 15:35:51,233 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-18 15:35:51,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-18 15:35:51,233 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-18 15:35:51,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-18 15:35:51,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-18 15:35:51,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-18 15:35:51,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-18 15:35:51,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-18 15:35:51,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-18 15:35:51,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-18 15:35:51,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-18 15:35:51,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-18 15:35:51,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-18 15:35:51,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-18 15:35:51,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-18 15:35:51,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-18 15:35:51,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-18 15:35:51,238 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 -> 133ba40f5b51c272364c51a4e246bcd97a40cd88b0bcd4bd92df8f8d6bb23a52 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-18 15:35:51,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-18 15:35:51,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-18 15:35:51,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-18 15:35:51,527 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-18 15:35:51,527 INFO L274 PluginConnector]: CDTParser initialized [2024-09-18 15:35:51,528 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2024-09-18 15:35:52,920 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-18 15:35:53,112 INFO L384 CDTParser]: Found 1 translation units. [2024-09-18 15:35:53,113 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2024-09-18 15:35:53,124 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/c88d67d84/005652c146f04c65bfedc7c3ab7e26bb/FLAG53e7e5dfe [2024-09-18 15:35:53,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/c88d67d84/005652c146f04c65bfedc7c3ab7e26bb [2024-09-18 15:35:53,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-18 15:35:53,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-18 15:35:53,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-18 15:35:53,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-18 15:35:53,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-18 15:35:53,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 03:35:53" (1/1) ... [2024-09-18 15:35:53,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24484fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:53, skipping insertion in model container [2024-09-18 15:35:53,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 03:35:53" (1/1) ... [2024-09-18 15:35:53,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-18 15:35:53,767 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2024-09-18 15:35:53,772 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2024-09-18 15:35:53,777 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2024-09-18 15:35:53,784 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2024-09-18 15:35:53,786 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2024-09-18 15:35:53,790 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2024-09-18 15:35:53,792 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2024-09-18 15:35:53,794 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2024-09-18 15:35:53,795 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2024-09-18 15:35:53,798 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2024-09-18 15:35:53,800 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2024-09-18 15:35:53,803 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2024-09-18 15:35:53,808 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2024-09-18 15:35:53,810 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2024-09-18 15:35:53,815 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2024-09-18 15:35:53,816 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2024-09-18 15:35:53,818 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2024-09-18 15:35:53,819 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2024-09-18 15:35:53,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-18 15:35:53,839 INFO L200 MainTranslator]: Completed pre-run [2024-09-18 15:35:53,854 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2024-09-18 15:35:53,856 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2024-09-18 15:35:53,857 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2024-09-18 15:35:53,858 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2024-09-18 15:35:53,859 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2024-09-18 15:35:53,861 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2024-09-18 15:35:53,862 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2024-09-18 15:35:53,863 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2024-09-18 15:35:53,864 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2024-09-18 15:35:53,866 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2024-09-18 15:35:53,870 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2024-09-18 15:35:53,873 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2024-09-18 15:35:53,875 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2024-09-18 15:35:53,876 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2024-09-18 15:35:53,877 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2024-09-18 15:35:53,878 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2024-09-18 15:35:53,879 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2024-09-18 15:35:53,880 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2024-09-18 15:35:53,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-18 15:35:53,897 INFO L204 MainTranslator]: Completed translation [2024-09-18 15:35:53,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:53 WrapperNode [2024-09-18 15:35:53,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-18 15:35:53,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-18 15:35:53,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-18 15:35:53,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-18 15:35:53,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:53" (1/1) ... [2024-09-18 15:35:53,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:53" (1/1) ... [2024-09-18 15:35:53,918 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-18 15:35:53,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-18 15:35:53,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-18 15:35:53,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-18 15:35:53,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-18 15:35:53,930 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:53" (1/1) ... [2024-09-18 15:35:53,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:53" (1/1) ... [2024-09-18 15:35:53,933 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:53" (1/1) ... [2024-09-18 15:35:53,950 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-18 15:35:53,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:53" (1/1) ... [2024-09-18 15:35:53,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:53" (1/1) ... [2024-09-18 15:35:53,957 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:53" (1/1) ... [2024-09-18 15:35:53,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:53" (1/1) ... [2024-09-18 15:35:53,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:53" (1/1) ... [2024-09-18 15:35:53,966 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:53" (1/1) ... [2024-09-18 15:35:53,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-18 15:35:53,970 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-18 15:35:53,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-18 15:35:53,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-18 15:35:53,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:53" (1/1) ... [2024-09-18 15:35:53,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-18 15:35:53,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:35:54,007 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-18 15:35:54,009 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-18 15:35:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-18 15:35:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-18 15:35:54,047 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-18 15:35:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-18 15:35:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-18 15:35:54,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-18 15:35:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-18 15:35:54,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-18 15:35:54,117 INFO L242 CfgBuilder]: Building ICFG [2024-09-18 15:35:54,119 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-18 15:35:54,406 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2024-09-18 15:35:54,407 INFO L291 CfgBuilder]: Performing block encoding [2024-09-18 15:35:54,431 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-18 15:35:54,432 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-18 15:35:54,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 03:35:54 BoogieIcfgContainer [2024-09-18 15:35:54,432 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-18 15:35:54,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-18 15:35:54,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-18 15:35:54,438 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-18 15:35:54,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.09 03:35:53" (1/3) ... [2024-09-18 15:35:54,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c332920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 03:35:54, skipping insertion in model container [2024-09-18 15:35:54,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:35:53" (2/3) ... [2024-09-18 15:35:54,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c332920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 03:35:54, skipping insertion in model container [2024-09-18 15:35:54,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 03:35:54" (3/3) ... [2024-09-18 15:35:54,440 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2024-09-18 15:35:54,458 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-18 15:35:54,459 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-09-18 15:35:54,513 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-18 15:35:54,519 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;@2ac90d4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-18 15:35:54,520 INFO L337 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-09-18 15:35:54,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 74 states have internal predecessors, (104), 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-18 15:35:54,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-18 15:35:54,533 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:54,534 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:54,534 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-18 15:35:54,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:54,540 INFO L85 PathProgramCache]: Analyzing trace with hash 315066952, now seen corresponding path program 1 times [2024-09-18 15:35:54,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:54,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554753320] [2024-09-18 15:35:54,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:54,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:54,961 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:54,974 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-18 15:35:54,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:54,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554753320] [2024-09-18 15:35:54,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554753320] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:54,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:54,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-18 15:35:54,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101873652] [2024-09-18 15:35:54,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:54,986 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-18 15:35:54,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:55,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-18 15:35:55,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-18 15:35:55,011 INFO L87 Difference]: Start difference. First operand has 79 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 74 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:55,305 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2024-09-18 15:35:55,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-18 15:35:55,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-18 15:35:55,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:55,317 INFO L225 Difference]: With dead ends: 89 [2024-09-18 15:35:55,318 INFO L226 Difference]: Without dead ends: 74 [2024-09-18 15:35:55,321 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-18 15:35:55,323 INFO L434 NwaCegarLoop]: 70 mSDtfsCounter, 24 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:55,324 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 187 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-18 15:35:55,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-09-18 15:35:55,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2024-09-18 15:35:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 68 states have internal predecessors, (73), 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-18 15:35:55,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-09-18 15:35:55,361 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 11 [2024-09-18 15:35:55,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:55,362 INFO L474 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-09-18 15:35:55,362 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:55,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:55,364 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-09-18 15:35:55,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-18 15:35:55,365 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:55,365 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:55,366 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-18 15:35:55,366 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-18 15:35:55,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:55,367 INFO L85 PathProgramCache]: Analyzing trace with hash 311896200, now seen corresponding path program 1 times [2024-09-18 15:35:55,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:55,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087930465] [2024-09-18 15:35:55,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:55,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:55,497 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:55,503 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-18 15:35:55,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:55,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087930465] [2024-09-18 15:35:55,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087930465] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:55,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:55,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-18 15:35:55,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704789788] [2024-09-18 15:35:55,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:55,506 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-18 15:35:55,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:55,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-18 15:35:55,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-18 15:35:55,507 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:55,655 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2024-09-18 15:35:55,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-18 15:35:55,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-18 15:35:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:55,657 INFO L225 Difference]: With dead ends: 74 [2024-09-18 15:35:55,657 INFO L226 Difference]: Without dead ends: 72 [2024-09-18 15:35:55,657 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-18 15:35:55,658 INFO L434 NwaCegarLoop]: 62 mSDtfsCounter, 12 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:55,659 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 166 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:55,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-09-18 15:35:55,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2024-09-18 15:35:55,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.392156862745098) internal successors, (71), 66 states have internal predecessors, (71), 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-18 15:35:55,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2024-09-18 15:35:55,669 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 11 [2024-09-18 15:35:55,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:55,669 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2024-09-18 15:35:55,669 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:55,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:55,670 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2024-09-18 15:35:55,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-18 15:35:55,671 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:55,671 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:55,671 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-18 15:35:55,671 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-18 15:35:55,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:55,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1659047165, now seen corresponding path program 1 times [2024-09-18 15:35:55,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:55,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990869903] [2024-09-18 15:35:55,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:55,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:55,797 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:55,805 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-18 15:35:55,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:55,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990869903] [2024-09-18 15:35:55,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990869903] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:55,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:55,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-18 15:35:55,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682912855] [2024-09-18 15:35:55,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:55,806 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-18 15:35:55,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:55,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-18 15:35:55,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:35:55,807 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:55,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:55,989 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2024-09-18 15:35:55,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-18 15:35:55,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-18 15:35:55,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:55,991 INFO L225 Difference]: With dead ends: 72 [2024-09-18 15:35:55,991 INFO L226 Difference]: Without dead ends: 70 [2024-09-18 15:35:55,992 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-18 15:35:55,993 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 53 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:55,994 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 129 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-18 15:35:56,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-09-18 15:35:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.38) internal successors, (69), 64 states have internal predecessors, (69), 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-18 15:35:56,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2024-09-18 15:35:56,039 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 14 [2024-09-18 15:35:56,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:56,039 INFO L474 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2024-09-18 15:35:56,040 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:56,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:56,040 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2024-09-18 15:35:56,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-18 15:35:56,046 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:56,046 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:56,046 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-18 15:35:56,047 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-18 15:35:56,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:56,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1688353559, now seen corresponding path program 1 times [2024-09-18 15:35:56,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:56,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281170108] [2024-09-18 15:35:56,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:56,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:56,160 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:56,165 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-18 15:35:56,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:56,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281170108] [2024-09-18 15:35:56,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281170108] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:56,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:56,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-18 15:35:56,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264787455] [2024-09-18 15:35:56,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:56,167 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-18 15:35:56,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:56,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-18 15:35:56,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:35:56,172 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:56,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:56,341 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2024-09-18 15:35:56,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-18 15:35:56,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-18 15:35:56,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:56,343 INFO L225 Difference]: With dead ends: 70 [2024-09-18 15:35:56,343 INFO L226 Difference]: Without dead ends: 68 [2024-09-18 15:35:56,343 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-18 15:35:56,344 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 51 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:56,345 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 123 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:56,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-18 15:35:56,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-09-18 15:35:56,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 62 states have internal predecessors, (67), 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-18 15:35:56,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2024-09-18 15:35:56,356 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 14 [2024-09-18 15:35:56,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:56,356 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2024-09-18 15:35:56,356 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:56,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2024-09-18 15:35:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-18 15:35:56,358 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:56,358 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:56,358 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-18 15:35:56,359 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-18 15:35:56,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:56,359 INFO L85 PathProgramCache]: Analyzing trace with hash -108700357, now seen corresponding path program 1 times [2024-09-18 15:35:56,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:56,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705187102] [2024-09-18 15:35:56,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:56,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:56,438 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:56,442 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-18 15:35:56,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:56,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705187102] [2024-09-18 15:35:56,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705187102] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:56,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:56,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-18 15:35:56,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573027111] [2024-09-18 15:35:56,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:56,444 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-18 15:35:56,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:56,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-18 15:35:56,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:35:56,447 INFO L87 Difference]: Start difference. First operand 66 states and 70 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-18 15:35:56,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:56,602 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2024-09-18 15:35:56,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-18 15:35:56,603 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-18 15:35:56,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:56,603 INFO L225 Difference]: With dead ends: 68 [2024-09-18 15:35:56,604 INFO L226 Difference]: Without dead ends: 66 [2024-09-18 15:35:56,604 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-18 15:35:56,605 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 48 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:56,607 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 117 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:56,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-18 15:35:56,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-09-18 15:35:56,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 60 states have internal predecessors, (65), 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-18 15:35:56,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2024-09-18 15:35:56,623 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 15 [2024-09-18 15:35:56,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:56,624 INFO L474 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2024-09-18 15:35:56,624 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-18 15:35:56,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:56,626 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2024-09-18 15:35:56,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-18 15:35:56,626 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:56,626 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:56,627 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-18 15:35:56,627 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-18 15:35:56,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:56,627 INFO L85 PathProgramCache]: Analyzing trace with hash -108714259, now seen corresponding path program 1 times [2024-09-18 15:35:56,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:56,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573578796] [2024-09-18 15:35:56,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:56,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:56,694 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:56,698 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-18 15:35:56,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:56,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573578796] [2024-09-18 15:35:56,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573578796] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:56,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:56,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-18 15:35:56,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609432263] [2024-09-18 15:35:56,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:56,699 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-18 15:35:56,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:56,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-18 15:35:56,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:35:56,701 INFO L87 Difference]: Start difference. First operand 64 states and 68 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-18 15:35:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:56,832 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2024-09-18 15:35:56,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-18 15:35:56,833 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-18 15:35:56,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:56,834 INFO L225 Difference]: With dead ends: 66 [2024-09-18 15:35:56,834 INFO L226 Difference]: Without dead ends: 64 [2024-09-18 15:35:56,834 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-18 15:35:56,835 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 46 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:56,836 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 111 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:56,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-18 15:35:56,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-09-18 15:35:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 58 states have internal predecessors, (63), 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-18 15:35:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2024-09-18 15:35:56,844 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 15 [2024-09-18 15:35:56,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:56,844 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2024-09-18 15:35:56,844 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-18 15:35:56,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:56,845 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2024-09-18 15:35:56,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-18 15:35:56,845 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:56,845 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:56,845 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-18 15:35:56,846 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-18 15:35:56,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:56,846 INFO L85 PathProgramCache]: Analyzing trace with hash -109142256, now seen corresponding path program 1 times [2024-09-18 15:35:56,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:56,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502359052] [2024-09-18 15:35:56,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:56,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:56,937 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:56,941 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-18 15:35:56,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:56,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502359052] [2024-09-18 15:35:56,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502359052] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:56,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:56,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-18 15:35:56,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9503459] [2024-09-18 15:35:56,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:56,944 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-18 15:35:56,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:56,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-18 15:35:56,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-18 15:35:56,945 INFO L87 Difference]: Start difference. First operand 62 states and 66 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-18 15:35:57,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:57,053 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2024-09-18 15:35:57,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-18 15:35:57,053 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-18 15:35:57,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:57,054 INFO L225 Difference]: With dead ends: 64 [2024-09-18 15:35:57,054 INFO L226 Difference]: Without dead ends: 60 [2024-09-18 15:35:57,055 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:35:57,055 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 16 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:57,056 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 128 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-18 15:35:57,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-09-18 15:35:57,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.3409090909090908) 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-18 15:35:57,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2024-09-18 15:35:57,067 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 15 [2024-09-18 15:35:57,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:57,068 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2024-09-18 15:35:57,068 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-18 15:35:57,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:57,069 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2024-09-18 15:35:57,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-18 15:35:57,070 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:57,070 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:57,070 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-18 15:35:57,071 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-18 15:35:57,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:57,071 INFO L85 PathProgramCache]: Analyzing trace with hash 799355856, now seen corresponding path program 1 times [2024-09-18 15:35:57,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:57,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181152690] [2024-09-18 15:35:57,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:57,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:57,129 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:57,132 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-18 15:35:57,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:57,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181152690] [2024-09-18 15:35:57,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181152690] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:57,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:57,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-18 15:35:57,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408796581] [2024-09-18 15:35:57,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:57,134 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-18 15:35:57,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:57,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-18 15:35:57,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-18 15:35:57,135 INFO L87 Difference]: Start difference. First operand 58 states and 62 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-18 15:35:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:57,227 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2024-09-18 15:35:57,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-18 15:35:57,228 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-18 15:35:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:57,229 INFO L225 Difference]: With dead ends: 60 [2024-09-18 15:35:57,229 INFO L226 Difference]: Without dead ends: 56 [2024-09-18 15:35:57,229 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:35:57,230 INFO L434 NwaCegarLoop]: 46 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:57,230 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 120 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:57,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-18 15:35:57,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2024-09-18 15:35:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 50 states have internal predecessors, (55), 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-18 15:35:57,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-09-18 15:35:57,245 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2024-09-18 15:35:57,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:57,245 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-09-18 15:35:57,245 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-18 15:35:57,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:57,245 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-09-18 15:35:57,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-18 15:35:57,246 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:57,246 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:57,246 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-18 15:35:57,246 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-18 15:35:57,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:57,247 INFO L85 PathProgramCache]: Analyzing trace with hash 925259441, now seen corresponding path program 1 times [2024-09-18 15:35:57,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:57,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127132886] [2024-09-18 15:35:57,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:57,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:57,400 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:57,405 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-18 15:35:57,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:57,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127132886] [2024-09-18 15:35:57,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127132886] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:57,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:57,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-18 15:35:57,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815699562] [2024-09-18 15:35:57,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:57,407 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-18 15:35:57,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:57,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-18 15:35:57,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-18 15:35:57,408 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:57,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:57,568 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2024-09-18 15:35:57,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-18 15:35:57,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-18 15:35:57,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:57,570 INFO L225 Difference]: With dead ends: 88 [2024-09-18 15:35:57,571 INFO L226 Difference]: Without dead ends: 86 [2024-09-18 15:35:57,571 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-18 15:35:57,571 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 40 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:57,572 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 119 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:57,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-09-18 15:35:57,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 59. [2024-09-18 15:35:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.326086956521739) internal successors, (61), 55 states have internal predecessors, (61), 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-18 15:35:57,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-09-18 15:35:57,582 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 16 [2024-09-18 15:35:57,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:57,583 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-09-18 15:35:57,583 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:57,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:57,583 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-09-18 15:35:57,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-18 15:35:57,584 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:57,584 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:57,584 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-18 15:35:57,585 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-18 15:35:57,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:57,585 INFO L85 PathProgramCache]: Analyzing trace with hash 924828465, now seen corresponding path program 1 times [2024-09-18 15:35:57,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:57,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821122440] [2024-09-18 15:35:57,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:57,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:57,713 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:57,718 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-18 15:35:57,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:57,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821122440] [2024-09-18 15:35:57,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821122440] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:57,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:57,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-18 15:35:57,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912585241] [2024-09-18 15:35:57,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:57,719 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-18 15:35:57,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:57,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-18 15:35:57,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-18 15:35:57,720 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:57,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:57,888 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2024-09-18 15:35:57,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-18 15:35:57,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-18 15:35:57,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:57,891 INFO L225 Difference]: With dead ends: 86 [2024-09-18 15:35:57,891 INFO L226 Difference]: Without dead ends: 84 [2024-09-18 15:35:57,891 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-18 15:35:57,892 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 35 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:57,892 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 147 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:57,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-18 15:35:57,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 61. [2024-09-18 15:35:57,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.3125) internal successors, (63), 57 states have internal predecessors, (63), 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-18 15:35:57,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-09-18 15:35:57,910 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 16 [2024-09-18 15:35:57,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:57,910 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-09-18 15:35:57,910 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:57,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:57,912 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-09-18 15:35:57,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-18 15:35:57,913 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:57,913 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:57,914 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-18 15:35:57,914 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-18 15:35:57,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:57,915 INFO L85 PathProgramCache]: Analyzing trace with hash -975549911, now seen corresponding path program 1 times [2024-09-18 15:35:57,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:57,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852119873] [2024-09-18 15:35:57,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:57,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:57,988 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:57,992 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-18 15:35:57,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:57,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852119873] [2024-09-18 15:35:57,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852119873] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:57,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:57,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-18 15:35:57,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963369919] [2024-09-18 15:35:57,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:57,994 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-18 15:35:57,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:57,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-18 15:35:57,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:35:57,995 INFO L87 Difference]: Start difference. First operand 61 states and 66 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-18 15:35:58,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:58,118 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2024-09-18 15:35:58,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-18 15:35:58,119 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-18 15:35:58,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:58,119 INFO L225 Difference]: With dead ends: 62 [2024-09-18 15:35:58,119 INFO L226 Difference]: Without dead ends: 60 [2024-09-18 15:35:58,120 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-18 15:35:58,120 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:58,120 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 89 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:58,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-18 15:35:58,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2024-09-18 15:35:58,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.297872340425532) internal successors, (61), 55 states have internal predecessors, (61), 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-18 15:35:58,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-09-18 15:35:58,133 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 16 [2024-09-18 15:35:58,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:58,133 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-09-18 15:35:58,133 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-18 15:35:58,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:58,134 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-09-18 15:35:58,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-18 15:35:58,134 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:58,135 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:58,135 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-18 15:35:58,135 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-18 15:35:58,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:58,135 INFO L85 PathProgramCache]: Analyzing trace with hash -974010711, now seen corresponding path program 1 times [2024-09-18 15:35:58,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:58,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703017787] [2024-09-18 15:35:58,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:58,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:58,203 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:58,206 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-18 15:35:58,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:58,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703017787] [2024-09-18 15:35:58,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703017787] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:58,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:58,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-18 15:35:58,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337279844] [2024-09-18 15:35:58,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:58,208 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-18 15:35:58,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:58,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-18 15:35:58,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:35:58,209 INFO L87 Difference]: Start difference. First operand 59 states and 64 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-18 15:35:58,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:58,335 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2024-09-18 15:35:58,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-18 15:35:58,335 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-18 15:35:58,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:58,336 INFO L225 Difference]: With dead ends: 60 [2024-09-18 15:35:58,336 INFO L226 Difference]: Without dead ends: 58 [2024-09-18 15:35:58,336 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-18 15:35:58,337 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 39 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:58,337 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 83 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:58,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-18 15:35:58,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2024-09-18 15:35:58,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 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-18 15:35:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2024-09-18 15:35:58,346 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 16 [2024-09-18 15:35:58,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:58,346 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2024-09-18 15:35:58,346 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-18 15:35:58,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:58,347 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2024-09-18 15:35:58,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-18 15:35:58,349 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:58,349 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:58,349 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-18 15:35:58,351 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-18 15:35:58,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:58,351 INFO L85 PathProgramCache]: Analyzing trace with hash -175907649, now seen corresponding path program 1 times [2024-09-18 15:35:58,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:58,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839161272] [2024-09-18 15:35:58,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:58,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:58,449 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:58,453 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-18 15:35:58,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:58,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839161272] [2024-09-18 15:35:58,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839161272] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:58,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:58,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-18 15:35:58,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902526545] [2024-09-18 15:35:58,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:58,454 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-18 15:35:58,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:58,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-18 15:35:58,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:35:58,454 INFO L87 Difference]: Start difference. First operand 57 states and 62 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-18 15:35:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:58,575 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-09-18 15:35:58,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-18 15:35:58,575 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-18 15:35:58,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:58,576 INFO L225 Difference]: With dead ends: 58 [2024-09-18 15:35:58,577 INFO L226 Difference]: Without dead ends: 56 [2024-09-18 15:35:58,577 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-18 15:35:58,578 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:58,578 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 77 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:58,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-18 15:35:58,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-09-18 15:35:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 51 states have internal predecessors, (57), 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-18 15:35:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2024-09-18 15:35:58,589 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 17 [2024-09-18 15:35:58,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:58,590 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2024-09-18 15:35:58,590 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-18 15:35:58,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2024-09-18 15:35:58,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-18 15:35:58,591 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:58,591 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:58,591 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-18 15:35:58,591 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-18 15:35:58,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:58,594 INFO L85 PathProgramCache]: Analyzing trace with hash -177273069, now seen corresponding path program 1 times [2024-09-18 15:35:58,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:58,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429864963] [2024-09-18 15:35:58,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:58,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:58,712 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:58,716 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-18 15:35:58,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:58,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429864963] [2024-09-18 15:35:58,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429864963] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:58,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:58,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-18 15:35:58,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518245733] [2024-09-18 15:35:58,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:58,717 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-18 15:35:58,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:58,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-18 15:35:58,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-18 15:35:58,718 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:58,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:58,865 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2024-09-18 15:35:58,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-18 15:35:58,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-18 15:35:58,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:58,866 INFO L225 Difference]: With dead ends: 72 [2024-09-18 15:35:58,866 INFO L226 Difference]: Without dead ends: 70 [2024-09-18 15:35:58,866 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-18 15:35:58,867 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:58,867 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 98 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-18 15:35:58,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2024-09-18 15:35:58,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 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-18 15:35:58,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-09-18 15:35:58,876 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 17 [2024-09-18 15:35:58,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:58,877 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-09-18 15:35:58,877 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:58,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:58,877 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-09-18 15:35:58,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-18 15:35:58,877 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:58,877 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:58,878 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-18 15:35:58,878 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-18 15:35:58,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:58,878 INFO L85 PathProgramCache]: Analyzing trace with hash -129557819, now seen corresponding path program 1 times [2024-09-18 15:35:58,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:58,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618911512] [2024-09-18 15:35:58,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:58,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:58,991 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:58,995 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-18 15:35:58,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:58,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618911512] [2024-09-18 15:35:58,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618911512] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:58,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:58,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-18 15:35:58,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235400047] [2024-09-18 15:35:58,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:58,996 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-18 15:35:58,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:58,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-18 15:35:58,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-18 15:35:58,997 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:59,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:59,163 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-09-18 15:35:59,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-18 15:35:59,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-18 15:35:59,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:59,165 INFO L225 Difference]: With dead ends: 73 [2024-09-18 15:35:59,165 INFO L226 Difference]: Without dead ends: 69 [2024-09-18 15:35:59,165 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-09-18 15:35:59,166 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:59,166 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 121 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:59,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-18 15:35:59,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2024-09-18 15:35:59,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 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-18 15:35:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2024-09-18 15:35:59,177 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 17 [2024-09-18 15:35:59,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:59,178 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2024-09-18 15:35:59,178 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:59,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-09-18 15:35:59,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-18 15:35:59,179 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:59,179 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-18 15:35:59,179 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-18 15:35:59,179 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-18 15:35:59,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:59,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1158166692, now seen corresponding path program 1 times [2024-09-18 15:35:59,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:59,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313105925] [2024-09-18 15:35:59,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:59,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:59,311 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:59,315 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-18 15:35:59,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:59,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313105925] [2024-09-18 15:35:59,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313105925] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:59,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:59,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-18 15:35:59,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673724804] [2024-09-18 15:35:59,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:59,317 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-18 15:35:59,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:59,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-18 15:35:59,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-18 15:35:59,318 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:59,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:59,459 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2024-09-18 15:35:59,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-18 15:35:59,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-18 15:35:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:59,461 INFO L225 Difference]: With dead ends: 69 [2024-09-18 15:35:59,461 INFO L226 Difference]: Without dead ends: 67 [2024-09-18 15:35:59,461 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-18 15:35:59,462 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 28 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:59,462 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 102 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:59,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-18 15:35:59,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2024-09-18 15:35:59,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 61 states have internal predecessors, (69), 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-18 15:35:59,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2024-09-18 15:35:59,470 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 18 [2024-09-18 15:35:59,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:59,470 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2024-09-18 15:35:59,471 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:59,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:59,471 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2024-09-18 15:35:59,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-18 15:35:59,472 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:59,472 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-18 15:35:59,472 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-18 15:35:59,472 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-18 15:35:59,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:59,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1439368950, now seen corresponding path program 1 times [2024-09-18 15:35:59,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:59,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485719757] [2024-09-18 15:35:59,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:59,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:59,529 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:59,533 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-18 15:35:59,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:59,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485719757] [2024-09-18 15:35:59,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485719757] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:59,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:59,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-18 15:35:59,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185999335] [2024-09-18 15:35:59,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:59,534 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-18 15:35:59,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:59,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-18 15:35:59,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-18 15:35:59,535 INFO L87 Difference]: Start difference. First operand 65 states and 72 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-18 15:35:59,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:59,621 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2024-09-18 15:35:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-18 15:35:59,621 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-18 15:35:59,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:59,622 INFO L225 Difference]: With dead ends: 65 [2024-09-18 15:35:59,622 INFO L226 Difference]: Without dead ends: 63 [2024-09-18 15:35:59,622 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-18 15:35:59,623 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:59,623 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 68 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:59,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-18 15:35:59,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-09-18 15:35:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 59 states have internal predecessors, (67), 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-18 15:35:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2024-09-18 15:35:59,631 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 19 [2024-09-18 15:35:59,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:59,631 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2024-09-18 15:35:59,631 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-18 15:35:59,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:59,631 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2024-09-18 15:35:59,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-18 15:35:59,632 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:59,632 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-18 15:35:59,632 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-18 15:35:59,632 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-18 15:35:59,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:59,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1670767605, now seen corresponding path program 1 times [2024-09-18 15:35:59,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:59,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639566539] [2024-09-18 15:35:59,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:59,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:59,678 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:59,682 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-18 15:35:59,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:59,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639566539] [2024-09-18 15:35:59,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639566539] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:35:59,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:35:59,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-18 15:35:59,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960149137] [2024-09-18 15:35:59,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:35:59,684 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-18 15:35:59,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:35:59,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-18 15:35:59,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-18 15:35:59,684 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:59,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:35:59,766 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2024-09-18 15:35:59,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-18 15:35:59,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-09-18 15:35:59,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:35:59,767 INFO L225 Difference]: With dead ends: 63 [2024-09-18 15:35:59,767 INFO L226 Difference]: Without dead ends: 59 [2024-09-18 15:35:59,767 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:35:59,768 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:35:59,768 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 90 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:35:59,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-18 15:35:59,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-09-18 15:35:59,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 55 states have internal predecessors, (63), 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-18 15:35:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2024-09-18 15:35:59,777 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 20 [2024-09-18 15:35:59,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:35:59,777 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2024-09-18 15:35:59,777 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:35:59,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:59,777 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2024-09-18 15:35:59,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-18 15:35:59,778 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:35:59,778 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:35:59,778 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-18 15:35:59,779 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-18 15:35:59,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:35:59,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1687468520, now seen corresponding path program 1 times [2024-09-18 15:35:59,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:35:59,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138161580] [2024-09-18 15:35:59,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:59,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:35:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:59,901 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:35:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-18 15:35:59,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:35:59,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138161580] [2024-09-18 15:35:59,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138161580] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 15:35:59,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482922814] [2024-09-18 15:35:59,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:35:59,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:35:59,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:35:59,908 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-18 15:35:59,909 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-18 15:35:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:35:59,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-18 15:35:59,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:36:00,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-18 15:36:00,222 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 15:36:00,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-18 15:36:00,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482922814] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-18 15:36:00,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-18 15:36:00,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 18 [2024-09-18 15:36:00,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58508584] [2024-09-18 15:36:00,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-18 15:36:00,329 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-18 15:36:00,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:36:00,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-18 15:36:00,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-09-18 15:36:00,330 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:00,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:36:00,640 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2024-09-18 15:36:00,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-18 15:36:00,640 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-18 15:36:00,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:36:00,641 INFO L225 Difference]: With dead ends: 86 [2024-09-18 15:36:00,641 INFO L226 Difference]: Without dead ends: 84 [2024-09-18 15:36:00,642 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2024-09-18 15:36:00,642 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 324 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-18 15:36:00,642 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 139 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-18 15:36:00,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-18 15:36:00,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 55. [2024-09-18 15:36:00,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 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-18 15:36:00,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2024-09-18 15:36:00,652 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 21 [2024-09-18 15:36:00,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:36:00,652 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2024-09-18 15:36:00,652 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:00,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:00,653 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2024-09-18 15:36:00,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-18 15:36:00,653 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:36:00,653 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:36:00,671 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-18 15:36:00,854 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:36:00,855 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-18 15:36:00,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:00,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1687899496, now seen corresponding path program 1 times [2024-09-18 15:36:00,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:36:00,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358159447] [2024-09-18 15:36:00,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:36:00,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:36:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:00,956 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:36:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:00,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-18 15:36:00,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:36:00,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358159447] [2024-09-18 15:36:00,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358159447] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 15:36:00,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071465449] [2024-09-18 15:36:00,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:36:00,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:36:00,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:36:00,962 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-18 15:36:00,963 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-18 15:36:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:01,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-18 15:36:01,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:36:01,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-18 15:36:01,200 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 15:36:01,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-18 15:36:01,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071465449] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-18 15:36:01,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-18 15:36:01,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 18 [2024-09-18 15:36:01,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880810065] [2024-09-18 15:36:01,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-18 15:36:01,286 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-18 15:36:01,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:36:01,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-18 15:36:01,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-09-18 15:36:01,287 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:01,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:36:01,532 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2024-09-18 15:36:01,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-18 15:36:01,533 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-18 15:36:01,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:36:01,533 INFO L225 Difference]: With dead ends: 82 [2024-09-18 15:36:01,533 INFO L226 Difference]: Without dead ends: 80 [2024-09-18 15:36:01,534 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2024-09-18 15:36:01,534 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 113 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:36:01,535 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 96 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:36:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-18 15:36:01,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 48. [2024-09-18 15:36:01,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 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-18 15:36:01,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-09-18 15:36:01,544 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 21 [2024-09-18 15:36:01,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:36:01,544 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-09-18 15:36:01,545 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:36:01,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:01,545 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2024-09-18 15:36:01,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-18 15:36:01,545 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:36:01,545 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-18 15:36:01,563 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-18 15:36:01,749 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:36:01,750 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-18 15:36:01,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:01,750 INFO L85 PathProgramCache]: Analyzing trace with hash 267428458, now seen corresponding path program 1 times [2024-09-18 15:36:01,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:36:01,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795048140] [2024-09-18 15:36:01,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:36:01,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:36:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:01,845 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:36:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:01,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-18 15:36:01,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:36:01,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795048140] [2024-09-18 15:36:01,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795048140] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:36:01,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:36:01,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-18 15:36:01,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832640565] [2024-09-18 15:36:01,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:36:01,853 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-18 15:36:01,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:36:01,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-18 15:36:01,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-18 15:36:01,854 INFO L87 Difference]: Start difference. First operand 48 states and 54 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-18 15:36:01,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:36:01,968 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2024-09-18 15:36:01,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-18 15:36:01,969 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-18 15:36:01,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:36:01,969 INFO L225 Difference]: With dead ends: 48 [2024-09-18 15:36:01,970 INFO L226 Difference]: Without dead ends: 46 [2024-09-18 15:36:01,970 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-18 15:36:01,970 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 74 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:36:01,971 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 37 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:36:01,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-18 15:36:01,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2024-09-18 15:36:01,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 39 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-18 15:36:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-09-18 15:36:01,980 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 21 [2024-09-18 15:36:01,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:36:01,980 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-09-18 15:36:01,980 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-18 15:36:01,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:01,981 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-09-18 15:36:01,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-18 15:36:01,981 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:36:01,981 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-18 15:36:01,981 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-09-18 15:36:01,982 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-18 15:36:01,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:01,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1335654093, now seen corresponding path program 1 times [2024-09-18 15:36:01,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:36:01,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653751123] [2024-09-18 15:36:01,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:36:01,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:36:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:02,104 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:36:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:02,107 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-18 15:36:02,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:36:02,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653751123] [2024-09-18 15:36:02,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653751123] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:36:02,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:36:02,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-18 15:36:02,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223622045] [2024-09-18 15:36:02,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:36:02,109 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-18 15:36:02,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:36:02,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-18 15:36:02,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-18 15:36:02,110 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-18 15:36:02,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:36:02,220 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-09-18 15:36:02,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-18 15:36:02,221 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-18 15:36:02,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:36:02,222 INFO L225 Difference]: With dead ends: 43 [2024-09-18 15:36:02,222 INFO L226 Difference]: Without dead ends: 41 [2024-09-18 15:36:02,222 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-18 15:36:02,223 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:36:02,223 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 43 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:36:02,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-18 15:36:02,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-09-18 15:36:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 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-18 15:36:02,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-09-18 15:36:02,231 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 22 [2024-09-18 15:36:02,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:36:02,231 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-09-18 15:36:02,232 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-18 15:36:02,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:02,232 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-09-18 15:36:02,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-18 15:36:02,232 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:36:02,233 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-18 15:36:02,233 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-09-18 15:36:02,233 INFO L399 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-18 15:36:02,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:02,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1287938843, now seen corresponding path program 1 times [2024-09-18 15:36:02,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:36:02,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131883239] [2024-09-18 15:36:02,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:36:02,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:36:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:02,325 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:36:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:36:02,328 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-18 15:36:02,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:36:02,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131883239] [2024-09-18 15:36:02,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131883239] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:36:02,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:36:02,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-18 15:36:02,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77592567] [2024-09-18 15:36:02,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:36:02,330 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-18 15:36:02,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:36:02,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-18 15:36:02,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-18 15:36:02,330 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-18 15:36:02,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:36:02,436 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-09-18 15:36:02,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-18 15:36:02,437 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-18 15:36:02,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:36:02,437 INFO L225 Difference]: With dead ends: 38 [2024-09-18 15:36:02,437 INFO L226 Difference]: Without dead ends: 0 [2024-09-18 15:36:02,437 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-18 15:36:02,438 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:36:02,438 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 31 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:36:02,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-18 15:36:02,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-18 15:36:02,439 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-18 15:36:02,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-18 15:36:02,439 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2024-09-18 15:36:02,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:36:02,439 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-18 15:36:02,439 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-18 15:36:02,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:36:02,439 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-18 15:36:02,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-18 15:36:02,442 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2024-09-18 15:36:02,443 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2024-09-18 15:36:02,443 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2024-09-18 15:36:02,443 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2024-09-18 15:36:02,443 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2024-09-18 15:36:02,444 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2024-09-18 15:36:02,444 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2024-09-18 15:36:02,444 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2024-09-18 15:36:02,444 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2024-09-18 15:36:02,444 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2024-09-18 15:36:02,444 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2024-09-18 15:36:02,445 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2024-09-18 15:36:02,445 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2024-09-18 15:36:02,445 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2024-09-18 15:36:02,445 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2024-09-18 15:36:02,445 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2024-09-18 15:36:02,446 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2024-09-18 15:36:02,446 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2024-09-18 15:36:02,446 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-09-18 15:36:02,449 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:36:02,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-18 15:36:04,288 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-18 15:36:04,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.09 03:36:04 BoogieIcfgContainer [2024-09-18 15:36:04,310 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-18 15:36:04,310 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-18 15:36:04,310 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-18 15:36:04,311 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-18 15:36:04,311 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 03:35:54" (3/4) ... [2024-09-18 15:36:04,313 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-18 15:36:04,371 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-18 15:36:04,371 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-18 15:36:04,375 INFO L158 Benchmark]: Toolchain (without parser) took 10871.50ms. Allocated memory was 151.0MB in the beginning and 337.6MB in the end (delta: 186.6MB). Free memory was 93.5MB in the beginning and 112.3MB in the end (delta: -18.8MB). Peak memory consumption was 168.5MB. Max. memory is 16.1GB. [2024-09-18 15:36:04,376 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory is still 46.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-18 15:36:04,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.77ms. Allocated memory is still 151.0MB. Free memory was 93.2MB in the beginning and 113.9MB in the end (delta: -20.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-18 15:36:04,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.78ms. Allocated memory is still 151.0MB. Free memory was 113.9MB in the beginning and 113.3MB in the end (delta: 628.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-18 15:36:04,376 INFO L158 Benchmark]: Boogie Preprocessor took 50.28ms. Allocated memory is still 151.0MB. Free memory was 113.3MB in the beginning and 110.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-18 15:36:04,376 INFO L158 Benchmark]: RCFGBuilder took 462.49ms. Allocated memory is still 151.0MB. Free memory was 110.6MB in the beginning and 90.8MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-09-18 15:36:04,377 INFO L158 Benchmark]: TraceAbstraction took 9875.52ms. Allocated memory was 151.0MB in the beginning and 337.6MB in the end (delta: 186.6MB). Free memory was 90.2MB in the beginning and 114.4MB in the end (delta: -24.2MB). Peak memory consumption was 166.8MB. Max. memory is 16.1GB. [2024-09-18 15:36:04,377 INFO L158 Benchmark]: Witness Printer took 61.16ms. Allocated memory is still 337.6MB. Free memory was 114.4MB in the beginning and 112.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-18 15:36:04,378 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory is still 46.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.77ms. Allocated memory is still 151.0MB. Free memory was 93.2MB in the beginning and 113.9MB in the end (delta: -20.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.78ms. Allocated memory is still 151.0MB. Free memory was 113.9MB in the beginning and 113.3MB in the end (delta: 628.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.28ms. Allocated memory is still 151.0MB. Free memory was 113.3MB in the beginning and 110.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 462.49ms. Allocated memory is still 151.0MB. Free memory was 110.6MB in the beginning and 90.8MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9875.52ms. Allocated memory was 151.0MB in the beginning and 337.6MB in the end (delta: 186.6MB). Free memory was 90.2MB in the beginning and 114.4MB in the end (delta: -24.2MB). Peak memory consumption was 166.8MB. Max. memory is 16.1GB. * Witness Printer took 61.16ms. Allocated memory is still 337.6MB. Free memory was 114.4MB in the beginning and 112.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 52]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 72]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 84]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 114]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 126]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 142]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 154]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 176]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 188]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 224]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 236]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 278]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 297]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 309]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 333]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 345]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 366]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 378]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1154 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1154 mSDsluCounter, 2421 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1705 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3234 IncrementalHoareTripleChecker+Invalid, 3392 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 716 mSDtfsCounter, 3234 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 138 SyntacticMatches, 6 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=0, InterpolantAutomatonStates: 181, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 154 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 431 NumberOfCodeBlocks, 431 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 446 ConstructedInterpolants, 0 QuantifiedInterpolants, 1855 SizeOfPredicates, 6 NumberOfNonLiveVariables, 259 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 8/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 282]: Location Invariant Derived location invariant: (((main__t == 0) || (1 <= main__t)) && (((long long) main__t + 1) <= main__tagbuf_len)) - InvariantResult [Line: 63]: Location Invariant Derived location invariant: ((1 <= main__t) && (main__t <= main__tagbuf_len)) - InvariantResult [Line: 32]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 32]: Location Invariant Derived location invariant: ((((long long) main__t + 1) <= main__tagbuf_len) && ((0 < main__t) || (main__t == 0))) - InvariantResult [Line: 101]: Location Invariant Derived location invariant: ((((long long) main__t + 1) <= main__tagbuf_len) && (1 <= main__t)) RESULT: Ultimate proved your program to be correct! [2024-09-18 15:36:04,421 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE