./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 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 5b57e964dbb610d8a39ef60225ec1dbb75ce4568 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 03:35:36,790 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 03:35:36,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 03:35:36,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 03:35:36,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 03:35:36,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 03:35:36,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 03:35:36,845 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 03:35:36,847 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 03:35:36,851 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 03:35:36,852 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 03:35:36,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 03:35:36,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 03:35:36,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 03:35:36,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 03:35:36,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 03:35:36,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 03:35:36,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 03:35:36,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 03:35:36,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 03:35:36,876 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 03:35:36,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 03:35:36,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 03:35:36,880 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 03:35:36,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 03:35:36,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 03:35:36,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 03:35:36,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 03:35:36,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 03:35:36,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 03:35:36,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 03:35:36,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 03:35:36,892 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 03:35:36,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 03:35:36,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 03:35:36,894 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 03:35:36,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 03:35:36,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 03:35:36,895 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 03:35:36,896 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 03:35:36,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 03:35:36,897 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 03:35:36,932 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 03:35:36,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 03:35:36,933 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 03:35:36,933 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 03:35:36,935 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 03:35:36,935 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 03:35:36,935 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 03:35:36,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 03:35:36,936 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 03:35:36,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 03:35:36,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 03:35:36,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 03:35:36,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 03:35:36,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 03:35:36,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 03:35:36,938 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 03:35:36,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 03:35:36,938 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 03:35:36,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 03:35:36,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 03:35:36,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 03:35:36,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 03:35:36,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 03:35:36,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 03:35:36,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 03:35:36,940 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 03:35:36,940 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 03:35:36,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 03:35:36,940 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 03:35:36,941 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 03:35:36,941 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 5b57e964dbb610d8a39ef60225ec1dbb75ce4568 [2021-08-26 03:35:37,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 03:35:37,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 03:35:37,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 03:35:37,313 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 03:35:37,313 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 03:35:37,314 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2021-08-26 03:35:37,366 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32e2f4041/3aa4564fc49545c3b2cba494052ddb3b/FLAG7620f36bb [2021-08-26 03:35:37,735 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 03:35:37,736 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2021-08-26 03:35:37,743 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32e2f4041/3aa4564fc49545c3b2cba494052ddb3b/FLAG7620f36bb [2021-08-26 03:35:37,755 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32e2f4041/3aa4564fc49545c3b2cba494052ddb3b [2021-08-26 03:35:37,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 03:35:37,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 03:35:37,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 03:35:37,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 03:35:37,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 03:35:37,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:35:37" (1/1) ... [2021-08-26 03:35:37,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b2de6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:37, skipping insertion in model container [2021-08-26 03:35:37,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:35:37" (1/1) ... [2021-08-26 03:35:37,774 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 03:35:37,812 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 03:35:37,913 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2021-08-26 03:35:37,917 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2021-08-26 03:35:37,918 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2021-08-26 03:35:37,921 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2021-08-26 03:35:37,922 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2021-08-26 03:35:37,924 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2021-08-26 03:35:37,925 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2021-08-26 03:35:37,926 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2021-08-26 03:35:37,928 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2021-08-26 03:35:37,930 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2021-08-26 03:35:37,931 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2021-08-26 03:35:37,933 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2021-08-26 03:35:37,935 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2021-08-26 03:35:37,936 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2021-08-26 03:35:37,937 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2021-08-26 03:35:37,938 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2021-08-26 03:35:37,940 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2021-08-26 03:35:37,941 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2021-08-26 03:35:37,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 03:35:37,957 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 03:35:37,973 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2021-08-26 03:35:37,975 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2021-08-26 03:35:37,976 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2021-08-26 03:35:37,977 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2021-08-26 03:35:37,978 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2021-08-26 03:35:37,980 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2021-08-26 03:35:37,981 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2021-08-26 03:35:37,982 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2021-08-26 03:35:37,983 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2021-08-26 03:35:37,985 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2021-08-26 03:35:37,986 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2021-08-26 03:35:37,988 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2021-08-26 03:35:37,991 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2021-08-26 03:35:37,992 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2021-08-26 03:35:37,993 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2021-08-26 03:35:37,994 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2021-08-26 03:35:38,026 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2021-08-26 03:35:38,027 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2021-08-26 03:35:38,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 03:35:38,040 INFO L208 MainTranslator]: Completed translation [2021-08-26 03:35:38,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:38 WrapperNode [2021-08-26 03:35:38,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 03:35:38,042 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 03:35:38,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 03:35:38,042 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 03:35:38,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:38" (1/1) ... [2021-08-26 03:35:38,055 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:38" (1/1) ... [2021-08-26 03:35:38,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 03:35:38,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 03:35:38,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 03:35:38,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 03:35:38,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:38" (1/1) ... [2021-08-26 03:35:38,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:38" (1/1) ... [2021-08-26 03:35:38,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:38" (1/1) ... [2021-08-26 03:35:38,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:38" (1/1) ... [2021-08-26 03:35:38,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:38" (1/1) ... [2021-08-26 03:35:38,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:38" (1/1) ... [2021-08-26 03:35:38,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:38" (1/1) ... [2021-08-26 03:35:38,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 03:35:38,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 03:35:38,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 03:35:38,138 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 03:35:38,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:38" (1/1) ... [2021-08-26 03:35:38,145 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 03:35:38,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:35:38,170 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 03:35:38,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 03:35:38,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 03:35:38,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 03:35:38,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 03:35:38,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 03:35:38,688 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 03:35:38,689 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-26 03:35:38,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:35:38 BoogieIcfgContainer [2021-08-26 03:35:38,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 03:35:38,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 03:35:38,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 03:35:38,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 03:35:38,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:35:37" (1/3) ... [2021-08-26 03:35:38,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559c584d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:35:38, skipping insertion in model container [2021-08-26 03:35:38,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:38" (2/3) ... [2021-08-26 03:35:38,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559c584d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:35:38, skipping insertion in model container [2021-08-26 03:35:38,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:35:38" (3/3) ... [2021-08-26 03:35:38,696 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2021-08-26 03:35:38,699 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 03:35:38,699 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2021-08-26 03:35:38,734 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 03:35:38,739 INFO L339 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, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 03:35:38,739 INFO L340 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2021-08-26 03:35:38,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 74 states have internal predecessors, (104), 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) [2021-08-26 03:35:38,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-26 03:35:38,767 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:38,768 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:38,768 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-08-26 03:35:38,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:38,772 INFO L82 PathProgramCache]: Analyzing trace with hash 123910062, now seen corresponding path program 1 times [2021-08-26 03:35:38,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:38,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207213548] [2021-08-26 03:35:38,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:38,779 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:38,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:38,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:38,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207213548] [2021-08-26 03:35:38,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207213548] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:38,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:38,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:35:38,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500232193] [2021-08-26 03:35:39,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:35:39,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:39,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:35:39,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:35:39,011 INFO L87 Difference]: Start difference. First operand has 75 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 74 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2021-08-26 03:35:39,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:39,153 INFO L93 Difference]: Finished difference Result 123 states and 164 transitions. [2021-08-26 03:35:39,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:39,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-08-26 03:35:39,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:39,162 INFO L225 Difference]: With dead ends: 123 [2021-08-26 03:35:39,162 INFO L226 Difference]: Without dead ends: 107 [2021-08-26 03:35:39,166 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:39,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-08-26 03:35:39,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 69. [2021-08-26 03:35:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 68 states have internal predecessors, (73), 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) [2021-08-26 03:35:39,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2021-08-26 03:35:39,205 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 8 [2021-08-26 03:35:39,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:39,205 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2021-08-26 03:35:39,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2021-08-26 03:35:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2021-08-26 03:35:39,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-26 03:35:39,207 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:39,207 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:39,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 03:35:39,209 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-08-26 03:35:39,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:39,212 INFO L82 PathProgramCache]: Analyzing trace with hash 120339118, now seen corresponding path program 1 times [2021-08-26 03:35:39,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:39,212 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032766892] [2021-08-26 03:35:39,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:39,212 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:39,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:39,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:39,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032766892] [2021-08-26 03:35:39,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032766892] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:39,295 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:39,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:35:39,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989861036] [2021-08-26 03:35:39,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:35:39,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:39,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:35:39,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:35:39,299 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2021-08-26 03:35:39,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:39,397 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2021-08-26 03:35:39,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:39,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-08-26 03:35:39,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:39,399 INFO L225 Difference]: With dead ends: 107 [2021-08-26 03:35:39,399 INFO L226 Difference]: Without dead ends: 105 [2021-08-26 03:35:39,400 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:39,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-08-26 03:35:39,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2021-08-26 03:35:39,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.392156862745098) internal successors, (71), 66 states have internal predecessors, (71), 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) [2021-08-26 03:35:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2021-08-26 03:35:39,405 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 8 [2021-08-26 03:35:39,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:39,406 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2021-08-26 03:35:39,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2021-08-26 03:35:39,406 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2021-08-26 03:35:39,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 03:35:39,407 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:39,407 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:39,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 03:35:39,407 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-08-26 03:35:39,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:39,408 INFO L82 PathProgramCache]: Analyzing trace with hash 2031737892, now seen corresponding path program 1 times [2021-08-26 03:35:39,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:39,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989226317] [2021-08-26 03:35:39,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:39,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:39,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:39,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989226317] [2021-08-26 03:35:39,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989226317] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:39,480 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:39,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:39,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008778146] [2021-08-26 03:35:39,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:39,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:39,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:39,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:39,489 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:39,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:39,588 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2021-08-26 03:35:39,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:39,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-26 03:35:39,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:39,593 INFO L225 Difference]: With dead ends: 69 [2021-08-26 03:35:39,593 INFO L226 Difference]: Without dead ends: 67 [2021-08-26 03:35:39,594 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:39,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-08-26 03:35:39,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2021-08-26 03:35:39,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.38) internal successors, (69), 64 states have internal predecessors, (69), 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) [2021-08-26 03:35:39,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2021-08-26 03:35:39,607 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 11 [2021-08-26 03:35:39,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:39,608 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2021-08-26 03:35:39,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:39,608 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2021-08-26 03:35:39,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 03:35:39,609 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:39,609 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:39,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 03:35:39,609 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-08-26 03:35:39,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:39,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1271153903, now seen corresponding path program 1 times [2021-08-26 03:35:39,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:39,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033814239] [2021-08-26 03:35:39,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:39,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:39,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:39,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:39,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033814239] [2021-08-26 03:35:39,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033814239] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:39,675 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:39,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:39,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871006121] [2021-08-26 03:35:39,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:39,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:39,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:39,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:39,678 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:39,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:39,765 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2021-08-26 03:35:39,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:39,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-26 03:35:39,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:39,767 INFO L225 Difference]: With dead ends: 67 [2021-08-26 03:35:39,767 INFO L226 Difference]: Without dead ends: 65 [2021-08-26 03:35:39,767 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:39,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-08-26 03:35:39,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2021-08-26 03:35:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 62 states have internal predecessors, (67), 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) [2021-08-26 03:35:39,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2021-08-26 03:35:39,782 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 11 [2021-08-26 03:35:39,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:39,782 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2021-08-26 03:35:39,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:39,783 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2021-08-26 03:35:39,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 03:35:39,783 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:39,783 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:39,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 03:35:39,784 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-08-26 03:35:39,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:39,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1440630601, now seen corresponding path program 1 times [2021-08-26 03:35:39,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:39,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70440126] [2021-08-26 03:35:39,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:39,785 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:39,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:39,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:39,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70440126] [2021-08-26 03:35:39,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70440126] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:39,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:39,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:35:39,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930514689] [2021-08-26 03:35:39,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:35:39,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:39,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:35:39,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:35:39,850 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:39,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:39,901 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2021-08-26 03:35:39,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:35:39,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-26 03:35:39,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:39,902 INFO L225 Difference]: With dead ends: 65 [2021-08-26 03:35:39,902 INFO L226 Difference]: Without dead ends: 61 [2021-08-26 03:35:39,902 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:39,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-08-26 03:35:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2021-08-26 03:35:39,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 58 states have internal predecessors, (63), 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) [2021-08-26 03:35:39,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2021-08-26 03:35:39,906 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 12 [2021-08-26 03:35:39,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:39,906 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2021-08-26 03:35:39,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:39,906 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2021-08-26 03:35:39,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 03:35:39,907 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:39,907 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:39,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 03:35:39,907 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-08-26 03:35:39,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:39,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1440142029, now seen corresponding path program 1 times [2021-08-26 03:35:39,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:39,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138175933] [2021-08-26 03:35:39,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:39,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:39,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:39,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:39,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138175933] [2021-08-26 03:35:39,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138175933] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:39,951 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:39,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:39,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129869872] [2021-08-26 03:35:39,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:39,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:39,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:39,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:39,953 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:40,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:40,037 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2021-08-26 03:35:40,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:40,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-26 03:35:40,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:40,039 INFO L225 Difference]: With dead ends: 95 [2021-08-26 03:35:40,039 INFO L226 Difference]: Without dead ends: 93 [2021-08-26 03:35:40,039 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:40,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-08-26 03:35:40,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 57. [2021-08-26 03:35:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 56 states have internal predecessors, (61), 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) [2021-08-26 03:35:40,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2021-08-26 03:35:40,048 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 12 [2021-08-26 03:35:40,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:40,048 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2021-08-26 03:35:40,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:40,049 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2021-08-26 03:35:40,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 03:35:40,049 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:40,049 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:40,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 03:35:40,050 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-08-26 03:35:40,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:40,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1440126141, now seen corresponding path program 1 times [2021-08-26 03:35:40,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:40,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222331707] [2021-08-26 03:35:40,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:40,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:40,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:40,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:40,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222331707] [2021-08-26 03:35:40,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222331707] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:40,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:40,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:40,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387258534] [2021-08-26 03:35:40,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:40,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:40,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:40,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:40,104 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:40,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:40,200 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2021-08-26 03:35:40,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:40,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-26 03:35:40,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:40,202 INFO L225 Difference]: With dead ends: 100 [2021-08-26 03:35:40,202 INFO L226 Difference]: Without dead ends: 98 [2021-08-26 03:35:40,202 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:40,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-08-26 03:35:40,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 55. [2021-08-26 03:35:40,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 54 states have internal predecessors, (59), 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) [2021-08-26 03:35:40,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2021-08-26 03:35:40,206 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 12 [2021-08-26 03:35:40,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:40,207 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2021-08-26 03:35:40,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:40,207 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2021-08-26 03:35:40,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 03:35:40,207 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:40,207 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:40,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 03:35:40,208 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-08-26 03:35:40,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:40,208 INFO L82 PathProgramCache]: Analyzing trace with hash -751061257, now seen corresponding path program 1 times [2021-08-26 03:35:40,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:40,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245623978] [2021-08-26 03:35:40,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:40,209 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:40,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:40,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:40,255 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245623978] [2021-08-26 03:35:40,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245623978] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:40,255 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:40,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:35:40,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334289648] [2021-08-26 03:35:40,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:35:40,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:40,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:35:40,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:35:40,258 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:40,309 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2021-08-26 03:35:40,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:35:40,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-26 03:35:40,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:40,310 INFO L225 Difference]: With dead ends: 57 [2021-08-26 03:35:40,310 INFO L226 Difference]: Without dead ends: 53 [2021-08-26 03:35:40,310 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:40,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-08-26 03:35:40,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2021-08-26 03:35:40,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 50 states have internal predecessors, (55), 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) [2021-08-26 03:35:40,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2021-08-26 03:35:40,313 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 12 [2021-08-26 03:35:40,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:40,314 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2021-08-26 03:35:40,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:40,314 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2021-08-26 03:35:40,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 03:35:40,314 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:40,315 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:40,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 03:35:40,315 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-08-26 03:35:40,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:40,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1694725733, now seen corresponding path program 1 times [2021-08-26 03:35:40,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:40,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064869071] [2021-08-26 03:35:40,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:40,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:40,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:40,469 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064869071] [2021-08-26 03:35:40,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064869071] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:40,469 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:40,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 03:35:40,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434111698] [2021-08-26 03:35:40,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:35:40,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:40,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:35:40,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:40,470 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:40,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:40,606 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2021-08-26 03:35:40,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 03:35:40,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-26 03:35:40,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:40,609 INFO L225 Difference]: With dead ends: 118 [2021-08-26 03:35:40,609 INFO L226 Difference]: Without dead ends: 116 [2021-08-26 03:35:40,610 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 62.4ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:35:40,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-08-26 03:35:40,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 56. [2021-08-26 03:35:40,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.326086956521739) internal successors, (61), 55 states have internal predecessors, (61), 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) [2021-08-26 03:35:40,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2021-08-26 03:35:40,621 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 13 [2021-08-26 03:35:40,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:40,621 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2021-08-26 03:35:40,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:40,621 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2021-08-26 03:35:40,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 03:35:40,622 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:40,622 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:40,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 03:35:40,622 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-08-26 03:35:40,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:40,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1694233189, now seen corresponding path program 1 times [2021-08-26 03:35:40,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:40,623 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936133779] [2021-08-26 03:35:40,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:40,623 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:40,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:40,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:40,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936133779] [2021-08-26 03:35:40,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936133779] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:40,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:40,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 03:35:40,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433233546] [2021-08-26 03:35:40,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:35:40,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:40,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:35:40,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:40,745 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:40,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:40,856 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2021-08-26 03:35:40,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 03:35:40,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-26 03:35:40,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:40,857 INFO L225 Difference]: With dead ends: 116 [2021-08-26 03:35:40,857 INFO L226 Difference]: Without dead ends: 114 [2021-08-26 03:35:40,858 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 46.4ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:35:40,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-08-26 03:35:40,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 58. [2021-08-26 03:35:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.3125) internal successors, (63), 57 states have internal predecessors, (63), 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) [2021-08-26 03:35:40,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2021-08-26 03:35:40,863 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 13 [2021-08-26 03:35:40,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:40,864 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2021-08-26 03:35:40,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:40,864 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2021-08-26 03:35:40,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 03:35:40,865 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:40,865 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:40,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 03:35:40,866 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-08-26 03:35:40,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:40,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1791008026, now seen corresponding path program 1 times [2021-08-26 03:35:40,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:40,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769267031] [2021-08-26 03:35:40,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:40,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:40,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:40,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769267031] [2021-08-26 03:35:40,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769267031] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:40,925 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:40,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:40,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218155766] [2021-08-26 03:35:40,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:40,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:40,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:40,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:40,926 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:41,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:41,008 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2021-08-26 03:35:41,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:41,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-26 03:35:41,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:41,009 INFO L225 Difference]: With dead ends: 76 [2021-08-26 03:35:41,009 INFO L226 Difference]: Without dead ends: 74 [2021-08-26 03:35:41,010 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:41,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-08-26 03:35:41,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2021-08-26 03:35:41,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.297872340425532) internal successors, (61), 55 states have internal predecessors, (61), 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) [2021-08-26 03:35:41,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2021-08-26 03:35:41,013 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 13 [2021-08-26 03:35:41,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:41,013 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2021-08-26 03:35:41,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:41,013 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2021-08-26 03:35:41,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 03:35:41,014 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:41,014 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:41,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 03:35:41,015 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-08-26 03:35:41,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:41,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1789284122, now seen corresponding path program 1 times [2021-08-26 03:35:41,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:41,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585286967] [2021-08-26 03:35:41,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:41,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:41,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:41,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585286967] [2021-08-26 03:35:41,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585286967] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:41,062 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:41,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:41,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921859601] [2021-08-26 03:35:41,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:41,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:41,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:41,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:41,063 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:41,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:41,120 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2021-08-26 03:35:41,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:41,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-26 03:35:41,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:41,121 INFO L225 Difference]: With dead ends: 57 [2021-08-26 03:35:41,121 INFO L226 Difference]: Without dead ends: 55 [2021-08-26 03:35:41,121 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:41,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-08-26 03:35:41,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2021-08-26 03:35:41,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 states have internal predecessors, (59), 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) [2021-08-26 03:35:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2021-08-26 03:35:41,124 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2021-08-26 03:35:41,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:41,124 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2021-08-26 03:35:41,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:41,125 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2021-08-26 03:35:41,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-26 03:35:41,125 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:41,125 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:41,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-26 03:35:41,125 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-08-26 03:35:41,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:41,126 INFO L82 PathProgramCache]: Analyzing trace with hash 313330138, now seen corresponding path program 1 times [2021-08-26 03:35:41,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:41,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043295322] [2021-08-26 03:35:41,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:41,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:41,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:41,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:41,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043295322] [2021-08-26 03:35:41,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043295322] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:41,221 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:41,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 03:35:41,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913419605] [2021-08-26 03:35:41,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:35:41,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:41,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:35:41,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:41,223 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:41,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:41,322 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2021-08-26 03:35:41,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 03:35:41,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-26 03:35:41,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:41,324 INFO L225 Difference]: With dead ends: 92 [2021-08-26 03:35:41,324 INFO L226 Difference]: Without dead ends: 90 [2021-08-26 03:35:41,324 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 32.2ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:35:41,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-08-26 03:35:41,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 60. [2021-08-26 03:35:41,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 59 states have internal predecessors, (67), 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) [2021-08-26 03:35:41,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2021-08-26 03:35:41,328 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 14 [2021-08-26 03:35:41,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:41,328 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2021-08-26 03:35:41,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:41,329 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2021-08-26 03:35:41,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-26 03:35:41,329 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:41,329 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:41,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 03:35:41,330 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-08-26 03:35:41,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:41,330 INFO L82 PathProgramCache]: Analyzing trace with hash 314877283, now seen corresponding path program 1 times [2021-08-26 03:35:41,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:41,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005459110] [2021-08-26 03:35:41,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:41,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:41,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:41,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:41,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005459110] [2021-08-26 03:35:41,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005459110] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:41,360 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:41,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:41,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100383] [2021-08-26 03:35:41,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:41,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:41,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:41,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:41,361 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:41,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:41,450 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2021-08-26 03:35:41,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:41,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-26 03:35:41,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:41,452 INFO L225 Difference]: With dead ends: 80 [2021-08-26 03:35:41,452 INFO L226 Difference]: Without dead ends: 78 [2021-08-26 03:35:41,452 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.0ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:41,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-08-26 03:35:41,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 58. [2021-08-26 03:35:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2021-08-26 03:35:41,456 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 14 [2021-08-26 03:35:41,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:41,456 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2021-08-26 03:35:41,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:41,457 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2021-08-26 03:35:41,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-26 03:35:41,457 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:41,457 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:41,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-26 03:35:41,457 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-08-26 03:35:41,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:41,458 INFO L82 PathProgramCache]: Analyzing trace with hash 366771218, now seen corresponding path program 1 times [2021-08-26 03:35:41,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:41,458 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002383331] [2021-08-26 03:35:41,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:41,458 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:41,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:41,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:41,575 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002383331] [2021-08-26 03:35:41,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002383331] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:41,575 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:41,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 03:35:41,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951098919] [2021-08-26 03:35:41,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:35:41,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:41,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:35:41,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:41,578 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:41,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:41,659 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2021-08-26 03:35:41,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:35:41,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-26 03:35:41,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:41,660 INFO L225 Difference]: With dead ends: 70 [2021-08-26 03:35:41,660 INFO L226 Difference]: Without dead ends: 66 [2021-08-26 03:35:41,661 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 37.3ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:35:41,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-08-26 03:35:41,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2021-08-26 03:35:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:41,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2021-08-26 03:35:41,664 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 14 [2021-08-26 03:35:41,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:41,664 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2021-08-26 03:35:41,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:41,665 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2021-08-26 03:35:41,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-26 03:35:41,665 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:41,665 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:41,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-26 03:35:41,665 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-08-26 03:35:41,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:41,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1171265312, now seen corresponding path program 1 times [2021-08-26 03:35:41,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:41,666 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877002712] [2021-08-26 03:35:41,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:41,667 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:41,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:41,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:41,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877002712] [2021-08-26 03:35:41,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877002712] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:41,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:41,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 03:35:41,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832305757] [2021-08-26 03:35:41,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:35:41,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:41,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:35:41,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:41,746 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:41,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:41,839 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2021-08-26 03:35:41,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 03:35:41,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-26 03:35:41,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:41,840 INFO L225 Difference]: With dead ends: 87 [2021-08-26 03:35:41,841 INFO L226 Difference]: Without dead ends: 85 [2021-08-26 03:35:41,841 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 31.7ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:35:41,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-08-26 03:35:41,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 62. [2021-08-26 03:35:41,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 61 states have internal predecessors, (69), 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) [2021-08-26 03:35:41,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2021-08-26 03:35:41,848 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 15 [2021-08-26 03:35:41,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:41,849 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2021-08-26 03:35:41,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:41,849 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2021-08-26 03:35:41,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 03:35:41,850 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:41,850 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:41,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-26 03:35:41,850 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-08-26 03:35:41,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:41,851 INFO L82 PathProgramCache]: Analyzing trace with hash 462679229, now seen corresponding path program 1 times [2021-08-26 03:35:41,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:41,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055983438] [2021-08-26 03:35:41,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:41,851 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:41,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:41,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:41,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055983438] [2021-08-26 03:35:41,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055983438] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:41,896 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:41,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:35:41,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351476898] [2021-08-26 03:35:41,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:35:41,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:41,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:35:41,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:35:41,898 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:41,923 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2021-08-26 03:35:41,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:35:41,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-08-26 03:35:41,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:41,924 INFO L225 Difference]: With dead ends: 62 [2021-08-26 03:35:41,924 INFO L226 Difference]: Without dead ends: 60 [2021-08-26 03:35:41,924 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:41,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-08-26 03:35:41,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-08-26 03:35:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 59 states have internal predecessors, (67), 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) [2021-08-26 03:35:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2021-08-26 03:35:41,928 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 16 [2021-08-26 03:35:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:41,928 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2021-08-26 03:35:41,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:41,928 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2021-08-26 03:35:41,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-26 03:35:41,928 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:41,929 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:41,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-26 03:35:41,929 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-08-26 03:35:41,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:41,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1458158324, now seen corresponding path program 1 times [2021-08-26 03:35:41,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:41,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977296169] [2021-08-26 03:35:41,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:41,930 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:41,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:41,963 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977296169] [2021-08-26 03:35:41,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977296169] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:41,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:41,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:35:41,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825341505] [2021-08-26 03:35:41,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:35:41,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:41,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:35:41,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:35:41,966 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:42,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:42,002 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2021-08-26 03:35:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:35:42,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-26 03:35:42,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:42,003 INFO L225 Difference]: With dead ends: 60 [2021-08-26 03:35:42,003 INFO L226 Difference]: Without dead ends: 56 [2021-08-26 03:35:42,004 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:42,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-08-26 03:35:42,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-08-26 03:35:42,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 55 states have internal predecessors, (63), 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) [2021-08-26 03:35:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2021-08-26 03:35:42,008 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 17 [2021-08-26 03:35:42,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:42,008 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2021-08-26 03:35:42,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:42,008 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2021-08-26 03:35:42,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-26 03:35:42,009 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:42,009 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:42,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-26 03:35:42,009 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-08-26 03:35:42,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:42,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1747922500, now seen corresponding path program 1 times [2021-08-26 03:35:42,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:42,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474041961] [2021-08-26 03:35:42,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:42,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:42,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:42,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:42,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474041961] [2021-08-26 03:35:42,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474041961] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:35:42,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237669099] [2021-08-26 03:35:42,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:42,092 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:35:42,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:35:42,096 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:35:42,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-26 03:35:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:42,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-26 03:35:42,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:35:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:42,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237669099] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:35:42,617 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:35:42,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2021-08-26 03:35:42,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499881891] [2021-08-26 03:35:42,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 03:35:42,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:42,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 03:35:42,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-08-26 03:35:42,620 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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) [2021-08-26 03:35:42,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:42,858 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2021-08-26 03:35:42,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-26 03:35:42,859 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-26 03:35:42,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:42,859 INFO L225 Difference]: With dead ends: 121 [2021-08-26 03:35:42,859 INFO L226 Difference]: Without dead ends: 119 [2021-08-26 03:35:42,860 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 153.5ms TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2021-08-26 03:35:42,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-08-26 03:35:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 52. [2021-08-26 03:35:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 states have internal predecessors, (59), 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) [2021-08-26 03:35:42,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2021-08-26 03:35:42,864 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 18 [2021-08-26 03:35:42,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:42,864 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2021-08-26 03:35:42,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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) [2021-08-26 03:35:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2021-08-26 03:35:42,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-26 03:35:42,866 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:42,866 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:42,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-26 03:35:43,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:35:43,084 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-08-26 03:35:43,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:43,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1748415044, now seen corresponding path program 1 times [2021-08-26 03:35:43,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:43,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71826362] [2021-08-26 03:35:43,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:43,084 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:43,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:43,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71826362] [2021-08-26 03:35:43,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71826362] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:35:43,156 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047711755] [2021-08-26 03:35:43,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:43,156 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:35:43,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:35:43,157 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:35:43,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-26 03:35:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:43,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-26 03:35:43,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:35:43,555 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:43,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047711755] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:35:43,555 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:35:43,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2021-08-26 03:35:43,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872338141] [2021-08-26 03:35:43,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 03:35:43,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:43,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 03:35:43,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-08-26 03:35:43,558 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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) [2021-08-26 03:35:43,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:43,767 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2021-08-26 03:35:43,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-26 03:35:43,768 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-26 03:35:43,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:43,769 INFO L225 Difference]: With dead ends: 100 [2021-08-26 03:35:43,769 INFO L226 Difference]: Without dead ends: 98 [2021-08-26 03:35:43,770 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 144.5ms TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2021-08-26 03:35:43,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-08-26 03:35:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 45. [2021-08-26 03:35:43,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 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) [2021-08-26 03:35:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2021-08-26 03:35:43,774 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 18 [2021-08-26 03:35:43,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:43,774 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2021-08-26 03:35:43,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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) [2021-08-26 03:35:43,775 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2021-08-26 03:35:43,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-26 03:35:43,775 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:43,775 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:43,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-26 03:35:43,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-08-26 03:35:43,997 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-08-26 03:35:43,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:43,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2026613132, now seen corresponding path program 1 times [2021-08-26 03:35:43,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:43,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653435897] [2021-08-26 03:35:43,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:43,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:44,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:44,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:44,045 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653435897] [2021-08-26 03:35:44,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653435897] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:44,046 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:44,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 03:35:44,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964668175] [2021-08-26 03:35:44,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:35:44,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:44,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:35:44,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:44,047 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:44,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:44,139 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2021-08-26 03:35:44,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:35:44,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-26 03:35:44,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:44,140 INFO L225 Difference]: With dead ends: 60 [2021-08-26 03:35:44,140 INFO L226 Difference]: Without dead ends: 58 [2021-08-26 03:35:44,140 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 46.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-26 03:35:44,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-08-26 03:35:44,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 40. [2021-08-26 03:35:44,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 39 states have internal predecessors, (46), 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) [2021-08-26 03:35:44,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2021-08-26 03:35:44,144 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2021-08-26 03:35:44,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:44,144 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2021-08-26 03:35:44,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:44,144 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2021-08-26 03:35:44,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-26 03:35:44,144 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:44,144 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:44,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-26 03:35:44,145 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-08-26 03:35:44,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:44,145 INFO L82 PathProgramCache]: Analyzing trace with hash -684716563, now seen corresponding path program 1 times [2021-08-26 03:35:44,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:44,145 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787071462] [2021-08-26 03:35:44,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:44,146 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:44,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:44,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787071462] [2021-08-26 03:35:44,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787071462] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:44,212 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:44,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-26 03:35:44,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141102033] [2021-08-26 03:35:44,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 03:35:44,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:44,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 03:35:44,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:35:44,214 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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) [2021-08-26 03:35:44,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:44,275 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2021-08-26 03:35:44,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:35:44,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-08-26 03:35:44,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:44,276 INFO L225 Difference]: With dead ends: 52 [2021-08-26 03:35:44,276 INFO L226 Difference]: Without dead ends: 50 [2021-08-26 03:35:44,277 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 32.7ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-26 03:35:44,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-08-26 03:35:44,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2021-08-26 03:35:44,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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) [2021-08-26 03:35:44,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2021-08-26 03:35:44,279 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 19 [2021-08-26 03:35:44,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:44,280 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2021-08-26 03:35:44,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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) [2021-08-26 03:35:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2021-08-26 03:35:44,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-26 03:35:44,281 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:44,281 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:44,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-26 03:35:44,281 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-08-26 03:35:44,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:44,282 INFO L82 PathProgramCache]: Analyzing trace with hash -631275483, now seen corresponding path program 1 times [2021-08-26 03:35:44,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:44,282 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137320081] [2021-08-26 03:35:44,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:44,282 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:44,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:44,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137320081] [2021-08-26 03:35:44,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137320081] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:44,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:44,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-26 03:35:44,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674169506] [2021-08-26 03:35:44,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 03:35:44,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:44,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 03:35:44,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:35:44,361 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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) [2021-08-26 03:35:44,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:44,410 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2021-08-26 03:35:44,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:44,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-08-26 03:35:44,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:44,410 INFO L225 Difference]: With dead ends: 35 [2021-08-26 03:35:44,410 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 03:35:44,411 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 26.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:35:44,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 03:35:44,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 03:35:44,411 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) [2021-08-26 03:35:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 03:35:44,411 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2021-08-26 03:35:44,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:44,411 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 03:35:44,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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) [2021-08-26 03:35:44,411 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 03:35:44,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 03:35:44,414 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:44,414 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:44,414 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:44,414 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:44,414 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:44,415 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:44,415 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:44,415 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:44,415 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:44,415 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:44,415 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:44,415 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:44,415 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:44,416 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:44,416 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:44,416 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:44,416 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:44,416 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:44,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-26 03:35:44,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 03:35:44,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:35:44,507 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:35:44,545 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:35:44,572 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:35:44,574 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:35:44,616 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:35:45,115 INFO L857 garLoopResultBuilder]: For program point L126(line 126) no Hoare annotation was computed. [2021-08-26 03:35:45,115 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2021-08-26 03:35:45,115 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 72) no Hoare annotation was computed. [2021-08-26 03:35:45,115 INFO L857 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2021-08-26 03:35:45,115 INFO L857 garLoopResultBuilder]: For program point L176(line 176) no Hoare annotation was computed. [2021-08-26 03:35:45,115 INFO L857 garLoopResultBuilder]: For program point L366(line 366) no Hoare annotation was computed. [2021-08-26 03:35:45,116 INFO L857 garLoopResultBuilder]: For program point L333(line 333) no Hoare annotation was computed. [2021-08-26 03:35:45,116 INFO L857 garLoopResultBuilder]: For program point L234(lines 234 242) no Hoare annotation was computed. [2021-08-26 03:35:45,116 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 297) no Hoare annotation was computed. [2021-08-26 03:35:45,116 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 126) no Hoare annotation was computed. [2021-08-26 03:35:45,116 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 03:35:45,116 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 03:35:45,116 INFO L857 garLoopResultBuilder]: For program point L152(lines 152 160) no Hoare annotation was computed. [2021-08-26 03:35:45,116 INFO L857 garLoopResultBuilder]: For program point L309(line 309) no Hoare annotation was computed. [2021-08-26 03:35:45,116 INFO L857 garLoopResultBuilder]: For program point L20(lines 20 401) no Hoare annotation was computed. [2021-08-26 03:35:45,116 INFO L857 garLoopResultBuilder]: For program point L276(lines 276 391) no Hoare annotation was computed. [2021-08-26 03:35:45,116 INFO L860 garLoopResultBuilder]: At program point L400(lines 15 402) the Hoare annotation is: true [2021-08-26 03:35:45,116 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 345) no Hoare annotation was computed. [2021-08-26 03:35:45,116 INFO L857 garLoopResultBuilder]: For program point L70(lines 70 94) no Hoare annotation was computed. [2021-08-26 03:35:45,117 INFO L853 garLoopResultBuilder]: At program point L384(lines 282 391) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_main_~main__t~0 0))) (let ((.cse0 (let ((.cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)))) (or (and (<= 1 ULTIMATE.start_main_~main__t~0) .cse2) (and .cse2 .cse1))))) (or (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (not (= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0)) .cse0 .cse1) (and (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~19) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~18 0)) .cse0)))) [2021-08-26 03:35:45,117 INFO L853 garLoopResultBuilder]: At program point L351(lines 32 395) the Hoare annotation is: (let ((.cse4 (<= 0 ULTIMATE.start_main_~main__tagbuf_len~0))) (or (and (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (let ((.cse3 (<= ULTIMATE.start_main_~main__t~0 1))) (let ((.cse0 (let ((.cse5 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~16 0))) (.cse6 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0))) (.cse7 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~17 0)))) (or (and .cse5 (not (= ULTIMATE.start_main_~main__tagbuf_len~0 0)) .cse3 .cse6 .cse7) (and .cse5 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~19 0)) .cse6 .cse7)))) (.cse1 (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~17)) (.cse2 (<= 1 ULTIMATE.start_main_~main__t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse4 (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~19)))))) (and (not (= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0)) .cse4 (= ULTIMATE.start_main_~main__t~0 0)))) [2021-08-26 03:35:45,117 INFO L857 garLoopResultBuilder]: For program point L186(lines 186 196) no Hoare annotation was computed. [2021-08-26 03:35:45,117 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 278) no Hoare annotation was computed. [2021-08-26 03:35:45,117 INFO L857 garLoopResultBuilder]: For program point L376(lines 376 385) no Hoare annotation was computed. [2021-08-26 03:35:45,117 INFO L857 garLoopResultBuilder]: For program point L343(lines 343 352) no Hoare annotation was computed. [2021-08-26 03:35:45,117 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 114) no Hoare annotation was computed. [2021-08-26 03:35:45,117 INFO L857 garLoopResultBuilder]: For program point L112(lines 112 203) no Hoare annotation was computed. [2021-08-26 03:35:45,117 INFO L857 garLoopResultBuilder]: For program point L236(line 236) no Hoare annotation was computed. [2021-08-26 03:35:45,117 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 333) no Hoare annotation was computed. [2021-08-26 03:35:45,118 INFO L853 garLoopResultBuilder]: At program point L195(lines 56 253) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0)) [2021-08-26 03:35:45,118 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 154) no Hoare annotation was computed. [2021-08-26 03:35:45,118 INFO L857 garLoopResultBuilder]: For program point L154(line 154) no Hoare annotation was computed. [2021-08-26 03:35:45,118 INFO L857 garLoopResultBuilder]: For program point L278(line 278) no Hoare annotation was computed. [2021-08-26 03:35:45,118 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 378) no Hoare annotation was computed. [2021-08-26 03:35:45,118 INFO L857 garLoopResultBuilder]: For program point L105(lines 105 209) no Hoare annotation was computed. [2021-08-26 03:35:45,118 INFO L857 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2021-08-26 03:35:45,118 INFO L857 garLoopResultBuilder]: For program point L39(lines 39 255) no Hoare annotation was computed. [2021-08-26 03:35:45,118 INFO L857 garLoopResultBuilder]: For program point L295(lines 295 317) no Hoare annotation was computed. [2021-08-26 03:35:45,118 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 142) no Hoare annotation was computed. [2021-08-26 03:35:45,118 INFO L857 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2021-08-26 03:35:45,118 INFO L857 garLoopResultBuilder]: For program point L378(line 378) no Hoare annotation was computed. [2021-08-26 03:35:45,119 INFO L857 garLoopResultBuilder]: For program point L345(line 345) no Hoare annotation was computed. [2021-08-26 03:35:45,119 INFO L857 garLoopResultBuilder]: For program point L114(line 114) no Hoare annotation was computed. [2021-08-26 03:35:45,119 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 366) no Hoare annotation was computed. [2021-08-26 03:35:45,119 INFO L857 garLoopResultBuilder]: For program point L32(lines 32 395) no Hoare annotation was computed. [2021-08-26 03:35:45,119 INFO L857 garLoopResultBuilder]: For program point L288(lines 288 390) no Hoare annotation was computed. [2021-08-26 03:35:45,119 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 03:35:45,119 INFO L857 garLoopResultBuilder]: For program point L222(lines 222 244) no Hoare annotation was computed. [2021-08-26 03:35:45,119 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2021-08-26 03:35:45,119 INFO L857 garLoopResultBuilder]: For program point L24(lines 24 396) no Hoare annotation was computed. [2021-08-26 03:35:45,119 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 52) no Hoare annotation was computed. [2021-08-26 03:35:45,119 INFO L857 garLoopResultBuilder]: For program point L82(lines 82 92) no Hoare annotation was computed. [2021-08-26 03:35:45,119 INFO L857 garLoopResultBuilder]: For program point L140(lines 140 162) no Hoare annotation was computed. [2021-08-26 03:35:45,120 INFO L857 garLoopResultBuilder]: For program point L297(line 297) no Hoare annotation was computed. [2021-08-26 03:35:45,120 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 03:35:45,120 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 176) no Hoare annotation was computed. [2021-08-26 03:35:45,120 INFO L857 garLoopResultBuilder]: For program point L124(lines 124 201) no Hoare annotation was computed. [2021-08-26 03:35:45,120 INFO L860 garLoopResultBuilder]: At program point L314(lines 32 395) the Hoare annotation is: true [2021-08-26 03:35:45,120 INFO L857 garLoopResultBuilder]: For program point L215(lines 215 250) no Hoare annotation was computed. [2021-08-26 03:35:45,120 INFO L857 garLoopResultBuilder]: For program point L50(lines 50 253) no Hoare annotation was computed. [2021-08-26 03:35:45,120 INFO L857 garLoopResultBuilder]: For program point L174(lines 174 198) no Hoare annotation was computed. [2021-08-26 03:35:45,120 INFO L857 garLoopResultBuilder]: For program point L364(lines 364 387) no Hoare annotation was computed. [2021-08-26 03:35:45,120 INFO L857 garLoopResultBuilder]: For program point L331(lines 331 354) no Hoare annotation was computed. [2021-08-26 03:35:45,120 INFO L857 garLoopResultBuilder]: For program point L265(lines 265 393) no Hoare annotation was computed. [2021-08-26 03:35:45,121 INFO L857 garLoopResultBuilder]: For program point L133(lines 133 200) no Hoare annotation was computed. [2021-08-26 03:35:45,121 INFO L857 garLoopResultBuilder]: For program point L224(line 224) no Hoare annotation was computed. [2021-08-26 03:35:45,121 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 236) no Hoare annotation was computed. [2021-08-26 03:35:45,121 INFO L853 garLoopResultBuilder]: At program point L249(lines 101 251) the Hoare annotation is: (and (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0)) [2021-08-26 03:35:45,121 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 84) no Hoare annotation was computed. [2021-08-26 03:35:45,121 INFO L857 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2021-08-26 03:35:45,121 INFO L857 garLoopResultBuilder]: For program point L307(lines 307 315) no Hoare annotation was computed. [2021-08-26 03:35:45,121 INFO L857 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2021-08-26 03:35:45,121 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 309) no Hoare annotation was computed. [2021-08-26 03:35:45,121 INFO L857 garLoopResultBuilder]: For program point L101(lines 101 251) no Hoare annotation was computed. [2021-08-26 03:35:45,121 INFO L857 garLoopResultBuilder]: For program point L324(lines 324 389) no Hoare annotation was computed. [2021-08-26 03:35:45,125 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 03:35:45,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:35:45 BoogieIcfgContainer [2021-08-26 03:35:45,138 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 03:35:45,138 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 03:35:45,138 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 03:35:45,139 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 03:35:45,139 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:35:38" (3/4) ... [2021-08-26 03:35:45,141 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 03:35:45,150 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-08-26 03:35:45,151 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-26 03:35:45,151 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 03:35:45,151 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 03:35:45,199 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 03:35:45,199 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 03:35:45,200 INFO L168 Benchmark]: Toolchain (without parser) took 7441.97 ms. Allocated memory was 56.6 MB in the beginning and 157.3 MB in the end (delta: 100.7 MB). Free memory was 35.2 MB in the beginning and 68.6 MB in the end (delta: -33.4 MB). Peak memory consumption was 67.2 MB. Max. memory is 16.1 GB. [2021-08-26 03:35:45,201 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 56.6 MB. Free memory was 38.6 MB in the beginning and 38.5 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 03:35:45,201 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.18 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 35.0 MB in the beginning and 49.5 MB in the end (delta: -14.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-26 03:35:45,201 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.06 ms. Allocated memory is still 69.2 MB. Free memory was 49.5 MB in the beginning and 47.5 MB in the end (delta: 2.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 03:35:45,201 INFO L168 Benchmark]: Boogie Preprocessor took 51.81 ms. Allocated memory is still 69.2 MB. Free memory was 47.5 MB in the beginning and 46.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 03:35:45,202 INFO L168 Benchmark]: RCFGBuilder took 552.04 ms. Allocated memory is still 69.2 MB. Free memory was 45.9 MB in the beginning and 37.7 MB in the end (delta: 8.2 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 GB. [2021-08-26 03:35:45,202 INFO L168 Benchmark]: TraceAbstraction took 6446.72 ms. Allocated memory was 69.2 MB in the beginning and 157.3 MB in the end (delta: 88.1 MB). Free memory was 37.1 MB in the beginning and 74.9 MB in the end (delta: -37.8 MB). Peak memory consumption was 75.5 MB. Max. memory is 16.1 GB. [2021-08-26 03:35:45,202 INFO L168 Benchmark]: Witness Printer took 60.85 ms. Allocated memory is still 157.3 MB. Free memory was 74.9 MB in the beginning and 68.6 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-26 03:35:45,203 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 56.6 MB. Free memory was 38.6 MB in the beginning and 38.5 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 279.18 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 35.0 MB in the beginning and 49.5 MB in the end (delta: -14.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 43.06 ms. Allocated memory is still 69.2 MB. Free memory was 49.5 MB in the beginning and 47.5 MB in the end (delta: 2.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 51.81 ms. Allocated memory is still 69.2 MB. Free memory was 47.5 MB in the beginning and 46.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 552.04 ms. Allocated memory is still 69.2 MB. Free memory was 45.9 MB in the beginning and 37.7 MB in the end (delta: 8.2 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6446.72 ms. Allocated memory was 69.2 MB in the beginning and 157.3 MB in the end (delta: 88.1 MB). Free memory was 37.1 MB in the beginning and 74.9 MB in the end (delta: -37.8 MB). Peak memory consumption was 75.5 MB. Max. memory is 16.1 GB. * Witness Printer took 60.85 ms. Allocated memory is still 157.3 MB. Free memory was 74.9 MB in the beginning and 68.6 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 52]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 72]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 84]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 114]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 126]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 142]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 154]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 176]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 188]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 224]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 236]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 278]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 297]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 309]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 333]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 345]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 366]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 378]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 75 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 6392.4ms, OverallIterations: 23, TraceHistogramMax: 2, EmptinessCheckTime: 20.2ms, AutomataDifference: 2265.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 698.1ms, InitialAbstractionConstructionTime: 21.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1028 SDtfs, 1618 SDslu, 1765 SDs, 0 SdLazy, 2051 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1244.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 833.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=0, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 141.3ms AutomataMinimizationTime, 23 MinimizatonAttempts, 531 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 12 NumberOfFragments, 192 HoareAnnotationTreeSize, 6 FomulaSimplifications, 10686158 FormulaSimplificationTreeSizeReduction, 197.0ms HoareSimplificationTime, 6 FomulaSimplificationsInter, 2506650 FormulaSimplificationTreeSizeReductionInter, 494.6ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 79.4ms SsaConstructionTime, 309.7ms SatisfiabilityAnalysisTime, 2034.4ms InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 331 ConstructedInterpolants, 0 QuantifiedInterpolants, 1519 SizeOfPredicates, 6 NumberOfNonLiveVariables, 233 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 4/16 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: 32]: Loop Invariant Derived loop invariant: (main__t < main__tagbuf_len && ((((((((((!(__VERIFIER_assert__cond == 0) && !(main__tagbuf_len == 0)) && main__t <= 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && 1 <= __VERIFIER_assert__cond) && 1 <= main__t) && main__t <= 1) && 0 <= main__tagbuf_len) || (((((((((!(__VERIFIER_assert__cond == 0) && !(main__tagbuf_len == 0)) && main__t <= 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && 1 <= __VERIFIER_assert__cond) && 1 <= main__t) && 0 <= main__tagbuf_len) && 1 <= __VERIFIER_assert__cond))) || ((!(main__t == main__tagbuf_len) && 0 <= main__tagbuf_len) && main__t == 0) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: main__t < main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: (((main__t <= main__tagbuf_len && !(main__t == main__tagbuf_len)) && ((1 <= main__t && !(__VERIFIER_assert__cond == 0)) || (!(__VERIFIER_assert__cond == 0) && main__t == 0))) && main__t == 0) || (((main__t < main__tagbuf_len && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && ((1 <= main__t && !(__VERIFIER_assert__cond == 0)) || (!(__VERIFIER_assert__cond == 0) && main__t == 0))) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-08-26 03:35:45,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...