./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39feee77bf576ea852c42114836a4ed3182237f56346991038306ebcfd74e257 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:35:49,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:35:49,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:35:49,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:35:49,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:35:49,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:35:49,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:35:49,087 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:35:49,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:35:49,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:35:49,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:35:49,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:35:49,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:35:49,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:35:49,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:35:49,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:35:49,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:35:49,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:35:49,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:35:49,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:35:49,110 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:35:49,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:35:49,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:35:49,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:35:49,113 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:35:49,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:35:49,119 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:35:49,120 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:35:49,121 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:35:49,121 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:35:49,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:35:49,122 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:35:49,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:35:49,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:35:49,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:35:49,125 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:35:49,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:35:49,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:35:49,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:35:49,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:35:49,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:35:49,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:35:49,130 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 15:35:49,157 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:35:49,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:35:49,158 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:35:49,158 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:35:49,159 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:35:49,159 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:35:49,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:35:49,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:35:49,160 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:35:49,161 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:35:49,161 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:35:49,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 15:35:49,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:35:49,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:35:49,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:35:49,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:35:49,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:35:49,162 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:35:49,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:35:49,162 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:35:49,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:35:49,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:35:49,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:35:49,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:35:49,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:35:49,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:35:49,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:35:49,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:35:49,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 15:35:49,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 15:35:49,164 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:35:49,165 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:35:49,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:35:49,165 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 -> 39feee77bf576ea852c42114836a4ed3182237f56346991038306ebcfd74e257 [2022-07-13 15:35:49,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:35:49,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:35:49,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:35:49,414 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:35:49,414 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:35:49,415 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2022-07-13 15:35:49,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02cac2104/68d7205047d347eaac2c152860ff5e10/FLAGf95452026 [2022-07-13 15:35:49,828 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:35:49,828 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2022-07-13 15:35:49,836 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02cac2104/68d7205047d347eaac2c152860ff5e10/FLAGf95452026 [2022-07-13 15:35:49,848 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02cac2104/68d7205047d347eaac2c152860ff5e10 [2022-07-13 15:35:49,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:35:49,851 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:35:49,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:35:49,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:35:49,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:35:49,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:35:49" (1/1) ... [2022-07-13 15:35:49,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f02c66e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:49, skipping insertion in model container [2022-07-13 15:35:49,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:35:49" (1/1) ... [2022-07-13 15:35:49,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:35:49,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:35:50,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[919,932] [2022-07-13 15:35:50,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[1134,1147] [2022-07-13 15:35:50,059 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2208,2221] [2022-07-13 15:35:50,060 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2423,2436] [2022-07-13 15:35:50,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2918,2931] [2022-07-13 15:35:50,064 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3133,3146] [2022-07-13 15:35:50,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3435,3448] [2022-07-13 15:35:50,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3653,3666] [2022-07-13 15:35:50,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3929,3942] [2022-07-13 15:35:50,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4147,4160] [2022-07-13 15:35:50,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4717,4730] [2022-07-13 15:35:50,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4935,4948] [2022-07-13 15:35:50,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[15828,15841] [2022-07-13 15:35:50,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16046,16059] [2022-07-13 15:35:50,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16441,16454] [2022-07-13 15:35:50,112 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16659,16672] [2022-07-13 15:35:50,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:35:50,122 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:35:50,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[919,932] [2022-07-13 15:35:50,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[1134,1147] [2022-07-13 15:35:50,137 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2208,2221] [2022-07-13 15:35:50,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2423,2436] [2022-07-13 15:35:50,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2918,2931] [2022-07-13 15:35:50,140 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3133,3146] [2022-07-13 15:35:50,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3435,3448] [2022-07-13 15:35:50,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3653,3666] [2022-07-13 15:35:50,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3929,3942] [2022-07-13 15:35:50,144 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4147,4160] [2022-07-13 15:35:50,146 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4717,4730] [2022-07-13 15:35:50,147 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4935,4948] [2022-07-13 15:35:50,186 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[15828,15841] [2022-07-13 15:35:50,187 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16046,16059] [2022-07-13 15:35:50,188 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16441,16454] [2022-07-13 15:35:50,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16659,16672] [2022-07-13 15:35:50,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:35:50,211 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:35:50,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:50 WrapperNode [2022-07-13 15:35:50,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:35:50,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:35:50,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:35:50,213 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:35:50,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:50" (1/1) ... [2022-07-13 15:35:50,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:50" (1/1) ... [2022-07-13 15:35:50,259 INFO L137 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 590 [2022-07-13 15:35:50,259 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:35:50,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:35:50,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:35:50,260 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:35:50,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:50" (1/1) ... [2022-07-13 15:35:50,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:50" (1/1) ... [2022-07-13 15:35:50,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:50" (1/1) ... [2022-07-13 15:35:50,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:50" (1/1) ... [2022-07-13 15:35:50,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:50" (1/1) ... [2022-07-13 15:35:50,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:50" (1/1) ... [2022-07-13 15:35:50,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:50" (1/1) ... [2022-07-13 15:35:50,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:35:50,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:35:50,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:35:50,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:35:50,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:50" (1/1) ... [2022-07-13 15:35:50,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:35:50,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:35:50,332 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) [2022-07-13 15:35:50,352 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 [2022-07-13 15:35:50,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:35:50,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 15:35:50,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:35:50,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:35:50,480 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:35:50,481 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:35:50,842 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:35:50,848 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:35:50,848 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 15:35:50,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:35:50 BoogieIcfgContainer [2022-07-13 15:35:50,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:35:50,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:35:50,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:35:50,857 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:35:50,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:35:49" (1/3) ... [2022-07-13 15:35:50,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bc2e026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:35:50, skipping insertion in model container [2022-07-13 15:35:50,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:50" (2/3) ... [2022-07-13 15:35:50,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bc2e026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:35:50, skipping insertion in model container [2022-07-13 15:35:50,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:35:50" (3/3) ... [2022-07-13 15:35:50,860 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2022-07-13 15:35:50,871 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:35:50,872 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-07-13 15:35:50,947 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:35:50,952 INFO L357 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, mAutomataTypeConcurrency=PETRI_NET, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@23938119, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@8b09826 [2022-07-13 15:35:50,953 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-07-13 15:35:50,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 103 states have (on average 1.912621359223301) internal successors, (197), 119 states have internal predecessors, (197), 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) [2022-07-13 15:35:50,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-13 15:35:50,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:50,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:50,962 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-07-13 15:35:50,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:50,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1804934597, now seen corresponding path program 1 times [2022-07-13 15:35:50,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:50,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348088651] [2022-07-13 15:35:50,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:50,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:51,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:35:51,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:51,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348088651] [2022-07-13 15:35:51,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348088651] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:51,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:51,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:35:51,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918559436] [2022-07-13 15:35:51,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:51,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:35:51,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:51,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:35:51,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:35:51,183 INFO L87 Difference]: Start difference. First operand has 120 states, 103 states have (on average 1.912621359223301) internal successors, (197), 119 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-07-13 15:35:51,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:51,414 INFO L93 Difference]: Finished difference Result 131 states and 205 transitions. [2022-07-13 15:35:51,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:35:51,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2022-07-13 15:35:51,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:51,428 INFO L225 Difference]: With dead ends: 131 [2022-07-13 15:35:51,428 INFO L226 Difference]: Without dead ends: 114 [2022-07-13 15:35:51,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:35:51,436 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 160 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:51,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 175 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:35:51,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-13 15:35:51,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-07-13 15:35:51,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 113 states have internal predecessors, (135), 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) [2022-07-13 15:35:51,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2022-07-13 15:35:51,469 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 7 [2022-07-13 15:35:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:51,470 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2022-07-13 15:35:51,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-07-13 15:35:51,470 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2022-07-13 15:35:51,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-13 15:35:51,470 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:51,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:51,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 15:35:51,471 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-07-13 15:35:51,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:51,471 INFO L85 PathProgramCache]: Analyzing trace with hash 118401710, now seen corresponding path program 1 times [2022-07-13 15:35:51,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:51,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683012574] [2022-07-13 15:35:51,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:51,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:51,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:35:51,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:51,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683012574] [2022-07-13 15:35:51,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683012574] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:51,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:51,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:35:51,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446751964] [2022-07-13 15:35:51,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:51,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:35:51,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:51,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:35:51,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:35:51,554 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:51,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:51,684 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2022-07-13 15:35:51,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:35:51,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-13 15:35:51,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:51,689 INFO L225 Difference]: With dead ends: 114 [2022-07-13 15:35:51,689 INFO L226 Difference]: Without dead ends: 109 [2022-07-13 15:35:51,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:35:51,692 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 34 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:51,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 268 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:35:51,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-13 15:35:51,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-07-13 15:35:51,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 108 states have internal predecessors, (121), 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) [2022-07-13 15:35:51,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2022-07-13 15:35:51,712 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 8 [2022-07-13 15:35:51,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:51,712 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2022-07-13 15:35:51,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:51,713 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2022-07-13 15:35:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 15:35:51,713 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:51,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:51,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 15:35:51,714 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-07-13 15:35:51,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:51,715 INFO L85 PathProgramCache]: Analyzing trace with hash -639549266, now seen corresponding path program 1 times [2022-07-13 15:35:51,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:51,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117965029] [2022-07-13 15:35:51,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:51,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:51,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:35:51,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:51,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117965029] [2022-07-13 15:35:51,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117965029] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:51,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:51,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:35:51,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199200244] [2022-07-13 15:35:51,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:51,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:35:51,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:51,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:35:51,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:35:51,778 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:51,953 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2022-07-13 15:35:51,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:35:51,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-13 15:35:51,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:51,956 INFO L225 Difference]: With dead ends: 109 [2022-07-13 15:35:51,957 INFO L226 Difference]: Without dead ends: 107 [2022-07-13 15:35:51,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:35:51,959 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 93 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:51,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 101 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:35:51,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-13 15:35:51,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-13 15:35:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 106 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) [2022-07-13 15:35:51,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2022-07-13 15:35:51,977 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 11 [2022-07-13 15:35:51,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:51,978 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2022-07-13 15:35:51,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:51,980 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-07-13 15:35:51,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-13 15:35:51,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:51,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:51,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 15:35:51,981 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-07-13 15:35:51,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:51,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1648813321, now seen corresponding path program 1 times [2022-07-13 15:35:51,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:51,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952649477] [2022-07-13 15:35:51,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:51,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:52,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:35:52,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:52,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952649477] [2022-07-13 15:35:52,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952649477] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:52,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:52,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:35:52,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645281667] [2022-07-13 15:35:52,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:52,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:35:52,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:52,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:35:52,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:35:52,021 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:52,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:52,110 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2022-07-13 15:35:52,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:35:52,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-13 15:35:52,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:52,113 INFO L225 Difference]: With dead ends: 107 [2022-07-13 15:35:52,113 INFO L226 Difference]: Without dead ends: 103 [2022-07-13 15:35:52,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:35:52,120 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 11 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:52,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 242 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:35:52,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-13 15:35:52,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-07-13 15:35:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 102 states have internal predecessors, (115), 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) [2022-07-13 15:35:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2022-07-13 15:35:52,138 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 12 [2022-07-13 15:35:52,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:52,138 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2022-07-13 15:35:52,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:52,138 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2022-07-13 15:35:52,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 15:35:52,139 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:52,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:52,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 15:35:52,139 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-07-13 15:35:52,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:52,140 INFO L85 PathProgramCache]: Analyzing trace with hash -411248735, now seen corresponding path program 1 times [2022-07-13 15:35:52,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:52,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661082479] [2022-07-13 15:35:52,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:52,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:35:52,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:52,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661082479] [2022-07-13 15:35:52,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661082479] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:52,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:52,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:35:52,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150174251] [2022-07-13 15:35:52,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:52,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:35:52,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:52,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:35:52,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:35:52,216 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:52,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:52,373 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2022-07-13 15:35:52,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:35:52,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 15:35:52,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:52,374 INFO L225 Difference]: With dead ends: 121 [2022-07-13 15:35:52,374 INFO L226 Difference]: Without dead ends: 119 [2022-07-13 15:35:52,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:35:52,375 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 110 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:52,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 111 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:35:52,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-13 15:35:52,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 101. [2022-07-13 15:35:52,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 100 states have internal predecessors, (113), 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) [2022-07-13 15:35:52,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2022-07-13 15:35:52,380 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 13 [2022-07-13 15:35:52,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:52,380 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2022-07-13 15:35:52,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:52,381 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2022-07-13 15:35:52,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 15:35:52,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:52,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:52,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 15:35:52,382 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-07-13 15:35:52,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:52,382 INFO L85 PathProgramCache]: Analyzing trace with hash -409524831, now seen corresponding path program 1 times [2022-07-13 15:35:52,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:52,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361797973] [2022-07-13 15:35:52,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:52,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:52,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:35:52,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:52,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361797973] [2022-07-13 15:35:52,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361797973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:52,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:52,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:35:52,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944292493] [2022-07-13 15:35:52,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:52,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:35:52,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:52,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:35:52,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:35:52,431 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:52,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:52,565 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2022-07-13 15:35:52,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:35:52,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 15:35:52,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:52,567 INFO L225 Difference]: With dead ends: 101 [2022-07-13 15:35:52,567 INFO L226 Difference]: Without dead ends: 99 [2022-07-13 15:35:52,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:35:52,569 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 83 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:52,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 83 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:35:52,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-13 15:35:52,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-07-13 15:35:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 89 states have (on average 1.247191011235955) internal successors, (111), 98 states have internal predecessors, (111), 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) [2022-07-13 15:35:52,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2022-07-13 15:35:52,578 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 13 [2022-07-13 15:35:52,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:52,578 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2022-07-13 15:35:52,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:52,579 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2022-07-13 15:35:52,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 15:35:52,579 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:52,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:52,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 15:35:52,580 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-07-13 15:35:52,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:52,581 INFO L85 PathProgramCache]: Analyzing trace with hash 136195212, now seen corresponding path program 1 times [2022-07-13 15:35:52,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:52,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782928910] [2022-07-13 15:35:52,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:52,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:52,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:35:52,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:52,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782928910] [2022-07-13 15:35:52,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782928910] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:52,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:52,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:35:52,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941259757] [2022-07-13 15:35:52,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:52,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:35:52,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:52,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:35:52,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:35:52,682 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:52,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:52,848 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2022-07-13 15:35:52,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 15:35:52,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-13 15:35:52,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:52,850 INFO L225 Difference]: With dead ends: 136 [2022-07-13 15:35:52,850 INFO L226 Difference]: Without dead ends: 134 [2022-07-13 15:35:52,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:35:52,851 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 51 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:52,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 296 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:35:52,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-13 15:35:52,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 105. [2022-07-13 15:35:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 104 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) [2022-07-13 15:35:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-07-13 15:35:52,861 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 14 [2022-07-13 15:35:52,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:52,862 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-07-13 15:35:52,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:52,862 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-07-13 15:35:52,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 15:35:52,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:52,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:52,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 15:35:52,863 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-07-13 15:35:52,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:52,864 INFO L85 PathProgramCache]: Analyzing trace with hash 137742357, now seen corresponding path program 1 times [2022-07-13 15:35:52,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:52,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824646233] [2022-07-13 15:35:52,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:52,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:52,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:35:52,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:52,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824646233] [2022-07-13 15:35:52,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824646233] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:52,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:52,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:35:52,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495818122] [2022-07-13 15:35:52,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:52,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:35:52,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:52,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:35:52,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:35:52,910 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:53,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:53,059 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2022-07-13 15:35:53,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:35:53,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-13 15:35:53,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:53,060 INFO L225 Difference]: With dead ends: 126 [2022-07-13 15:35:53,060 INFO L226 Difference]: Without dead ends: 124 [2022-07-13 15:35:53,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:35:53,061 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 101 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:53,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 103 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:35:53,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-13 15:35:53,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103. [2022-07-13 15:35:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 94 states have (on average 1.2446808510638299) internal successors, (117), 102 states have internal predecessors, (117), 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) [2022-07-13 15:35:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2022-07-13 15:35:53,071 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 14 [2022-07-13 15:35:53,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:53,071 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2022-07-13 15:35:53,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2022-07-13 15:35:53,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 15:35:53,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:53,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:53,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 15:35:53,073 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-07-13 15:35:53,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:53,073 INFO L85 PathProgramCache]: Analyzing trace with hash 189636292, now seen corresponding path program 1 times [2022-07-13 15:35:53,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:53,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063094744] [2022-07-13 15:35:53,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:53,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:53,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:35:53,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:53,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063094744] [2022-07-13 15:35:53,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063094744] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:53,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:53,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:35:53,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86375759] [2022-07-13 15:35:53,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:53,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:35:53,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:53,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:35:53,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:35:53,155 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:53,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:53,313 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2022-07-13 15:35:53,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:35:53,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-13 15:35:53,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:53,315 INFO L225 Difference]: With dead ends: 113 [2022-07-13 15:35:53,315 INFO L226 Difference]: Without dead ends: 109 [2022-07-13 15:35:53,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:35:53,315 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 22 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:53,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 245 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:35:53,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-13 15:35:53,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2022-07-13 15:35:53,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 103 states have internal predecessors, (118), 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) [2022-07-13 15:35:53,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2022-07-13 15:35:53,319 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 14 [2022-07-13 15:35:53,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:53,319 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2022-07-13 15:35:53,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:53,320 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2022-07-13 15:35:53,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 15:35:53,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:53,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:53,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 15:35:53,320 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-07-13 15:35:53,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:53,321 INFO L85 PathProgramCache]: Analyzing trace with hash -24950085, now seen corresponding path program 1 times [2022-07-13 15:35:53,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:53,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194684248] [2022-07-13 15:35:53,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:53,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:53,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:35:53,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:53,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194684248] [2022-07-13 15:35:53,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194684248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:53,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:53,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:35:53,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541652134] [2022-07-13 15:35:53,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:53,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:35:53,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:53,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:35:53,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:35:53,401 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:53,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:53,548 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2022-07-13 15:35:53,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 15:35:53,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-13 15:35:53,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:53,549 INFO L225 Difference]: With dead ends: 131 [2022-07-13 15:35:53,549 INFO L226 Difference]: Without dead ends: 129 [2022-07-13 15:35:53,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:35:53,550 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 42 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:53,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 274 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:35:53,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-13 15:35:53,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 107. [2022-07-13 15:35:53,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 106 states have internal predecessors, (121), 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) [2022-07-13 15:35:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2022-07-13 15:35:53,554 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 15 [2022-07-13 15:35:53,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:53,555 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2022-07-13 15:35:53,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:53,555 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2022-07-13 15:35:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 15:35:53,555 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:53,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:53,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 15:35:53,556 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-07-13 15:35:53,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:53,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2034707599, now seen corresponding path program 1 times [2022-07-13 15:35:53,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:53,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49501671] [2022-07-13 15:35:53,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:53,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:53,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:35:53,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:53,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49501671] [2022-07-13 15:35:53,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49501671] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:53,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:53,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:35:53,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971594435] [2022-07-13 15:35:53,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:53,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:35:53,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:53,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:35:53,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:35:53,607 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:53,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:53,653 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2022-07-13 15:35:53,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:35:53,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-13 15:35:53,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:53,655 INFO L225 Difference]: With dead ends: 107 [2022-07-13 15:35:53,655 INFO L226 Difference]: Without dead ends: 105 [2022-07-13 15:35:53,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:35:53,656 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 97 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:53,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 138 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:35:53,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-13 15:35:53,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-13 15:35:53,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 104 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) [2022-07-13 15:35:53,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-07-13 15:35:53,662 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 16 [2022-07-13 15:35:53,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:53,663 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-07-13 15:35:53,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:53,663 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-07-13 15:35:53,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 15:35:53,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:53,667 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:53,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 15:35:53,667 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-07-13 15:35:53,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:53,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1348569745, now seen corresponding path program 1 times [2022-07-13 15:35:53,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:53,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520479114] [2022-07-13 15:35:53,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:53,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:35:53,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:53,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520479114] [2022-07-13 15:35:53,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520479114] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:53,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:53,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:35:53,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953469290] [2022-07-13 15:35:53,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:53,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:35:53,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:53,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:35:53,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:35:53,718 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:53,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:53,793 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2022-07-13 15:35:53,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:35:53,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-13 15:35:53,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:53,794 INFO L225 Difference]: With dead ends: 105 [2022-07-13 15:35:53,794 INFO L226 Difference]: Without dead ends: 101 [2022-07-13 15:35:53,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:35:53,795 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:53,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 214 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:35:53,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-13 15:35:53,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-13 15:35:53,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 100 states have internal predecessors, (115), 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) [2022-07-13 15:35:53,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2022-07-13 15:35:53,800 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 17 [2022-07-13 15:35:53,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:53,801 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2022-07-13 15:35:53,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:53,801 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2022-07-13 15:35:53,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 15:35:53,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:53,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:53,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 15:35:53,803 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-07-13 15:35:53,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:53,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1418456853, now seen corresponding path program 1 times [2022-07-13 15:35:53,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:53,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113123535] [2022-07-13 15:35:53,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:53,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:53,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:35:53,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:53,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113123535] [2022-07-13 15:35:53,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113123535] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:53,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:53,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:35:53,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935600103] [2022-07-13 15:35:53,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:53,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:35:53,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:53,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:35:53,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:35:53,893 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:54,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:54,058 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2022-07-13 15:35:54,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:35:54,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-13 15:35:54,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:54,059 INFO L225 Difference]: With dead ends: 116 [2022-07-13 15:35:54,059 INFO L226 Difference]: Without dead ends: 114 [2022-07-13 15:35:54,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 15:35:54,060 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 154 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:54,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 57 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:35:54,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-13 15:35:54,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2022-07-13 15:35:54,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 96 states have internal predecessors, (111), 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) [2022-07-13 15:35:54,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2022-07-13 15:35:54,064 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 18 [2022-07-13 15:35:54,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:54,064 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2022-07-13 15:35:54,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:54,064 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2022-07-13 15:35:54,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 15:35:54,065 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:54,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:54,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 15:35:54,065 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-07-13 15:35:54,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:54,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1471897933, now seen corresponding path program 1 times [2022-07-13 15:35:54,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:54,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679586845] [2022-07-13 15:35:54,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:54,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:35:54,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:54,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679586845] [2022-07-13 15:35:54,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679586845] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:54,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:54,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:35:54,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708334327] [2022-07-13 15:35:54,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:54,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:35:54,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:54,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:35:54,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:35:54,120 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:54,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:54,264 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2022-07-13 15:35:54,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:35:54,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-13 15:35:54,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:54,265 INFO L225 Difference]: With dead ends: 97 [2022-07-13 15:35:54,265 INFO L226 Difference]: Without dead ends: 93 [2022-07-13 15:35:54,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 15:35:54,266 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 130 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:54,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 44 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:35:54,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-13 15:35:54,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-07-13 15:35:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 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) [2022-07-13 15:35:54,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2022-07-13 15:35:54,269 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 18 [2022-07-13 15:35:54,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:54,269 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2022-07-13 15:35:54,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:54,270 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2022-07-13 15:35:54,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 15:35:54,270 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:54,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:54,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 15:35:54,270 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-07-13 15:35:54,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:54,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1159129958, now seen corresponding path program 1 times [2022-07-13 15:35:54,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:54,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518072872] [2022-07-13 15:35:54,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:54,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:54,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:35:54,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:54,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518072872] [2022-07-13 15:35:54,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518072872] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:54,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:54,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:35:54,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249172311] [2022-07-13 15:35:54,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:54,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:35:54,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:54,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:35:54,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:35:54,316 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:54,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:54,481 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2022-07-13 15:35:54,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:35:54,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-13 15:35:54,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:54,482 INFO L225 Difference]: With dead ends: 103 [2022-07-13 15:35:54,482 INFO L226 Difference]: Without dead ends: 54 [2022-07-13 15:35:54,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 15:35:54,483 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 134 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:54,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 47 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:35:54,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-13 15:35:54,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-07-13 15:35:54,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.08) internal successors, (54), 53 states have internal predecessors, (54), 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) [2022-07-13 15:35:54,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-07-13 15:35:54,485 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 18 [2022-07-13 15:35:54,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:54,485 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-07-13 15:35:54,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:54,486 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-07-13 15:35:54,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 15:35:54,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:54,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:54,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 15:35:54,487 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-07-13 15:35:54,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:54,487 INFO L85 PathProgramCache]: Analyzing trace with hash 892497877, now seen corresponding path program 1 times [2022-07-13 15:35:54,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:54,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812339082] [2022-07-13 15:35:54,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:54,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:35:54,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:54,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812339082] [2022-07-13 15:35:54,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812339082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:54,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:54,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 15:35:54,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546948222] [2022-07-13 15:35:54,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:54,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 15:35:54,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:54,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 15:35:54,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-07-13 15:35:54,601 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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) [2022-07-13 15:35:54,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:54,704 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-07-13 15:35:54,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 15:35:54,705 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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 44 [2022-07-13 15:35:54,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:54,705 INFO L225 Difference]: With dead ends: 54 [2022-07-13 15:35:54,705 INFO L226 Difference]: Without dead ends: 52 [2022-07-13 15:35:54,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-07-13 15:35:54,706 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 61 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:54,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 29 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:35:54,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-13 15:35:54,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-07-13 15:35:54,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 51 states have internal predecessors, (52), 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) [2022-07-13 15:35:54,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-07-13 15:35:54,708 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 44 [2022-07-13 15:35:54,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:54,708 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-07-13 15:35:54,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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) [2022-07-13 15:35:54,709 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-07-13 15:35:54,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 15:35:54,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:54,709 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:54,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 15:35:54,710 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-07-13 15:35:54,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:54,710 INFO L85 PathProgramCache]: Analyzing trace with hash 892513765, now seen corresponding path program 1 times [2022-07-13 15:35:54,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:54,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373492656] [2022-07-13 15:35:54,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:54,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:35:54,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:54,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373492656] [2022-07-13 15:35:54,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373492656] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:54,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:54,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 15:35:54,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690910514] [2022-07-13 15:35:54,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:54,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 15:35:54,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:54,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 15:35:54,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-07-13 15:35:54,826 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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) [2022-07-13 15:35:54,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:54,926 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-07-13 15:35:54,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 15:35:54,926 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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 44 [2022-07-13 15:35:54,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:54,927 INFO L225 Difference]: With dead ends: 59 [2022-07-13 15:35:54,927 INFO L226 Difference]: Without dead ends: 57 [2022-07-13 15:35:54,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-07-13 15:35:54,928 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 89 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:54,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 27 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:35:54,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-13 15:35:54,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2022-07-13 15:35:54,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 49 states have internal predecessors, (50), 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) [2022-07-13 15:35:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-07-13 15:35:54,929 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 44 [2022-07-13 15:35:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:54,929 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-07-13 15:35:54,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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) [2022-07-13 15:35:54,930 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-07-13 15:35:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 15:35:54,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:54,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:54,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 15:35:54,930 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-07-13 15:35:54,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:54,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1897634854, now seen corresponding path program 1 times [2022-07-13 15:35:54,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:54,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596123303] [2022-07-13 15:35:54,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:54,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:55,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:35:55,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:55,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596123303] [2022-07-13 15:35:55,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596123303] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:55,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:55,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 15:35:55,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367376203] [2022-07-13 15:35:55,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:55,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:35:55,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:55,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:35:55,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:35:55,036 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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) [2022-07-13 15:35:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:55,098 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-07-13 15:35:55,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:35:55,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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 [2022-07-13 15:35:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:55,099 INFO L225 Difference]: With dead ends: 50 [2022-07-13 15:35:55,099 INFO L226 Difference]: Without dead ends: 46 [2022-07-13 15:35:55,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 15:35:55,100 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 88 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:55,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 14 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:35:55,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-13 15:35:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-07-13 15:35:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:55,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-07-13 15:35:55,102 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 45 [2022-07-13 15:35:55,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:55,102 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-07-13 15:35:55,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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) [2022-07-13 15:35:55,102 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-07-13 15:35:55,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 15:35:55,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:55,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:55,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 15:35:55,103 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-07-13 15:35:55,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:55,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1898127398, now seen corresponding path program 1 times [2022-07-13 15:35:55,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:55,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301786680] [2022-07-13 15:35:55,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:55,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:55,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:35:55,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:55,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301786680] [2022-07-13 15:35:55,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301786680] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:55,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:55,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 15:35:55,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560334512] [2022-07-13 15:35:55,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:55,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:35:55,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:55,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:35:55,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:35:55,200 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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) [2022-07-13 15:35:55,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:55,275 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-07-13 15:35:55,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:35:55,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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 [2022-07-13 15:35:55,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:55,276 INFO L225 Difference]: With dead ends: 50 [2022-07-13 15:35:55,276 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 15:35:55,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 15:35:55,277 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 58 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:55,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 15 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:35:55,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 15:35:55,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 15:35:55,278 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) [2022-07-13 15:35:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 15:35:55,279 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2022-07-13 15:35:55,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:55,279 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 15:35:55,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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) [2022-07-13 15:35:55,279 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 15:35:55,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 15:35:55,282 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-07-13 15:35:55,282 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-07-13 15:35:55,282 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-07-13 15:35:55,283 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-07-13 15:35:55,283 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-07-13 15:35:55,283 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-07-13 15:35:55,283 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-07-13 15:35:55,283 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-07-13 15:35:55,284 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-07-13 15:35:55,284 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-07-13 15:35:55,284 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-07-13 15:35:55,284 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-07-13 15:35:55,285 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-07-13 15:35:55,285 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-07-13 15:35:55,285 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-07-13 15:35:55,285 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-07-13 15:35:55,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 15:35:55,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 15:35:55,412 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2022-07-13 15:35:55,413 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 229) no Hoare annotation was computed. [2022-07-13 15:35:55,413 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 969) no Hoare annotation was computed. [2022-07-13 15:35:55,413 INFO L899 garLoopResultBuilder]: For program point L366(lines 366 991) no Hoare annotation was computed. [2022-07-13 15:35:55,413 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 275) no Hoare annotation was computed. [2022-07-13 15:35:55,414 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 883) no Hoare annotation was computed. [2022-07-13 15:35:55,414 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 971) no Hoare annotation was computed. [2022-07-13 15:35:55,414 INFO L899 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2022-07-13 15:35:55,414 INFO L899 garLoopResultBuilder]: For program point L895(line 895) no Hoare annotation was computed. [2022-07-13 15:35:55,415 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 15:35:55,415 INFO L899 garLoopResultBuilder]: For program point L317(lines 317 994) no Hoare annotation was computed. [2022-07-13 15:35:55,415 INFO L899 garLoopResultBuilder]: For program point L185(line 185) no Hoare annotation was computed. [2022-07-13 15:35:55,415 INFO L899 garLoopResultBuilder]: For program point L400(lines 400 424) no Hoare annotation was computed. [2022-07-13 15:35:55,415 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 242) no Hoare annotation was computed. [2022-07-13 15:35:55,416 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 125) no Hoare annotation was computed. [2022-07-13 15:35:55,416 INFO L899 garLoopResultBuilder]: For program point L615(lines 615 626) no Hoare annotation was computed. [2022-07-13 15:35:55,416 INFO L899 garLoopResultBuilder]: For program point L929(lines 929 941) no Hoare annotation was computed. [2022-07-13 15:35:55,416 INFO L899 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2022-07-13 15:35:55,416 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 269) no Hoare annotation was computed. [2022-07-13 15:35:55,416 INFO L899 garLoopResultBuilder]: For program point L665(lines 665 963) no Hoare annotation was computed. [2022-07-13 15:35:55,417 INFO L899 garLoopResultBuilder]: For program point L434(lines 434 985) no Hoare annotation was computed. [2022-07-13 15:35:55,417 INFO L899 garLoopResultBuilder]: For program point L269(line 269) no Hoare annotation was computed. [2022-07-13 15:35:55,417 INFO L899 garLoopResultBuilder]: For program point L649(lines 649 965) no Hoare annotation was computed. [2022-07-13 15:35:55,417 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 173) no Hoare annotation was computed. [2022-07-13 15:35:55,417 INFO L899 garLoopResultBuilder]: For program point L385(lines 385 988) no Hoare annotation was computed. [2022-07-13 15:35:55,417 INFO L899 garLoopResultBuilder]: For program point L22(lines 22 1005) no Hoare annotation was computed. [2022-07-13 15:35:55,418 INFO L899 garLoopResultBuilder]: For program point L468(lines 468 492) no Hoare annotation was computed. [2022-07-13 15:35:55,418 INFO L899 garLoopResultBuilder]: For program point L881(lines 881 907) no Hoare annotation was computed. [2022-07-13 15:35:55,418 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 193) no Hoare annotation was computed. [2022-07-13 15:35:55,418 INFO L899 garLoopResultBuilder]: For program point L683(lines 683 694) no Hoare annotation was computed. [2022-07-13 15:35:55,419 INFO L899 garLoopResultBuilder]: For program point L105(line 105) no Hoare annotation was computed. [2022-07-13 15:35:55,419 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 288) no Hoare annotation was computed. [2022-07-13 15:35:55,419 INFO L899 garLoopResultBuilder]: For program point L931(line 931) no Hoare annotation was computed. [2022-07-13 15:35:55,419 INFO L899 garLoopResultBuilder]: For program point L733(lines 733 957) no Hoare annotation was computed. [2022-07-13 15:35:55,419 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 234) no Hoare annotation was computed. [2022-07-13 15:35:55,419 INFO L899 garLoopResultBuilder]: For program point L502(lines 502 979) no Hoare annotation was computed. [2022-07-13 15:35:55,420 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 231) no Hoare annotation was computed. [2022-07-13 15:35:55,420 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 959) no Hoare annotation was computed. [2022-07-13 15:35:55,420 INFO L899 garLoopResultBuilder]: For program point L453(lines 453 982) no Hoare annotation was computed. [2022-07-13 15:35:55,421 INFO L902 garLoopResultBuilder]: At program point L932(lines 17 1006) the Hoare annotation is: true [2022-07-13 15:35:55,421 INFO L899 garLoopResultBuilder]: For program point L866(lines 866 946) no Hoare annotation was computed. [2022-07-13 15:35:55,421 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 277) no Hoare annotation was computed. [2022-07-13 15:35:55,421 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 207) no Hoare annotation was computed. [2022-07-13 15:35:55,421 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 560) no Hoare annotation was computed. [2022-07-13 15:35:55,422 INFO L899 garLoopResultBuilder]: For program point L883(line 883) no Hoare annotation was computed. [2022-07-13 15:35:55,422 INFO L899 garLoopResultBuilder]: For program point L751(lines 751 762) no Hoare annotation was computed. [2022-07-13 15:35:55,422 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-07-13 15:35:55,422 INFO L899 garLoopResultBuilder]: For program point L801(lines 801 951) no Hoare annotation was computed. [2022-07-13 15:35:55,422 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 15:35:55,422 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 185) no Hoare annotation was computed. [2022-07-13 15:35:55,422 INFO L899 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-07-13 15:35:55,422 INFO L899 garLoopResultBuilder]: For program point L570(lines 570 973) no Hoare annotation was computed. [2022-07-13 15:35:55,423 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 943) no Hoare annotation was computed. [2022-07-13 15:35:55,423 INFO L899 garLoopResultBuilder]: For program point L785(lines 785 953) no Hoare annotation was computed. [2022-07-13 15:35:55,423 INFO L899 garLoopResultBuilder]: For program point L207(line 207) no Hoare annotation was computed. [2022-07-13 15:35:55,423 INFO L899 garLoopResultBuilder]: For program point L521(lines 521 976) no Hoare annotation was computed. [2022-07-13 15:35:55,423 INFO L895 garLoopResultBuilder]: At program point L868(lines 26 1000) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~main__t~0#1|) (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) [2022-07-13 15:35:55,423 INFO L899 garLoopResultBuilder]: For program point L257(line 257) no Hoare annotation was computed. [2022-07-13 15:35:55,424 INFO L899 garLoopResultBuilder]: For program point L604(lines 604 628) no Hoare annotation was computed. [2022-07-13 15:35:55,424 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 1000) no Hoare annotation was computed. [2022-07-13 15:35:55,425 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2022-07-13 15:35:55,425 INFO L899 garLoopResultBuilder]: For program point L819(lines 819 830) no Hoare annotation was computed. [2022-07-13 15:35:55,425 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 895) no Hoare annotation was computed. [2022-07-13 15:35:55,425 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 967) no Hoare annotation was computed. [2022-07-13 15:35:55,425 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2022-07-13 15:35:55,426 INFO L899 garLoopResultBuilder]: For program point L919(line 919) no Hoare annotation was computed. [2022-07-13 15:35:55,426 INFO L899 garLoopResultBuilder]: For program point L853(lines 853 947) no Hoare annotation was computed. [2022-07-13 15:35:55,426 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 236) no Hoare annotation was computed. [2022-07-13 15:35:55,426 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 970) no Hoare annotation was computed. [2022-07-13 15:35:55,426 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 993) no Hoare annotation was computed. [2022-07-13 15:35:55,427 INFO L899 garLoopResultBuilder]: For program point L672(lines 672 696) no Hoare annotation was computed. [2022-07-13 15:35:55,427 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2022-07-13 15:35:55,427 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 15:35:55,427 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 995) no Hoare annotation was computed. [2022-07-13 15:35:55,427 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 931) no Hoare annotation was computed. [2022-07-13 15:35:55,427 INFO L895 garLoopResultBuilder]: At program point L904(lines 65 999) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__t~0#1|) (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) [2022-07-13 15:35:55,427 INFO L899 garLoopResultBuilder]: For program point L706(lines 706 961) no Hoare annotation was computed. [2022-07-13 15:35:55,428 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 354) no Hoare annotation was computed. [2022-07-13 15:35:55,428 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 117) no Hoare annotation was computed. [2022-07-13 15:35:55,428 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-07-13 15:35:55,428 INFO L899 garLoopResultBuilder]: For program point L657(lines 657 964) no Hoare annotation was computed. [2022-07-13 15:35:55,429 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 56) no Hoare annotation was computed. [2022-07-13 15:35:55,429 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 919) no Hoare annotation was computed. [2022-07-13 15:35:55,429 INFO L902 garLoopResultBuilder]: At program point L1004(lines 22 1005) the Hoare annotation is: true [2022-07-13 15:35:55,429 INFO L899 garLoopResultBuilder]: For program point L393(lines 393 987) no Hoare annotation was computed. [2022-07-13 15:35:55,429 INFO L899 garLoopResultBuilder]: For program point L740(lines 740 764) no Hoare annotation was computed. [2022-07-13 15:35:55,429 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 285) no Hoare annotation was computed. [2022-07-13 15:35:55,430 INFO L899 garLoopResultBuilder]: For program point L377(lines 377 989) no Hoare annotation was computed. [2022-07-13 15:35:55,430 INFO L899 garLoopResultBuilder]: For program point L774(lines 774 955) no Hoare annotation was computed. [2022-07-13 15:35:55,430 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-07-13 15:35:55,430 INFO L899 garLoopResultBuilder]: For program point L411(lines 411 422) no Hoare annotation was computed. [2022-07-13 15:35:55,430 INFO L899 garLoopResultBuilder]: For program point L725(lines 725 958) no Hoare annotation was computed. [2022-07-13 15:35:55,430 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-07-13 15:35:55,430 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 981) no Hoare annotation was computed. [2022-07-13 15:35:55,431 INFO L895 garLoopResultBuilder]: At program point L940(lines 858 947) the Hoare annotation is: (and (<= 9 |ULTIMATE.start_main_~main__t~0#1|) (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) [2022-07-13 15:35:55,431 INFO L899 garLoopResultBuilder]: For program point L874(lines 874 945) no Hoare annotation was computed. [2022-07-13 15:35:55,431 INFO L899 garLoopResultBuilder]: For program point L808(lines 808 832) no Hoare annotation was computed. [2022-07-13 15:35:55,431 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 233) no Hoare annotation was computed. [2022-07-13 15:35:55,431 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 999) no Hoare annotation was computed. [2022-07-13 15:35:55,431 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 15:35:55,431 INFO L899 garLoopResultBuilder]: For program point L445(lines 445 983) no Hoare annotation was computed. [2022-07-13 15:35:55,431 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2022-07-13 15:35:55,432 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 123) no Hoare annotation was computed. [2022-07-13 15:35:55,432 INFO L899 garLoopResultBuilder]: For program point L842(lines 842 949) no Hoare annotation was computed. [2022-07-13 15:35:55,432 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 284) no Hoare annotation was computed. [2022-07-13 15:35:55,432 INFO L899 garLoopResultBuilder]: For program point L479(lines 479 490) no Hoare annotation was computed. [2022-07-13 15:35:55,433 INFO L899 garLoopResultBuilder]: For program point L793(lines 793 952) no Hoare annotation was computed. [2022-07-13 15:35:55,433 INFO L899 garLoopResultBuilder]: For program point L248(lines 248 283) no Hoare annotation was computed. [2022-07-13 15:35:55,433 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 286) no Hoare annotation was computed. [2022-07-13 15:35:55,433 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 975) no Hoare annotation was computed. [2022-07-13 15:35:55,433 INFO L899 garLoopResultBuilder]: For program point L298(lines 298 997) no Hoare annotation was computed. [2022-07-13 15:35:55,433 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 58) no Hoare annotation was computed. [2022-07-13 15:35:55,433 INFO L899 garLoopResultBuilder]: For program point L513(lines 513 977) no Hoare annotation was computed. [2022-07-13 15:35:55,433 INFO L899 garLoopResultBuilder]: For program point L893(lines 893 905) no Hoare annotation was computed. [2022-07-13 15:35:55,434 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 257) no Hoare annotation was computed. [2022-07-13 15:35:55,434 INFO L895 garLoopResultBuilder]: At program point L282(lines 132 284) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__t~0#1|) (not (<= |ULTIMATE.start_main_~main__tagbuf_len~0#1| |ULTIMATE.start_main_~main__t~0#1|))) [2022-07-13 15:35:55,434 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 191) no Hoare annotation was computed. [2022-07-13 15:35:55,434 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2022-07-13 15:35:55,434 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 356) no Hoare annotation was computed. [2022-07-13 15:35:55,434 INFO L899 garLoopResultBuilder]: For program point L547(lines 547 558) no Hoare annotation was computed. [2022-07-13 15:35:55,438 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:55,441 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 15:35:55,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 03:35:55 BoogieIcfgContainer [2022-07-13 15:35:55,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 15:35:55,459 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 15:35:55,459 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 15:35:55,459 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 15:35:55,459 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:35:50" (3/4) ... [2022-07-13 15:35:55,462 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 15:35:55,480 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-07-13 15:35:55,481 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-13 15:35:55,482 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 15:35:55,482 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 15:35:55,565 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 15:35:55,565 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 15:35:55,566 INFO L158 Benchmark]: Toolchain (without parser) took 5714.78ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 76.9MB in the beginning and 77.9MB in the end (delta: -970.0kB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2022-07-13 15:35:55,566 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 93.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:35:55,566 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.61ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 80.4MB in the end (delta: -3.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 15:35:55,567 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.35ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 77.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:35:55,567 INFO L158 Benchmark]: Boogie Preprocessor took 27.04ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 75.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:35:55,567 INFO L158 Benchmark]: RCFGBuilder took 562.80ms. Allocated memory is still 117.4MB. Free memory was 74.9MB in the beginning and 49.0MB in the end (delta: 25.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-07-13 15:35:55,570 INFO L158 Benchmark]: TraceAbstraction took 4606.48ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 48.7MB in the beginning and 87.4MB in the end (delta: -38.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-07-13 15:35:55,571 INFO L158 Benchmark]: Witness Printer took 106.43ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 77.9MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 15:35:55,574 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.20ms. Allocated memory is still 117.4MB. Free memory is still 93.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.61ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 80.4MB in the end (delta: -3.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.35ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 77.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.04ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 75.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 562.80ms. Allocated memory is still 117.4MB. Free memory was 74.9MB in the beginning and 49.0MB in the end (delta: 25.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4606.48ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 48.7MB in the beginning and 87.4MB in the end (delta: -38.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Witness Printer took 106.43ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 77.9MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 48]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 105]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 117]: 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: 173]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 185]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 207]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 219]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 257]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 269]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 883]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 895]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 919]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 931]: 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, 120 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1524 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1524 mSDsluCounter, 2483 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1445 mSDsCounter, 335 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3638 IncrementalHoareTripleChecker+Invalid, 3973 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 335 mSolverCounterUnsat, 1038 mSDtfsCounter, 3638 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=0, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 119 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 31 HoareAnnotationTreeSize, 6 FomulaSimplifications, 4434 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 211 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 386 NumberOfCodeBlocks, 386 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 367 ConstructedInterpolants, 0 QuantifiedInterpolants, 1313 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: 1 <= main__t && !(main__tagbuf_len <= main__t) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 0 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 858]: Loop Invariant Derived loop invariant: 9 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-13 15:35:55,619 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE