./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 e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 14:16:59,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:16:59,612 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:16:59,615 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:16:59,615 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:16:59,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:16:59,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:16:59,636 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:16:59,636 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:16:59,636 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:16:59,637 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:16:59,637 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:16:59,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:16:59,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:16:59,639 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:16:59,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:16:59,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:16:59,640 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:16:59,640 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:16:59,640 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:16:59,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:16:59,641 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:16:59,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:16:59,644 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:16:59,644 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:16:59,644 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:16:59,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:16:59,644 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:16:59,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:16:59,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:16:59,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:16:59,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:16:59,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:16:59,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:16:59,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:16:59,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:16:59,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:16:59,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:16:59,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:16:59,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:16:59,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:16:59,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:16:59,647 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-10-15 14:16:59,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:16:59,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:16:59,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:16:59,904 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:16:59,904 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:16:59,905 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-10-15 14:17:01,122 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:17:01,339 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:17:01,340 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2024-10-15 14:17:01,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/d51154ba3/ec7af0a9d1e643ec8fc055694fb077c3/FLAG6e2c96f16 [2024-10-15 14:17:01,717 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/d51154ba3/ec7af0a9d1e643ec8fc055694fb077c3 [2024-10-15 14:17:01,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:17:01,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:17:01,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:17:01,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:17:01,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:17:01,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:17:01" (1/1) ... [2024-10-15 14:17:01,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3472c90b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:01, skipping insertion in model container [2024-10-15 14:17:01,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:17:01" (1/1) ... [2024-10-15 14:17:01,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:17:01,933 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-10-15 14:17:01,938 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-10-15 14:17:01,939 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-10-15 14:17:01,941 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-10-15 14:17:01,942 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-10-15 14:17:01,943 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-10-15 14:17:01,944 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-10-15 14:17:01,946 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-10-15 14:17:01,947 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-10-15 14:17:01,948 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-10-15 14:17:01,949 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-10-15 14:17:01,951 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-10-15 14:17:01,952 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-10-15 14:17:01,953 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-10-15 14:17:01,955 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-10-15 14:17:01,956 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-10-15 14:17:01,957 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-10-15 14:17:01,958 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-10-15 14:17:01,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:17:01,968 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:17:01,978 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-10-15 14:17:01,980 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-10-15 14:17:01,981 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-10-15 14:17:01,982 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-10-15 14:17:01,983 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-10-15 14:17:01,984 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-10-15 14:17:01,986 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-10-15 14:17:01,987 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-10-15 14:17:01,988 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-10-15 14:17:01,990 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-10-15 14:17:01,990 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-10-15 14:17:01,992 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-10-15 14:17:01,993 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-10-15 14:17:01,993 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-10-15 14:17:01,994 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-10-15 14:17:01,995 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-10-15 14:17:01,996 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-10-15 14:17:01,997 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-10-15 14:17:01,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:17:02,014 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:17:02,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02 WrapperNode [2024-10-15 14:17:02,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:17:02,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:17:02,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:17:02,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:17:02,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,035 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:17:02,035 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:17:02,036 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:17:02,036 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:17:02,036 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:17:02,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,046 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,062 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-15 14:17:02,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,073 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:17:02,089 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:17:02,090 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:17:02,090 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:17:02,091 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (1/1) ... [2024-10-15 14:17:02,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:17:02,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:17:02,119 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-10-15 14:17:02,121 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-10-15 14:17:02,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:17:02,160 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:17:02,160 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:17:02,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:17:02,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:17:02,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:17:02,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:17:02,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:17:02,226 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:17:02,228 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:17:02,444 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2024-10-15 14:17:02,444 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:17:02,474 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:17:02,474 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-15 14:17:02,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:17:02 BoogieIcfgContainer [2024-10-15 14:17:02,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:17:02,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:17:02,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:17:02,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:17:02,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:17:01" (1/3) ... [2024-10-15 14:17:02,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa27c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:17:02, skipping insertion in model container [2024-10-15 14:17:02,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:02" (2/3) ... [2024-10-15 14:17:02,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa27c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:17:02, skipping insertion in model container [2024-10-15 14:17:02,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:17:02" (3/3) ... [2024-10-15 14:17:02,485 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2024-10-15 14:17:02,502 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:17:02,502 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-10-15 14:17:02,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:17:02,559 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@6e4b4a0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:17:02,563 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-10-15 14:17:02,567 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-10-15 14:17:02,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-15 14:17:02,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:02,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:02,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-15 14:17:02,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:02,594 INFO L85 PathProgramCache]: Analyzing trace with hash 315066952, now seen corresponding path program 1 times [2024-10-15 14:17:02,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:02,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766808166] [2024-10-15 14:17:02,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:02,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:02,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:02,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:02,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766808166] [2024-10-15 14:17:02,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766808166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:02,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:02,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:17:02,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143906668] [2024-10-15 14:17:02,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:02,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:17:02,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:02,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:17:02,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:17:02,996 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-10-15 14:17:03,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:03,271 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2024-10-15 14:17:03,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:17:03,274 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-10-15 14:17:03,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:03,281 INFO L225 Difference]: With dead ends: 89 [2024-10-15 14:17:03,281 INFO L226 Difference]: Without dead ends: 74 [2024-10-15 14:17:03,283 INFO L431 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-10-15 14:17:03,288 INFO L432 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-10-15 14:17:03,289 INFO L433 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-10-15 14:17:03,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-15 14:17:03,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2024-10-15 14:17:03,327 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-10-15 14:17:03,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-10-15 14:17:03,330 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 11 [2024-10-15 14:17:03,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:03,331 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-10-15 14:17:03,331 INFO L472 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-10-15 14:17:03,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:03,332 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-10-15 14:17:03,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-15 14:17:03,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:03,332 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:03,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:17:03,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-15 14:17:03,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:03,333 INFO L85 PathProgramCache]: Analyzing trace with hash 311896200, now seen corresponding path program 1 times [2024-10-15 14:17:03,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:03,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10665663] [2024-10-15 14:17:03,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:03,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:03,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:03,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:03,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10665663] [2024-10-15 14:17:03,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10665663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:03,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:03,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:17:03,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480471753] [2024-10-15 14:17:03,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:03,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:17:03,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:03,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:17:03,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:17:03,489 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-10-15 14:17:03,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:03,658 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2024-10-15 14:17:03,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:17:03,659 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-10-15 14:17:03,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:03,660 INFO L225 Difference]: With dead ends: 74 [2024-10-15 14:17:03,660 INFO L226 Difference]: Without dead ends: 72 [2024-10-15 14:17:03,660 INFO L431 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-10-15 14:17:03,661 INFO L432 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-10-15 14:17:03,661 INFO L433 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-10-15 14:17:03,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-15 14:17:03,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2024-10-15 14:17:03,671 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-10-15 14:17:03,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2024-10-15 14:17:03,675 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 11 [2024-10-15 14:17:03,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:03,676 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2024-10-15 14:17:03,676 INFO L472 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-10-15 14:17:03,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2024-10-15 14:17:03,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-15 14:17:03,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:03,678 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:03,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 14:17:03,679 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-15 14:17:03,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:03,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1659047165, now seen corresponding path program 1 times [2024-10-15 14:17:03,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:03,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899172743] [2024-10-15 14:17:03,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:03,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:03,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:03,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:03,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899172743] [2024-10-15 14:17:03,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899172743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:03,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:03,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:17:03,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274059013] [2024-10-15 14:17:03,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:03,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:17:03,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:03,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:17:03,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:17:03,819 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-10-15 14:17:03,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:03,975 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2024-10-15 14:17:03,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:03,976 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-10-15 14:17:03,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:03,978 INFO L225 Difference]: With dead ends: 72 [2024-10-15 14:17:03,979 INFO L226 Difference]: Without dead ends: 70 [2024-10-15 14:17:03,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:17:03,980 INFO L432 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-10-15 14:17:03,980 INFO L433 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-10-15 14:17:03,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-15 14:17:03,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-10-15 14:17:03,990 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-10-15 14:17:03,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2024-10-15 14:17:03,991 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 14 [2024-10-15 14:17:03,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:03,992 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2024-10-15 14:17:03,992 INFO L472 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-10-15 14:17:03,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:03,993 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2024-10-15 14:17:03,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-15 14:17:03,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:03,994 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:03,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-15 14:17:03,994 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-15 14:17:03,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:03,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1688353559, now seen corresponding path program 1 times [2024-10-15 14:17:03,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:03,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312232005] [2024-10-15 14:17:03,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:03,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:04,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:04,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:04,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:04,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312232005] [2024-10-15 14:17:04,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312232005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:04,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:04,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:17:04,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657296707] [2024-10-15 14:17:04,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:04,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:17:04,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:04,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:17:04,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:17:04,100 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-10-15 14:17:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:04,261 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2024-10-15 14:17:04,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:04,262 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-10-15 14:17:04,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:04,263 INFO L225 Difference]: With dead ends: 70 [2024-10-15 14:17:04,263 INFO L226 Difference]: Without dead ends: 68 [2024-10-15 14:17:04,263 INFO L431 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-10-15 14:17:04,264 INFO L432 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-10-15 14:17:04,264 INFO L433 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-10-15 14:17:04,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-15 14:17:04,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-10-15 14:17:04,271 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-10-15 14:17:04,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2024-10-15 14:17:04,272 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 14 [2024-10-15 14:17:04,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:04,273 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2024-10-15 14:17:04,273 INFO L472 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-10-15 14:17:04,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:04,273 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2024-10-15 14:17:04,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-15 14:17:04,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:04,274 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:04,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-15 14:17:04,274 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-15 14:17:04,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:04,275 INFO L85 PathProgramCache]: Analyzing trace with hash -108700357, now seen corresponding path program 1 times [2024-10-15 14:17:04,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:04,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775388145] [2024-10-15 14:17:04,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:04,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:04,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:04,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:04,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:04,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775388145] [2024-10-15 14:17:04,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775388145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:04,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:04,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:17:04,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719965898] [2024-10-15 14:17:04,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:04,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:17:04,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:04,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:17:04,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:17:04,341 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-10-15 14:17:04,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:04,487 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2024-10-15 14:17:04,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:04,487 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-10-15 14:17:04,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:04,488 INFO L225 Difference]: With dead ends: 68 [2024-10-15 14:17:04,488 INFO L226 Difference]: Without dead ends: 66 [2024-10-15 14:17:04,489 INFO L431 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-10-15 14:17:04,489 INFO L432 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-10-15 14:17:04,490 INFO L433 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-10-15 14:17:04,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-15 14:17:04,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-10-15 14:17:04,498 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-10-15 14:17:04,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2024-10-15 14:17:04,499 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 15 [2024-10-15 14:17:04,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:04,500 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2024-10-15 14:17:04,500 INFO L472 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-10-15 14:17:04,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:04,500 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2024-10-15 14:17:04,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-15 14:17:04,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:04,501 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:04,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-15 14:17:04,501 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-15 14:17:04,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:04,502 INFO L85 PathProgramCache]: Analyzing trace with hash -108714259, now seen corresponding path program 1 times [2024-10-15 14:17:04,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:04,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250804174] [2024-10-15 14:17:04,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:04,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:04,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:04,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:04,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:04,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250804174] [2024-10-15 14:17:04,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250804174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:04,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:04,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:17:04,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9173432] [2024-10-15 14:17:04,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:04,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:17:04,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:04,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:17:04,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:17:04,572 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-10-15 14:17:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:04,712 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2024-10-15 14:17:04,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:04,713 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-10-15 14:17:04,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:04,713 INFO L225 Difference]: With dead ends: 66 [2024-10-15 14:17:04,713 INFO L226 Difference]: Without dead ends: 64 [2024-10-15 14:17:04,714 INFO L431 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-10-15 14:17:04,716 INFO L432 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-10-15 14:17:04,716 INFO L433 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-10-15 14:17:04,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-15 14:17:04,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-10-15 14:17:04,724 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-10-15 14:17:04,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2024-10-15 14:17:04,725 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 15 [2024-10-15 14:17:04,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:04,725 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2024-10-15 14:17:04,725 INFO L472 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-10-15 14:17:04,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2024-10-15 14:17:04,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-15 14:17:04,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:04,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:04,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-15 14:17:04,726 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-15 14:17:04,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:04,727 INFO L85 PathProgramCache]: Analyzing trace with hash -109142256, now seen corresponding path program 1 times [2024-10-15 14:17:04,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:04,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263836921] [2024-10-15 14:17:04,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:04,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:04,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:04,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:04,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:04,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263836921] [2024-10-15 14:17:04,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263836921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:04,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:04,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:17:04,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680727697] [2024-10-15 14:17:04,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:04,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:17:04,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:04,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:17:04,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:17:04,773 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-10-15 14:17:04,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:04,863 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2024-10-15 14:17:04,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:17:04,864 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-10-15 14:17:04,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:04,865 INFO L225 Difference]: With dead ends: 64 [2024-10-15 14:17:04,865 INFO L226 Difference]: Without dead ends: 60 [2024-10-15 14:17:04,865 INFO L431 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-10-15 14:17:04,866 INFO L432 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-10-15 14:17:04,867 INFO L433 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-10-15 14:17:04,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-15 14:17:04,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-10-15 14:17:04,875 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-10-15 14:17:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2024-10-15 14:17:04,877 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 15 [2024-10-15 14:17:04,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:04,877 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2024-10-15 14:17:04,878 INFO L472 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-10-15 14:17:04,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:04,878 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2024-10-15 14:17:04,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-15 14:17:04,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:04,878 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:04,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-15 14:17:04,879 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-15 14:17:04,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:04,879 INFO L85 PathProgramCache]: Analyzing trace with hash 799355856, now seen corresponding path program 1 times [2024-10-15 14:17:04,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:04,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689876693] [2024-10-15 14:17:04,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:04,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:04,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:04,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:04,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:04,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689876693] [2024-10-15 14:17:04,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689876693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:04,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:04,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:17:04,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972657285] [2024-10-15 14:17:04,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:04,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:17:04,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:04,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:17:04,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:17:04,957 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-10-15 14:17:05,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:05,034 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2024-10-15 14:17:05,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:17:05,034 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-10-15 14:17:05,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:05,036 INFO L225 Difference]: With dead ends: 60 [2024-10-15 14:17:05,036 INFO L226 Difference]: Without dead ends: 56 [2024-10-15 14:17:05,036 INFO L431 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-10-15 14:17:05,037 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-10-15 14:17:05,038 INFO L433 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-10-15 14:17:05,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-15 14:17:05,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2024-10-15 14:17:05,048 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-10-15 14:17:05,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-10-15 14:17:05,048 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2024-10-15 14:17:05,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:05,049 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-10-15 14:17:05,049 INFO L472 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-10-15 14:17:05,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:05,049 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-10-15 14:17:05,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-15 14:17:05,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:05,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:05,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-15 14:17:05,050 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-15 14:17:05,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:05,050 INFO L85 PathProgramCache]: Analyzing trace with hash 925259441, now seen corresponding path program 1 times [2024-10-15 14:17:05,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:05,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348882607] [2024-10-15 14:17:05,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:05,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:05,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:05,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:05,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348882607] [2024-10-15 14:17:05,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348882607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:05,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:05,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:17:05,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742006343] [2024-10-15 14:17:05,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:05,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:17:05,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:05,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:17:05,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:05,146 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-10-15 14:17:05,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:05,272 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2024-10-15 14:17:05,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:17:05,273 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-10-15 14:17:05,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:05,274 INFO L225 Difference]: With dead ends: 88 [2024-10-15 14:17:05,274 INFO L226 Difference]: Without dead ends: 86 [2024-10-15 14:17:05,275 INFO L431 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-10-15 14:17:05,275 INFO L432 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-10-15 14:17:05,275 INFO L433 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-10-15 14:17:05,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-15 14:17:05,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 59. [2024-10-15 14:17:05,283 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-10-15 14:17:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-10-15 14:17:05,283 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 16 [2024-10-15 14:17:05,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:05,283 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-10-15 14:17:05,284 INFO L472 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-10-15 14:17:05,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-10-15 14:17:05,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-15 14:17:05,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:05,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:05,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-15 14:17:05,285 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-15 14:17:05,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:05,285 INFO L85 PathProgramCache]: Analyzing trace with hash 924828465, now seen corresponding path program 1 times [2024-10-15 14:17:05,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:05,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507106504] [2024-10-15 14:17:05,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:05,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:05,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:05,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:05,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507106504] [2024-10-15 14:17:05,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507106504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:05,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:05,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:17:05,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698410795] [2024-10-15 14:17:05,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:05,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:17:05,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:05,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:17:05,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:05,390 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-10-15 14:17:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:05,555 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2024-10-15 14:17:05,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:17:05,555 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-10-15 14:17:05,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:05,556 INFO L225 Difference]: With dead ends: 86 [2024-10-15 14:17:05,556 INFO L226 Difference]: Without dead ends: 84 [2024-10-15 14:17:05,556 INFO L431 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-10-15 14:17:05,557 INFO L432 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-10-15 14:17:05,557 INFO L433 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-10-15 14:17:05,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-15 14:17:05,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 61. [2024-10-15 14:17:05,563 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-10-15 14:17:05,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-10-15 14:17:05,564 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 16 [2024-10-15 14:17:05,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:05,564 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-10-15 14:17:05,564 INFO L472 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-10-15 14:17:05,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:05,565 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-10-15 14:17:05,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-15 14:17:05,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:05,565 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:05,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-15 14:17:05,566 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-15 14:17:05,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:05,566 INFO L85 PathProgramCache]: Analyzing trace with hash -975549911, now seen corresponding path program 1 times [2024-10-15 14:17:05,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:05,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515110528] [2024-10-15 14:17:05,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:05,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:05,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:05,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:05,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:05,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515110528] [2024-10-15 14:17:05,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515110528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:05,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:05,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:17:05,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410800810] [2024-10-15 14:17:05,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:05,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:17:05,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:05,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:17:05,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:17:05,615 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-10-15 14:17:05,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:05,709 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2024-10-15 14:17:05,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:05,710 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-10-15 14:17:05,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:05,711 INFO L225 Difference]: With dead ends: 62 [2024-10-15 14:17:05,711 INFO L226 Difference]: Without dead ends: 60 [2024-10-15 14:17:05,711 INFO L431 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-10-15 14:17:05,712 INFO L432 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-10-15 14:17:05,712 INFO L433 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-10-15 14:17:05,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-15 14:17:05,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2024-10-15 14:17:05,721 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-10-15 14:17:05,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-10-15 14:17:05,722 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 16 [2024-10-15 14:17:05,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:05,722 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-10-15 14:17:05,722 INFO L472 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-10-15 14:17:05,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:05,722 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-10-15 14:17:05,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-15 14:17:05,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:05,723 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:05,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-15 14:17:05,723 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-15 14:17:05,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:05,724 INFO L85 PathProgramCache]: Analyzing trace with hash -974010711, now seen corresponding path program 1 times [2024-10-15 14:17:05,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:05,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519391257] [2024-10-15 14:17:05,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:05,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:05,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:05,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:05,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:05,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519391257] [2024-10-15 14:17:05,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519391257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:05,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:05,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:17:05,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807111983] [2024-10-15 14:17:05,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:05,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:17:05,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:05,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:17:05,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:17:05,777 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-10-15 14:17:05,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:05,863 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2024-10-15 14:17:05,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:05,864 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-10-15 14:17:05,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:05,864 INFO L225 Difference]: With dead ends: 60 [2024-10-15 14:17:05,864 INFO L226 Difference]: Without dead ends: 58 [2024-10-15 14:17:05,865 INFO L431 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-10-15 14:17:05,865 INFO L432 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-10-15 14:17:05,865 INFO L433 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-10-15 14:17:05,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-15 14:17:05,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2024-10-15 14:17:05,871 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-10-15 14:17:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2024-10-15 14:17:05,871 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 16 [2024-10-15 14:17:05,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:05,872 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2024-10-15 14:17:05,872 INFO L472 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-10-15 14:17:05,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:05,872 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2024-10-15 14:17:05,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-15 14:17:05,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:05,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:05,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-15 14:17:05,873 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-15 14:17:05,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:05,873 INFO L85 PathProgramCache]: Analyzing trace with hash -175907649, now seen corresponding path program 1 times [2024-10-15 14:17:05,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:05,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229251744] [2024-10-15 14:17:05,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:05,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:05,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:05,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:05,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:05,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229251744] [2024-10-15 14:17:05,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229251744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:05,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:05,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:17:05,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850104637] [2024-10-15 14:17:05,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:05,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:17:05,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:05,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:17:05,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:17:05,961 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-10-15 14:17:06,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:06,052 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-10-15 14:17:06,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:06,052 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-10-15 14:17:06,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:06,053 INFO L225 Difference]: With dead ends: 58 [2024-10-15 14:17:06,053 INFO L226 Difference]: Without dead ends: 56 [2024-10-15 14:17:06,053 INFO L431 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-10-15 14:17:06,054 INFO L432 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-10-15 14:17:06,054 INFO L433 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-10-15 14:17:06,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-15 14:17:06,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-10-15 14:17:06,065 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-10-15 14:17:06,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2024-10-15 14:17:06,066 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 17 [2024-10-15 14:17:06,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:06,066 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2024-10-15 14:17:06,066 INFO L472 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-10-15 14:17:06,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:06,067 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2024-10-15 14:17:06,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-15 14:17:06,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:06,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:06,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-15 14:17:06,067 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-15 14:17:06,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:06,067 INFO L85 PathProgramCache]: Analyzing trace with hash -177273069, now seen corresponding path program 1 times [2024-10-15 14:17:06,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:06,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389006791] [2024-10-15 14:17:06,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:06,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:06,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:06,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:06,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:06,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389006791] [2024-10-15 14:17:06,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389006791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:06,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:06,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:17:06,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786767480] [2024-10-15 14:17:06,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:06,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:17:06,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:06,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:17:06,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:06,162 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-10-15 14:17:06,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:06,288 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2024-10-15 14:17:06,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:17:06,288 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-10-15 14:17:06,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:06,289 INFO L225 Difference]: With dead ends: 72 [2024-10-15 14:17:06,289 INFO L226 Difference]: Without dead ends: 70 [2024-10-15 14:17:06,289 INFO L431 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-10-15 14:17:06,290 INFO L432 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-10-15 14:17:06,290 INFO L433 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-10-15 14:17:06,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-15 14:17:06,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2024-10-15 14:17:06,297 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-10-15 14:17:06,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-10-15 14:17:06,297 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 17 [2024-10-15 14:17:06,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:06,298 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-10-15 14:17:06,298 INFO L472 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-10-15 14:17:06,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:06,298 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-10-15 14:17:06,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-15 14:17:06,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:06,299 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:06,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-15 14:17:06,299 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-15 14:17:06,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:06,300 INFO L85 PathProgramCache]: Analyzing trace with hash -129557819, now seen corresponding path program 1 times [2024-10-15 14:17:06,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:06,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893597396] [2024-10-15 14:17:06,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:06,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:06,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:06,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:06,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893597396] [2024-10-15 14:17:06,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893597396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:06,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:06,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:17:06,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973268054] [2024-10-15 14:17:06,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:06,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:17:06,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:06,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:17:06,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:06,398 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-10-15 14:17:06,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:06,532 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-10-15 14:17:06,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:17:06,532 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-10-15 14:17:06,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:06,533 INFO L225 Difference]: With dead ends: 73 [2024-10-15 14:17:06,533 INFO L226 Difference]: Without dead ends: 69 [2024-10-15 14:17:06,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:17:06,535 INFO L432 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-10-15 14:17:06,535 INFO L433 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-10-15 14:17:06,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-15 14:17:06,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2024-10-15 14:17:06,541 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-10-15 14:17:06,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2024-10-15 14:17:06,541 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 17 [2024-10-15 14:17:06,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:06,543 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2024-10-15 14:17:06,543 INFO L472 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-10-15 14:17:06,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:06,543 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-10-15 14:17:06,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-15 14:17:06,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:06,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:06,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-15 14:17:06,545 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-15 14:17:06,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:06,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1158166692, now seen corresponding path program 1 times [2024-10-15 14:17:06,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:06,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891492474] [2024-10-15 14:17:06,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:06,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:06,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:06,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:06,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891492474] [2024-10-15 14:17:06,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891492474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:06,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:06,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:17:06,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693884715] [2024-10-15 14:17:06,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:06,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:17:06,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:06,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:17:06,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:06,650 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-10-15 14:17:06,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:06,761 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2024-10-15 14:17:06,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:17:06,762 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-10-15 14:17:06,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:06,762 INFO L225 Difference]: With dead ends: 69 [2024-10-15 14:17:06,762 INFO L226 Difference]: Without dead ends: 67 [2024-10-15 14:17:06,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:17:06,763 INFO L432 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-10-15 14:17:06,763 INFO L433 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-10-15 14:17:06,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-15 14:17:06,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2024-10-15 14:17:06,769 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-10-15 14:17:06,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2024-10-15 14:17:06,769 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 18 [2024-10-15 14:17:06,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:06,769 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2024-10-15 14:17:06,770 INFO L472 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-10-15 14:17:06,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:06,770 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2024-10-15 14:17:06,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-15 14:17:06,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:06,771 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:06,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-15 14:17:06,771 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-15 14:17:06,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:06,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1439368950, now seen corresponding path program 1 times [2024-10-15 14:17:06,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:06,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284304794] [2024-10-15 14:17:06,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:06,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:06,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:06,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:06,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:06,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284304794] [2024-10-15 14:17:06,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284304794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:06,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:06,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:17:06,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635675262] [2024-10-15 14:17:06,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:06,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:17:06,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:06,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:17:06,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:17:06,813 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-10-15 14:17:06,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:06,882 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2024-10-15 14:17:06,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:17:06,883 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-10-15 14:17:06,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:06,883 INFO L225 Difference]: With dead ends: 65 [2024-10-15 14:17:06,883 INFO L226 Difference]: Without dead ends: 63 [2024-10-15 14:17:06,883 INFO L431 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-10-15 14:17:06,884 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:06,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 68 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:17:06,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-15 14:17:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-15 14:17:06,889 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-10-15 14:17:06,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2024-10-15 14:17:06,890 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 19 [2024-10-15 14:17:06,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:06,890 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2024-10-15 14:17:06,890 INFO L472 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-10-15 14:17:06,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:06,891 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2024-10-15 14:17:06,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-15 14:17:06,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:06,891 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:06,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-15 14:17:06,892 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-15 14:17:06,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:06,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1670767605, now seen corresponding path program 1 times [2024-10-15 14:17:06,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:06,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029197045] [2024-10-15 14:17:06,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:06,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:06,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:06,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:06,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:06,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029197045] [2024-10-15 14:17:06,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029197045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:06,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:06,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:17:06,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128853137] [2024-10-15 14:17:06,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:06,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:17:06,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:06,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:17:06,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:17:06,932 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-10-15 14:17:06,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:06,995 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2024-10-15 14:17:06,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:17:06,996 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-10-15 14:17:06,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:06,996 INFO L225 Difference]: With dead ends: 63 [2024-10-15 14:17:06,997 INFO L226 Difference]: Without dead ends: 59 [2024-10-15 14:17:06,997 INFO L431 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-10-15 14:17:06,997 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:06,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 90 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:17:06,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-15 14:17:07,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-15 14:17:07,015 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-10-15 14:17:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2024-10-15 14:17:07,015 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 20 [2024-10-15 14:17:07,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:07,016 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2024-10-15 14:17:07,016 INFO L472 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-10-15 14:17:07,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:07,016 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2024-10-15 14:17:07,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-15 14:17:07,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:07,017 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:07,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-15 14:17:07,017 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-15 14:17:07,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:07,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1687468520, now seen corresponding path program 1 times [2024-10-15 14:17:07,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:07,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682078141] [2024-10-15 14:17:07,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:07,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:07,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:07,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:07,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682078141] [2024-10-15 14:17:07,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682078141] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:17:07,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17926722] [2024-10-15 14:17:07,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:07,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:17:07,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:17:07,126 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-10-15 14:17:07,127 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 14:17:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:07,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-15 14:17:07,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:17:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:07,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:17:07,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 14:17:07,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17926722] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:17:07,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:17:07,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 18 [2024-10-15 14:17:07,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518009271] [2024-10-15 14:17:07,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:17:07,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-15 14:17:07,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:07,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-15 14:17:07,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-10-15 14:17:07,513 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-10-15 14:17:07,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:07,763 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2024-10-15 14:17:07,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-15 14:17:07,763 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-10-15 14:17:07,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:07,764 INFO L225 Difference]: With dead ends: 86 [2024-10-15 14:17:07,764 INFO L226 Difference]: Without dead ends: 84 [2024-10-15 14:17:07,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2024-10-15 14:17:07,765 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 324 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-10-15 14:17:07,765 INFO L433 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-10-15 14:17:07,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-15 14:17:07,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 55. [2024-10-15 14:17:07,771 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-10-15 14:17:07,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2024-10-15 14:17:07,772 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 21 [2024-10-15 14:17:07,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:07,772 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2024-10-15 14:17:07,772 INFO L472 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-10-15 14:17:07,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:07,773 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2024-10-15 14:17:07,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-15 14:17:07,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:07,773 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:07,786 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-15 14:17:07,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:17:07,974 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-15 14:17:07,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:07,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1687899496, now seen corresponding path program 1 times [2024-10-15 14:17:07,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:07,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592996113] [2024-10-15 14:17:07,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:07,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:08,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:08,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:08,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:08,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592996113] [2024-10-15 14:17:08,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592996113] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:17:08,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613117303] [2024-10-15 14:17:08,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:08,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:17:08,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:17:08,057 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-10-15 14:17:08,059 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 14:17:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:08,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-15 14:17:08,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:17:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:08,265 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:17:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 14:17:08,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613117303] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:17:08,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:17:08,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 18 [2024-10-15 14:17:08,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389769316] [2024-10-15 14:17:08,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:17:08,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-15 14:17:08,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:08,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-15 14:17:08,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-10-15 14:17:08,338 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-10-15 14:17:08,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:08,536 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2024-10-15 14:17:08,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-15 14:17:08,537 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-10-15 14:17:08,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:08,537 INFO L225 Difference]: With dead ends: 82 [2024-10-15 14:17:08,537 INFO L226 Difference]: Without dead ends: 80 [2024-10-15 14:17:08,538 INFO L431 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-10-15 14:17:08,538 INFO L432 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-10-15 14:17:08,538 INFO L433 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-10-15 14:17:08,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-15 14:17:08,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 48. [2024-10-15 14:17:08,546 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-10-15 14:17:08,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-10-15 14:17:08,547 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 21 [2024-10-15 14:17:08,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:08,547 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-10-15 14:17:08,547 INFO L472 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-10-15 14:17:08,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:08,548 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2024-10-15 14:17:08,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-15 14:17:08,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:08,548 INFO L215 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-10-15 14:17:08,564 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-15 14:17:08,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:17:08,753 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-15 14:17:08,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:08,754 INFO L85 PathProgramCache]: Analyzing trace with hash 267428458, now seen corresponding path program 1 times [2024-10-15 14:17:08,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:08,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553337945] [2024-10-15 14:17:08,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:08,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:08,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:08,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:08,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553337945] [2024-10-15 14:17:08,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553337945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:08,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:08,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:17:08,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919017715] [2024-10-15 14:17:08,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:08,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:17:08,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:08,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:17:08,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:08,821 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-10-15 14:17:08,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:08,915 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2024-10-15 14:17:08,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:17:08,916 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-10-15 14:17:08,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:08,916 INFO L225 Difference]: With dead ends: 48 [2024-10-15 14:17:08,916 INFO L226 Difference]: Without dead ends: 46 [2024-10-15 14:17:08,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-15 14:17:08,917 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 74 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-10-15 14:17:08,917 INFO L433 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-10-15 14:17:08,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-15 14:17:08,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2024-10-15 14:17:08,924 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-10-15 14:17:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-10-15 14:17:08,924 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 21 [2024-10-15 14:17:08,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:08,925 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-10-15 14:17:08,925 INFO L472 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-10-15 14:17:08,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-10-15 14:17:08,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-15 14:17:08,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:08,925 INFO L215 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-10-15 14:17:08,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-15 14:17:08,926 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-15 14:17:08,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:08,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1335654093, now seen corresponding path program 1 times [2024-10-15 14:17:08,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:08,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653725577] [2024-10-15 14:17:08,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:08,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:09,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:09,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:09,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:09,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653725577] [2024-10-15 14:17:09,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653725577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:09,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:09,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-15 14:17:09,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025418586] [2024-10-15 14:17:09,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:09,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-15 14:17:09,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:09,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 14:17:09,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:17:09,017 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-10-15 14:17:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:09,099 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-10-15 14:17:09,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:17:09,099 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-10-15 14:17:09,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:09,100 INFO L225 Difference]: With dead ends: 43 [2024-10-15 14:17:09,100 INFO L226 Difference]: Without dead ends: 41 [2024-10-15 14:17:09,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-15 14:17:09,102 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-10-15 14:17:09,103 INFO L433 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-10-15 14:17:09,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-15 14:17:09,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-10-15 14:17:09,108 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-10-15 14:17:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-10-15 14:17:09,109 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 22 [2024-10-15 14:17:09,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:09,109 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-10-15 14:17:09,110 INFO L472 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-10-15 14:17:09,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:09,110 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-10-15 14:17:09,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-15 14:17:09,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:09,111 INFO L215 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-10-15 14:17:09,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-15 14:17:09,111 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-10-15 14:17:09,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:09,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1287938843, now seen corresponding path program 1 times [2024-10-15 14:17:09,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:09,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012742758] [2024-10-15 14:17:09,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:09,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:09,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:09,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:09,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:09,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012742758] [2024-10-15 14:17:09,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012742758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:09,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:09,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-15 14:17:09,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618596159] [2024-10-15 14:17:09,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:09,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-15 14:17:09,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:09,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 14:17:09,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:17:09,199 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-10-15 14:17:09,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:09,289 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-10-15 14:17:09,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:17:09,290 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-10-15 14:17:09,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:09,290 INFO L225 Difference]: With dead ends: 38 [2024-10-15 14:17:09,290 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 14:17:09,291 INFO L431 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-10-15 14:17:09,291 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-10-15 14:17:09,292 INFO L433 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-10-15 14:17:09,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 14:17:09,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 14:17:09,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 14:17:09,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 14:17:09,293 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2024-10-15 14:17:09,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:09,293 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 14:17:09,293 INFO L472 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-10-15 14:17:09,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:09,294 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 14:17:09,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 14:17:09,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2024-10-15 14:17:09,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2024-10-15 14:17:09,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2024-10-15 14:17:09,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2024-10-15 14:17:09,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2024-10-15 14:17:09,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2024-10-15 14:17:09,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2024-10-15 14:17:09,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2024-10-15 14:17:09,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2024-10-15 14:17:09,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2024-10-15 14:17:09,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2024-10-15 14:17:09,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2024-10-15 14:17:09,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2024-10-15 14:17:09,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2024-10-15 14:17:09,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2024-10-15 14:17:09,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2024-10-15 14:17:09,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2024-10-15 14:17:09,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2024-10-15 14:17:09,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-15 14:17:09,302 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:09,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 14:17:10,752 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 14:17:10,770 WARN L156 FloydHoareUtils]: Requires clause for main contained old-variable. Original clause: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) Eliminated clause: true [2024-10-15 14:17:10,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 02:17:10 BoogieIcfgContainer [2024-10-15 14:17:10,773 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-15 14:17:10,774 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 14:17:10,774 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 14:17:10,774 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 14:17:10,774 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:17:02" (3/4) ... [2024-10-15 14:17:10,776 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-15 14:17:10,821 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-10-15 14:17:10,821 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 14:17:10,824 INFO L158 Benchmark]: Toolchain (without parser) took 9100.96ms. Allocated memory was 159.4MB in the beginning and 352.3MB in the end (delta: 192.9MB). Free memory was 132.7MB in the beginning and 175.6MB in the end (delta: -42.9MB). Peak memory consumption was 148.5MB. Max. memory is 16.1GB. [2024-10-15 14:17:10,825 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 133.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:17:10,825 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.74ms. Allocated memory is still 159.4MB. Free memory was 132.7MB in the beginning and 112.7MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-15 14:17:10,825 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.50ms. Allocated memory is still 159.4MB. Free memory was 112.7MB in the beginning and 111.7MB in the end (delta: 983.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:17:10,826 INFO L158 Benchmark]: Boogie Preprocessor took 49.65ms. Allocated memory is still 159.4MB. Free memory was 111.7MB in the beginning and 109.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:17:10,826 INFO L158 Benchmark]: RCFGBuilder took 386.51ms. Allocated memory is still 159.4MB. Free memory was 109.1MB in the beginning and 89.7MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-15 14:17:10,826 INFO L158 Benchmark]: TraceAbstraction took 8296.27ms. Allocated memory was 159.4MB in the beginning and 352.3MB in the end (delta: 192.9MB). Free memory was 88.7MB in the beginning and 178.7MB in the end (delta: -90.0MB). Peak memory consumption was 135.9MB. Max. memory is 16.1GB. [2024-10-15 14:17:10,826 INFO L158 Benchmark]: Witness Printer took 47.58ms. Allocated memory is still 352.3MB. Free memory was 178.7MB in the beginning and 175.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:17:10,827 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.16ms. Allocated memory is still 159.4MB. Free memory is still 133.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.74ms. Allocated memory is still 159.4MB. Free memory was 132.7MB in the beginning and 112.7MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.50ms. Allocated memory is still 159.4MB. Free memory was 112.7MB in the beginning and 111.7MB in the end (delta: 983.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.65ms. Allocated memory is still 159.4MB. Free memory was 111.7MB in the beginning and 109.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 386.51ms. Allocated memory is still 159.4MB. Free memory was 109.1MB in the beginning and 89.7MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8296.27ms. Allocated memory was 159.4MB in the beginning and 352.3MB in the end (delta: 192.9MB). Free memory was 88.7MB in the beginning and 178.7MB in the end (delta: -90.0MB). Peak memory consumption was 135.9MB. Max. memory is 16.1GB. * Witness Printer took 47.58ms. Allocated memory is still 352.3MB. Free memory was 178.7MB in the beginning and 175.6MB in the end (delta: 3.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: 6.8s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1154 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1154 mSDsluCounter, 2421 SdHoareTripleChecker+Invalid, 1.7s 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.3s 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.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 154 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s 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)) - ProcedureContractResult [Line: 15]: Procedure Contract for main Derived contract for procedure main. Ensures: (__return_main == \old(__return_main)) RESULT: Ultimate proved your program to be correct! [2024-10-15 14:17:10,853 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