./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-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-escape-absolute.i.v+cfa-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 e45e933f699aab7bcc9592c7af081e2fbc1238f5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:00,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 03:35:00,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 03:35:01,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 03:35:01,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 03:35:01,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 03:35:01,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 03:35:01,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 03:35:01,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 03:35:01,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 03:35:01,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 03:35:01,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 03:35:01,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 03:35:01,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 03:35:01,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 03:35:01,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 03:35:01,043 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 03:35:01,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 03:35:01,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 03:35:01,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 03:35:01,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 03:35:01,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 03:35:01,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 03:35:01,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 03:35:01,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 03:35:01,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 03:35:01,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 03:35:01,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 03:35:01,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 03:35:01,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 03:35:01,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 03:35:01,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 03:35:01,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 03:35:01,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 03:35:01,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 03:35:01,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 03:35:01,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 03:35:01,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 03:35:01,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 03:35:01,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 03:35:01,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 03:35:01,078 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:01,118 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 03:35:01,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 03:35:01,119 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 03:35:01,120 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 03:35:01,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 03:35:01,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 03:35:01,121 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 03:35:01,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 03:35:01,122 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 03:35:01,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 03:35:01,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 03:35:01,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 03:35:01,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 03:35:01,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 03:35:01,124 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 03:35:01,124 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 03:35:01,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 03:35:01,124 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 03:35:01,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 03:35:01,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 03:35:01,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 03:35:01,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 03:35:01,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 03:35:01,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 03:35:01,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 03:35:01,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 03:35:01,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 03:35:01,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 03:35:01,126 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 03:35:01,126 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 03:35:01,127 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 -> e45e933f699aab7bcc9592c7af081e2fbc1238f5 [2021-08-26 03:35:01,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 03:35:01,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 03:35:01,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 03:35:01,471 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 03:35:01,471 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 03:35:01,472 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2021-08-26 03:35:01,528 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca4696563/e0d9ab068eeb4b97bc170dff562fe9de/FLAG1be367aa6 [2021-08-26 03:35:01,906 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 03:35:01,906 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2021-08-26 03:35:01,912 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca4696563/e0d9ab068eeb4b97bc170dff562fe9de/FLAG1be367aa6 [2021-08-26 03:35:01,924 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca4696563/e0d9ab068eeb4b97bc170dff562fe9de [2021-08-26 03:35:01,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 03:35:01,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 03:35:01,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 03:35:01,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 03:35:01,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 03:35:01,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:35:01" (1/1) ... [2021-08-26 03:35:01,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dd84c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:01, skipping insertion in model container [2021-08-26 03:35:01,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:35:01" (1/1) ... [2021-08-26 03:35:01,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 03:35:01,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 03:35:02,070 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-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2021-08-26 03:35:02,073 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-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2021-08-26 03:35:02,075 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-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2021-08-26 03:35:02,076 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-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2021-08-26 03:35:02,078 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-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2021-08-26 03:35:02,079 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-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2021-08-26 03:35:02,081 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-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2021-08-26 03:35:02,083 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-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2021-08-26 03:35:02,085 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-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2021-08-26 03:35:02,086 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-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2021-08-26 03:35:02,088 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-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2021-08-26 03:35:02,089 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-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2021-08-26 03:35:02,091 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-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2021-08-26 03:35:02,092 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-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2021-08-26 03:35:02,094 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-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2021-08-26 03:35:02,095 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-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2021-08-26 03:35:02,097 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-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2021-08-26 03:35:02,098 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-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2021-08-26 03:35:02,101 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 03:35:02,107 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 03:35:02,160 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-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2021-08-26 03:35:02,162 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-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2021-08-26 03:35:02,163 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-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2021-08-26 03:35:02,164 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-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2021-08-26 03:35:02,165 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-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2021-08-26 03:35:02,168 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-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2021-08-26 03:35:02,174 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-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2021-08-26 03:35:02,175 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-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2021-08-26 03:35:02,177 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-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2021-08-26 03:35:02,178 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-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2021-08-26 03:35:02,179 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-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2021-08-26 03:35:02,181 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-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2021-08-26 03:35:02,182 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-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2021-08-26 03:35:02,183 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-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2021-08-26 03:35:02,193 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-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2021-08-26 03:35:02,199 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-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2021-08-26 03:35:02,201 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-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2021-08-26 03:35:02,202 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-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2021-08-26 03:35:02,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 03:35:02,218 INFO L208 MainTranslator]: Completed translation [2021-08-26 03:35:02,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:02 WrapperNode [2021-08-26 03:35:02,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 03:35:02,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 03:35:02,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 03:35:02,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 03:35:02,225 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:02" (1/1) ... [2021-08-26 03:35:02,241 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:02" (1/1) ... [2021-08-26 03:35:02,274 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 03:35:02,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 03:35:02,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 03:35:02,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 03:35:02,282 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:02" (1/1) ... [2021-08-26 03:35:02,283 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:02" (1/1) ... [2021-08-26 03:35:02,294 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:02" (1/1) ... [2021-08-26 03:35:02,294 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:02" (1/1) ... [2021-08-26 03:35:02,298 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:02" (1/1) ... [2021-08-26 03:35:02,300 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:02" (1/1) ... [2021-08-26 03:35:02,301 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:02" (1/1) ... [2021-08-26 03:35:02,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 03:35:02,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 03:35:02,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 03:35:02,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 03:35:02,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:02" (1/1) ... [2021-08-26 03:35:02,311 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 03:35:02,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:35:02,326 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:02,339 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:02,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 03:35:02,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 03:35:02,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 03:35:02,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 03:35:02,829 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 03:35:02,829 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-26 03:35:02,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:35:02 BoogieIcfgContainer [2021-08-26 03:35:02,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 03:35:02,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 03:35:02,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 03:35:02,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 03:35:02,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:35:01" (1/3) ... [2021-08-26 03:35:02,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6024b4a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:35:02, skipping insertion in model container [2021-08-26 03:35:02,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:02" (2/3) ... [2021-08-26 03:35:02,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6024b4a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:35:02, skipping insertion in model container [2021-08-26 03:35:02,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:35:02" (3/3) ... [2021-08-26 03:35:02,839 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2021-08-26 03:35:02,844 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 03:35:02,844 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2021-08-26 03:35:02,893 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 03:35:02,900 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:02,900 INFO L340 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2021-08-26 03:35:02,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 81 states have internal predecessors, (119), 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:02,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-26 03:35:02,919 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:02,920 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:02,920 INFO L402 AbstractCegarLoop]: === Iteration 1 === 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:02,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:02,926 INFO L82 PathProgramCache]: Analyzing trace with hash -2034435078, now seen corresponding path program 1 times [2021-08-26 03:35:02,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:02,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986288099] [2021-08-26 03:35:02,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:02,935 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:03,120 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:03,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:03,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986288099] [2021-08-26 03:35:03,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986288099] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:03,122 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:03,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 03:35:03,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699040062] [2021-08-26 03:35:03,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 03:35:03,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:03,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 03:35:03,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:35:03,146 INFO L87 Difference]: Start difference. First operand has 82 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 81 states have internal predecessors, (119), 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 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:03,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:03,186 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2021-08-26 03:35:03,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 03:35:03,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:03,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:03,197 INFO L225 Difference]: With dead ends: 88 [2021-08-26 03:35:03,198 INFO L226 Difference]: Without dead ends: 76 [2021-08-26 03:35:03,200 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:35:03,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-08-26 03:35:03,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-08-26 03:35:03,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 75 states have internal predecessors, (79), 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:03,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2021-08-26 03:35:03,236 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2021-08-26 03:35:03,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:03,237 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2021-08-26 03:35:03,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:03,237 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2021-08-26 03:35:03,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 03:35:03,238 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:03,239 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:03,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 03:35:03,239 INFO L402 AbstractCegarLoop]: === Iteration 2 === 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:03,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:03,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1357026114, now seen corresponding path program 1 times [2021-08-26 03:35:03,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:03,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802421890] [2021-08-26 03:35:03,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:03,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:03,336 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:03,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:03,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802421890] [2021-08-26 03:35:03,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802421890] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:03,337 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:03,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 03:35:03,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523683880] [2021-08-26 03:35:03,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:35:03,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:03,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:35:03,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:03,340 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:03,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:03,430 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2021-08-26 03:35:03,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:35:03,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:03,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:03,434 INFO L225 Difference]: With dead ends: 76 [2021-08-26 03:35:03,435 INFO L226 Difference]: Without dead ends: 74 [2021-08-26 03:35:03,436 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 30.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:35:03,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-08-26 03:35:03,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-08-26 03:35:03,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 73 states have internal predecessors, (77), 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:03,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2021-08-26 03:35:03,449 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2021-08-26 03:35:03,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:03,450 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2021-08-26 03:35:03,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:03,450 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2021-08-26 03:35:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-26 03:35:03,451 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:03,451 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:03,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 03:35:03,452 INFO L402 AbstractCegarLoop]: === Iteration 3 === 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:03,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:03,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1567835227, now seen corresponding path program 1 times [2021-08-26 03:35:03,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:03,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457197753] [2021-08-26 03:35:03,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:03,460 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:03,528 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:03,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:03,529 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457197753] [2021-08-26 03:35:03,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457197753] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:03,529 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:03,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:35:03,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73890602] [2021-08-26 03:35:03,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:35:03,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:03,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:35:03,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:35:03,531 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:03,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:03,605 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2021-08-26 03:35:03,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:03,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:03,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:03,607 INFO L225 Difference]: With dead ends: 97 [2021-08-26 03:35:03,607 INFO L226 Difference]: Without dead ends: 95 [2021-08-26 03:35:03,608 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:03,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-08-26 03:35:03,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 72. [2021-08-26 03:35:03,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 71 states have internal predecessors, (75), 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:03,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2021-08-26 03:35:03,614 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2021-08-26 03:35:03,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:03,614 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2021-08-26 03:35:03,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:03,614 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2021-08-26 03:35:03,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-26 03:35:03,615 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:03,615 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:03,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 03:35:03,615 INFO L402 AbstractCegarLoop]: === Iteration 4 === 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:03,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:03,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1358247672, now seen corresponding path program 1 times [2021-08-26 03:35:03,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:03,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382992142] [2021-08-26 03:35:03,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:03,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:03,674 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:03,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:03,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382992142] [2021-08-26 03:35:03,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382992142] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:03,675 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:03,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:03,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801722411] [2021-08-26 03:35:03,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:03,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:03,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:03,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:03,676 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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:03,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:03,754 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2021-08-26 03:35:03,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:03,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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:03,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:03,755 INFO L225 Difference]: With dead ends: 72 [2021-08-26 03:35:03,755 INFO L226 Difference]: Without dead ends: 70 [2021-08-26 03:35:03,755 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:35:03,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-08-26 03:35:03,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-08-26 03:35:03,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 69 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:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2021-08-26 03:35:03,765 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2021-08-26 03:35:03,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:03,766 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2021-08-26 03:35:03,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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:03,766 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2021-08-26 03:35:03,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-26 03:35:03,767 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:03,767 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:03,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 03:35:03,768 INFO L402 AbstractCegarLoop]: === Iteration 5 === 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:03,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:03,769 INFO L82 PathProgramCache]: Analyzing trace with hash -665385716, now seen corresponding path program 1 times [2021-08-26 03:35:03,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:03,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708712073] [2021-08-26 03:35:03,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:03,772 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:03,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:03,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:03,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708712073] [2021-08-26 03:35:03,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708712073] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:03,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:03,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:03,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102647096] [2021-08-26 03:35:03,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:03,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:03,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:03,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:03,846 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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:03,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:03,978 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2021-08-26 03:35:03,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 03:35:03,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2021-08-26 03:35:03,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:03,985 INFO L225 Difference]: With dead ends: 137 [2021-08-26 03:35:03,985 INFO L226 Difference]: Without dead ends: 135 [2021-08-26 03:35:03,985 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 48.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:35:03,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-08-26 03:35:03,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2021-08-26 03:35:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 states have internal predecessors, (78), 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:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2021-08-26 03:35:04,001 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 22 [2021-08-26 03:35:04,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:04,001 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2021-08-26 03:35:04,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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:04,002 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2021-08-26 03:35:04,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-26 03:35:04,002 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:04,003 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:04,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 03:35:04,003 INFO L402 AbstractCegarLoop]: === Iteration 6 === 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:04,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:04,006 INFO L82 PathProgramCache]: Analyzing trace with hash -661217951, now seen corresponding path program 1 times [2021-08-26 03:35:04,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:04,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560225084] [2021-08-26 03:35:04,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:04,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:04,093 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:04,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:04,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560225084] [2021-08-26 03:35:04,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560225084] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:04,093 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:04,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:04,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378763936] [2021-08-26 03:35:04,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:04,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:04,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:04,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:04,095 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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:04,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:04,186 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2021-08-26 03:35:04,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 03:35:04,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2021-08-26 03:35:04,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:04,187 INFO L225 Difference]: With dead ends: 104 [2021-08-26 03:35:04,188 INFO L226 Difference]: Without dead ends: 102 [2021-08-26 03:35:04,188 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 46.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:35:04,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-08-26 03:35:04,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2021-08-26 03:35:04,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 74 states have internal predecessors, (80), 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:04,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2021-08-26 03:35:04,193 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2021-08-26 03:35:04,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:04,193 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2021-08-26 03:35:04,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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:04,194 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2021-08-26 03:35:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-26 03:35:04,194 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:04,194 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:04,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 03:35:04,195 INFO L402 AbstractCegarLoop]: === Iteration 7 === 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:04,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:04,195 INFO L82 PathProgramCache]: Analyzing trace with hash 847883539, now seen corresponding path program 1 times [2021-08-26 03:35:04,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:04,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924439078] [2021-08-26 03:35:04,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:04,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:04,265 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:04,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:04,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924439078] [2021-08-26 03:35:04,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924439078] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:04,265 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:04,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:04,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939694966] [2021-08-26 03:35:04,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:04,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:04,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:04,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:04,267 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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:04,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:04,366 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2021-08-26 03:35:04,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:04,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2021-08-26 03:35:04,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:04,367 INFO L225 Difference]: With dead ends: 117 [2021-08-26 03:35:04,367 INFO L226 Difference]: Without dead ends: 115 [2021-08-26 03:35:04,367 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 54.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:35:04,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-08-26 03:35:04,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2021-08-26 03:35:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 60 states have (on average 1.3) internal successors, (78), 72 states have internal predecessors, (78), 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:04,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2021-08-26 03:35:04,381 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2021-08-26 03:35:04,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:04,383 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2021-08-26 03:35:04,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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:04,383 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2021-08-26 03:35:04,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-26 03:35:04,384 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:04,384 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:04,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 03:35:04,384 INFO L402 AbstractCegarLoop]: === Iteration 8 === 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:04,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:04,385 INFO L82 PathProgramCache]: Analyzing trace with hash 977084131, now seen corresponding path program 1 times [2021-08-26 03:35:04,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:04,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699651357] [2021-08-26 03:35:04,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:04,386 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:04,477 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:04,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:04,481 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699651357] [2021-08-26 03:35:04,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699651357] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:04,481 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:04,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:04,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431753550] [2021-08-26 03:35:04,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:04,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:04,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:04,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:04,485 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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:04,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:04,564 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2021-08-26 03:35:04,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:04,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2021-08-26 03:35:04,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:04,570 INFO L225 Difference]: With dead ends: 73 [2021-08-26 03:35:04,571 INFO L226 Difference]: Without dead ends: 71 [2021-08-26 03:35:04,571 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 46.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:35:04,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-08-26 03:35:04,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-08-26 03:35:04,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 70 states have internal predecessors, (76), 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:04,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2021-08-26 03:35:04,584 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2021-08-26 03:35:04,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:04,584 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2021-08-26 03:35:04,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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:04,584 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2021-08-26 03:35:04,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-26 03:35:04,586 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:04,588 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:04,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 03:35:04,589 INFO L402 AbstractCegarLoop]: === Iteration 9 === 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:04,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:04,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1619855478, now seen corresponding path program 1 times [2021-08-26 03:35:04,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:04,590 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129349891] [2021-08-26 03:35:04,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:04,590 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:04,644 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:04,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:04,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129349891] [2021-08-26 03:35:04,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129349891] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:04,646 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:04,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 03:35:04,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933447817] [2021-08-26 03:35:04,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 03:35:04,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:04,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 03:35:04,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:35:04,647 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:04,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:04,682 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2021-08-26 03:35:04,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 03:35:04,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2021-08-26 03:35:04,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:04,683 INFO L225 Difference]: With dead ends: 111 [2021-08-26 03:35:04,683 INFO L226 Difference]: Without dead ends: 71 [2021-08-26 03:35:04,684 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:35:04,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-08-26 03:35:04,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-08-26 03:35:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 70 states have internal predecessors, (74), 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:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2021-08-26 03:35:04,696 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2021-08-26 03:35:04,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:04,696 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2021-08-26 03:35:04,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:04,697 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2021-08-26 03:35:04,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-26 03:35:04,703 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:04,703 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:04,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 03:35:04,703 INFO L402 AbstractCegarLoop]: === Iteration 10 === 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:04,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:04,704 INFO L82 PathProgramCache]: Analyzing trace with hash 595608307, now seen corresponding path program 1 times [2021-08-26 03:35:04,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:04,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854387933] [2021-08-26 03:35:04,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:04,704 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:04,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 03:35:04,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:04,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854387933] [2021-08-26 03:35:04,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854387933] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:35:04,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420739174] [2021-08-26 03:35:04,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:04,789 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:35:04,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:35:04,800 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:04,834 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:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:04,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-26 03:35:04,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:35:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 03:35:05,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420739174] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:35:05,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:35:05,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-08-26 03:35:05,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893679341] [2021-08-26 03:35:05,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:35:05,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:05,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:35:05,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:05,063 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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:05,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:05,151 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2021-08-26 03:35:05,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:35:05,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 26 [2021-08-26 03:35:05,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:05,153 INFO L225 Difference]: With dead ends: 111 [2021-08-26 03:35:05,153 INFO L226 Difference]: Without dead ends: 109 [2021-08-26 03:35:05,153 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 36.7ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:35:05,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-08-26 03:35:05,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 68. [2021-08-26 03:35:05,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 67 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:05,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2021-08-26 03:35:05,158 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2021-08-26 03:35:05,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:05,159 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2021-08-26 03:35:05,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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:05,159 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2021-08-26 03:35:05,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-26 03:35:05,159 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:05,160 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:05,197 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:05,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-08-26 03:35:05,390 INFO L402 AbstractCegarLoop]: === Iteration 11 === 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:05,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:05,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1780382557, now seen corresponding path program 1 times [2021-08-26 03:35:05,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:05,390 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773939060] [2021-08-26 03:35:05,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:05,390 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:05,434 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:05,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:05,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773939060] [2021-08-26 03:35:05,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773939060] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:05,434 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:05,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:05,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51161741] [2021-08-26 03:35:05,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:05,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:05,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:05,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:05,436 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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:05,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:05,489 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2021-08-26 03:35:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:35:05,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 26 [2021-08-26 03:35:05,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:05,490 INFO L225 Difference]: With dead ends: 69 [2021-08-26 03:35:05,490 INFO L226 Difference]: Without dead ends: 67 [2021-08-26 03:35:05,490 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 22.4ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:35:05,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-08-26 03:35:05,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2021-08-26 03:35:05,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 65 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:05,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2021-08-26 03:35:05,494 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2021-08-26 03:35:05,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:05,494 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2021-08-26 03:35:05,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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:05,494 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2021-08-26 03:35:05,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-26 03:35:05,494 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:05,494 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:05,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 03:35:05,495 INFO L402 AbstractCegarLoop]: === Iteration 12 === 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:05,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:05,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1280139623, now seen corresponding path program 1 times [2021-08-26 03:35:05,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:05,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485673559] [2021-08-26 03:35:05,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:05,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 03:35:05,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:05,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485673559] [2021-08-26 03:35:05,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485673559] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:35:05,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535534812] [2021-08-26 03:35:05,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:05,544 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:35:05,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:35:05,545 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:05,573 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:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:05,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-26 03:35:05,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:35:05,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 03:35:05,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535534812] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:35:05,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:35:05,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-08-26 03:35:05,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540939100] [2021-08-26 03:35:05,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:35:05,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:05,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:35:05,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:05,755 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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:05,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:05,808 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2021-08-26 03:35:05,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:35:05,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 27 [2021-08-26 03:35:05,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:05,810 INFO L225 Difference]: With dead ends: 67 [2021-08-26 03:35:05,810 INFO L226 Difference]: Without dead ends: 65 [2021-08-26 03:35:05,810 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 30.0ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:35:05,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-08-26 03:35:05,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2021-08-26 03:35:05,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 59 states have internal predecessors, (62), 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:05,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2021-08-26 03:35:05,813 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2021-08-26 03:35:05,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:05,813 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2021-08-26 03:35:05,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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:05,813 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2021-08-26 03:35:05,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-26 03:35:05,815 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:05,815 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:05,841 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:06,028 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,SelfDestructingSolverStorable11 [2021-08-26 03:35:06,029 INFO L402 AbstractCegarLoop]: === Iteration 13 === 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:06,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:06,029 INFO L82 PathProgramCache]: Analyzing trace with hash -642711428, now seen corresponding path program 1 times [2021-08-26 03:35:06,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:06,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138653957] [2021-08-26 03:35:06,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:06,030 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:06,074 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:06,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:06,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138653957] [2021-08-26 03:35:06,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138653957] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:06,075 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:06,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:06,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246382940] [2021-08-26 03:35:06,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:06,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:06,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:06,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:06,081 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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:06,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:06,135 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2021-08-26 03:35:06,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:06,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 27 [2021-08-26 03:35:06,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:06,136 INFO L225 Difference]: With dead ends: 60 [2021-08-26 03:35:06,136 INFO L226 Difference]: Without dead ends: 58 [2021-08-26 03:35:06,137 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:35:06,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-08-26 03:35:06,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-08-26 03:35:06,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.2) internal successors, (60), 57 states have internal predecessors, (60), 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:06,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2021-08-26 03:35:06,140 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2021-08-26 03:35:06,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:06,142 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2021-08-26 03:35:06,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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:06,143 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2021-08-26 03:35:06,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-26 03:35:06,143 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:06,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:06,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 03:35:06,145 INFO L402 AbstractCegarLoop]: === Iteration 14 === 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:06,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:06,145 INFO L82 PathProgramCache]: Analyzing trace with hash -47880409, now seen corresponding path program 1 times [2021-08-26 03:35:06,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:06,146 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852731082] [2021-08-26 03:35:06,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:06,146 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:06,207 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:06,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:06,208 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852731082] [2021-08-26 03:35:06,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852731082] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:06,208 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:06,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:06,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778987860] [2021-08-26 03:35:06,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:06,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:06,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:06,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:06,212 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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:06,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:06,264 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2021-08-26 03:35:06,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:35:06,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 30 [2021-08-26 03:35:06,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:06,265 INFO L225 Difference]: With dead ends: 59 [2021-08-26 03:35:06,265 INFO L226 Difference]: Without dead ends: 57 [2021-08-26 03:35:06,266 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 23.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:35:06,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-08-26 03:35:06,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2021-08-26 03:35:06,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.183673469387755) internal successors, (58), 55 states have internal predecessors, (58), 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:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2021-08-26 03:35:06,269 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2021-08-26 03:35:06,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:06,269 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2021-08-26 03:35:06,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2021-08-26 03:35:06,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-26 03:35:06,270 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:06,271 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:06,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-26 03:35:06,271 INFO L402 AbstractCegarLoop]: === Iteration 15 === 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:06,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:06,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1484288504, now seen corresponding path program 1 times [2021-08-26 03:35:06,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:06,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016716694] [2021-08-26 03:35:06,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:06,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:06,321 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:06,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:06,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016716694] [2021-08-26 03:35:06,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016716694] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:06,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:06,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 03:35:06,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291463972] [2021-08-26 03:35:06,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:35:06,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:06,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:35:06,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:06,324 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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:06,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:06,399 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2021-08-26 03:35:06,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:35:06,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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 31 [2021-08-26 03:35:06,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:06,400 INFO L225 Difference]: With dead ends: 67 [2021-08-26 03:35:06,400 INFO L226 Difference]: Without dead ends: 65 [2021-08-26 03:35:06,401 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 30.3ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-08-26 03:35:06,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-08-26 03:35:06,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2021-08-26 03:35:06,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 53 states have internal predecessors, (56), 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:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2021-08-26 03:35:06,404 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2021-08-26 03:35:06,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:06,404 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2021-08-26 03:35:06,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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:06,404 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2021-08-26 03:35:06,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-26 03:35:06,405 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:06,405 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:06,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-26 03:35:06,405 INFO L402 AbstractCegarLoop]: === Iteration 16 === 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:06,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:06,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1746453711, now seen corresponding path program 1 times [2021-08-26 03:35:06,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:06,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739751206] [2021-08-26 03:35:06,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:06,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:06,459 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:06,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:06,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739751206] [2021-08-26 03:35:06,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739751206] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:06,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:06,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:06,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982600785] [2021-08-26 03:35:06,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:06,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:06,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:06,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:06,461 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:06,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:06,550 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2021-08-26 03:35:06,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 03:35:06,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 34 [2021-08-26 03:35:06,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:06,551 INFO L225 Difference]: With dead ends: 87 [2021-08-26 03:35:06,551 INFO L226 Difference]: Without dead ends: 85 [2021-08-26 03:35:06,551 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:35:06,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-08-26 03:35:06,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2021-08-26 03:35:06,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 56 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:06,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2021-08-26 03:35:06,555 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2021-08-26 03:35:06,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:06,555 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2021-08-26 03:35:06,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:06,555 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2021-08-26 03:35:06,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-26 03:35:06,556 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:06,556 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:06,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-26 03:35:06,556 INFO L402 AbstractCegarLoop]: === Iteration 17 === 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:06,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:06,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1694514003, now seen corresponding path program 1 times [2021-08-26 03:35:06,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:06,557 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136523115] [2021-08-26 03:35:06,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:06,557 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:06,599 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:06,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:06,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136523115] [2021-08-26 03:35:06,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136523115] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:06,600 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:06,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:06,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063041231] [2021-08-26 03:35:06,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:06,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:06,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:06,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:06,601 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:06,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:06,667 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2021-08-26 03:35:06,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:06,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 35 [2021-08-26 03:35:06,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:06,668 INFO L225 Difference]: With dead ends: 57 [2021-08-26 03:35:06,668 INFO L226 Difference]: Without dead ends: 55 [2021-08-26 03:35:06,669 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:35:06,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-08-26 03:35:06,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-08-26 03:35:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.14) internal successors, (57), 54 states have internal predecessors, (57), 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:06,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2021-08-26 03:35:06,672 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2021-08-26 03:35:06,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:06,673 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-08-26 03:35:06,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:06,673 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2021-08-26 03:35:06,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-26 03:35:06,674 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:06,674 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:06,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-26 03:35:06,674 INFO L402 AbstractCegarLoop]: === Iteration 18 === 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:06,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:06,675 INFO L82 PathProgramCache]: Analyzing trace with hash 635482230, now seen corresponding path program 1 times [2021-08-26 03:35:06,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:06,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344039426] [2021-08-26 03:35:06,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:06,675 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:06,704 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:06,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:06,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344039426] [2021-08-26 03:35:06,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344039426] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:06,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:06,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:35:06,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773137177] [2021-08-26 03:35:06,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:35:06,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:06,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:35:06,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:35:06,706 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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:06,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:06,740 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2021-08-26 03:35:06,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:06,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 37 [2021-08-26 03:35:06,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:06,741 INFO L225 Difference]: With dead ends: 66 [2021-08-26 03:35:06,741 INFO L226 Difference]: Without dead ends: 64 [2021-08-26 03:35:06,741 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-08-26 03:35:06,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2021-08-26 03:35:06,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 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:06,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2021-08-26 03:35:06,745 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 37 [2021-08-26 03:35:06,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:06,745 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2021-08-26 03:35:06,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2021-08-26 03:35:06,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-26 03:35:06,746 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:06,746 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:06,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-26 03:35:06,746 INFO L402 AbstractCegarLoop]: === Iteration 19 === 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:06,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:06,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1774883137, now seen corresponding path program 1 times [2021-08-26 03:35:06,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:06,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76100648] [2021-08-26 03:35:06,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:06,747 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:06,782 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:06,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:06,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76100648] [2021-08-26 03:35:06,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76100648] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:06,783 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:06,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:06,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202274472] [2021-08-26 03:35:06,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:06,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:06,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:06,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:06,785 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:06,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:06,808 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2021-08-26 03:35:06,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:06,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 38 [2021-08-26 03:35:06,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:06,809 INFO L225 Difference]: With dead ends: 62 [2021-08-26 03:35:06,809 INFO L226 Difference]: Without dead ends: 60 [2021-08-26 03:35:06,810 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:06,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-08-26 03:35:06,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2021-08-26 03:35:06,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 50 states have internal predecessors, (53), 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:06,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2021-08-26 03:35:06,813 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 38 [2021-08-26 03:35:06,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:06,813 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2021-08-26 03:35:06,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:06,813 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2021-08-26 03:35:06,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-26 03:35:06,814 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:06,814 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:06,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-26 03:35:06,814 INFO L402 AbstractCegarLoop]: === Iteration 20 === 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:06,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:06,815 INFO L82 PathProgramCache]: Analyzing trace with hash 813201821, now seen corresponding path program 1 times [2021-08-26 03:35:06,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:06,815 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744475066] [2021-08-26 03:35:06,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:06,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:06,870 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:06,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:06,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744475066] [2021-08-26 03:35:06,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744475066] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:06,871 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:06,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:06,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238532352] [2021-08-26 03:35:06,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:06,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:06,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:06,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:06,873 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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:06,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:06,977 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2021-08-26 03:35:06,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 03:35:06,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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 39 [2021-08-26 03:35:06,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:06,978 INFO L225 Difference]: With dead ends: 84 [2021-08-26 03:35:06,978 INFO L226 Difference]: Without dead ends: 82 [2021-08-26 03:35:06,978 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:35:06,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-08-26 03:35:06,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 56. [2021-08-26 03:35:06,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 55 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:06,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2021-08-26 03:35:06,982 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 39 [2021-08-26 03:35:06,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:06,982 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2021-08-26 03:35:06,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2021-08-26 03:35:06,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-26 03:35:06,983 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:06,983 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:06,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-26 03:35:06,984 INFO L402 AbstractCegarLoop]: === Iteration 21 === 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:06,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:06,984 INFO L82 PathProgramCache]: Analyzing trace with hash -560543098, now seen corresponding path program 1 times [2021-08-26 03:35:06,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:06,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256581921] [2021-08-26 03:35:06,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:06,985 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:07,031 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:07,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:07,031 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256581921] [2021-08-26 03:35:07,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256581921] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:07,032 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:07,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:07,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066395072] [2021-08-26 03:35:07,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:07,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:07,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:07,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:07,033 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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:07,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:07,118 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2021-08-26 03:35:07,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:07,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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) Word has length 40 [2021-08-26 03:35:07,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:07,119 INFO L225 Difference]: With dead ends: 69 [2021-08-26 03:35:07,119 INFO L226 Difference]: Without dead ends: 67 [2021-08-26 03:35:07,120 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:35:07,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-08-26 03:35:07,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2021-08-26 03:35:07,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 53 states have internal predecessors, (57), 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:07,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2021-08-26 03:35:07,123 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 40 [2021-08-26 03:35:07,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:07,123 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2021-08-26 03:35:07,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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:07,124 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2021-08-26 03:35:07,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-26 03:35:07,124 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:07,124 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:07,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-26 03:35:07,125 INFO L402 AbstractCegarLoop]: === Iteration 22 === 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:07,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:07,125 INFO L82 PathProgramCache]: Analyzing trace with hash 375780089, now seen corresponding path program 1 times [2021-08-26 03:35:07,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:07,125 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904263801] [2021-08-26 03:35:07,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:07,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:07,184 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:07,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:07,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904263801] [2021-08-26 03:35:07,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904263801] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:35:07,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151313545] [2021-08-26 03:35:07,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:07,185 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:35:07,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:35:07,187 INFO L229 MonitoredProcess]: Starting monitored process 4 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:07,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-26 03:35:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:07,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-26 03:35:07,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:35:07,471 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:07,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151313545] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:35:07,471 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:35:07,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-08-26 03:35:07,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689473039] [2021-08-26 03:35:07,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:35:07,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:07,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:35:07,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:07,473 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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:07,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:07,527 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2021-08-26 03:35:07,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:35:07,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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 40 [2021-08-26 03:35:07,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:07,528 INFO L225 Difference]: With dead ends: 54 [2021-08-26 03:35:07,528 INFO L226 Difference]: Without dead ends: 52 [2021-08-26 03:35:07,528 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 35.2ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:35:07,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-08-26 03:35:07,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-08-26 03:35:07,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 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:07,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2021-08-26 03:35:07,532 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 40 [2021-08-26 03:35:07,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:07,532 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2021-08-26 03:35:07,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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:07,532 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2021-08-26 03:35:07,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-26 03:35:07,533 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:07,533 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:07,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-26 03:35:07,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:35:07,749 INFO L402 AbstractCegarLoop]: === Iteration 23 === 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:07,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:07,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1394778411, now seen corresponding path program 1 times [2021-08-26 03:35:07,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:07,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074382777] [2021-08-26 03:35:07,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:07,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-26 03:35:07,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:07,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074382777] [2021-08-26 03:35:07,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074382777] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:07,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:07,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:07,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727694924] [2021-08-26 03:35:07,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:07,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:07,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:07,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:07,798 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:07,896 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2021-08-26 03:35:07,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 03:35:07,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 45 [2021-08-26 03:35:07,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:07,897 INFO L225 Difference]: With dead ends: 71 [2021-08-26 03:35:07,897 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 03:35:07,898 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 52.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:35:07,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 03:35:07,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 03:35:07,899 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:07,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 03:35:07,899 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2021-08-26 03:35:07,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:07,899 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 03:35:07,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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:07,899 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 03:35:07,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 03:35:07,901 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:07,901 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:07,901 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:07,902 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:07,902 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:07,902 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:07,902 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:07,902 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:07,902 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:07,902 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:07,903 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:07,903 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:07,903 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:07,903 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:07,903 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:07,903 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:07,904 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:07,904 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:07,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-26 03:35:07,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 03:35:07,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:35:07,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:35:07,967 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:35:08,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:35:08,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:35:08,041 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:35:08,877 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) no Hoare annotation was computed. [2021-08-26 03:35:08,877 INFO L857 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2021-08-26 03:35:08,878 INFO L857 garLoopResultBuilder]: For program point L234(lines 234 338) no Hoare annotation was computed. [2021-08-26 03:35:08,878 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) no Hoare annotation was computed. [2021-08-26 03:35:08,878 INFO L857 garLoopResultBuilder]: For program point L135(lines 135 397) no Hoare annotation was computed. [2021-08-26 03:35:08,879 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 03:35:08,879 INFO L857 garLoopResultBuilder]: For program point L284(line 284) no Hoare annotation was computed. [2021-08-26 03:35:08,879 INFO L857 garLoopResultBuilder]: For program point L53(lines 53 433) no Hoare annotation was computed. [2021-08-26 03:35:08,879 INFO L857 garLoopResultBuilder]: For program point L384(lines 384 393) no Hoare annotation was computed. [2021-08-26 03:35:08,879 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2021-08-26 03:35:08,879 INFO L853 garLoopResultBuilder]: At program point L401(lines 131 402) the Hoare annotation is: (and (let ((.cse0 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse1 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 ULTIMATE.start_main_~main__cp~0))) (or (and (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 1) .cse0 .cse1 .cse2 .cse3) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~16 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0)) .cse0 .cse1 .cse2 .cse3))) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~3 1) (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0)) [2021-08-26 03:35:08,880 INFO L857 garLoopResultBuilder]: For program point L104(lines 104 411) no Hoare annotation was computed. [2021-08-26 03:35:08,880 INFO L857 garLoopResultBuilder]: For program point L71(lines 71 416) no Hoare annotation was computed. [2021-08-26 03:35:08,880 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2021-08-26 03:35:08,880 INFO L857 garLoopResultBuilder]: For program point L253(lines 253 329) no Hoare annotation was computed. [2021-08-26 03:35:08,880 INFO L857 garLoopResultBuilder]: For program point L187(lines 187 355) no Hoare annotation was computed. [2021-08-26 03:35:08,880 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) no Hoare annotation was computed. [2021-08-26 03:35:08,880 INFO L857 garLoopResultBuilder]: For program point L270(lines 270 322) no Hoare annotation was computed. [2021-08-26 03:35:08,881 INFO L857 garLoopResultBuilder]: For program point L204(lines 204 353) no Hoare annotation was computed. [2021-08-26 03:35:08,881 INFO L857 garLoopResultBuilder]: For program point L386(line 386) no Hoare annotation was computed. [2021-08-26 03:35:08,881 INFO L857 garLoopResultBuilder]: For program point L155(lines 155 360) no Hoare annotation was computed. [2021-08-26 03:35:08,881 INFO L857 garLoopResultBuilder]: For program point L23(lines 23 438) no Hoare annotation was computed. [2021-08-26 03:35:08,881 INFO L857 garLoopResultBuilder]: For program point L255(line 255) no Hoare annotation was computed. [2021-08-26 03:35:08,881 INFO L857 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2021-08-26 03:35:08,881 INFO L857 garLoopResultBuilder]: For program point L123(lines 123 403) no Hoare annotation was computed. [2021-08-26 03:35:08,881 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2021-08-26 03:35:08,882 INFO L857 garLoopResultBuilder]: For program point L272(line 272) no Hoare annotation was computed. [2021-08-26 03:35:08,882 INFO L857 garLoopResultBuilder]: For program point L41(lines 41 435) no Hoare annotation was computed. [2021-08-26 03:35:08,882 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 03:35:08,882 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2021-08-26 03:35:08,882 INFO L857 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2021-08-26 03:35:08,882 INFO L857 garLoopResultBuilder]: For program point L372(lines 372 395) no Hoare annotation was computed. [2021-08-26 03:35:08,882 INFO L857 garLoopResultBuilder]: For program point L306(lines 306 316) no Hoare annotation was computed. [2021-08-26 03:35:08,882 INFO L857 garLoopResultBuilder]: For program point L224(lines 224 344) no Hoare annotation was computed. [2021-08-26 03:35:08,883 INFO L857 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2021-08-26 03:35:08,883 INFO L857 garLoopResultBuilder]: For program point L59(lines 59 432) no Hoare annotation was computed. [2021-08-26 03:35:08,883 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) no Hoare annotation was computed. [2021-08-26 03:35:08,883 INFO L857 garLoopResultBuilder]: For program point L241(lines 241 331) no Hoare annotation was computed. [2021-08-26 03:35:08,884 INFO L857 garLoopResultBuilder]: For program point L175(lines 175 357) no Hoare annotation was computed. [2021-08-26 03:35:08,884 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) no Hoare annotation was computed. [2021-08-26 03:35:08,884 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) no Hoare annotation was computed. [2021-08-26 03:35:08,884 INFO L857 garLoopResultBuilder]: For program point L374(line 374) no Hoare annotation was computed. [2021-08-26 03:35:08,885 INFO L857 garLoopResultBuilder]: For program point L308(line 308) no Hoare annotation was computed. [2021-08-26 03:35:08,885 INFO L857 garLoopResultBuilder]: For program point L143(lines 143 362) no Hoare annotation was computed. [2021-08-26 03:35:08,885 INFO L857 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2021-08-26 03:35:08,885 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2021-08-26 03:35:08,885 INFO L857 garLoopResultBuilder]: For program point L61(lines 61 427) no Hoare annotation was computed. [2021-08-26 03:35:08,885 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 03:35:08,885 INFO L857 garLoopResultBuilder]: For program point L243(line 243) no Hoare annotation was computed. [2021-08-26 03:35:08,885 INFO L857 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2021-08-26 03:35:08,886 INFO L857 garLoopResultBuilder]: For program point L111(lines 111 405) no Hoare annotation was computed. [2021-08-26 03:35:08,886 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) no Hoare annotation was computed. [2021-08-26 03:35:08,887 INFO L853 garLoopResultBuilder]: At program point L392(lines 129 403) the Hoare annotation is: (and (let ((.cse0 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse1 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~3 1)) (.cse4 (<= 1 ULTIMATE.start_main_~main__cp~0))) (or (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0)) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~16) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~17 0))) (and (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 1) .cse0 .cse1 .cse2 .cse3 .cse4))) (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0)) [2021-08-26 03:35:08,887 INFO L857 garLoopResultBuilder]: For program point L194(lines 194 354) no Hoare annotation was computed. [2021-08-26 03:35:08,887 INFO L857 garLoopResultBuilder]: For program point L95(lines 95 412) no Hoare annotation was computed. [2021-08-26 03:35:08,887 INFO L857 garLoopResultBuilder]: For program point L29(lines 29 437) no Hoare annotation was computed. [2021-08-26 03:35:08,887 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) no Hoare annotation was computed. [2021-08-26 03:35:08,888 INFO L857 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2021-08-26 03:35:08,888 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) no Hoare annotation was computed. [2021-08-26 03:35:08,888 INFO L853 garLoopResultBuilder]: At program point L327(lines 262 328) the Hoare annotation is: (and (= ULTIMATE.start_main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (let ((.cse1 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~7 0))) (.cse2 (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4)) (.cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~11 0))) (.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~8 0))) (.cse5 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))) (.cse6 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse7 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~6 0))) (.cse8 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) (.cse9 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) (.cse10 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~10 0))) (.cse11 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~5 0))) (.cse12 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~3 1)) (.cse13 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse14 (not (= (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))))) (or (and (= ULTIMATE.start_main_~main__c~0 0) .cse0) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) .cse0 (<= 1 ULTIMATE.start_main_~main__c~0)))) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~9 1) (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0)) [2021-08-26 03:35:08,888 INFO L857 garLoopResultBuilder]: For program point L294(lines 294 318) no Hoare annotation was computed. [2021-08-26 03:35:08,889 INFO L857 garLoopResultBuilder]: For program point L162(lines 162 359) no Hoare annotation was computed. [2021-08-26 03:35:08,889 INFO L857 garLoopResultBuilder]: For program point L63(lines 63 422) no Hoare annotation was computed. [2021-08-26 03:35:08,889 INFO L853 garLoopResultBuilder]: At program point L410(lines 104 411) the Hoare annotation is: (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0)) [2021-08-26 03:35:08,889 INFO L857 garLoopResultBuilder]: For program point L212(lines 212 346) no Hoare annotation was computed. [2021-08-26 03:35:08,890 INFO L857 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2021-08-26 03:35:08,890 INFO L857 garLoopResultBuilder]: For program point L47(lines 47 434) no Hoare annotation was computed. [2021-08-26 03:35:08,890 INFO L857 garLoopResultBuilder]: For program point L262(lines 262 328) no Hoare annotation was computed. [2021-08-26 03:35:08,890 INFO L857 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2021-08-26 03:35:08,890 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2021-08-26 03:35:08,890 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) no Hoare annotation was computed. [2021-08-26 03:35:08,891 INFO L857 garLoopResultBuilder]: For program point L296(line 296) no Hoare annotation was computed. [2021-08-26 03:35:08,891 INFO L857 garLoopResultBuilder]: For program point L65(lines 65 417) no Hoare annotation was computed. [2021-08-26 03:35:08,891 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 03:35:08,891 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2021-08-26 03:35:08,891 INFO L857 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2021-08-26 03:35:08,891 INFO L857 garLoopResultBuilder]: For program point L83(lines 83 414) no Hoare annotation was computed. [2021-08-26 03:35:08,892 INFO L853 garLoopResultBuilder]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~7 0))) (.cse3 (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4)) (.cse1 (= ULTIMATE.start_main_~main__c~0 0)) (.cse6 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))) (.cse7 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse8 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~6 0))) (.cse9 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) (.cse10 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) (.cse11 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~5 0))) (.cse12 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~3 1)) (.cse13 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse14 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~9 1))) (or (and (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10) (let ((.cse0 (let ((.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~11 0))) (.cse5 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~8 0))) (.cse15 (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse12 .cse13 .cse14 .cse15))))) (or (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) .cse0 (<= 1 ULTIMATE.start_main_~main__c~0)) (and .cse1 .cse0)))) (and .cse2 .cse3 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~8 1) .cse11 .cse12 .cse13 .cse14 (< (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0)))) [2021-08-26 03:35:08,892 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2021-08-26 03:35:08,892 INFO L857 garLoopResultBuilder]: For program point L282(lines 282 320) no Hoare annotation was computed. [2021-08-26 03:35:08,893 INFO L860 garLoopResultBuilder]: At program point L431(lines 13 439) the Hoare annotation is: true [2021-08-26 03:35:08,893 INFO L857 garLoopResultBuilder]: For program point L35(lines 35 436) no Hoare annotation was computed. [2021-08-26 03:35:08,897 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 03:35:08,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:35:08 BoogieIcfgContainer [2021-08-26 03:35:08,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 03:35:08,934 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 03:35:08,934 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 03:35:08,934 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 03:35:08,934 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:02" (3/4) ... [2021-08-26 03:35:08,937 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 03:35:08,955 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-08-26 03:35:08,955 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-26 03:35:08,956 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 03:35:08,956 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 03:35:09,018 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 03:35:09,019 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 03:35:09,020 INFO L168 Benchmark]: Toolchain (without parser) took 7091.93 ms. Allocated memory was 65.0 MB in the beginning and 151.0 MB in the end (delta: 86.0 MB). Free memory was 45.9 MB in the beginning and 98.0 MB in the end (delta: -52.1 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. [2021-08-26 03:35:09,020 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 65.0 MB. Free memory is still 47.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 03:35:09,021 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.27 ms. Allocated memory is still 65.0 MB. Free memory was 45.9 MB in the beginning and 44.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-08-26 03:35:09,021 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.82 ms. Allocated memory is still 65.0 MB. Free memory was 44.1 MB in the beginning and 42.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 03:35:09,021 INFO L168 Benchmark]: Boogie Preprocessor took 28.98 ms. Allocated memory is still 65.0 MB. Free memory was 42.0 MB in the beginning and 40.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 03:35:09,022 INFO L168 Benchmark]: RCFGBuilder took 526.92 ms. Allocated memory was 65.0 MB in the beginning and 86.0 MB in the end (delta: 21.0 MB). Free memory was 40.5 MB in the beginning and 51.2 MB in the end (delta: -10.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 16.1 GB. [2021-08-26 03:35:09,022 INFO L168 Benchmark]: TraceAbstraction took 6099.84 ms. Allocated memory was 86.0 MB in the beginning and 151.0 MB in the end (delta: 65.0 MB). Free memory was 50.4 MB in the beginning and 105.4 MB in the end (delta: -54.9 MB). Peak memory consumption was 75.1 MB. Max. memory is 16.1 GB. [2021-08-26 03:35:09,022 INFO L168 Benchmark]: Witness Printer took 85.15 ms. Allocated memory is still 151.0 MB. Free memory was 105.4 MB in the beginning and 98.0 MB in the end (delta: 7.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-26 03:35:09,024 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.19 ms. Allocated memory is still 65.0 MB. Free memory is still 47.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 290.27 ms. Allocated memory is still 65.0 MB. Free memory was 45.9 MB in the beginning and 44.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 54.82 ms. Allocated memory is still 65.0 MB. Free memory was 44.1 MB in the beginning and 42.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.98 ms. Allocated memory is still 65.0 MB. Free memory was 42.0 MB in the beginning and 40.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 526.92 ms. Allocated memory was 65.0 MB in the beginning and 86.0 MB in the end (delta: 21.0 MB). Free memory was 40.5 MB in the beginning and 51.2 MB in the end (delta: -10.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6099.84 ms. Allocated memory was 86.0 MB in the beginning and 151.0 MB in the end (delta: 65.0 MB). Free memory was 50.4 MB in the beginning and 105.4 MB in the end (delta: -54.9 MB). Peak memory consumption was 75.1 MB. Max. memory is 16.1 GB. * Witness Printer took 85.15 ms. Allocated memory is still 151.0 MB. Free memory was 105.4 MB in the beginning and 98.0 MB in the end (delta: 7.3 MB). Peak memory consumption was 8.4 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: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 97]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 113]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 125]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 214]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 226]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 243]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 272]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 284]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 296]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 308]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 374]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 386]: 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, 82 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 6005.5ms, OverallIterations: 23, TraceHistogramMax: 2, EmptinessCheckTime: 27.1ms, AutomataDifference: 1747.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 972.3ms, InitialAbstractionConstructionTime: 11.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1247 SDtfs, 2076 SDslu, 1461 SDs, 0 SdLazy, 1164 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 791.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 130 SyntacticMatches, 11 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 727.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 153.4ms AutomataMinimizationTime, 23 MinimizatonAttempts, 300 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 665 HoareAnnotationTreeSize, 6 FomulaSimplifications, 362850 FormulaSimplificationTreeSizeReduction, 164.0ms HoareSimplificationTime, 6 FomulaSimplificationsInter, 7955 FormulaSimplificationTreeSizeReductionInter, 801.7ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 86.2ms SsaConstructionTime, 339.2ms SatisfiabilityAnalysisTime, 1522.4ms InterpolantComputationTime, 751 NumberOfCodeBlocks, 751 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 725 ConstructedInterpolants, 0 QuantifiedInterpolants, 1526 SizeOfPredicates, 12 NumberOfNonLiveVariables, 398 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 26 InterpolantComputations, 20 PerfectInterpolantSequences, 9/21 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: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (1 <= __VERIFIER_assert__cond && (((!(__VERIFIER_assert__cond == 0) && (((((((((((((((!(__VERIFIER_assert__cond == 0) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && main__cp < main__urilen) || ((((((((((((((!(__VERIFIER_assert__cond == 0) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && main__cp < main__urilen))) && 1 <= main__c) || (main__c == 0 && (((((((((((((((!(__VERIFIER_assert__cond == 0) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && main__cp < main__urilen) || ((((((((((((((!(__VERIFIER_assert__cond == 0) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && main__cp < main__urilen))))) || (((((((((((((!(__VERIFIER_assert__cond == 0) && 1 <= __VERIFIER_assert__cond) && main__c == 0) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && main__cp + 1 < main__urilen) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: ((__VERIFIER_assert__cond == 1 && ((main__c == 0 && (((((((((((((((!(__VERIFIER_assert__cond == 0) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(main__cp + 1 == main__urilen)) || ((((((((((((((!(__VERIFIER_assert__cond == 0) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(main__cp + 1 == main__urilen)))) || ((!(__VERIFIER_assert__cond == 0) && (((((((((((((((!(__VERIFIER_assert__cond == 0) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(main__cp + 1 == main__urilen)) || ((((((((((((((!(__VERIFIER_assert__cond == 0) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(main__cp + 1 == main__urilen)))) && 1 <= main__c))) && __VERIFIER_assert__cond == 1) && main__cp < main__urilen - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) || (((((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp)) && main__cp < main__urilen - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: ((((((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) || (((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp)) && __VERIFIER_assert__cond == 1) && main__cp < main__urilen RESULT: Ultimate proved your program to be correct! [2021-08-26 03:35:09,073 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...